./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-circular-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-circular-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b2cf85bdf3ceca18f859bba09ed8bf6de8160130db2f8571365ac2bc4f0e30c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:53:51,539 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:53:51,540 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:53:51,558 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:53:51,559 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:53:51,564 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:53:51,567 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:53:51,571 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:53:51,572 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:53:51,573 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:53:51,574 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:53:51,575 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:53:51,575 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:53:51,581 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:53:51,582 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:53:51,584 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:53:51,586 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:53:51,587 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:53:51,589 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:53:51,596 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:53:51,601 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:53:51,602 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:53:51,603 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:53:51,604 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:53:51,606 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:53:51,607 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:53:51,607 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:53:51,608 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:53:51,609 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:53:51,610 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:53:51,610 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:53:51,611 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:53:51,612 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:53:51,613 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:53:51,614 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:53:51,614 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:53:51,615 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:53:51,616 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:53:51,616 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:53:51,616 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:53:51,617 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:53:51,618 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:53:51,649 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:53:51,650 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:53:51,650 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:53:51,650 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:53:51,651 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:53:51,651 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:53:51,652 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:53:51,652 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:53:51,652 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:53:51,652 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:53:51,653 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:53:51,653 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:53:51,653 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:53:51,653 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:53:51,653 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:53:51,654 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:53:51,654 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:53:51,654 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:53:51,654 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:53:51,654 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:53:51,654 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:53:51,654 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:53:51,655 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:53:51,655 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:53:51,655 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:53:51,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:53:51,655 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:53:51,656 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:53:51,656 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:53:51,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:53:51,656 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 5b2cf85bdf3ceca18f859bba09ed8bf6de8160130db2f8571365ac2bc4f0e30c [2022-02-20 23:53:51,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:53:51,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:53:51,883 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:53:51,884 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:53:51,885 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:53:51,885 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-circular-2.i [2022-02-20 23:53:51,937 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f43079906/33cc4ab48d494a1c96620bd08be2d892/FLAG7bb3a11d8 [2022-02-20 23:53:52,323 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:53:52,323 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i [2022-02-20 23:53:52,331 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f43079906/33cc4ab48d494a1c96620bd08be2d892/FLAG7bb3a11d8 [2022-02-20 23:53:52,340 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f43079906/33cc4ab48d494a1c96620bd08be2d892 [2022-02-20 23:53:52,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:53:52,343 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:53:52,344 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:53:52,344 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:53:52,346 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:53:52,347 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:53:52" (1/1) ... [2022-02-20 23:53:52,348 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9fd1fae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:52, skipping insertion in model container [2022-02-20 23:53:52,348 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:53:52" (1/1) ... [2022-02-20 23:53:52,352 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:53:52,372 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:53:52,590 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-circular-2.i[22391,22404] [2022-02-20 23:53:52,596 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-circular-2.i[22497,22510] [2022-02-20 23:53:52,600 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-circular-2.i[22622,22635] [2022-02-20 23:53:52,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:53:52,616 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:53:52,650 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-circular-2.i[22391,22404] [2022-02-20 23:53:52,651 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-circular-2.i[22497,22510] [2022-02-20 23:53:52,652 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-circular-2.i[22622,22635] [2022-02-20 23:53:52,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:53:52,680 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:53:52,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:52 WrapperNode [2022-02-20 23:53:52,680 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:53:52,681 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:53:52,681 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:53:52,681 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:53:52,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:52" (1/1) ... [2022-02-20 23:53:52,700 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:52" (1/1) ... [2022-02-20 23:53:52,728 INFO L137 Inliner]: procedures = 119, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 123 [2022-02-20 23:53:52,728 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:53:52,729 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:53:52,729 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:53:52,729 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:53:52,735 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:52" (1/1) ... [2022-02-20 23:53:52,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:52" (1/1) ... [2022-02-20 23:53:52,737 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:52" (1/1) ... [2022-02-20 23:53:52,738 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:52" (1/1) ... [2022-02-20 23:53:52,745 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:52" (1/1) ... [2022-02-20 23:53:52,748 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:52" (1/1) ... [2022-02-20 23:53:52,749 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:52" (1/1) ... [2022-02-20 23:53:52,751 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:53:52,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:53:52,752 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:53:52,752 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:53:52,757 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:52" (1/1) ... [2022-02-20 23:53:52,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:53:52,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:53:52,782 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:53:52,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:53:52,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:53:52,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:53:52,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:53:52,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:53:52,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:53:52,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:53:52,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:53:52,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:53:52,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:53:52,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:53:52,869 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:53:52,870 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:53:53,323 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:53:53,328 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:53:53,328 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2022-02-20 23:53:53,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:53:53 BoogieIcfgContainer [2022-02-20 23:53:53,330 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:53:53,331 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:53:53,331 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:53:53,333 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:53:53,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:53:52" (1/3) ... [2022-02-20 23:53:53,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@593d6abf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:53:53, skipping insertion in model container [2022-02-20 23:53:53,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:52" (2/3) ... [2022-02-20 23:53:53,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@593d6abf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:53:53, skipping insertion in model container [2022-02-20 23:53:53,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:53:53" (3/3) ... [2022-02-20 23:53:53,335 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-circular-2.i [2022-02-20 23:53:53,339 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:53:53,339 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2022-02-20 23:53:53,367 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:53:53,372 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:53:53,372 INFO L340 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2022-02-20 23:53:53,397 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 59 states have (on average 2.2033898305084745) internal successors, (130), 111 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:53,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:53:53,403 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:53:53,403 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:53:53,404 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2022-02-20 23:53:53,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:53:53,408 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-02-20 23:53:53,414 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:53:53,414 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427771638] [2022-02-20 23:53:53,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:53:53,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:53:53,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:53,515 INFO L290 TraceCheckUtils]: 0: Hoare triple {115#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {115#true} is VALID [2022-02-20 23:53:53,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {115#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;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; {117#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:53:53,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {117#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} assume !(1 == #valid[main_~head~0#1.base]); {116#false} is VALID [2022-02-20 23:53:53,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:53:53,518 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:53:53,518 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427771638] [2022-02-20 23:53:53,519 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427771638] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:53:53,519 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:53:53,519 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:53:53,520 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402039166] [2022-02-20 23:53:53,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:53:53,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:53:53,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:53:53,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:53,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:53,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:53:53,530 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:53:53,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:53:53,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:53:53,546 INFO L87 Difference]: Start difference. First operand has 112 states, 59 states have (on average 2.2033898305084745) internal successors, (130), 111 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:53,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:53,750 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2022-02-20 23:53:53,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:53:53,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:53:53,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:53:53,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:53,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 142 transitions. [2022-02-20 23:53:53,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:53,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 142 transitions. [2022-02-20 23:53:53,765 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 142 transitions. [2022-02-20 23:53:53,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:53,871 INFO L225 Difference]: With dead ends: 117 [2022-02-20 23:53:53,872 INFO L226 Difference]: Without dead ends: 115 [2022-02-20 23:53:53,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:53:53,879 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 95 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:53:53,880 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 80 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:53:53,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-02-20 23:53:53,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 105. [2022-02-20 23:53:53,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:53:53,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 105 states, 58 states have (on average 1.9137931034482758) internal successors, (111), 104 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:53,919 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 105 states, 58 states have (on average 1.9137931034482758) internal successors, (111), 104 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:53,921 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 105 states, 58 states have (on average 1.9137931034482758) internal successors, (111), 104 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:53,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:53,929 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2022-02-20 23:53:53,929 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 122 transitions. [2022-02-20 23:53:53,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:53,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:53,931 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 58 states have (on average 1.9137931034482758) internal successors, (111), 104 states have internal predecessors, (111), 0 states have call successors, (0), 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 115 states. [2022-02-20 23:53:53,931 INFO L87 Difference]: Start difference. First operand has 105 states, 58 states have (on average 1.9137931034482758) internal successors, (111), 104 states have internal predecessors, (111), 0 states have call successors, (0), 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 115 states. [2022-02-20 23:53:53,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:53,960 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2022-02-20 23:53:53,960 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 122 transitions. [2022-02-20 23:53:53,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:53,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:53,962 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:53:53,962 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:53:53,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 58 states have (on average 1.9137931034482758) internal successors, (111), 104 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:53,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2022-02-20 23:53:53,967 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 3 [2022-02-20 23:53:53,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:53:53,968 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2022-02-20 23:53:53,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:53,968 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2022-02-20 23:53:53,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:53:53,969 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:53:53,969 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:53:53,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:53:53,970 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2022-02-20 23:53:53,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:53:53,973 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-20 23:53:53,974 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:53:53,974 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119681463] [2022-02-20 23:53:53,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:53:53,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:53:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:54,044 INFO L290 TraceCheckUtils]: 0: Hoare triple {572#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {572#true} is VALID [2022-02-20 23:53:54,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {572#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;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; {574#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:53:54,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {574#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} assume !(4 + main_~head~0#1.offset <= #length[main_~head~0#1.base] && 0 <= main_~head~0#1.offset); {573#false} is VALID [2022-02-20 23:53:54,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:53:54,046 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:53:54,046 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119681463] [2022-02-20 23:53:54,046 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119681463] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:53:54,046 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:53:54,047 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:53:54,047 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323357293] [2022-02-20 23:53:54,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:53:54,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:53:54,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:53:54,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:54,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:54,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:53:54,051 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:53:54,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:53:54,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:53:54,055 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:54,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:54,222 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2022-02-20 23:53:54,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:53:54,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:53:54,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:53:54,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:54,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2022-02-20 23:53:54,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:54,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2022-02-20 23:53:54,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 123 transitions. [2022-02-20 23:53:54,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:54,321 INFO L225 Difference]: With dead ends: 112 [2022-02-20 23:53:54,321 INFO L226 Difference]: Without dead ends: 112 [2022-02-20 23:53:54,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:53:54,322 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 92 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:53:54,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 80 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:53:54,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-02-20 23:53:54,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 100. [2022-02-20 23:53:54,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:53:54,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand has 100 states, 58 states have (on average 1.8275862068965518) internal successors, (106), 99 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:54,326 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand has 100 states, 58 states have (on average 1.8275862068965518) internal successors, (106), 99 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:54,326 INFO L87 Difference]: Start difference. First operand 112 states. Second operand has 100 states, 58 states have (on average 1.8275862068965518) internal successors, (106), 99 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:54,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:54,328 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2022-02-20 23:53:54,328 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2022-02-20 23:53:54,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:54,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:54,329 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 58 states have (on average 1.8275862068965518) internal successors, (106), 99 states have internal predecessors, (106), 0 states have call successors, (0), 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 112 states. [2022-02-20 23:53:54,329 INFO L87 Difference]: Start difference. First operand has 100 states, 58 states have (on average 1.8275862068965518) internal successors, (106), 99 states have internal predecessors, (106), 0 states have call successors, (0), 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 112 states. [2022-02-20 23:53:54,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:54,332 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2022-02-20 23:53:54,332 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2022-02-20 23:53:54,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:54,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:54,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:53:54,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:53:54,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 58 states have (on average 1.8275862068965518) internal successors, (106), 99 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:54,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2022-02-20 23:53:54,334 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 3 [2022-02-20 23:53:54,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:53:54,335 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2022-02-20 23:53:54,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:54,335 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2022-02-20 23:53:54,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:53:54,335 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:53:54,335 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:53:54,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:53:54,335 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2022-02-20 23:53:54,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:53:54,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112040, now seen corresponding path program 1 times [2022-02-20 23:53:54,336 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:53:54,336 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068391421] [2022-02-20 23:53:54,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:53:54,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:53:54,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:54,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {1013#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {1013#true} is VALID [2022-02-20 23:53:54,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {1013#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;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; {1013#true} is VALID [2022-02-20 23:53:54,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {1013#true} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L998 {1015#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:53:54,413 INFO L290 TraceCheckUtils]: 3: Hoare triple {1015#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-1 {1015#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:53:54,413 INFO L290 TraceCheckUtils]: 4: Hoare triple {1015#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L999 {1015#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:53:54,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {1015#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~state~0#1 := 1; {1016#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:53:54,415 INFO L290 TraceCheckUtils]: 6: Hoare triple {1016#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1016#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:53:54,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {1016#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {1016#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:53:54,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {1016#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !(1 == #valid[main_~x~0#1.base]); {1014#false} is VALID [2022-02-20 23:53:54,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:53:54,416 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:53:54,416 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068391421] [2022-02-20 23:53:54,416 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068391421] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:53:54,416 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:53:54,416 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:53:54,416 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088260524] [2022-02-20 23:53:54,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:53:54,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-02-20 23:53:54,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:53:54,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:54,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:54,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:53:54,423 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:53:54,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:53:54,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:53:54,424 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:54,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:54,606 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2022-02-20 23:53:54,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:53:54,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-02-20 23:53:54,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:53:54,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:54,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2022-02-20 23:53:54,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:54,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2022-02-20 23:53:54,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 117 transitions. [2022-02-20 23:53:54,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:54,684 INFO L225 Difference]: With dead ends: 97 [2022-02-20 23:53:54,684 INFO L226 Difference]: Without dead ends: 97 [2022-02-20 23:53:54,684 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:53:54,685 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 149 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:53:54,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 54 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:53:54,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-02-20 23:53:54,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 88. [2022-02-20 23:53:54,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:53:54,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 88 states, 58 states have (on average 1.6206896551724137) internal successors, (94), 87 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:54,689 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 88 states, 58 states have (on average 1.6206896551724137) internal successors, (94), 87 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:54,689 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 88 states, 58 states have (on average 1.6206896551724137) internal successors, (94), 87 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:54,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:54,691 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2022-02-20 23:53:54,691 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2022-02-20 23:53:54,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:54,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:54,692 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 58 states have (on average 1.6206896551724137) internal successors, (94), 87 states have internal predecessors, (94), 0 states have call successors, (0), 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 97 states. [2022-02-20 23:53:54,692 INFO L87 Difference]: Start difference. First operand has 88 states, 58 states have (on average 1.6206896551724137) internal successors, (94), 87 states have internal predecessors, (94), 0 states have call successors, (0), 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 97 states. [2022-02-20 23:53:54,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:54,694 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2022-02-20 23:53:54,694 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2022-02-20 23:53:54,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:54,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:54,694 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:53:54,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:53:54,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.6206896551724137) internal successors, (94), 87 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:54,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2022-02-20 23:53:54,696 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 9 [2022-02-20 23:53:54,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:53:54,697 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2022-02-20 23:53:54,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:54,697 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2022-02-20 23:53:54,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:53:54,697 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:53:54,697 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:53:54,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:53:54,698 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2022-02-20 23:53:54,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:53:54,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112041, now seen corresponding path program 1 times [2022-02-20 23:53:54,698 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:53:54,699 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948594954] [2022-02-20 23:53:54,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:53:54,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:53:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:54,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {1400#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {1400#true} is VALID [2022-02-20 23:53:54,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {1400#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;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; {1402#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:53:54,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {1402#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L998 {1402#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:53:54,759 INFO L290 TraceCheckUtils]: 3: Hoare triple {1402#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-1 {1402#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:53:54,759 INFO L290 TraceCheckUtils]: 4: Hoare triple {1402#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L999 {1402#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:53:54,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {1402#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= |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;main_~state~0#1 := 1; {1403#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (+ (- 12) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) 0))} is VALID [2022-02-20 23:53:54,760 INFO L290 TraceCheckUtils]: 6: Hoare triple {1403#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (+ (- 12) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1403#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (+ (- 12) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) 0))} is VALID [2022-02-20 23:53:54,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {1403#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (+ (- 12) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) 0))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {1403#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (+ (- 12) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) 0))} is VALID [2022-02-20 23:53:54,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {1403#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (+ (- 12) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) 0))} assume !(4 + (8 + main_~x~0#1.offset) <= #length[main_~x~0#1.base] && 0 <= 8 + main_~x~0#1.offset); {1401#false} is VALID [2022-02-20 23:53:54,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:53:54,762 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:53:54,762 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948594954] [2022-02-20 23:53:54,762 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948594954] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:53:54,762 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:53:54,762 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:53:54,762 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828721692] [2022-02-20 23:53:54,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:53:54,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-02-20 23:53:54,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:53:54,763 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:54,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:54,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:53:54,769 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:53:54,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:53:54,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:53:54,770 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:54,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:54,980 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2022-02-20 23:53:54,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:53:54,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-02-20 23:53:54,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:53:54,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:54,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2022-02-20 23:53:54,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:54,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2022-02-20 23:53:54,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 124 transitions. [2022-02-20 23:53:55,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:55,079 INFO L225 Difference]: With dead ends: 113 [2022-02-20 23:53:55,079 INFO L226 Difference]: Without dead ends: 113 [2022-02-20 23:53:55,079 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:53:55,080 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 103 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:53:55,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 101 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:53:55,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-02-20 23:53:55,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 97. [2022-02-20 23:53:55,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:53:55,086 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 97 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:55,087 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 97 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:55,087 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 97 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:55,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:55,089 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2022-02-20 23:53:55,089 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2022-02-20 23:53:55,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:55,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:55,090 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 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 113 states. [2022-02-20 23:53:55,090 INFO L87 Difference]: Start difference. First operand has 97 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 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 113 states. [2022-02-20 23:53:55,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:55,093 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2022-02-20 23:53:55,093 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2022-02-20 23:53:55,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:55,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:55,094 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:53:55,094 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:53:55,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:55,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2022-02-20 23:53:55,096 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 9 [2022-02-20 23:53:55,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:53:55,096 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2022-02-20 23:53:55,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:55,096 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2022-02-20 23:53:55,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:53:55,097 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:53:55,097 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:53:55,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:53:55,097 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2022-02-20 23:53:55,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:53:55,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413642, now seen corresponding path program 1 times [2022-02-20 23:53:55,098 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:53:55,099 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630759601] [2022-02-20 23:53:55,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:53:55,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:53:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:55,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {1844#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {1844#true} is VALID [2022-02-20 23:53:55,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {1844#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;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; {1844#true} is VALID [2022-02-20 23:53:55,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {1844#true} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L998 {1844#true} is VALID [2022-02-20 23:53:55,207 INFO L290 TraceCheckUtils]: 3: Hoare triple {1844#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-1 {1844#true} is VALID [2022-02-20 23:53:55,207 INFO L290 TraceCheckUtils]: 4: Hoare triple {1844#true} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L999 {1844#true} is VALID [2022-02-20 23:53:55,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {1844#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~state~0#1 := 1; {1844#true} is VALID [2022-02-20 23:53:55,208 INFO L290 TraceCheckUtils]: 6: Hoare triple {1844#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1844#true} is VALID [2022-02-20 23:53:55,208 INFO L290 TraceCheckUtils]: 7: Hoare triple {1844#true} assume !!(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {1846#(and (= |ULTIMATE.start_main_#t~malloc3#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|) 12))} is VALID [2022-02-20 23:53:55,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {1846#(and (= |ULTIMATE.start_main_#t~malloc3#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|) 12))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1009 {1847#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:53:55,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {1847#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1847#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:53:55,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {1847#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1010 {1848#(and (= |ULTIMATE.start_main_#t~mem4#1.offset| 0) (= (+ (- 12) (select |#length| |ULTIMATE.start_main_#t~mem4#1.base|)) 0))} is VALID [2022-02-20 23:53:55,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {1848#(and (= |ULTIMATE.start_main_#t~mem4#1.offset| 0) (= (+ (- 12) (select |#length| |ULTIMATE.start_main_#t~mem4#1.base|)) 0))} assume !(4 + (4 + main_#t~mem4#1.offset) <= #length[main_#t~mem4#1.base] && 0 <= 4 + main_#t~mem4#1.offset); {1845#false} is VALID [2022-02-20 23:53:55,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:53:55,211 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:53:55,211 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630759601] [2022-02-20 23:53:55,211 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630759601] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:53:55,211 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:53:55,211 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:53:55,212 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260323886] [2022-02-20 23:53:55,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:53:55,212 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 23:53:55,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:53:55,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:55,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:55,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:53:55,220 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:53:55,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:53:55,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:53:55,221 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:55,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:55,470 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-02-20 23:53:55,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:53:55,470 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 23:53:55,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:53:55,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:55,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2022-02-20 23:53:55,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:55,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2022-02-20 23:53:55,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 94 transitions. [2022-02-20 23:53:55,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:55,528 INFO L225 Difference]: With dead ends: 96 [2022-02-20 23:53:55,528 INFO L226 Difference]: Without dead ends: 96 [2022-02-20 23:53:55,529 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:53:55,529 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 6 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:53:55,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 224 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:53:55,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-02-20 23:53:55,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-02-20 23:53:55,532 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:53:55,532 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 96 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 95 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:55,532 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 96 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 95 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:55,533 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 96 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 95 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:55,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:55,534 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-02-20 23:53:55,534 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2022-02-20 23:53:55,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:55,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:55,534 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 95 states have internal predecessors, (104), 0 states have call successors, (0), 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 96 states. [2022-02-20 23:53:55,535 INFO L87 Difference]: Start difference. First operand has 96 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 95 states have internal predecessors, (104), 0 states have call successors, (0), 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 96 states. [2022-02-20 23:53:55,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:55,536 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-02-20 23:53:55,536 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2022-02-20 23:53:55,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:55,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:55,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:53:55,536 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:53:55,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 95 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:55,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2022-02-20 23:53:55,538 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 12 [2022-02-20 23:53:55,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:53:55,538 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2022-02-20 23:53:55,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:55,538 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2022-02-20 23:53:55,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:53:55,538 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:53:55,539 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:53:55,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:53:55,539 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2022-02-20 23:53:55,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:53:55,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413643, now seen corresponding path program 1 times [2022-02-20 23:53:55,539 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:53:55,539 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097711093] [2022-02-20 23:53:55,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:53:55,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:53:55,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:55,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {2239#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {2239#true} is VALID [2022-02-20 23:53:55,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {2239#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;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; {2239#true} is VALID [2022-02-20 23:53:55,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {2239#true} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L998 {2239#true} is VALID [2022-02-20 23:53:55,609 INFO L290 TraceCheckUtils]: 3: Hoare triple {2239#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-1 {2239#true} is VALID [2022-02-20 23:53:55,609 INFO L290 TraceCheckUtils]: 4: Hoare triple {2239#true} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L999 {2239#true} is VALID [2022-02-20 23:53:55,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {2239#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~state~0#1 := 1; {2239#true} is VALID [2022-02-20 23:53:55,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {2239#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {2239#true} is VALID [2022-02-20 23:53:55,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {2239#true} assume !!(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {2241#(= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1)} is VALID [2022-02-20 23:53:55,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {2241#(= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1)} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1009 {2242#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:53:55,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {2242#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {2242#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:53:55,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {2242#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1010 {2243#(= (select |#valid| |ULTIMATE.start_main_#t~mem4#1.base|) 1)} is VALID [2022-02-20 23:53:55,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {2243#(= (select |#valid| |ULTIMATE.start_main_#t~mem4#1.base|) 1)} assume !(1 == #valid[main_#t~mem4#1.base]); {2240#false} is VALID [2022-02-20 23:53:55,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:53:55,612 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:53:55,612 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097711093] [2022-02-20 23:53:55,612 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097711093] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:53:55,612 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:53:55,612 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:53:55,612 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583799047] [2022-02-20 23:53:55,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:53:55,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 23:53:55,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:53:55,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:55,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:55,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:53:55,621 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:53:55,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:53:55,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:53:55,622 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:55,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:55,839 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2022-02-20 23:53:55,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:53:55,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 23:53:55,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:53:55,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:55,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2022-02-20 23:53:55,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:55,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2022-02-20 23:53:55,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 93 transitions. [2022-02-20 23:53:55,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:55,894 INFO L225 Difference]: With dead ends: 95 [2022-02-20 23:53:55,894 INFO L226 Difference]: Without dead ends: 95 [2022-02-20 23:53:55,895 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:53:55,895 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 7 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:53:55,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 229 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:53:55,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-02-20 23:53:55,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-02-20 23:53:55,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:53:55,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 95 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 94 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:55,899 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 95 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 94 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:55,899 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 95 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 94 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:55,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:55,901 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2022-02-20 23:53:55,901 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2022-02-20 23:53:55,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:55,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:55,901 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 94 states have internal predecessors, (102), 0 states have call successors, (0), 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 95 states. [2022-02-20 23:53:55,902 INFO L87 Difference]: Start difference. First operand has 95 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 94 states have internal predecessors, (102), 0 states have call successors, (0), 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 95 states. [2022-02-20 23:53:55,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:55,904 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2022-02-20 23:53:55,904 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2022-02-20 23:53:55,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:55,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:55,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:53:55,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:53:55,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 94 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:55,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2022-02-20 23:53:55,906 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 12 [2022-02-20 23:53:55,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:53:55,906 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2022-02-20 23:53:55,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:55,906 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2022-02-20 23:53:55,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:53:55,907 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:53:55,907 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:53:55,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:53:55,907 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2022-02-20 23:53:55,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:53:55,907 INFO L85 PathProgramCache]: Analyzing trace with hash 683852107, now seen corresponding path program 1 times [2022-02-20 23:53:55,908 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:53:55,908 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34894482] [2022-02-20 23:53:55,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:53:55,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:53:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:56,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {2630#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {2630#true} is VALID [2022-02-20 23:53:56,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {2630#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;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; {2632#(and (not (= |ULTIMATE.start_main_~head~0#1.base| 0)) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:53:56,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {2632#(and (not (= |ULTIMATE.start_main_~head~0#1.base| 0)) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L998 {2633#(and (not (= (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| 0))} is VALID [2022-02-20 23:53:56,038 INFO L290 TraceCheckUtils]: 3: Hoare triple {2633#(and (not (= (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| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-1 {2633#(and (not (= (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| 0))} is VALID [2022-02-20 23:53:56,039 INFO L290 TraceCheckUtils]: 4: Hoare triple {2633#(and (not (= (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| 0))} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L999 {2633#(and (not (= (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| 0))} is VALID [2022-02-20 23:53:56,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {2633#(and (not (= (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| 0))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~state~0#1 := 1; {2634#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 23:53:56,040 INFO L290 TraceCheckUtils]: 6: Hoare triple {2634#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {2634#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 23:53:56,041 INFO L290 TraceCheckUtils]: 7: Hoare triple {2634#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {2634#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 23:53:56,043 INFO L290 TraceCheckUtils]: 8: Hoare triple {2634#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1006-3 {2635#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:53:56,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {2635#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1028 {2636#(not (= |ULTIMATE.start_main_#t~mem7#1.base| 0))} is VALID [2022-02-20 23:53:56,044 INFO L290 TraceCheckUtils]: 10: Hoare triple {2636#(not (= |ULTIMATE.start_main_#t~mem7#1.base| 0))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {2637#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} is VALID [2022-02-20 23:53:56,044 INFO L290 TraceCheckUtils]: 11: Hoare triple {2637#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} assume !(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {2631#false} is VALID [2022-02-20 23:53:56,045 INFO L290 TraceCheckUtils]: 12: Hoare triple {2631#false} assume !false; {2631#false} is VALID [2022-02-20 23:53:56,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:53:56,045 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:53:56,045 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34894482] [2022-02-20 23:53:56,045 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34894482] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:53:56,045 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:53:56,046 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:53:56,046 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806243965] [2022-02-20 23:53:56,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:53:56,046 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 23:53:56,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:53:56,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:56,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:56,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:53:56,056 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:53:56,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:53:56,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:53:56,056 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:56,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:56,637 INFO L93 Difference]: Finished difference Result 178 states and 189 transitions. [2022-02-20 23:53:56,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:53:56,637 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 23:53:56,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:53:56,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:56,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 190 transitions. [2022-02-20 23:53:56,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:56,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 190 transitions. [2022-02-20 23:53:56,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 190 transitions. [2022-02-20 23:53:56,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:56,767 INFO L225 Difference]: With dead ends: 178 [2022-02-20 23:53:56,767 INFO L226 Difference]: Without dead ends: 178 [2022-02-20 23:53:56,767 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:53:56,767 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 279 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:53:56,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 380 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:53:56,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-02-20 23:53:56,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 98. [2022-02-20 23:53:56,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:53:56,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 178 states. Second operand has 98 states, 70 states have (on average 1.5) internal successors, (105), 97 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:56,770 INFO L74 IsIncluded]: Start isIncluded. First operand 178 states. Second operand has 98 states, 70 states have (on average 1.5) internal successors, (105), 97 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:56,771 INFO L87 Difference]: Start difference. First operand 178 states. Second operand has 98 states, 70 states have (on average 1.5) internal successors, (105), 97 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:56,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:56,773 INFO L93 Difference]: Finished difference Result 178 states and 189 transitions. [2022-02-20 23:53:56,773 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 189 transitions. [2022-02-20 23:53:56,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:56,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:56,774 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 70 states have (on average 1.5) internal successors, (105), 97 states have internal predecessors, (105), 0 states have call successors, (0), 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 178 states. [2022-02-20 23:53:56,774 INFO L87 Difference]: Start difference. First operand has 98 states, 70 states have (on average 1.5) internal successors, (105), 97 states have internal predecessors, (105), 0 states have call successors, (0), 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 178 states. [2022-02-20 23:53:56,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:56,776 INFO L93 Difference]: Finished difference Result 178 states and 189 transitions. [2022-02-20 23:53:56,776 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 189 transitions. [2022-02-20 23:53:56,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:56,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:56,777 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:53:56,777 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:53:56,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.5) internal successors, (105), 97 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:56,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2022-02-20 23:53:56,778 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 13 [2022-02-20 23:53:56,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:53:56,778 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2022-02-20 23:53:56,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:56,778 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2022-02-20 23:53:56,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:53:56,779 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:53:56,779 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:53:56,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 23:53:56,779 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2022-02-20 23:53:56,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:53:56,779 INFO L85 PathProgramCache]: Analyzing trace with hash -275416990, now seen corresponding path program 1 times [2022-02-20 23:53:56,779 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:53:56,779 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530131616] [2022-02-20 23:53:56,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:53:56,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:53:56,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:56,919 INFO L290 TraceCheckUtils]: 0: Hoare triple {3282#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {3282#true} is VALID [2022-02-20 23:53:56,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {3282#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;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; {3284#(= |ULTIMATE.start_main_~head~0#1.offset| 0)} is VALID [2022-02-20 23:53:56,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {3284#(= |ULTIMATE.start_main_~head~0#1.offset| 0)} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L998 {3285#(and (= (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))} is VALID [2022-02-20 23:53:56,921 INFO L290 TraceCheckUtils]: 3: Hoare triple {3285#(and (= (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))} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-1 {3285#(and (= (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))} is VALID [2022-02-20 23:53:56,922 INFO L290 TraceCheckUtils]: 4: Hoare triple {3285#(and (= (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))} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L999 {3285#(and (= (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))} is VALID [2022-02-20 23:53:56,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {3285#(and (= (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))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~state~0#1 := 1; {3286#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.base|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 23:53:56,923 INFO L290 TraceCheckUtils]: 6: Hoare triple {3286#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.base|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {3286#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.base|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 23:53:56,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {3286#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.base|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {3286#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.base|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 23:53:56,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {3286#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.base|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1006-3 {3287#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)} is VALID [2022-02-20 23:53:56,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {3287#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1028 {3288#(= (select |#valid| |ULTIMATE.start_main_#t~mem7#1.base|) 1)} is VALID [2022-02-20 23:53:56,925 INFO L290 TraceCheckUtils]: 10: Hoare triple {3288#(= (select |#valid| |ULTIMATE.start_main_#t~mem7#1.base|) 1)} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {3289#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:53:56,925 INFO L290 TraceCheckUtils]: 11: Hoare triple {3289#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {3289#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:53:56,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {3289#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} goto; {3289#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:53:56,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {3289#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !(1 == #valid[main_~x~0#1.base]); {3283#false} is VALID [2022-02-20 23:53:56,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:53:56,926 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:53:56,926 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530131616] [2022-02-20 23:53:56,926 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530131616] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:53:56,926 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:53:56,926 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:53:56,927 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666390645] [2022-02-20 23:53:56,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:53:56,927 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 23:53:56,927 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:53:56,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:56,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:56,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:53:56,937 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:53:56,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:53:56,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:53:56,938 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:57,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:57,539 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2022-02-20 23:53:57,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:53:57,539 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 23:53:57,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:53:57,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:57,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 145 transitions. [2022-02-20 23:53:57,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:57,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 145 transitions. [2022-02-20 23:53:57,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 145 transitions. [2022-02-20 23:53:57,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:57,643 INFO L225 Difference]: With dead ends: 140 [2022-02-20 23:53:57,643 INFO L226 Difference]: Without dead ends: 140 [2022-02-20 23:53:57,643 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:53:57,643 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 314 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:53:57,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [314 Valid, 210 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:53:57,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-02-20 23:53:57,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 100. [2022-02-20 23:53:57,646 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:53:57,646 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand has 100 states, 72 states have (on average 1.5) internal successors, (108), 99 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:57,646 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand has 100 states, 72 states have (on average 1.5) internal successors, (108), 99 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:57,646 INFO L87 Difference]: Start difference. First operand 140 states. Second operand has 100 states, 72 states have (on average 1.5) internal successors, (108), 99 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:57,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:57,648 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2022-02-20 23:53:57,648 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 149 transitions. [2022-02-20 23:53:57,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:57,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:57,649 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 72 states have (on average 1.5) internal successors, (108), 99 states have internal predecessors, (108), 0 states have call successors, (0), 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 140 states. [2022-02-20 23:53:57,649 INFO L87 Difference]: Start difference. First operand has 100 states, 72 states have (on average 1.5) internal successors, (108), 99 states have internal predecessors, (108), 0 states have call successors, (0), 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 140 states. [2022-02-20 23:53:57,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:57,651 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2022-02-20 23:53:57,651 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 149 transitions. [2022-02-20 23:53:57,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:57,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:57,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:53:57,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:53:57,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.5) internal successors, (108), 99 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:57,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2022-02-20 23:53:57,653 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 14 [2022-02-20 23:53:57,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:53:57,653 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2022-02-20 23:53:57,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:57,653 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2022-02-20 23:53:57,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:53:57,653 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:53:57,653 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:53:57,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 23:53:57,654 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2022-02-20 23:53:57,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:53:57,654 INFO L85 PathProgramCache]: Analyzing trace with hash -275416989, now seen corresponding path program 1 times [2022-02-20 23:53:57,654 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:53:57,654 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916100803] [2022-02-20 23:53:57,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:53:57,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:53:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:57,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {3822#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {3822#true} is VALID [2022-02-20 23:53:57,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {3822#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;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; {3824#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:53:57,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {3824#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L998 {3825#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:53:57,787 INFO L290 TraceCheckUtils]: 3: Hoare triple {3825#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-1 {3825#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:53:57,787 INFO L290 TraceCheckUtils]: 4: Hoare triple {3825#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L999 {3825#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:53:57,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {3825#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (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;main_~state~0#1 := 1; {3826#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 23:53:57,788 INFO L290 TraceCheckUtils]: 6: Hoare triple {3826#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {3826#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 23:53:57,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {3826#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {3826#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 23:53:57,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {3826#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1006-3 {3827#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= (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|) (= (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 23:53:57,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {3827#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= (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|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1028 {3828#(and (= 12 (select |#length| |ULTIMATE.start_main_#t~mem7#1.base|)) (= |ULTIMATE.start_main_#t~mem7#1.offset| 0))} is VALID [2022-02-20 23:53:57,791 INFO L290 TraceCheckUtils]: 10: Hoare triple {3828#(and (= 12 (select |#length| |ULTIMATE.start_main_#t~mem7#1.base|)) (= |ULTIMATE.start_main_#t~mem7#1.offset| 0))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {3829#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (+ (- 12) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) 0))} is VALID [2022-02-20 23:53:57,791 INFO L290 TraceCheckUtils]: 11: Hoare triple {3829#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (+ (- 12) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) 0))} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {3829#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (+ (- 12) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) 0))} is VALID [2022-02-20 23:53:57,792 INFO L290 TraceCheckUtils]: 12: Hoare triple {3829#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (+ (- 12) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) 0))} goto; {3829#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (+ (- 12) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) 0))} is VALID [2022-02-20 23:53:57,792 INFO L290 TraceCheckUtils]: 13: Hoare triple {3829#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (+ (- 12) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) 0))} assume !(4 + (8 + main_~x~0#1.offset) <= #length[main_~x~0#1.base] && 0 <= 8 + main_~x~0#1.offset); {3823#false} is VALID [2022-02-20 23:53:57,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:53:57,792 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:53:57,792 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916100803] [2022-02-20 23:53:57,793 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916100803] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:53:57,793 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:53:57,793 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:53:57,793 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815917118] [2022-02-20 23:53:57,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:53:57,793 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 23:53:57,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:53:57,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:57,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:57,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:53:57,805 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:53:57,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:53:57,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:53:57,805 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:58,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:58,492 INFO L93 Difference]: Finished difference Result 172 states and 183 transitions. [2022-02-20 23:53:58,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:53:58,492 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 23:53:58,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:53:58,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:58,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions. [2022-02-20 23:53:58,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:58,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions. [2022-02-20 23:53:58,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 188 transitions. [2022-02-20 23:53:58,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:58,632 INFO L225 Difference]: With dead ends: 172 [2022-02-20 23:53:58,632 INFO L226 Difference]: Without dead ends: 172 [2022-02-20 23:53:58,632 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:53:58,633 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 184 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:53:58,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 284 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:53:58,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-02-20 23:53:58,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 112. [2022-02-20 23:53:58,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:53:58,635 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand has 112 states, 84 states have (on average 1.5) internal successors, (126), 111 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:58,635 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand has 112 states, 84 states have (on average 1.5) internal successors, (126), 111 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:58,636 INFO L87 Difference]: Start difference. First operand 172 states. Second operand has 112 states, 84 states have (on average 1.5) internal successors, (126), 111 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:58,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:58,638 INFO L93 Difference]: Finished difference Result 172 states and 183 transitions. [2022-02-20 23:53:58,638 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 183 transitions. [2022-02-20 23:53:58,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:58,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:58,638 INFO L74 IsIncluded]: Start isIncluded. First operand has 112 states, 84 states have (on average 1.5) internal successors, (126), 111 states have internal predecessors, (126), 0 states have call successors, (0), 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 172 states. [2022-02-20 23:53:58,638 INFO L87 Difference]: Start difference. First operand has 112 states, 84 states have (on average 1.5) internal successors, (126), 111 states have internal predecessors, (126), 0 states have call successors, (0), 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 172 states. [2022-02-20 23:53:58,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:58,640 INFO L93 Difference]: Finished difference Result 172 states and 183 transitions. [2022-02-20 23:53:58,640 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 183 transitions. [2022-02-20 23:53:58,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:58,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:58,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:53:58,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:53:58,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 84 states have (on average 1.5) internal successors, (126), 111 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:58,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2022-02-20 23:53:58,642 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 14 [2022-02-20 23:53:58,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:53:58,642 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2022-02-20 23:53:58,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:58,643 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2022-02-20 23:53:58,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:53:58,643 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:53:58,643 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:53:58,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 23:53:58,643 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2022-02-20 23:53:58,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:53:58,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362871, now seen corresponding path program 1 times [2022-02-20 23:53:58,644 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:53:58,644 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948933814] [2022-02-20 23:53:58,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:53:58,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:53:58,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:58,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {4468#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {4468#true} is VALID [2022-02-20 23:53:58,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {4468#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;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; {4468#true} is VALID [2022-02-20 23:53:58,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {4468#true} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L998 {4470#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:53:58,749 INFO L290 TraceCheckUtils]: 3: Hoare triple {4470#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-1 {4470#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:53:58,749 INFO L290 TraceCheckUtils]: 4: Hoare triple {4470#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L999 {4470#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:53:58,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {4470#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~state~0#1 := 1; {4471#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:53:58,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {4471#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {4471#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:53:58,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {4471#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !!(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {4472#(and (= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~x~0#1.base|)))} is VALID [2022-02-20 23:53:58,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {4472#(and (= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~x~0#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1009 {4473#(and (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1))} is VALID [2022-02-20 23:53:58,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {4473#(and (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {4473#(and (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1))} is VALID [2022-02-20 23:53:58,752 INFO L290 TraceCheckUtils]: 10: Hoare triple {4473#(and (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1))} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1010 {4474#(and (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1))} is VALID [2022-02-20 23:53:58,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {4474#(and (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1))} SUMMARY for call write~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, main_#t~mem4#1.base, 4 + main_#t~mem4#1.offset, 4); srcloc: L1010-1 {4475#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:53:58,753 INFO L290 TraceCheckUtils]: 12: Hoare triple {4475#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {4475#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:53:58,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {4475#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1011 {4476#(= (select |#valid| |ULTIMATE.start_main_#t~mem5#1.base|) 1)} is VALID [2022-02-20 23:53:58,754 INFO L290 TraceCheckUtils]: 14: Hoare triple {4476#(= (select |#valid| |ULTIMATE.start_main_#t~mem5#1.base|) 1)} 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; {4471#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:53:58,754 INFO L290 TraceCheckUtils]: 15: Hoare triple {4471#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !(1 == #valid[main_~x~0#1.base]); {4469#false} is VALID [2022-02-20 23:53:58,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:53:58,754 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:53:58,755 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948933814] [2022-02-20 23:53:58,755 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948933814] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:53:58,755 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:53:58,755 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:53:58,755 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916061270] [2022-02-20 23:53:58,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:53:58,755 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:53:58,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:53:58,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:58,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:58,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:53:58,766 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:53:58,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:53:58,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:53:58,767 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:59,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:59,284 INFO L93 Difference]: Finished difference Result 120 states and 135 transitions. [2022-02-20 23:53:59,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 23:53:59,284 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:53:59,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:53:59,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:59,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 109 transitions. [2022-02-20 23:53:59,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:59,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 109 transitions. [2022-02-20 23:53:59,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 109 transitions. [2022-02-20 23:53:59,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:59,361 INFO L225 Difference]: With dead ends: 120 [2022-02-20 23:53:59,361 INFO L226 Difference]: Without dead ends: 120 [2022-02-20 23:53:59,362 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-02-20 23:53:59,362 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 171 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:53:59,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 172 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:53:59,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-02-20 23:53:59,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 111. [2022-02-20 23:53:59,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:53:59,364 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 111 states, 84 states have (on average 1.4880952380952381) internal successors, (125), 110 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:59,365 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 111 states, 84 states have (on average 1.4880952380952381) internal successors, (125), 110 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:59,365 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 111 states, 84 states have (on average 1.4880952380952381) internal successors, (125), 110 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:59,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:59,366 INFO L93 Difference]: Finished difference Result 120 states and 135 transitions. [2022-02-20 23:53:59,366 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 135 transitions. [2022-02-20 23:53:59,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:59,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:59,367 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 84 states have (on average 1.4880952380952381) internal successors, (125), 110 states have internal predecessors, (125), 0 states have call successors, (0), 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 120 states. [2022-02-20 23:53:59,367 INFO L87 Difference]: Start difference. First operand has 111 states, 84 states have (on average 1.4880952380952381) internal successors, (125), 110 states have internal predecessors, (125), 0 states have call successors, (0), 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 120 states. [2022-02-20 23:53:59,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:59,368 INFO L93 Difference]: Finished difference Result 120 states and 135 transitions. [2022-02-20 23:53:59,368 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 135 transitions. [2022-02-20 23:53:59,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:59,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:59,369 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:53:59,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:53:59,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 84 states have (on average 1.4880952380952381) internal successors, (125), 110 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:59,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2022-02-20 23:53:59,370 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 16 [2022-02-20 23:53:59,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:53:59,370 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2022-02-20 23:53:59,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:59,370 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2022-02-20 23:53:59,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:53:59,370 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:53:59,371 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:53:59,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 23:53:59,371 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2022-02-20 23:53:59,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:53:59,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362872, now seen corresponding path program 1 times [2022-02-20 23:53:59,372 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:53:59,372 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340631701] [2022-02-20 23:53:59,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:53:59,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:53:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:59,516 INFO L290 TraceCheckUtils]: 0: Hoare triple {4966#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {4966#true} is VALID [2022-02-20 23:53:59,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {4966#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;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; {4966#true} is VALID [2022-02-20 23:53:59,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {4966#true} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L998 {4968#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:53:59,519 INFO L290 TraceCheckUtils]: 3: Hoare triple {4968#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-1 {4968#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:53:59,519 INFO L290 TraceCheckUtils]: 4: Hoare triple {4968#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L999 {4968#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:53:59,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {4968#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~state~0#1 := 1; {4969#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:53:59,520 INFO L290 TraceCheckUtils]: 6: Hoare triple {4969#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {4969#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:53:59,521 INFO L290 TraceCheckUtils]: 7: Hoare triple {4969#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !!(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {4970#(and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|) 12))} is VALID [2022-02-20 23:53:59,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {4970#(and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|) 12))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1009 {4971#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (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 23:53:59,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {4971#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (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))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {4971#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (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 23:53:59,523 INFO L290 TraceCheckUtils]: 10: Hoare triple {4971#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (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))} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1010 {4972#(and (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:53:59,524 INFO L290 TraceCheckUtils]: 11: Hoare triple {4972#(and (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} SUMMARY for 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); srcloc: L1010-1 {4973#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:53:59,525 INFO L290 TraceCheckUtils]: 12: Hoare triple {4973#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {4973#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:53:59,526 INFO L290 TraceCheckUtils]: 13: Hoare triple {4973#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1011 {4974#(and (= |ULTIMATE.start_main_#t~mem5#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~mem5#1.base|) 12))} is VALID [2022-02-20 23:53:59,527 INFO L290 TraceCheckUtils]: 14: Hoare triple {4974#(and (= |ULTIMATE.start_main_#t~mem5#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~mem5#1.base|) 12))} 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; {4975#(and (= 12 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} is VALID [2022-02-20 23:53:59,537 INFO L290 TraceCheckUtils]: 15: Hoare triple {4975#(and (= 12 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} assume !(4 + main_~x~0#1.offset <= #length[main_~x~0#1.base] && 0 <= main_~x~0#1.offset); {4967#false} is VALID [2022-02-20 23:53:59,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:53:59,537 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:53:59,538 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340631701] [2022-02-20 23:53:59,538 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340631701] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:53:59,538 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:53:59,538 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:53:59,538 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839980823] [2022-02-20 23:53:59,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:53:59,538 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:53:59,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:53:59,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:59,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:59,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:53:59,554 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:53:59,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:53:59,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:53:59,555 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:00,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:00,275 INFO L93 Difference]: Finished difference Result 115 states and 130 transitions. [2022-02-20 23:54:00,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 23:54:00,275 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:54:00,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:00,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:00,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 114 transitions. [2022-02-20 23:54:00,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:00,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 114 transitions. [2022-02-20 23:54:00,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 114 transitions. [2022-02-20 23:54:00,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:00,355 INFO L225 Difference]: With dead ends: 115 [2022-02-20 23:54:00,355 INFO L226 Difference]: Without dead ends: 115 [2022-02-20 23:54:00,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2022-02-20 23:54:00,355 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 158 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:00,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 211 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:54:00,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-02-20 23:54:00,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2022-02-20 23:54:00,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:00,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 99 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 98 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:00,357 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 99 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 98 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:00,357 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 99 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 98 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:00,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:00,359 INFO L93 Difference]: Finished difference Result 115 states and 130 transitions. [2022-02-20 23:54:00,359 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 130 transitions. [2022-02-20 23:54:00,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:00,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:00,359 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 98 states have internal predecessors, (113), 0 states have call successors, (0), 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 115 states. [2022-02-20 23:54:00,359 INFO L87 Difference]: Start difference. First operand has 99 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 98 states have internal predecessors, (113), 0 states have call successors, (0), 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 115 states. [2022-02-20 23:54:00,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:00,368 INFO L93 Difference]: Finished difference Result 115 states and 130 transitions. [2022-02-20 23:54:00,368 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 130 transitions. [2022-02-20 23:54:00,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:00,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:00,369 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:00,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:00,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 98 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:00,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2022-02-20 23:54:00,370 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 16 [2022-02-20 23:54:00,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:00,370 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2022-02-20 23:54:00,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:00,370 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2022-02-20 23:54:00,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:54:00,371 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:00,371 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:00,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 23:54:00,371 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2022-02-20 23:54:00,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:00,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1559926215, now seen corresponding path program 1 times [2022-02-20 23:54:00,372 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:00,372 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674682571] [2022-02-20 23:54:00,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:00,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:00,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:00,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {5448#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {5448#true} is VALID [2022-02-20 23:54:00,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {5448#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;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; {5450#(= |ULTIMATE.start_main_~head~0#1.offset| 0)} is VALID [2022-02-20 23:54:00,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {5450#(= |ULTIMATE.start_main_~head~0#1.offset| 0)} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L998 {5451#(and (= |ULTIMATE.start_main_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (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))} is VALID [2022-02-20 23:54:00,514 INFO L290 TraceCheckUtils]: 3: Hoare triple {5451#(and (= |ULTIMATE.start_main_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (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))} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-1 {5451#(and (= |ULTIMATE.start_main_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (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))} is VALID [2022-02-20 23:54:00,515 INFO L290 TraceCheckUtils]: 4: Hoare triple {5451#(and (= |ULTIMATE.start_main_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (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))} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L999 {5451#(and (= |ULTIMATE.start_main_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (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))} is VALID [2022-02-20 23:54:00,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {5451#(and (= |ULTIMATE.start_main_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (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))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~state~0#1 := 1; {5452#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.base|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:54:00,516 INFO L290 TraceCheckUtils]: 6: Hoare triple {5452#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.base|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {5452#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.base|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:54:00,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {5452#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.base|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {5452#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.base|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:54:00,518 INFO L290 TraceCheckUtils]: 8: Hoare triple {5452#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.base|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|))} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1006-3 {5453#(and (= |ULTIMATE.start_main_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (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|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:00,518 INFO L290 TraceCheckUtils]: 9: Hoare triple {5453#(and (= |ULTIMATE.start_main_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (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|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1028 {5454#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem7#1.base|) |ULTIMATE.start_main_#t~mem7#1.offset|)) 1)} is VALID [2022-02-20 23:54:00,519 INFO L290 TraceCheckUtils]: 10: Hoare triple {5454#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem7#1.base|) |ULTIMATE.start_main_#t~mem7#1.offset|)) 1)} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {5455#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:54:00,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {5455#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {5455#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:54:00,519 INFO L290 TraceCheckUtils]: 12: Hoare triple {5455#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} goto; {5455#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:54:00,520 INFO L290 TraceCheckUtils]: 13: Hoare triple {5455#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} SUMMARY for call main_#t~mem8#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1033-2 {5455#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:54:00,520 INFO L290 TraceCheckUtils]: 14: Hoare triple {5455#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} assume !!(0 != main_#t~mem8#1);havoc main_#t~mem8#1; {5455#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:54:00,520 INFO L290 TraceCheckUtils]: 15: Hoare triple {5455#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1035-13 {5456#(= (select |#valid| |ULTIMATE.start_main_#t~mem9#1.base|) 1)} is VALID [2022-02-20 23:54:00,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {5456#(= (select |#valid| |ULTIMATE.start_main_#t~mem9#1.base|) 1)} assume !(1 == #valid[main_#t~mem9#1.base]); {5449#false} is VALID [2022-02-20 23:54:00,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:00,521 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:00,521 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674682571] [2022-02-20 23:54:00,521 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674682571] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:00,521 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:00,521 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:54:00,521 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927406767] [2022-02-20 23:54:00,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:00,522 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 23:54:00,522 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:00,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:00,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:00,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:54:00,534 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:00,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:54:00,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:54:00,535 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:01,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:01,192 INFO L93 Difference]: Finished difference Result 147 states and 158 transitions. [2022-02-20 23:54:01,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:54:01,192 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 23:54:01,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:01,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:01,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 159 transitions. [2022-02-20 23:54:01,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:01,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 159 transitions. [2022-02-20 23:54:01,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 159 transitions. [2022-02-20 23:54:01,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:01,306 INFO L225 Difference]: With dead ends: 147 [2022-02-20 23:54:01,306 INFO L226 Difference]: Without dead ends: 147 [2022-02-20 23:54:01,306 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2022-02-20 23:54:01,307 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 265 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:01,307 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 322 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:54:01,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-02-20 23:54:01,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 99. [2022-02-20 23:54:01,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:01,309 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand has 99 states, 78 states have (on average 1.435897435897436) internal successors, (112), 98 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:01,309 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand has 99 states, 78 states have (on average 1.435897435897436) internal successors, (112), 98 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:01,309 INFO L87 Difference]: Start difference. First operand 147 states. Second operand has 99 states, 78 states have (on average 1.435897435897436) internal successors, (112), 98 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:01,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:01,311 INFO L93 Difference]: Finished difference Result 147 states and 158 transitions. [2022-02-20 23:54:01,311 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 158 transitions. [2022-02-20 23:54:01,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:01,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:01,312 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 78 states have (on average 1.435897435897436) internal successors, (112), 98 states have internal predecessors, (112), 0 states have call successors, (0), 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 147 states. [2022-02-20 23:54:01,312 INFO L87 Difference]: Start difference. First operand has 99 states, 78 states have (on average 1.435897435897436) internal successors, (112), 98 states have internal predecessors, (112), 0 states have call successors, (0), 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 147 states. [2022-02-20 23:54:01,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:01,313 INFO L93 Difference]: Finished difference Result 147 states and 158 transitions. [2022-02-20 23:54:01,313 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 158 transitions. [2022-02-20 23:54:01,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:01,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:01,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:01,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:01,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 78 states have (on average 1.435897435897436) internal successors, (112), 98 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:01,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2022-02-20 23:54:01,318 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 17 [2022-02-20 23:54:01,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:01,318 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2022-02-20 23:54:01,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:01,318 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2022-02-20 23:54:01,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:54:01,319 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:01,319 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:01,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 23:54:01,319 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2022-02-20 23:54:01,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:01,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1559926214, now seen corresponding path program 1 times [2022-02-20 23:54:01,319 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:01,320 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200390223] [2022-02-20 23:54:01,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:01,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:01,494 INFO L290 TraceCheckUtils]: 0: Hoare triple {6013#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {6013#true} is VALID [2022-02-20 23:54:01,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {6013#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;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; {6015#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:54:01,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {6015#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L998 {6016#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:01,496 INFO L290 TraceCheckUtils]: 3: Hoare triple {6016#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-1 {6016#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:01,497 INFO L290 TraceCheckUtils]: 4: Hoare triple {6016#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L999 {6016#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:01,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {6016#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (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;main_~state~0#1 := 1; {6017#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:54:01,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {6017#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {6017#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:54:01,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {6017#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {6017#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:54:01,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {6017#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|))} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1006-3 {6016#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:01,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {6016#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1028 {6018#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem7#1.base|) |ULTIMATE.start_main_#t~mem7#1.offset|) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem7#1.base|) |ULTIMATE.start_main_#t~mem7#1.offset|))))} is VALID [2022-02-20 23:54:01,500 INFO L290 TraceCheckUtils]: 10: Hoare triple {6018#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem7#1.base|) |ULTIMATE.start_main_#t~mem7#1.offset|) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem7#1.base|) |ULTIMATE.start_main_#t~mem7#1.offset|))))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {6019#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:54:01,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {6019#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {6019#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:54:01,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {6019#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} goto; {6019#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:54:01,501 INFO L290 TraceCheckUtils]: 13: Hoare triple {6019#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} SUMMARY for call main_#t~mem8#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1033-2 {6019#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:54:01,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {6019#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} assume !!(0 != main_#t~mem8#1);havoc main_#t~mem8#1; {6019#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:54:01,502 INFO L290 TraceCheckUtils]: 15: Hoare triple {6019#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1035-13 {6020#(and (<= 12 (select |#length| |ULTIMATE.start_main_#t~mem9#1.base|)) (= |ULTIMATE.start_main_#t~mem9#1.offset| 0))} is VALID [2022-02-20 23:54:01,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {6020#(and (<= 12 (select |#length| |ULTIMATE.start_main_#t~mem9#1.base|)) (= |ULTIMATE.start_main_#t~mem9#1.offset| 0))} assume !(4 + (8 + main_#t~mem9#1.offset) <= #length[main_#t~mem9#1.base] && 0 <= 8 + main_#t~mem9#1.offset); {6014#false} is VALID [2022-02-20 23:54:01,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:01,503 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:01,503 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200390223] [2022-02-20 23:54:01,503 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200390223] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:01,503 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:01,503 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:54:01,504 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326327400] [2022-02-20 23:54:01,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:01,504 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 23:54:01,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:01,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:01,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:01,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:54:01,517 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:01,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:54:01,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:54:01,518 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:02,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:02,169 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2022-02-20 23:54:02,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:54:02,169 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 23:54:02,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:02,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:02,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2022-02-20 23:54:02,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:02,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2022-02-20 23:54:02,172 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 169 transitions. [2022-02-20 23:54:02,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:02,299 INFO L225 Difference]: With dead ends: 157 [2022-02-20 23:54:02,299 INFO L226 Difference]: Without dead ends: 157 [2022-02-20 23:54:02,299 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:54:02,300 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 181 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:02,300 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 240 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:54:02,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-02-20 23:54:02,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 99. [2022-02-20 23:54:02,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:02,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand has 99 states, 78 states have (on average 1.4230769230769231) internal successors, (111), 98 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:02,302 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand has 99 states, 78 states have (on average 1.4230769230769231) internal successors, (111), 98 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:02,302 INFO L87 Difference]: Start difference. First operand 157 states. Second operand has 99 states, 78 states have (on average 1.4230769230769231) internal successors, (111), 98 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:02,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:02,304 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2022-02-20 23:54:02,304 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 168 transitions. [2022-02-20 23:54:02,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:02,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:02,304 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 78 states have (on average 1.4230769230769231) internal successors, (111), 98 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 157 states. [2022-02-20 23:54:02,304 INFO L87 Difference]: Start difference. First operand has 99 states, 78 states have (on average 1.4230769230769231) internal successors, (111), 98 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 157 states. [2022-02-20 23:54:02,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:02,306 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2022-02-20 23:54:02,306 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 168 transitions. [2022-02-20 23:54:02,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:02,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:02,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:02,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:02,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 78 states have (on average 1.4230769230769231) internal successors, (111), 98 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:02,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2022-02-20 23:54:02,308 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 17 [2022-02-20 23:54:02,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:02,308 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2022-02-20 23:54:02,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:02,308 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2022-02-20 23:54:02,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:54:02,309 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:02,309 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:02,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 23:54:02,309 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2022-02-20 23:54:02,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:02,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1113087206, now seen corresponding path program 1 times [2022-02-20 23:54:02,310 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:02,310 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243649657] [2022-02-20 23:54:02,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:02,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:02,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {6603#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {6603#true} is VALID [2022-02-20 23:54:02,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {6603#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;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; {6605#(= |ULTIMATE.start_main_~head~0#1.offset| 0)} is VALID [2022-02-20 23:54:02,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {6605#(= |ULTIMATE.start_main_~head~0#1.offset| 0)} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L998 {6606#(and (= (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))} is VALID [2022-02-20 23:54:02,388 INFO L290 TraceCheckUtils]: 3: Hoare triple {6606#(and (= (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))} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-1 {6606#(and (= (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))} is VALID [2022-02-20 23:54:02,389 INFO L290 TraceCheckUtils]: 4: Hoare triple {6606#(and (= (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))} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L999 {6606#(and (= (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))} is VALID [2022-02-20 23:54:02,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {6606#(and (= (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))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~state~0#1 := 1; {6607#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.base|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 23:54:02,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {6607#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.base|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {6607#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.base|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 23:54:02,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {6607#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.base|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {6607#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.base|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 23:54:02,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {6607#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.base|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1006-3 {6608#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)} is VALID [2022-02-20 23:54:02,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {6608#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1028 {6608#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)} is VALID [2022-02-20 23:54:02,392 INFO L290 TraceCheckUtils]: 10: Hoare triple {6608#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {6608#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)} is VALID [2022-02-20 23:54:02,392 INFO L290 TraceCheckUtils]: 11: Hoare triple {6608#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {6608#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)} is VALID [2022-02-20 23:54:02,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {6608#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)} goto; {6608#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)} is VALID [2022-02-20 23:54:02,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {6608#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)} SUMMARY for call main_#t~mem8#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1033-2 {6608#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)} is VALID [2022-02-20 23:54:02,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {6608#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)} assume !(0 != main_#t~mem8#1);havoc main_#t~mem8#1; {6608#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)} is VALID [2022-02-20 23:54:02,394 INFO L290 TraceCheckUtils]: 15: Hoare triple {6608#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)} SUMMARY for call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1033-3 {6609#(= (select |#valid| |ULTIMATE.start_main_#t~mem16#1.base|) 1)} is VALID [2022-02-20 23:54:02,394 INFO L290 TraceCheckUtils]: 16: Hoare triple {6609#(= (select |#valid| |ULTIMATE.start_main_#t~mem16#1.base|) 1)} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset; {6610#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:54:02,395 INFO L290 TraceCheckUtils]: 17: Hoare triple {6610#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !(1 == #valid[main_~x~0#1.base]); {6604#false} is VALID [2022-02-20 23:54:02,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:02,395 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:02,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243649657] [2022-02-20 23:54:02,395 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243649657] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:02,395 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:02,396 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:54:02,396 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844453078] [2022-02-20 23:54:02,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:02,396 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:54:02,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:02,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:02,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:02,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:54:02,410 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:02,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:54:02,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:54:02,411 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:02,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:02,908 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2022-02-20 23:54:02,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:54:02,908 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:54:02,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:02,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:02,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 135 transitions. [2022-02-20 23:54:02,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:02,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 135 transitions. [2022-02-20 23:54:02,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 135 transitions. [2022-02-20 23:54:03,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:03,011 INFO L225 Difference]: With dead ends: 138 [2022-02-20 23:54:03,011 INFO L226 Difference]: Without dead ends: 138 [2022-02-20 23:54:03,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:54:03,012 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 243 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:03,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 209 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:54:03,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-02-20 23:54:03,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 116. [2022-02-20 23:54:03,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:03,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand has 116 states, 95 states have (on average 1.4947368421052631) internal successors, (142), 115 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:03,014 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand has 116 states, 95 states have (on average 1.4947368421052631) internal successors, (142), 115 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:03,014 INFO L87 Difference]: Start difference. First operand 138 states. Second operand has 116 states, 95 states have (on average 1.4947368421052631) internal successors, (142), 115 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:03,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:03,016 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2022-02-20 23:54:03,016 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 152 transitions. [2022-02-20 23:54:03,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:03,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:03,016 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 95 states have (on average 1.4947368421052631) internal successors, (142), 115 states have internal predecessors, (142), 0 states have call successors, (0), 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 138 states. [2022-02-20 23:54:03,017 INFO L87 Difference]: Start difference. First operand has 116 states, 95 states have (on average 1.4947368421052631) internal successors, (142), 115 states have internal predecessors, (142), 0 states have call successors, (0), 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 138 states. [2022-02-20 23:54:03,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:03,018 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2022-02-20 23:54:03,018 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 152 transitions. [2022-02-20 23:54:03,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:03,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:03,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:03,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:03,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 95 states have (on average 1.4947368421052631) internal successors, (142), 115 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:03,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 142 transitions. [2022-02-20 23:54:03,020 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 142 transitions. Word has length 18 [2022-02-20 23:54:03,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:03,020 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 142 transitions. [2022-02-20 23:54:03,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:03,021 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 142 transitions. [2022-02-20 23:54:03,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:54:03,021 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:03,021 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:03,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 23:54:03,021 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2022-02-20 23:54:03,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:03,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1113087205, now seen corresponding path program 1 times [2022-02-20 23:54:03,022 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:03,022 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260288443] [2022-02-20 23:54:03,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:03,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:03,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {7153#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {7153#true} is VALID [2022-02-20 23:54:03,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {7153#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;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; {7155#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:54:03,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {7155#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L998 {7156#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:03,178 INFO L290 TraceCheckUtils]: 3: Hoare triple {7156#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-1 {7156#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:03,179 INFO L290 TraceCheckUtils]: 4: Hoare triple {7156#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L999 {7156#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:03,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {7156#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (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;main_~state~0#1 := 1; {7157#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 23:54:03,180 INFO L290 TraceCheckUtils]: 6: Hoare triple {7157#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {7157#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 23:54:03,181 INFO L290 TraceCheckUtils]: 7: Hoare triple {7157#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {7157#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 23:54:03,181 INFO L290 TraceCheckUtils]: 8: Hoare triple {7157#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1006-3 {7158#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= (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|) (= (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 23:54:03,182 INFO L290 TraceCheckUtils]: 9: Hoare triple {7158#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= (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|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1028 {7158#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= (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|) (= (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 23:54:03,183 INFO L290 TraceCheckUtils]: 10: Hoare triple {7158#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= (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|) (= (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_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {7158#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= (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|) (= (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 23:54:03,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {7158#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= (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|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {7158#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= (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|) (= (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 23:54:03,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {7158#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= (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|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} goto; {7158#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= (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|) (= (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 23:54:03,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {7158#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= (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|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} SUMMARY for call main_#t~mem8#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1033-2 {7158#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= (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|) (= (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 23:54:03,184 INFO L290 TraceCheckUtils]: 14: Hoare triple {7158#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= (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|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} assume !(0 != main_#t~mem8#1);havoc main_#t~mem8#1; {7158#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= (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|) (= (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 23:54:03,185 INFO L290 TraceCheckUtils]: 15: Hoare triple {7158#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= (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|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} SUMMARY for call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1033-3 {7159#(and (<= 12 (select |#length| |ULTIMATE.start_main_#t~mem16#1.base|)) (= |ULTIMATE.start_main_#t~mem16#1.offset| 0))} is VALID [2022-02-20 23:54:03,185 INFO L290 TraceCheckUtils]: 16: Hoare triple {7159#(and (<= 12 (select |#length| |ULTIMATE.start_main_#t~mem16#1.base|)) (= |ULTIMATE.start_main_#t~mem16#1.offset| 0))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset; {7160#(and (<= 12 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} is VALID [2022-02-20 23:54:03,186 INFO L290 TraceCheckUtils]: 17: Hoare triple {7160#(and (<= 12 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} assume !(4 + (8 + main_~x~0#1.offset) <= #length[main_~x~0#1.base] && 0 <= 8 + main_~x~0#1.offset); {7154#false} is VALID [2022-02-20 23:54:03,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:03,186 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:03,186 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260288443] [2022-02-20 23:54:03,186 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260288443] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:03,186 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:03,186 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:54:03,186 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617645195] [2022-02-20 23:54:03,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:03,187 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:54:03,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:03,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:03,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:03,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:54:03,201 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:03,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:54:03,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:54:03,201 INFO L87 Difference]: Start difference. First operand 116 states and 142 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:03,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:03,705 INFO L93 Difference]: Finished difference Result 159 states and 173 transitions. [2022-02-20 23:54:03,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:54:03,705 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:54:03,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:03,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:03,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2022-02-20 23:54:03,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:03,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2022-02-20 23:54:03,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 159 transitions. [2022-02-20 23:54:03,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:03,832 INFO L225 Difference]: With dead ends: 159 [2022-02-20 23:54:03,832 INFO L226 Difference]: Without dead ends: 159 [2022-02-20 23:54:03,833 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:54:03,833 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 222 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:03,833 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 184 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:54:03,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-02-20 23:54:03,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 121. [2022-02-20 23:54:03,835 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:03,835 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand has 121 states, 100 states have (on average 1.47) internal successors, (147), 120 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:03,835 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand has 121 states, 100 states have (on average 1.47) internal successors, (147), 120 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:03,835 INFO L87 Difference]: Start difference. First operand 159 states. Second operand has 121 states, 100 states have (on average 1.47) internal successors, (147), 120 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:03,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:03,837 INFO L93 Difference]: Finished difference Result 159 states and 173 transitions. [2022-02-20 23:54:03,837 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 173 transitions. [2022-02-20 23:54:03,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:03,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:03,837 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 100 states have (on average 1.47) internal successors, (147), 120 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 159 states. [2022-02-20 23:54:03,838 INFO L87 Difference]: Start difference. First operand has 121 states, 100 states have (on average 1.47) internal successors, (147), 120 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 159 states. [2022-02-20 23:54:03,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:03,839 INFO L93 Difference]: Finished difference Result 159 states and 173 transitions. [2022-02-20 23:54:03,839 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 173 transitions. [2022-02-20 23:54:03,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:03,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:03,840 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:03,840 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:03,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 100 states have (on average 1.47) internal successors, (147), 120 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:03,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 147 transitions. [2022-02-20 23:54:03,841 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 147 transitions. Word has length 18 [2022-02-20 23:54:03,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:03,841 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 147 transitions. [2022-02-20 23:54:03,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:03,842 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 147 transitions. [2022-02-20 23:54:03,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 23:54:03,842 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:03,842 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:03,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-20 23:54:03,842 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2022-02-20 23:54:03,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:03,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1461687964, now seen corresponding path program 1 times [2022-02-20 23:54:03,843 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:03,843 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809505541] [2022-02-20 23:54:03,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:03,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:03,943 INFO L290 TraceCheckUtils]: 0: Hoare triple {7769#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {7769#true} is VALID [2022-02-20 23:54:03,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {7769#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;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; {7771#(and (<= (+ |ULTIMATE.start_main_~head~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:54:03,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {7771#(and (<= (+ |ULTIMATE.start_main_~head~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L998 {7772#(and (= (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.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:54:03,946 INFO L290 TraceCheckUtils]: 3: Hoare triple {7772#(and (= (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.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-1 {7772#(and (= (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.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:54:03,946 INFO L290 TraceCheckUtils]: 4: Hoare triple {7772#(and (= (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.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L999 {7772#(and (= (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.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:54:03,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {7772#(and (= (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.base| 1) |#StackHeapBarrier|) (= |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;main_~state~0#1 := 1; {7773#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (<= (+ |ULTIMATE.start_main_~head~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 23:54:03,947 INFO L290 TraceCheckUtils]: 6: Hoare triple {7773#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (<= (+ |ULTIMATE.start_main_~head~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {7773#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (<= (+ |ULTIMATE.start_main_~head~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 23:54:03,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {7773#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (<= (+ |ULTIMATE.start_main_~head~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {7773#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (<= (+ |ULTIMATE.start_main_~head~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 23:54:03,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {7773#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (<= (+ |ULTIMATE.start_main_~head~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1006-3 {7774#(and (= (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.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 23:54:03,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {7774#(and (= (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.base| 1) |#StackHeapBarrier|))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1028 {7774#(and (= (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.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 23:54:03,949 INFO L290 TraceCheckUtils]: 10: Hoare triple {7774#(and (= (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.base| 1) |#StackHeapBarrier|))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {7774#(and (= (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.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 23:54:03,950 INFO L290 TraceCheckUtils]: 11: Hoare triple {7774#(and (= (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.base| 1) |#StackHeapBarrier|))} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {7774#(and (= (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.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 23:54:03,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {7774#(and (= (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.base| 1) |#StackHeapBarrier|))} goto; {7774#(and (= (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.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 23:54:03,953 INFO L290 TraceCheckUtils]: 13: Hoare triple {7774#(and (= (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.base| 1) |#StackHeapBarrier|))} SUMMARY for call main_#t~mem8#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1033-2 {7774#(and (= (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.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 23:54:03,954 INFO L290 TraceCheckUtils]: 14: Hoare triple {7774#(and (= (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.base| 1) |#StackHeapBarrier|))} assume !(0 != main_#t~mem8#1);havoc main_#t~mem8#1; {7774#(and (= (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.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 23:54:03,954 INFO L290 TraceCheckUtils]: 15: Hoare triple {7774#(and (= (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.base| 1) |#StackHeapBarrier|))} SUMMARY for call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1033-3 {7775#(<= (+ |ULTIMATE.start_main_#t~mem16#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:54:03,955 INFO L290 TraceCheckUtils]: 16: Hoare triple {7775#(<= (+ |ULTIMATE.start_main_#t~mem16#1.base| 1) |#StackHeapBarrier|)} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset; {7776#(<= (+ |ULTIMATE.start_main_~x~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:54:03,955 INFO L290 TraceCheckUtils]: 17: Hoare triple {7776#(<= (+ |ULTIMATE.start_main_~x~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call main_#t~mem17#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1041-3 {7776#(<= (+ |ULTIMATE.start_main_~x~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:54:03,955 INFO L290 TraceCheckUtils]: 18: Hoare triple {7776#(<= (+ |ULTIMATE.start_main_~x~0#1.base| 1) |#StackHeapBarrier|)} assume !(0 != main_#t~mem17#1);havoc main_#t~mem17#1; {7776#(<= (+ |ULTIMATE.start_main_~x~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:54:03,956 INFO L290 TraceCheckUtils]: 19: Hoare triple {7776#(<= (+ |ULTIMATE.start_main_~x~0#1.base| 1) |#StackHeapBarrier|)} assume 0 == main_~x~0#1.offset; {7776#(<= (+ |ULTIMATE.start_main_~x~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:54:03,956 INFO L290 TraceCheckUtils]: 20: Hoare triple {7776#(<= (+ |ULTIMATE.start_main_~x~0#1.base| 1) |#StackHeapBarrier|)} assume !(main_~x~0#1.base < #StackHeapBarrier); {7770#false} is VALID [2022-02-20 23:54:03,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:03,957 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:03,957 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809505541] [2022-02-20 23:54:03,958 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809505541] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:03,958 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:03,958 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:54:03,958 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955326847] [2022-02-20 23:54:03,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:03,959 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 23:54:03,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:03,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:03,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:03,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:54:03,973 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:03,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:54:03,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:54:03,974 INFO L87 Difference]: Start difference. First operand 121 states and 147 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:04,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:04,449 INFO L93 Difference]: Finished difference Result 155 states and 169 transitions. [2022-02-20 23:54:04,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:54:04,449 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 23:54:04,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:04,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:04,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2022-02-20 23:54:04,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:04,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2022-02-20 23:54:04,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 151 transitions. [2022-02-20 23:54:04,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:04,560 INFO L225 Difference]: With dead ends: 155 [2022-02-20 23:54:04,560 INFO L226 Difference]: Without dead ends: 155 [2022-02-20 23:54:04,561 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:54:04,561 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 171 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:04,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 272 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:54:04,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-02-20 23:54:04,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 122. [2022-02-20 23:54:04,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:04,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand has 122 states, 101 states have (on average 1.4653465346534653) internal successors, (148), 121 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:04,564 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand has 122 states, 101 states have (on average 1.4653465346534653) internal successors, (148), 121 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:04,564 INFO L87 Difference]: Start difference. First operand 155 states. Second operand has 122 states, 101 states have (on average 1.4653465346534653) internal successors, (148), 121 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:04,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:04,565 INFO L93 Difference]: Finished difference Result 155 states and 169 transitions. [2022-02-20 23:54:04,566 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 169 transitions. [2022-02-20 23:54:04,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:04,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:04,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 101 states have (on average 1.4653465346534653) internal successors, (148), 121 states have internal predecessors, (148), 0 states have call successors, (0), 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 155 states. [2022-02-20 23:54:04,566 INFO L87 Difference]: Start difference. First operand has 122 states, 101 states have (on average 1.4653465346534653) internal successors, (148), 121 states have internal predecessors, (148), 0 states have call successors, (0), 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 155 states. [2022-02-20 23:54:04,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:04,569 INFO L93 Difference]: Finished difference Result 155 states and 169 transitions. [2022-02-20 23:54:04,569 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 169 transitions. [2022-02-20 23:54:04,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:04,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:04,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:04,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:04,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.4653465346534653) internal successors, (148), 121 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:04,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 148 transitions. [2022-02-20 23:54:04,571 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 148 transitions. Word has length 21 [2022-02-20 23:54:04,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:04,571 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 148 transitions. [2022-02-20 23:54:04,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:04,571 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 148 transitions. [2022-02-20 23:54:04,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 23:54:04,571 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:04,571 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:04,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-20 23:54:04,572 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2022-02-20 23:54:04,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:04,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1905376220, now seen corresponding path program 1 times [2022-02-20 23:54:04,572 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:04,572 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555206786] [2022-02-20 23:54:04,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:04,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:04,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {8374#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {8374#true} is VALID [2022-02-20 23:54:04,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {8374#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;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; {8374#true} is VALID [2022-02-20 23:54:04,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {8374#true} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L998 {8374#true} is VALID [2022-02-20 23:54:04,595 INFO L290 TraceCheckUtils]: 3: Hoare triple {8374#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-1 {8374#true} is VALID [2022-02-20 23:54:04,595 INFO L290 TraceCheckUtils]: 4: Hoare triple {8374#true} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L999 {8374#true} is VALID [2022-02-20 23:54:04,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {8374#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~state~0#1 := 1; {8374#true} is VALID [2022-02-20 23:54:04,595 INFO L290 TraceCheckUtils]: 6: Hoare triple {8374#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {8374#true} is VALID [2022-02-20 23:54:04,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {8374#true} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {8374#true} is VALID [2022-02-20 23:54:04,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {8374#true} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1006-3 {8374#true} is VALID [2022-02-20 23:54:04,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {8374#true} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1028 {8374#true} is VALID [2022-02-20 23:54:04,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {8374#true} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {8374#true} is VALID [2022-02-20 23:54:04,596 INFO L290 TraceCheckUtils]: 11: Hoare triple {8374#true} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {8374#true} is VALID [2022-02-20 23:54:04,596 INFO L290 TraceCheckUtils]: 12: Hoare triple {8374#true} goto; {8374#true} is VALID [2022-02-20 23:54:04,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {8374#true} SUMMARY for call main_#t~mem8#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1033-2 {8374#true} is VALID [2022-02-20 23:54:04,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {8374#true} assume !!(0 != main_#t~mem8#1);havoc main_#t~mem8#1; {8374#true} is VALID [2022-02-20 23:54:04,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {8374#true} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1035-13 {8374#true} is VALID [2022-02-20 23:54:04,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {8374#true} SUMMARY for call main_#t~mem10#1 := read~int(main_#t~mem9#1.base, 8 + main_#t~mem9#1.offset, 4); srcloc: L1035-1 {8374#true} is VALID [2022-02-20 23:54:04,597 INFO L290 TraceCheckUtils]: 17: Hoare triple {8374#true} main_#t~short14#1 := 0 == main_#t~mem10#1; {8374#true} is VALID [2022-02-20 23:54:04,597 INFO L290 TraceCheckUtils]: 18: Hoare triple {8374#true} assume main_#t~short14#1; {8376#|ULTIMATE.start_main_#t~short14#1|} is VALID [2022-02-20 23:54:04,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {8376#|ULTIMATE.start_main_#t~short14#1|} assume !main_#t~short14#1;havoc main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem10#1;havoc main_#t~mem12#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem13#1;havoc main_#t~short14#1; {8375#false} is VALID [2022-02-20 23:54:04,597 INFO L290 TraceCheckUtils]: 20: Hoare triple {8375#false} assume !false; {8375#false} is VALID [2022-02-20 23:54:04,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:04,598 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:04,598 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555206786] [2022-02-20 23:54:04,598 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555206786] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:04,598 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:04,598 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:54:04,598 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401927700] [2022-02-20 23:54:04,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:04,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 23:54:04,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:04,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:04,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:04,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:54:04,610 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:04,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:54:04,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:54:04,611 INFO L87 Difference]: Start difference. First operand 122 states and 148 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:04,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:04,667 INFO L93 Difference]: Finished difference Result 125 states and 151 transitions. [2022-02-20 23:54:04,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:54:04,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 23:54:04,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:04,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:04,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2022-02-20 23:54:04,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:04,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2022-02-20 23:54:04,669 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 87 transitions. [2022-02-20 23:54:04,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:04,720 INFO L225 Difference]: With dead ends: 125 [2022-02-20 23:54:04,720 INFO L226 Difference]: Without dead ends: 125 [2022-02-20 23:54:04,720 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:54:04,721 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:04,721 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:54:04,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-02-20 23:54:04,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-02-20 23:54:04,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:04,723 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 125 states, 104 states have (on average 1.4519230769230769) internal successors, (151), 124 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:04,723 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 125 states, 104 states have (on average 1.4519230769230769) internal successors, (151), 124 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:04,723 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 125 states, 104 states have (on average 1.4519230769230769) internal successors, (151), 124 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:04,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:04,725 INFO L93 Difference]: Finished difference Result 125 states and 151 transitions. [2022-02-20 23:54:04,725 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 151 transitions. [2022-02-20 23:54:04,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:04,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:04,725 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 104 states have (on average 1.4519230769230769) internal successors, (151), 124 states have internal predecessors, (151), 0 states have call successors, (0), 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 125 states. [2022-02-20 23:54:04,725 INFO L87 Difference]: Start difference. First operand has 125 states, 104 states have (on average 1.4519230769230769) internal successors, (151), 124 states have internal predecessors, (151), 0 states have call successors, (0), 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 125 states. [2022-02-20 23:54:04,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:04,727 INFO L93 Difference]: Finished difference Result 125 states and 151 transitions. [2022-02-20 23:54:04,727 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 151 transitions. [2022-02-20 23:54:04,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:04,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:04,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:04,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:04,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 104 states have (on average 1.4519230769230769) internal successors, (151), 124 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:04,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 151 transitions. [2022-02-20 23:54:04,729 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 151 transitions. Word has length 21 [2022-02-20 23:54:04,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:04,729 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 151 transitions. [2022-02-20 23:54:04,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:04,729 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 151 transitions. [2022-02-20 23:54:04,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 23:54:04,730 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:04,730 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:04,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-20 23:54:04,730 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2022-02-20 23:54:04,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:04,731 INFO L85 PathProgramCache]: Analyzing trace with hash 2137291894, now seen corresponding path program 1 times [2022-02-20 23:54:04,731 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:04,731 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023919235] [2022-02-20 23:54:04,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:04,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:04,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:04,795 INFO L290 TraceCheckUtils]: 0: Hoare triple {8879#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {8881#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:54:04,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {8881#(= (select |#valid| 0) 0)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;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; {8881#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:54:04,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {8881#(= (select |#valid| 0) 0)} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L998 {8881#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:54:04,796 INFO L290 TraceCheckUtils]: 3: Hoare triple {8881#(= (select |#valid| 0) 0)} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-1 {8881#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:54:04,796 INFO L290 TraceCheckUtils]: 4: Hoare triple {8881#(= (select |#valid| 0) 0)} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L999 {8881#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:54:04,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {8881#(= (select |#valid| 0) 0)} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~state~0#1 := 1; {8881#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:54:04,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {8881#(= (select |#valid| 0) 0)} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {8881#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:54:04,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {8881#(= (select |#valid| 0) 0)} assume !!(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {8882#(and (= (select |#valid| 0) 0) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| 0)))} is VALID [2022-02-20 23:54:04,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {8882#(and (= (select |#valid| 0) 0) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| 0)))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1009 {8881#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:54:04,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {8881#(= (select |#valid| 0) 0)} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {8881#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:54:04,803 INFO L290 TraceCheckUtils]: 10: Hoare triple {8881#(= (select |#valid| 0) 0)} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1010 {8881#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:54:04,803 INFO L290 TraceCheckUtils]: 11: Hoare triple {8881#(= (select |#valid| 0) 0)} SUMMARY for 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); srcloc: L1010-1 {8881#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:54:04,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {8881#(= (select |#valid| 0) 0)} havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {8881#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:54:04,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {8881#(= (select |#valid| 0) 0)} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1011 {8881#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:54:04,809 INFO L290 TraceCheckUtils]: 14: Hoare triple {8881#(= (select |#valid| 0) 0)} 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; {8883#(or (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 0) (not (= |ULTIMATE.start_main_~x~0#1.base| 0)))} is VALID [2022-02-20 23:54:04,809 INFO L290 TraceCheckUtils]: 15: Hoare triple {8883#(or (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 0) (not (= |ULTIMATE.start_main_~x~0#1.base| 0)))} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1012 {8884#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} is VALID [2022-02-20 23:54:04,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {8884#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {8884#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} is VALID [2022-02-20 23:54:04,810 INFO L290 TraceCheckUtils]: 17: Hoare triple {8884#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} assume !(0 != main_#t~nondet6#1);havoc main_#t~nondet6#1; {8884#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} is VALID [2022-02-20 23:54:04,811 INFO L290 TraceCheckUtils]: 18: Hoare triple {8884#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1014-1 {8884#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} is VALID [2022-02-20 23:54:04,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {8884#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} assume !(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {8880#false} is VALID [2022-02-20 23:54:04,812 INFO L290 TraceCheckUtils]: 20: Hoare triple {8880#false} assume !false; {8880#false} is VALID [2022-02-20 23:54:04,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:04,812 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:04,813 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023919235] [2022-02-20 23:54:04,813 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023919235] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:04,813 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:04,813 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:54:04,813 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188997414] [2022-02-20 23:54:04,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:04,814 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 23:54:04,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:04,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:04,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:04,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:54:04,827 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:04,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:54:04,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:54:04,828 INFO L87 Difference]: Start difference. First operand 125 states and 151 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:05,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:05,054 INFO L93 Difference]: Finished difference Result 124 states and 150 transitions. [2022-02-20 23:54:05,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:54:05,055 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 23:54:05,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:05,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:05,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2022-02-20 23:54:05,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:05,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2022-02-20 23:54:05,056 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 89 transitions. [2022-02-20 23:54:05,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:05,128 INFO L225 Difference]: With dead ends: 124 [2022-02-20 23:54:05,128 INFO L226 Difference]: Without dead ends: 124 [2022-02-20 23:54:05,128 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:54:05,128 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 190 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:05,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 99 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:54:05,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-02-20 23:54:05,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2022-02-20 23:54:05,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:05,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 123 states, 103 states have (on average 1.4466019417475728) internal successors, (149), 122 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:05,130 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 123 states, 103 states have (on average 1.4466019417475728) internal successors, (149), 122 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:05,131 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 123 states, 103 states have (on average 1.4466019417475728) internal successors, (149), 122 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:05,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:05,132 INFO L93 Difference]: Finished difference Result 124 states and 150 transitions. [2022-02-20 23:54:05,132 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 150 transitions. [2022-02-20 23:54:05,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:05,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:05,133 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 103 states have (on average 1.4466019417475728) internal successors, (149), 122 states have internal predecessors, (149), 0 states have call successors, (0), 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 124 states. [2022-02-20 23:54:05,134 INFO L87 Difference]: Start difference. First operand has 123 states, 103 states have (on average 1.4466019417475728) internal successors, (149), 122 states have internal predecessors, (149), 0 states have call successors, (0), 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 124 states. [2022-02-20 23:54:05,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:05,136 INFO L93 Difference]: Finished difference Result 124 states and 150 transitions. [2022-02-20 23:54:05,136 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 150 transitions. [2022-02-20 23:54:05,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:05,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:05,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:05,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:05,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 103 states have (on average 1.4466019417475728) internal successors, (149), 122 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:05,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 149 transitions. [2022-02-20 23:54:05,141 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 149 transitions. Word has length 21 [2022-02-20 23:54:05,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:05,141 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 149 transitions. [2022-02-20 23:54:05,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:05,142 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 149 transitions. [2022-02-20 23:54:05,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:54:05,143 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:05,144 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:05,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-20 23:54:05,144 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2022-02-20 23:54:05,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:05,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1062832435, now seen corresponding path program 1 times [2022-02-20 23:54:05,145 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:05,145 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236677659] [2022-02-20 23:54:05,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:05,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:05,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:05,188 INFO L290 TraceCheckUtils]: 0: Hoare triple {9386#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {9386#true} is VALID [2022-02-20 23:54:05,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {9386#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;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; {9386#true} is VALID [2022-02-20 23:54:05,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {9386#true} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L998 {9386#true} is VALID [2022-02-20 23:54:05,190 INFO L290 TraceCheckUtils]: 3: Hoare triple {9386#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-1 {9386#true} is VALID [2022-02-20 23:54:05,190 INFO L290 TraceCheckUtils]: 4: Hoare triple {9386#true} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L999 {9386#true} is VALID [2022-02-20 23:54:05,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {9386#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~state~0#1 := 1; {9386#true} is VALID [2022-02-20 23:54:05,191 INFO L290 TraceCheckUtils]: 6: Hoare triple {9386#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {9386#true} is VALID [2022-02-20 23:54:05,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {9386#true} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {9386#true} is VALID [2022-02-20 23:54:05,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {9386#true} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1006-3 {9386#true} is VALID [2022-02-20 23:54:05,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {9386#true} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1028 {9386#true} is VALID [2022-02-20 23:54:05,191 INFO L290 TraceCheckUtils]: 10: Hoare triple {9386#true} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {9386#true} is VALID [2022-02-20 23:54:05,191 INFO L290 TraceCheckUtils]: 11: Hoare triple {9386#true} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {9386#true} is VALID [2022-02-20 23:54:05,191 INFO L290 TraceCheckUtils]: 12: Hoare triple {9386#true} goto; {9386#true} is VALID [2022-02-20 23:54:05,192 INFO L290 TraceCheckUtils]: 13: Hoare triple {9386#true} SUMMARY for call main_#t~mem8#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1033-2 {9386#true} is VALID [2022-02-20 23:54:05,192 INFO L290 TraceCheckUtils]: 14: Hoare triple {9386#true} assume !!(0 != main_#t~mem8#1);havoc main_#t~mem8#1; {9386#true} is VALID [2022-02-20 23:54:05,192 INFO L290 TraceCheckUtils]: 15: Hoare triple {9386#true} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1035-13 {9388#(= |ULTIMATE.start_main_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} is VALID [2022-02-20 23:54:05,193 INFO L290 TraceCheckUtils]: 16: Hoare triple {9388#(= |ULTIMATE.start_main_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} SUMMARY for call main_#t~mem10#1 := read~int(main_#t~mem9#1.base, 8 + main_#t~mem9#1.offset, 4); srcloc: L1035-1 {9389#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:54:05,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {9389#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} main_#t~short14#1 := 0 == main_#t~mem10#1; {9389#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:54:05,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {9389#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} assume !main_#t~short14#1; {9389#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:54:05,193 INFO L290 TraceCheckUtils]: 19: Hoare triple {9389#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} SUMMARY for call main_#t~mem12#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1035-5 {9389#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:54:05,194 INFO L290 TraceCheckUtils]: 20: Hoare triple {9389#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1035-6 {9390#(= (select |#valid| |ULTIMATE.start_main_#t~mem11#1.base|) 1)} is VALID [2022-02-20 23:54:05,194 INFO L290 TraceCheckUtils]: 21: Hoare triple {9390#(= (select |#valid| |ULTIMATE.start_main_#t~mem11#1.base|) 1)} assume !(1 == #valid[main_#t~mem11#1.base]); {9387#false} is VALID [2022-02-20 23:54:05,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:05,196 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:05,196 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236677659] [2022-02-20 23:54:05,196 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236677659] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:05,196 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:05,196 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:54:05,196 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258605521] [2022-02-20 23:54:05,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:05,198 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-02-20 23:54:05,198 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:05,198 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:05,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:05,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:54:05,210 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:05,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:54:05,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:54:05,211 INFO L87 Difference]: Start difference. First operand 123 states and 149 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:05,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:05,430 INFO L93 Difference]: Finished difference Result 122 states and 146 transitions. [2022-02-20 23:54:05,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:54:05,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-02-20 23:54:05,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:05,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:05,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2022-02-20 23:54:05,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:05,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2022-02-20 23:54:05,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 84 transitions. [2022-02-20 23:54:05,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:05,490 INFO L225 Difference]: With dead ends: 122 [2022-02-20 23:54:05,490 INFO L226 Difference]: Without dead ends: 122 [2022-02-20 23:54:05,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:54:05,490 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 29 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:05,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 164 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:54:05,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-02-20 23:54:05,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-02-20 23:54:05,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:05,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand has 122 states, 103 states have (on average 1.4174757281553398) internal successors, (146), 121 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:05,492 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand has 122 states, 103 states have (on average 1.4174757281553398) internal successors, (146), 121 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:05,492 INFO L87 Difference]: Start difference. First operand 122 states. Second operand has 122 states, 103 states have (on average 1.4174757281553398) internal successors, (146), 121 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:05,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:05,494 INFO L93 Difference]: Finished difference Result 122 states and 146 transitions. [2022-02-20 23:54:05,494 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 146 transitions. [2022-02-20 23:54:05,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:05,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:05,494 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 103 states have (on average 1.4174757281553398) internal successors, (146), 121 states have internal predecessors, (146), 0 states have call successors, (0), 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 122 states. [2022-02-20 23:54:05,499 INFO L87 Difference]: Start difference. First operand has 122 states, 103 states have (on average 1.4174757281553398) internal successors, (146), 121 states have internal predecessors, (146), 0 states have call successors, (0), 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 122 states. [2022-02-20 23:54:05,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:05,500 INFO L93 Difference]: Finished difference Result 122 states and 146 transitions. [2022-02-20 23:54:05,500 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 146 transitions. [2022-02-20 23:54:05,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:05,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:05,501 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:05,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:05,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.4174757281553398) internal successors, (146), 121 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:05,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 146 transitions. [2022-02-20 23:54:05,502 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 146 transitions. Word has length 22 [2022-02-20 23:54:05,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:05,502 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 146 transitions. [2022-02-20 23:54:05,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:05,502 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 146 transitions. [2022-02-20 23:54:05,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:54:05,502 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:05,502 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:05,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-20 23:54:05,503 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2022-02-20 23:54:05,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:05,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1062832434, now seen corresponding path program 1 times [2022-02-20 23:54:05,503 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:05,503 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926728449] [2022-02-20 23:54:05,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:05,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:05,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:05,682 INFO L290 TraceCheckUtils]: 0: Hoare triple {9885#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {9885#true} is VALID [2022-02-20 23:54:05,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {9885#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;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; {9887#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:54:05,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {9887#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L998 {9888#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:05,685 INFO L290 TraceCheckUtils]: 3: Hoare triple {9888#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-1 {9888#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:05,687 INFO L290 TraceCheckUtils]: 4: Hoare triple {9888#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L999 {9888#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:05,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {9888#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (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;main_~state~0#1 := 1; {9889#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:54:05,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {9889#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {9889#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:54:05,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {9889#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {9889#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:54:05,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {9889#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|))} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1006-3 {9888#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:05,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {9888#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1028 {9890#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem7#1.base|) |ULTIMATE.start_main_#t~mem7#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem7#1.base|) |ULTIMATE.start_main_#t~mem7#1.offset|)) 12))} is VALID [2022-02-20 23:54:05,690 INFO L290 TraceCheckUtils]: 10: Hoare triple {9890#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem7#1.base|) |ULTIMATE.start_main_#t~mem7#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem7#1.base|) |ULTIMATE.start_main_#t~mem7#1.offset|)) 12))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {9891#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:54:05,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {9891#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (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); {9891#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:54:05,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {9891#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} goto; {9891#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:54:05,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {9891#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} SUMMARY for call main_#t~mem8#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1033-2 {9891#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:54:05,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {9891#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} assume !!(0 != main_#t~mem8#1);havoc main_#t~mem8#1; {9891#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:54:05,693 INFO L290 TraceCheckUtils]: 15: Hoare triple {9891#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1035-13 {9892#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem9#1.offset|) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= |ULTIMATE.start_main_#t~mem9#1.offset| 0))} is VALID [2022-02-20 23:54:05,693 INFO L290 TraceCheckUtils]: 16: Hoare triple {9892#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem9#1.offset|) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= |ULTIMATE.start_main_#t~mem9#1.offset| 0))} SUMMARY for call main_#t~mem10#1 := read~int(main_#t~mem9#1.base, 8 + main_#t~mem9#1.offset, 4); srcloc: L1035-1 {9891#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:54:05,694 INFO L290 TraceCheckUtils]: 17: Hoare triple {9891#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} main_#t~short14#1 := 0 == main_#t~mem10#1; {9891#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:54:05,694 INFO L290 TraceCheckUtils]: 18: Hoare triple {9891#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (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; {9891#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:54:05,694 INFO L290 TraceCheckUtils]: 19: Hoare triple {9891#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} SUMMARY for call main_#t~mem12#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1035-5 {9891#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:54:05,695 INFO L290 TraceCheckUtils]: 20: Hoare triple {9891#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1035-6 {9893#(and (<= |ULTIMATE.start_main_#t~mem11#1.offset| 0) (= (+ (- 12) (select |#length| |ULTIMATE.start_main_#t~mem11#1.base|)) 0) (<= 0 |ULTIMATE.start_main_#t~mem11#1.offset|))} is VALID [2022-02-20 23:54:05,695 INFO L290 TraceCheckUtils]: 21: Hoare triple {9893#(and (<= |ULTIMATE.start_main_#t~mem11#1.offset| 0) (= (+ (- 12) (select |#length| |ULTIMATE.start_main_#t~mem11#1.base|)) 0) (<= 0 |ULTIMATE.start_main_#t~mem11#1.offset|))} assume !(4 + (8 + main_#t~mem11#1.offset) <= #length[main_#t~mem11#1.base] && 0 <= 8 + main_#t~mem11#1.offset); {9886#false} is VALID [2022-02-20 23:54:05,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:05,696 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:05,696 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926728449] [2022-02-20 23:54:05,696 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926728449] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:05,696 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:05,696 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:54:05,696 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195189707] [2022-02-20 23:54:05,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:05,697 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-02-20 23:54:05,697 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:05,697 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:05,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:05,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:54:05,715 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:05,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:54:05,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:54:05,716 INFO L87 Difference]: Start difference. First operand 122 states and 146 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:06,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:06,325 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2022-02-20 23:54:06,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:54:06,326 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-02-20 23:54:06,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:06,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:06,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 160 transitions. [2022-02-20 23:54:06,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:06,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 160 transitions. [2022-02-20 23:54:06,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 160 transitions. [2022-02-20 23:54:06,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:06,440 INFO L225 Difference]: With dead ends: 153 [2022-02-20 23:54:06,440 INFO L226 Difference]: Without dead ends: 153 [2022-02-20 23:54:06,440 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:54:06,441 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 163 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:06,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 259 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:54:06,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-02-20 23:54:06,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 122. [2022-02-20 23:54:06,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:06,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand has 122 states, 103 states have (on average 1.4077669902912622) internal successors, (145), 121 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:06,445 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand has 122 states, 103 states have (on average 1.4077669902912622) internal successors, (145), 121 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:06,445 INFO L87 Difference]: Start difference. First operand 153 states. Second operand has 122 states, 103 states have (on average 1.4077669902912622) internal successors, (145), 121 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:06,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:06,447 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2022-02-20 23:54:06,447 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 164 transitions. [2022-02-20 23:54:06,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:06,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:06,447 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 103 states have (on average 1.4077669902912622) internal successors, (145), 121 states have internal predecessors, (145), 0 states have call successors, (0), 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 153 states. [2022-02-20 23:54:06,448 INFO L87 Difference]: Start difference. First operand has 122 states, 103 states have (on average 1.4077669902912622) internal successors, (145), 121 states have internal predecessors, (145), 0 states have call successors, (0), 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 153 states. [2022-02-20 23:54:06,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:06,449 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2022-02-20 23:54:06,449 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 164 transitions. [2022-02-20 23:54:06,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:06,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:06,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:06,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:06,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.4077669902912622) internal successors, (145), 121 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:06,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 145 transitions. [2022-02-20 23:54:06,451 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 145 transitions. Word has length 22 [2022-02-20 23:54:06,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:06,451 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 145 transitions. [2022-02-20 23:54:06,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:06,451 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2022-02-20 23:54:06,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:54:06,451 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:06,452 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:06,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-20 23:54:06,452 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2022-02-20 23:54:06,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:06,452 INFO L85 PathProgramCache]: Analyzing trace with hash 227835007, now seen corresponding path program 1 times [2022-02-20 23:54:06,452 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:06,452 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430512401] [2022-02-20 23:54:06,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:06,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:06,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {10489#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {10489#true} is VALID [2022-02-20 23:54:06,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {10489#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;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; {10491#(= |ULTIMATE.start_main_~head~0#1.offset| 0)} is VALID [2022-02-20 23:54:06,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {10491#(= |ULTIMATE.start_main_~head~0#1.offset| 0)} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L998 {10492#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:06,603 INFO L290 TraceCheckUtils]: 3: Hoare triple {10492#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-1 {10492#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:06,604 INFO L290 TraceCheckUtils]: 4: Hoare triple {10492#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L999 {10492#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:06,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {10492#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (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;main_~state~0#1 := 1; {10493#(and (= |ULTIMATE.start_main_~state~0#1| 1) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (= (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) (+ |ULTIMATE.start_main_~head~0#1.offset| 8)))} is VALID [2022-02-20 23:54:06,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {10493#(and (= |ULTIMATE.start_main_~state~0#1| 1) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (= (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) (+ |ULTIMATE.start_main_~head~0#1.offset| 8)))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {10493#(and (= |ULTIMATE.start_main_~state~0#1| 1) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (= (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) (+ |ULTIMATE.start_main_~head~0#1.offset| 8)))} is VALID [2022-02-20 23:54:06,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {10493#(and (= |ULTIMATE.start_main_~state~0#1| 1) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (= (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) (+ |ULTIMATE.start_main_~head~0#1.offset| 8)))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {10493#(and (= |ULTIMATE.start_main_~state~0#1| 1) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (= (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) (+ |ULTIMATE.start_main_~head~0#1.offset| 8)))} is VALID [2022-02-20 23:54:06,606 INFO L290 TraceCheckUtils]: 8: Hoare triple {10493#(and (= |ULTIMATE.start_main_~state~0#1| 1) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (= (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) (+ |ULTIMATE.start_main_~head~0#1.offset| 8)))} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1006-3 {10494#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (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) (= (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 23:54:06,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {10494#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (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) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1028 {10495#(and (= (select (select |#memory_int| |ULTIMATE.start_main_#t~mem7#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 8)) 1) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_#t~mem7#1.offset| 0))} is VALID [2022-02-20 23:54:06,607 INFO L290 TraceCheckUtils]: 10: Hoare triple {10495#(and (= (select (select |#memory_int| |ULTIMATE.start_main_#t~mem7#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 8)) 1) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_#t~mem7#1.offset| 0))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {10496#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) 1) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) (+ |ULTIMATE.start_main_~head~0#1.offset| 8)))} is VALID [2022-02-20 23:54:06,608 INFO L290 TraceCheckUtils]: 11: Hoare triple {10496#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) 1) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) (+ |ULTIMATE.start_main_~head~0#1.offset| 8)))} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {10496#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) 1) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) (+ |ULTIMATE.start_main_~head~0#1.offset| 8)))} is VALID [2022-02-20 23:54:06,608 INFO L290 TraceCheckUtils]: 12: Hoare triple {10496#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) 1) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) (+ |ULTIMATE.start_main_~head~0#1.offset| 8)))} goto; {10496#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) 1) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) (+ |ULTIMATE.start_main_~head~0#1.offset| 8)))} is VALID [2022-02-20 23:54:06,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {10496#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) 1) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) (+ |ULTIMATE.start_main_~head~0#1.offset| 8)))} SUMMARY for call main_#t~mem8#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1033-2 {10497#(and (= |ULTIMATE.start_main_#t~mem8#1| 1) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:54:06,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {10497#(and (= |ULTIMATE.start_main_#t~mem8#1| 1) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} assume !(0 != main_#t~mem8#1);havoc main_#t~mem8#1; {10490#false} is VALID [2022-02-20 23:54:06,609 INFO L290 TraceCheckUtils]: 15: Hoare triple {10490#false} SUMMARY for call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1033-3 {10490#false} is VALID [2022-02-20 23:54:06,609 INFO L290 TraceCheckUtils]: 16: Hoare triple {10490#false} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset; {10490#false} is VALID [2022-02-20 23:54:06,609 INFO L290 TraceCheckUtils]: 17: Hoare triple {10490#false} SUMMARY for call main_#t~mem17#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1041-3 {10490#false} is VALID [2022-02-20 23:54:06,609 INFO L290 TraceCheckUtils]: 18: Hoare triple {10490#false} assume !(0 != main_#t~mem17#1);havoc main_#t~mem17#1; {10490#false} is VALID [2022-02-20 23:54:06,609 INFO L290 TraceCheckUtils]: 19: Hoare triple {10490#false} assume 0 == main_~x~0#1.offset; {10490#false} is VALID [2022-02-20 23:54:06,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {10490#false} assume main_~x~0#1.base < #StackHeapBarrier; {10490#false} is VALID [2022-02-20 23:54:06,609 INFO L290 TraceCheckUtils]: 21: Hoare triple {10490#false} assume 0 == main_~x~0#1.base || 1 == #valid[main_~x~0#1.base];call ULTIMATE.dealloc(main_~x~0#1.base, main_~x~0#1.offset);main_#res#1 := 0; {10490#false} is VALID [2022-02-20 23:54:06,609 INFO L290 TraceCheckUtils]: 22: Hoare triple {10490#false} assume !(#valid == main_old_#valid#1); {10490#false} is VALID [2022-02-20 23:54:06,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:06,610 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:06,610 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430512401] [2022-02-20 23:54:06,610 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430512401] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:06,610 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:06,610 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:54:06,610 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561095344] [2022-02-20 23:54:06,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:06,610 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-20 23:54:06,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:06,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:06,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:06,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:54:06,635 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:06,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:54:06,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:54:06,636 INFO L87 Difference]: Start difference. First operand 122 states and 145 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:07,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:07,214 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2022-02-20 23:54:07,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:54:07,214 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-20 23:54:07,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:07,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:07,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 145 transitions. [2022-02-20 23:54:07,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:07,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 145 transitions. [2022-02-20 23:54:07,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 145 transitions. [2022-02-20 23:54:07,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:07,322 INFO L225 Difference]: With dead ends: 140 [2022-02-20 23:54:07,322 INFO L226 Difference]: Without dead ends: 140 [2022-02-20 23:54:07,322 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:54:07,322 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 199 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:07,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 347 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:54:07,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-02-20 23:54:07,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 122. [2022-02-20 23:54:07,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:07,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand has 122 states, 103 states have (on average 1.3980582524271845) internal successors, (144), 121 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:07,324 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand has 122 states, 103 states have (on average 1.3980582524271845) internal successors, (144), 121 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:07,324 INFO L87 Difference]: Start difference. First operand 140 states. Second operand has 122 states, 103 states have (on average 1.3980582524271845) internal successors, (144), 121 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:07,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:07,326 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2022-02-20 23:54:07,326 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 150 transitions. [2022-02-20 23:54:07,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:07,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:07,326 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 103 states have (on average 1.3980582524271845) internal successors, (144), 121 states have internal predecessors, (144), 0 states have call successors, (0), 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 140 states. [2022-02-20 23:54:07,326 INFO L87 Difference]: Start difference. First operand has 122 states, 103 states have (on average 1.3980582524271845) internal successors, (144), 121 states have internal predecessors, (144), 0 states have call successors, (0), 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 140 states. [2022-02-20 23:54:07,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:07,327 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2022-02-20 23:54:07,327 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 150 transitions. [2022-02-20 23:54:07,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:07,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:07,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:07,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:07,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.3980582524271845) internal successors, (144), 121 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:07,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 144 transitions. [2022-02-20 23:54:07,329 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 144 transitions. Word has length 23 [2022-02-20 23:54:07,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:07,329 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 144 transitions. [2022-02-20 23:54:07,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:07,329 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 144 transitions. [2022-02-20 23:54:07,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 23:54:07,329 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:07,329 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:07,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-20 23:54:07,329 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2022-02-20 23:54:07,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:07,330 INFO L85 PathProgramCache]: Analyzing trace with hash 779247630, now seen corresponding path program 1 times [2022-02-20 23:54:07,330 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:07,330 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433694992] [2022-02-20 23:54:07,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:07,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:07,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {11052#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {11052#true} is VALID [2022-02-20 23:54:07,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {11052#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;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; {11052#true} is VALID [2022-02-20 23:54:07,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {11052#true} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L998 {11052#true} is VALID [2022-02-20 23:54:07,374 INFO L290 TraceCheckUtils]: 3: Hoare triple {11052#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-1 {11052#true} is VALID [2022-02-20 23:54:07,374 INFO L290 TraceCheckUtils]: 4: Hoare triple {11052#true} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L999 {11052#true} is VALID [2022-02-20 23:54:07,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {11052#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~state~0#1 := 1; {11052#true} is VALID [2022-02-20 23:54:07,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {11052#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {11052#true} is VALID [2022-02-20 23:54:07,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {11052#true} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {11052#true} is VALID [2022-02-20 23:54:07,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {11052#true} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1006-3 {11052#true} is VALID [2022-02-20 23:54:07,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {11052#true} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1028 {11052#true} is VALID [2022-02-20 23:54:07,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {11052#true} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {11052#true} is VALID [2022-02-20 23:54:07,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {11052#true} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {11052#true} is VALID [2022-02-20 23:54:07,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {11052#true} goto; {11052#true} is VALID [2022-02-20 23:54:07,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {11052#true} SUMMARY for call main_#t~mem8#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1033-2 {11052#true} is VALID [2022-02-20 23:54:07,375 INFO L290 TraceCheckUtils]: 14: Hoare triple {11052#true} assume !!(0 != main_#t~mem8#1);havoc main_#t~mem8#1; {11052#true} is VALID [2022-02-20 23:54:07,375 INFO L290 TraceCheckUtils]: 15: Hoare triple {11052#true} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1035-13 {11054#(= |ULTIMATE.start_main_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} is VALID [2022-02-20 23:54:07,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {11054#(= |ULTIMATE.start_main_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} SUMMARY for call main_#t~mem10#1 := read~int(main_#t~mem9#1.base, 8 + main_#t~mem9#1.offset, 4); srcloc: L1035-1 {11055#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:54:07,376 INFO L290 TraceCheckUtils]: 17: Hoare triple {11055#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} main_#t~short14#1 := 0 == main_#t~mem10#1; {11055#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:54:07,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {11055#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} assume main_#t~short14#1; {11055#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:54:07,377 INFO L290 TraceCheckUtils]: 19: Hoare triple {11055#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} assume !!main_#t~short14#1;havoc main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem10#1;havoc main_#t~mem12#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem13#1;havoc main_#t~short14#1; {11055#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:54:07,377 INFO L290 TraceCheckUtils]: 20: Hoare triple {11055#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} goto; {11055#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:54:07,377 INFO L290 TraceCheckUtils]: 21: Hoare triple {11055#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1035-14 {11056#(= (select |#valid| |ULTIMATE.start_main_#t~mem15#1.base|) 1)} is VALID [2022-02-20 23:54:07,378 INFO L290 TraceCheckUtils]: 22: Hoare triple {11056#(= (select |#valid| |ULTIMATE.start_main_#t~mem15#1.base|) 1)} 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; {11057#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:54:07,378 INFO L290 TraceCheckUtils]: 23: Hoare triple {11057#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !(1 == #valid[main_~x~0#1.base]); {11053#false} is VALID [2022-02-20 23:54:07,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:07,379 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:07,379 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433694992] [2022-02-20 23:54:07,379 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433694992] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:07,379 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:07,379 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:54:07,379 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156510559] [2022-02-20 23:54:07,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:07,380 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 23:54:07,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:07,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:07,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:07,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:54:07,393 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:07,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:54:07,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:54:07,394 INFO L87 Difference]: Start difference. First operand 122 states and 144 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:07,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:07,695 INFO L93 Difference]: Finished difference Result 125 states and 146 transitions. [2022-02-20 23:54:07,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:54:07,695 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 23:54:07,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:07,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:07,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2022-02-20 23:54:07,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:07,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2022-02-20 23:54:07,697 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 90 transitions. [2022-02-20 23:54:07,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:07,752 INFO L225 Difference]: With dead ends: 125 [2022-02-20 23:54:07,752 INFO L226 Difference]: Without dead ends: 125 [2022-02-20 23:54:07,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:54:07,753 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 76 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:07,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 159 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:54:07,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-02-20 23:54:07,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2022-02-20 23:54:07,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:07,755 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 123 states, 104 states have (on average 1.3942307692307692) internal successors, (145), 122 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:07,755 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 123 states, 104 states have (on average 1.3942307692307692) internal successors, (145), 122 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:07,755 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 123 states, 104 states have (on average 1.3942307692307692) internal successors, (145), 122 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:07,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:07,756 INFO L93 Difference]: Finished difference Result 125 states and 146 transitions. [2022-02-20 23:54:07,756 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 146 transitions. [2022-02-20 23:54:07,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:07,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:07,756 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 104 states have (on average 1.3942307692307692) internal successors, (145), 122 states have internal predecessors, (145), 0 states have call successors, (0), 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 125 states. [2022-02-20 23:54:07,757 INFO L87 Difference]: Start difference. First operand has 123 states, 104 states have (on average 1.3942307692307692) internal successors, (145), 122 states have internal predecessors, (145), 0 states have call successors, (0), 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 125 states. [2022-02-20 23:54:07,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:07,758 INFO L93 Difference]: Finished difference Result 125 states and 146 transitions. [2022-02-20 23:54:07,758 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 146 transitions. [2022-02-20 23:54:07,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:07,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:07,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:07,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:07,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 104 states have (on average 1.3942307692307692) internal successors, (145), 122 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:07,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 145 transitions. [2022-02-20 23:54:07,760 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 145 transitions. Word has length 24 [2022-02-20 23:54:07,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:07,760 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 145 transitions. [2022-02-20 23:54:07,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:07,760 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 145 transitions. [2022-02-20 23:54:07,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 23:54:07,761 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:07,761 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:07,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-20 23:54:07,761 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2022-02-20 23:54:07,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:07,762 INFO L85 PathProgramCache]: Analyzing trace with hash 779247631, now seen corresponding path program 1 times [2022-02-20 23:54:07,762 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:07,762 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886833732] [2022-02-20 23:54:07,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:07,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:07,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:07,935 INFO L290 TraceCheckUtils]: 0: Hoare triple {11566#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {11566#true} is VALID [2022-02-20 23:54:07,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {11566#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;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; {11568#(= |ULTIMATE.start_main_~head~0#1.offset| 0)} is VALID [2022-02-20 23:54:07,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {11568#(= |ULTIMATE.start_main_~head~0#1.offset| 0)} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L998 {11569#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:07,937 INFO L290 TraceCheckUtils]: 3: Hoare triple {11569#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-1 {11569#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:07,938 INFO L290 TraceCheckUtils]: 4: Hoare triple {11569#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L999 {11569#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:07,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {11569#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (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;main_~state~0#1 := 1; {11570#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:54:07,939 INFO L290 TraceCheckUtils]: 6: Hoare triple {11570#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {11570#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:54:07,939 INFO L290 TraceCheckUtils]: 7: Hoare triple {11570#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {11570#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:54:07,940 INFO L290 TraceCheckUtils]: 8: Hoare triple {11570#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|))} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1006-3 {11569#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:07,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {11569#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1028 {11571#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem7#1.base|) |ULTIMATE.start_main_#t~mem7#1.offset|) 0)} is VALID [2022-02-20 23:54:07,941 INFO L290 TraceCheckUtils]: 10: Hoare triple {11571#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem7#1.base|) |ULTIMATE.start_main_#t~mem7#1.offset|) 0)} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {11572#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)} is VALID [2022-02-20 23:54:07,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {11572#(= (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); {11572#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)} is VALID [2022-02-20 23:54:07,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {11572#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)} goto; {11572#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)} is VALID [2022-02-20 23:54:07,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {11572#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)} SUMMARY for call main_#t~mem8#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1033-2 {11572#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)} is VALID [2022-02-20 23:54:07,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {11572#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)} assume !!(0 != main_#t~mem8#1);havoc main_#t~mem8#1; {11572#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)} is VALID [2022-02-20 23:54:07,943 INFO L290 TraceCheckUtils]: 15: Hoare triple {11572#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1035-13 {11573#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem9#1.offset|) (= |ULTIMATE.start_main_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_#t~mem9#1.offset| 0))} is VALID [2022-02-20 23:54:07,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {11573#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem9#1.offset|) (= |ULTIMATE.start_main_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_#t~mem9#1.offset| 0))} SUMMARY for call main_#t~mem10#1 := read~int(main_#t~mem9#1.base, 8 + main_#t~mem9#1.offset, 4); srcloc: L1035-1 {11574#(and (<= 0 (select (select |#memory_$Pointer$.offset| |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|) 12) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 23:54:07,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {11574#(and (<= 0 (select (select |#memory_$Pointer$.offset| |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|) 12) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} main_#t~short14#1 := 0 == main_#t~mem10#1; {11574#(and (<= 0 (select (select |#memory_$Pointer$.offset| |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|) 12) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 23:54:07,944 INFO L290 TraceCheckUtils]: 18: Hoare triple {11574#(and (<= 0 (select (select |#memory_$Pointer$.offset| |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|) 12) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} assume main_#t~short14#1; {11574#(and (<= 0 (select (select |#memory_$Pointer$.offset| |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|) 12) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 23:54:07,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {11574#(and (<= 0 (select (select |#memory_$Pointer$.offset| |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|) 12) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} assume !!main_#t~short14#1;havoc main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem10#1;havoc main_#t~mem12#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem13#1;havoc main_#t~short14#1; {11574#(and (<= 0 (select (select |#memory_$Pointer$.offset| |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|) 12) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 23:54:07,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {11574#(and (<= 0 (select (select |#memory_$Pointer$.offset| |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|) 12) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} goto; {11574#(and (<= 0 (select (select |#memory_$Pointer$.offset| |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|) 12) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 23:54:07,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {11574#(and (<= 0 (select (select |#memory_$Pointer$.offset| |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|) 12) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1035-14 {11575#(and (<= (+ 12 |ULTIMATE.start_main_#t~mem15#1.offset|) (select |#length| |ULTIMATE.start_main_#t~mem15#1.base|)) (<= 0 |ULTIMATE.start_main_#t~mem15#1.offset|))} is VALID [2022-02-20 23:54:07,946 INFO L290 TraceCheckUtils]: 22: Hoare triple {11575#(and (<= (+ 12 |ULTIMATE.start_main_#t~mem15#1.offset|) (select |#length| |ULTIMATE.start_main_#t~mem15#1.base|)) (<= 0 |ULTIMATE.start_main_#t~mem15#1.offset|))} 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; {11576#(and (<= (+ 12 |ULTIMATE.start_main_~x~0#1.offset|) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (<= 0 |ULTIMATE.start_main_~x~0#1.offset|))} is VALID [2022-02-20 23:54:07,947 INFO L290 TraceCheckUtils]: 23: Hoare triple {11576#(and (<= (+ 12 |ULTIMATE.start_main_~x~0#1.offset|) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (<= 0 |ULTIMATE.start_main_~x~0#1.offset|))} assume !(4 + (8 + main_~x~0#1.offset) <= #length[main_~x~0#1.base] && 0 <= 8 + main_~x~0#1.offset); {11567#false} is VALID [2022-02-20 23:54:07,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:07,947 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:07,947 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886833732] [2022-02-20 23:54:07,947 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886833732] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:54:07,947 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396645364] [2022-02-20 23:54:07,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:07,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:54:07,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:54:07,952 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:54:07,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 23:54:08,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:08,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 23:54:08,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:08,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:54:08,289 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 23 treesize of output 15 [2022-02-20 23:54:08,320 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 28 treesize of output 16 [2022-02-20 23:54:08,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {11566#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {11566#true} is VALID [2022-02-20 23:54:08,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {11566#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;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; {11566#true} is VALID [2022-02-20 23:54:08,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {11566#true} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L998 {11566#true} is VALID [2022-02-20 23:54:08,362 INFO L290 TraceCheckUtils]: 3: Hoare triple {11566#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-1 {11566#true} is VALID [2022-02-20 23:54:08,364 INFO L290 TraceCheckUtils]: 4: Hoare triple {11566#true} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L999 {11566#true} is VALID [2022-02-20 23:54:08,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {11566#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~state~0#1 := 1; {11566#true} is VALID [2022-02-20 23:54:08,365 INFO L290 TraceCheckUtils]: 6: Hoare triple {11566#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {11566#true} is VALID [2022-02-20 23:54:08,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {11566#true} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {11566#true} is VALID [2022-02-20 23:54:08,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {11566#true} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1006-3 {11566#true} is VALID [2022-02-20 23:54:08,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {11566#true} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1028 {11566#true} is VALID [2022-02-20 23:54:08,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {11566#true} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {11566#true} is VALID [2022-02-20 23:54:08,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {11566#true} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {11566#true} is VALID [2022-02-20 23:54:08,365 INFO L290 TraceCheckUtils]: 12: Hoare triple {11566#true} goto; {11566#true} is VALID [2022-02-20 23:54:08,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {11566#true} SUMMARY for call main_#t~mem8#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1033-2 {11566#true} is VALID [2022-02-20 23:54:08,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {11566#true} assume !!(0 != main_#t~mem8#1);havoc main_#t~mem8#1; {11566#true} is VALID [2022-02-20 23:54:08,366 INFO L290 TraceCheckUtils]: 15: Hoare triple {11566#true} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1035-13 {11625#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem9#1.offset|) (= |ULTIMATE.start_main_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-20 23:54:08,367 INFO L290 TraceCheckUtils]: 16: Hoare triple {11625#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem9#1.offset|) (= |ULTIMATE.start_main_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} SUMMARY for call main_#t~mem10#1 := read~int(main_#t~mem9#1.base, 8 + main_#t~mem9#1.offset, 4); srcloc: L1035-1 {11629#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 8)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 12) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 23:54:08,367 INFO L290 TraceCheckUtils]: 17: Hoare triple {11629#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 8)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 12) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} main_#t~short14#1 := 0 == main_#t~mem10#1; {11629#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 8)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 12) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 23:54:08,368 INFO L290 TraceCheckUtils]: 18: Hoare triple {11629#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 8)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 12) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} assume main_#t~short14#1; {11629#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 8)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 12) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 23:54:08,368 INFO L290 TraceCheckUtils]: 19: Hoare triple {11629#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 8)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 12) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} assume !!main_#t~short14#1;havoc main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem10#1;havoc main_#t~mem12#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem13#1;havoc main_#t~short14#1; {11629#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 8)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 12) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 23:54:08,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {11629#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 8)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 12) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} goto; {11629#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 8)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 12) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 23:54:08,369 INFO L290 TraceCheckUtils]: 21: Hoare triple {11629#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 8)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 12) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1035-14 {11645#(and (<= (+ 12 |ULTIMATE.start_main_#t~mem15#1.offset|) (select |#length| |ULTIMATE.start_main_#t~mem15#1.base|)) (<= 0 (+ 8 |ULTIMATE.start_main_#t~mem15#1.offset|)))} is VALID [2022-02-20 23:54:08,370 INFO L290 TraceCheckUtils]: 22: Hoare triple {11645#(and (<= (+ 12 |ULTIMATE.start_main_#t~mem15#1.offset|) (select |#length| |ULTIMATE.start_main_#t~mem15#1.base|)) (<= 0 (+ 8 |ULTIMATE.start_main_#t~mem15#1.offset|)))} 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; {11649#(and (<= 0 (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) (<= (+ 12 |ULTIMATE.start_main_~x~0#1.offset|) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)))} is VALID [2022-02-20 23:54:08,370 INFO L290 TraceCheckUtils]: 23: Hoare triple {11649#(and (<= 0 (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) (<= (+ 12 |ULTIMATE.start_main_~x~0#1.offset|) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)))} assume !(4 + (8 + main_~x~0#1.offset) <= #length[main_~x~0#1.base] && 0 <= 8 + main_~x~0#1.offset); {11567#false} is VALID [2022-02-20 23:54:08,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:08,371 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:54:08,371 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396645364] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:08,371 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:54:08,371 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2022-02-20 23:54:08,372 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771127558] [2022-02-20 23:54:08,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:08,372 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 23:54:08,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:08,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:08,388 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:08,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:54:08,388 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:08,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:54:08,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:54:08,389 INFO L87 Difference]: Start difference. First operand 123 states and 145 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:08,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:08,777 INFO L93 Difference]: Finished difference Result 123 states and 142 transitions. [2022-02-20 23:54:08,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:54:08,777 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 23:54:08,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:08,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:08,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 88 transitions. [2022-02-20 23:54:08,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:08,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 88 transitions. [2022-02-20 23:54:08,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 88 transitions. [2022-02-20 23:54:08,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:08,839 INFO L225 Difference]: With dead ends: 123 [2022-02-20 23:54:08,839 INFO L226 Difference]: Without dead ends: 123 [2022-02-20 23:54:08,839 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2022-02-20 23:54:08,840 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 61 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:08,840 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 173 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:54:08,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-02-20 23:54:08,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2022-02-20 23:54:08,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:08,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand has 122 states, 104 states have (on average 1.3557692307692308) internal successors, (141), 121 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:08,842 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand has 122 states, 104 states have (on average 1.3557692307692308) internal successors, (141), 121 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:08,842 INFO L87 Difference]: Start difference. First operand 123 states. Second operand has 122 states, 104 states have (on average 1.3557692307692308) internal successors, (141), 121 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:08,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:08,843 INFO L93 Difference]: Finished difference Result 123 states and 142 transitions. [2022-02-20 23:54:08,843 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 142 transitions. [2022-02-20 23:54:08,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:08,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:08,844 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 104 states have (on average 1.3557692307692308) internal successors, (141), 121 states have internal predecessors, (141), 0 states have call successors, (0), 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 123 states. [2022-02-20 23:54:08,844 INFO L87 Difference]: Start difference. First operand has 122 states, 104 states have (on average 1.3557692307692308) internal successors, (141), 121 states have internal predecessors, (141), 0 states have call successors, (0), 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 123 states. [2022-02-20 23:54:08,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:08,845 INFO L93 Difference]: Finished difference Result 123 states and 142 transitions. [2022-02-20 23:54:08,845 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 142 transitions. [2022-02-20 23:54:08,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:08,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:08,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:08,846 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:08,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 104 states have (on average 1.3557692307692308) internal successors, (141), 121 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:08,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 141 transitions. [2022-02-20 23:54:08,847 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 141 transitions. Word has length 24 [2022-02-20 23:54:08,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:08,847 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 141 transitions. [2022-02-20 23:54:08,847 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:08,847 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 141 transitions. [2022-02-20 23:54:08,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:54:08,847 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:08,848 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:08,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 23:54:09,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-02-20 23:54:09,052 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2022-02-20 23:54:09,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:09,052 INFO L85 PathProgramCache]: Analyzing trace with hash -342052636, now seen corresponding path program 1 times [2022-02-20 23:54:09,052 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:09,052 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31508975] [2022-02-20 23:54:09,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:09,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:09,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:09,210 INFO L290 TraceCheckUtils]: 0: Hoare triple {12151#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {12151#true} is VALID [2022-02-20 23:54:09,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {12151#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;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; {12153#(= |ULTIMATE.start_main_~head~0#1.offset| 0)} is VALID [2022-02-20 23:54:09,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {12153#(= |ULTIMATE.start_main_~head~0#1.offset| 0)} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L998 {12154#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:09,212 INFO L290 TraceCheckUtils]: 3: Hoare triple {12154#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-1 {12154#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:09,213 INFO L290 TraceCheckUtils]: 4: Hoare triple {12154#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L999 {12154#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:09,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {12154#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (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;main_~state~0#1 := 1; {12155#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:54:09,214 INFO L290 TraceCheckUtils]: 6: Hoare triple {12155#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {12155#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:54:09,215 INFO L290 TraceCheckUtils]: 7: Hoare triple {12155#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {12155#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:54:09,215 INFO L290 TraceCheckUtils]: 8: Hoare triple {12155#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|))} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1006-3 {12154#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:09,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {12154#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1028 {12156#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem7#1.base|) |ULTIMATE.start_main_#t~mem7#1.offset|) 0) (= |ULTIMATE.start_main_#t~mem7#1.offset| 0) (= |ULTIMATE.start_main_#t~mem7#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem7#1.base|) |ULTIMATE.start_main_#t~mem7#1.offset|)))} is VALID [2022-02-20 23:54:09,216 INFO L290 TraceCheckUtils]: 10: Hoare triple {12156#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem7#1.base|) |ULTIMATE.start_main_#t~mem7#1.offset|) 0) (= |ULTIMATE.start_main_#t~mem7#1.offset| 0) (= |ULTIMATE.start_main_#t~mem7#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem7#1.base|) |ULTIMATE.start_main_#t~mem7#1.offset|)))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {12157#(and (= 8 (+ 8 |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) (= |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|)))} is VALID [2022-02-20 23:54:09,217 INFO L290 TraceCheckUtils]: 11: Hoare triple {12157#(and (= 8 (+ 8 |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) (= |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|)))} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {12157#(and (= 8 (+ 8 |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) (= |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|)))} is VALID [2022-02-20 23:54:09,217 INFO L290 TraceCheckUtils]: 12: Hoare triple {12157#(and (= 8 (+ 8 |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) (= |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|)))} goto; {12157#(and (= 8 (+ 8 |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) (= |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|)))} is VALID [2022-02-20 23:54:09,218 INFO L290 TraceCheckUtils]: 13: Hoare triple {12157#(and (= 8 (+ 8 |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) (= |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|)))} SUMMARY for call main_#t~mem8#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1033-2 {12157#(and (= 8 (+ 8 |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) (= |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|)))} is VALID [2022-02-20 23:54:09,218 INFO L290 TraceCheckUtils]: 14: Hoare triple {12157#(and (= 8 (+ 8 |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) (= |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|)))} assume !!(0 != main_#t~mem8#1);havoc main_#t~mem8#1; {12157#(and (= 8 (+ 8 |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) (= |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|)))} is VALID [2022-02-20 23:54:09,219 INFO L290 TraceCheckUtils]: 15: Hoare triple {12157#(and (= 8 (+ 8 |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) (= |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|)))} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1035-13 {12157#(and (= 8 (+ 8 |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) (= |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|)))} is VALID [2022-02-20 23:54:09,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {12157#(and (= 8 (+ 8 |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) (= |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|)))} SUMMARY for call main_#t~mem10#1 := read~int(main_#t~mem9#1.base, 8 + main_#t~mem9#1.offset, 4); srcloc: L1035-1 {12157#(and (= 8 (+ 8 |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) (= |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|)))} is VALID [2022-02-20 23:54:09,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {12157#(and (= 8 (+ 8 |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) (= |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|)))} main_#t~short14#1 := 0 == main_#t~mem10#1; {12157#(and (= 8 (+ 8 |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) (= |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|)))} is VALID [2022-02-20 23:54:09,220 INFO L290 TraceCheckUtils]: 18: Hoare triple {12157#(and (= 8 (+ 8 |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) (= |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|)))} assume !main_#t~short14#1; {12157#(and (= 8 (+ 8 |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) (= |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|)))} is VALID [2022-02-20 23:54:09,220 INFO L290 TraceCheckUtils]: 19: Hoare triple {12157#(and (= 8 (+ 8 |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) (= |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|)))} SUMMARY for call main_#t~mem12#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1035-5 {12158#(and (= 8 (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) |ULTIMATE.start_main_#t~mem12#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= |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|)))} is VALID [2022-02-20 23:54:09,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {12158#(and (= 8 (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) |ULTIMATE.start_main_#t~mem12#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= |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|)))} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1035-6 {12159#(= |ULTIMATE.start_main_#t~mem12#1| (select (select |#memory_int| |ULTIMATE.start_main_#t~mem11#1.base|) (+ |ULTIMATE.start_main_#t~mem11#1.offset| 8)))} is VALID [2022-02-20 23:54:09,221 INFO L290 TraceCheckUtils]: 21: Hoare triple {12159#(= |ULTIMATE.start_main_#t~mem12#1| (select (select |#memory_int| |ULTIMATE.start_main_#t~mem11#1.base|) (+ |ULTIMATE.start_main_#t~mem11#1.offset| 8)))} SUMMARY for call main_#t~mem13#1 := read~int(main_#t~mem11#1.base, 8 + main_#t~mem11#1.offset, 4); srcloc: L1035-7 {12160#(= (+ (* (- 1) |ULTIMATE.start_main_#t~mem13#1|) |ULTIMATE.start_main_#t~mem12#1|) 0)} is VALID [2022-02-20 23:54:09,222 INFO L290 TraceCheckUtils]: 22: Hoare triple {12160#(= (+ (* (- 1) |ULTIMATE.start_main_#t~mem13#1|) |ULTIMATE.start_main_#t~mem12#1|) 0)} main_#t~short14#1 := main_#t~mem12#1 <= main_#t~mem13#1; {12161#|ULTIMATE.start_main_#t~short14#1|} is VALID [2022-02-20 23:54:09,222 INFO L290 TraceCheckUtils]: 23: Hoare triple {12161#|ULTIMATE.start_main_#t~short14#1|} assume !main_#t~short14#1;havoc main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem10#1;havoc main_#t~mem12#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem13#1;havoc main_#t~short14#1; {12152#false} is VALID [2022-02-20 23:54:09,222 INFO L290 TraceCheckUtils]: 24: Hoare triple {12152#false} assume !false; {12152#false} is VALID [2022-02-20 23:54:09,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:09,223 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:09,223 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31508975] [2022-02-20 23:54:09,223 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31508975] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:09,223 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:09,224 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-20 23:54:09,224 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143451431] [2022-02-20 23:54:09,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:09,225 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 23:54:09,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:09,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:09,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:09,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 23:54:09,243 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:09,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 23:54:09,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:54:09,243 INFO L87 Difference]: Start difference. First operand 122 states and 141 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:09,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:09,934 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2022-02-20 23:54:09,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 23:54:09,935 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 23:54:09,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:09,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:09,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 142 transitions. [2022-02-20 23:54:09,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:09,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 142 transitions. [2022-02-20 23:54:09,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 142 transitions. [2022-02-20 23:54:10,041 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:10,043 INFO L225 Difference]: With dead ends: 135 [2022-02-20 23:54:10,043 INFO L226 Difference]: Without dead ends: 135 [2022-02-20 23:54:10,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2022-02-20 23:54:10,043 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 195 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:10,044 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 407 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:54:10,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-02-20 23:54:10,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 121. [2022-02-20 23:54:10,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:10,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 121 states, 103 states have (on average 1.3495145631067962) internal successors, (139), 120 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:10,045 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 121 states, 103 states have (on average 1.3495145631067962) internal successors, (139), 120 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:10,046 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 121 states, 103 states have (on average 1.3495145631067962) internal successors, (139), 120 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:10,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:10,047 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2022-02-20 23:54:10,047 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 145 transitions. [2022-02-20 23:54:10,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:10,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:10,047 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 103 states have (on average 1.3495145631067962) internal successors, (139), 120 states have internal predecessors, (139), 0 states have call successors, (0), 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 135 states. [2022-02-20 23:54:10,047 INFO L87 Difference]: Start difference. First operand has 121 states, 103 states have (on average 1.3495145631067962) internal successors, (139), 120 states have internal predecessors, (139), 0 states have call successors, (0), 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 135 states. [2022-02-20 23:54:10,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:10,049 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2022-02-20 23:54:10,049 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 145 transitions. [2022-02-20 23:54:10,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:10,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:10,049 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:10,049 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:10,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 103 states have (on average 1.3495145631067962) internal successors, (139), 120 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:10,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 139 transitions. [2022-02-20 23:54:10,050 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 139 transitions. Word has length 25 [2022-02-20 23:54:10,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:10,051 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 139 transitions. [2022-02-20 23:54:10,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:10,051 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 139 transitions. [2022-02-20 23:54:10,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:54:10,051 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:10,051 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:10,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-02-20 23:54:10,052 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2022-02-20 23:54:10,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:10,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1700492295, now seen corresponding path program 1 times [2022-02-20 23:54:10,052 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:10,052 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125827423] [2022-02-20 23:54:10,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:10,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:10,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:10,086 INFO L290 TraceCheckUtils]: 0: Hoare triple {12710#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {12710#true} is VALID [2022-02-20 23:54:10,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {12710#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;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; {12710#true} is VALID [2022-02-20 23:54:10,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {12710#true} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L998 {12710#true} is VALID [2022-02-20 23:54:10,087 INFO L290 TraceCheckUtils]: 3: Hoare triple {12710#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-1 {12710#true} is VALID [2022-02-20 23:54:10,087 INFO L290 TraceCheckUtils]: 4: Hoare triple {12710#true} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L999 {12710#true} is VALID [2022-02-20 23:54:10,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {12710#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~state~0#1 := 1; {12712#(= |ULTIMATE.start_main_~state~0#1| 1)} is VALID [2022-02-20 23:54:10,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {12712#(= |ULTIMATE.start_main_~state~0#1| 1)} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {12712#(= |ULTIMATE.start_main_~state~0#1| 1)} is VALID [2022-02-20 23:54:10,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {12712#(= |ULTIMATE.start_main_~state~0#1| 1)} assume !!(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {12712#(= |ULTIMATE.start_main_~state~0#1| 1)} is VALID [2022-02-20 23:54:10,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {12712#(= |ULTIMATE.start_main_~state~0#1| 1)} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1009 {12712#(= |ULTIMATE.start_main_~state~0#1| 1)} is VALID [2022-02-20 23:54:10,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {12712#(= |ULTIMATE.start_main_~state~0#1| 1)} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {12712#(= |ULTIMATE.start_main_~state~0#1| 1)} is VALID [2022-02-20 23:54:10,089 INFO L290 TraceCheckUtils]: 10: Hoare triple {12712#(= |ULTIMATE.start_main_~state~0#1| 1)} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1010 {12712#(= |ULTIMATE.start_main_~state~0#1| 1)} is VALID [2022-02-20 23:54:10,089 INFO L290 TraceCheckUtils]: 11: Hoare triple {12712#(= |ULTIMATE.start_main_~state~0#1| 1)} SUMMARY for 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); srcloc: L1010-1 {12712#(= |ULTIMATE.start_main_~state~0#1| 1)} is VALID [2022-02-20 23:54:10,089 INFO L290 TraceCheckUtils]: 12: Hoare triple {12712#(= |ULTIMATE.start_main_~state~0#1| 1)} havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {12712#(= |ULTIMATE.start_main_~state~0#1| 1)} is VALID [2022-02-20 23:54:10,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {12712#(= |ULTIMATE.start_main_~state~0#1| 1)} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1011 {12712#(= |ULTIMATE.start_main_~state~0#1| 1)} is VALID [2022-02-20 23:54:10,090 INFO L290 TraceCheckUtils]: 14: Hoare triple {12712#(= |ULTIMATE.start_main_~state~0#1| 1)} 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; {12712#(= |ULTIMATE.start_main_~state~0#1| 1)} is VALID [2022-02-20 23:54:10,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {12712#(= |ULTIMATE.start_main_~state~0#1| 1)} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1012 {12712#(= |ULTIMATE.start_main_~state~0#1| 1)} is VALID [2022-02-20 23:54:10,090 INFO L290 TraceCheckUtils]: 16: Hoare triple {12712#(= |ULTIMATE.start_main_~state~0#1| 1)} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {12712#(= |ULTIMATE.start_main_~state~0#1| 1)} is VALID [2022-02-20 23:54:10,091 INFO L290 TraceCheckUtils]: 17: Hoare triple {12712#(= |ULTIMATE.start_main_~state~0#1| 1)} assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1; {12712#(= |ULTIMATE.start_main_~state~0#1| 1)} is VALID [2022-02-20 23:54:10,091 INFO L290 TraceCheckUtils]: 18: Hoare triple {12712#(= |ULTIMATE.start_main_~state~0#1| 1)} assume !(1 == main_~state~0#1); {12711#false} is VALID [2022-02-20 23:54:10,091 INFO L290 TraceCheckUtils]: 19: Hoare triple {12711#false} assume !(2 == main_~state~0#1); {12711#false} is VALID [2022-02-20 23:54:10,091 INFO L290 TraceCheckUtils]: 20: Hoare triple {12711#false} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1006-3 {12711#false} is VALID [2022-02-20 23:54:10,091 INFO L290 TraceCheckUtils]: 21: Hoare triple {12711#false} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1028 {12711#false} is VALID [2022-02-20 23:54:10,091 INFO L290 TraceCheckUtils]: 22: Hoare triple {12711#false} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {12711#false} is VALID [2022-02-20 23:54:10,092 INFO L290 TraceCheckUtils]: 23: Hoare triple {12711#false} assume !(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {12711#false} is VALID [2022-02-20 23:54:10,092 INFO L290 TraceCheckUtils]: 24: Hoare triple {12711#false} assume !false; {12711#false} is VALID [2022-02-20 23:54:10,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:10,092 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:10,092 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125827423] [2022-02-20 23:54:10,092 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125827423] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:10,092 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:10,092 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:54:10,093 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920554798] [2022-02-20 23:54:10,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:10,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 23:54:10,093 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:10,093 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:10,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:10,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:54:10,109 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:10,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:54:10,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:54:10,109 INFO L87 Difference]: Start difference. First operand 121 states and 139 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:10,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:10,183 INFO L93 Difference]: Finished difference Result 191 states and 213 transitions. [2022-02-20 23:54:10,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:54:10,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 23:54:10,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:10,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:10,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2022-02-20 23:54:10,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:10,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2022-02-20 23:54:10,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 154 transitions. [2022-02-20 23:54:10,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:10,280 INFO L225 Difference]: With dead ends: 191 [2022-02-20 23:54:10,280 INFO L226 Difference]: Without dead ends: 191 [2022-02-20 23:54:10,280 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:54:10,280 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 59 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:10,280 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 151 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:54:10,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-02-20 23:54:10,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 137. [2022-02-20 23:54:10,283 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:10,283 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand has 137 states, 119 states have (on average 1.319327731092437) internal successors, (157), 136 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:10,283 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand has 137 states, 119 states have (on average 1.319327731092437) internal successors, (157), 136 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:10,283 INFO L87 Difference]: Start difference. First operand 191 states. Second operand has 137 states, 119 states have (on average 1.319327731092437) internal successors, (157), 136 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:10,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:10,285 INFO L93 Difference]: Finished difference Result 191 states and 213 transitions. [2022-02-20 23:54:10,285 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 213 transitions. [2022-02-20 23:54:10,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:10,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:10,285 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 119 states have (on average 1.319327731092437) internal successors, (157), 136 states have internal predecessors, (157), 0 states have call successors, (0), 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 191 states. [2022-02-20 23:54:10,286 INFO L87 Difference]: Start difference. First operand has 137 states, 119 states have (on average 1.319327731092437) internal successors, (157), 136 states have internal predecessors, (157), 0 states have call successors, (0), 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 191 states. [2022-02-20 23:54:10,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:10,288 INFO L93 Difference]: Finished difference Result 191 states and 213 transitions. [2022-02-20 23:54:10,288 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 213 transitions. [2022-02-20 23:54:10,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:10,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:10,289 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:10,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:10,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 119 states have (on average 1.319327731092437) internal successors, (157), 136 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:10,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 157 transitions. [2022-02-20 23:54:10,290 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 157 transitions. Word has length 25 [2022-02-20 23:54:10,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:10,290 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 157 transitions. [2022-02-20 23:54:10,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:10,291 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 157 transitions. [2022-02-20 23:54:10,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 23:54:10,291 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:10,291 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:10,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-02-20 23:54:10,291 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2022-02-20 23:54:10,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:10,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1532665747, now seen corresponding path program 1 times [2022-02-20 23:54:10,292 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:10,292 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967274572] [2022-02-20 23:54:10,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:10,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:10,432 INFO L290 TraceCheckUtils]: 0: Hoare triple {13425#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {13425#true} is VALID [2022-02-20 23:54:10,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {13425#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;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; {13427#(= |ULTIMATE.start_main_~head~0#1.offset| 0)} is VALID [2022-02-20 23:54:10,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {13427#(= |ULTIMATE.start_main_~head~0#1.offset| 0)} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L998 {13428#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:10,434 INFO L290 TraceCheckUtils]: 3: Hoare triple {13428#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-1 {13428#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:10,434 INFO L290 TraceCheckUtils]: 4: Hoare triple {13428#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L999 {13428#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:10,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {13428#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (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;main_~state~0#1 := 1; {13429#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:54:10,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {13429#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {13429#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:54:10,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {13429#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {13429#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:54:10,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {13429#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|))} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1006-3 {13428#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:10,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {13428#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1028 {13430#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem7#1.base|) |ULTIMATE.start_main_#t~mem7#1.offset|) 0)} is VALID [2022-02-20 23:54:10,438 INFO L290 TraceCheckUtils]: 10: Hoare triple {13430#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem7#1.base|) |ULTIMATE.start_main_#t~mem7#1.offset|) 0)} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {13431#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)} is VALID [2022-02-20 23:54:10,438 INFO L290 TraceCheckUtils]: 11: Hoare triple {13431#(= (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); {13431#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)} is VALID [2022-02-20 23:54:10,439 INFO L290 TraceCheckUtils]: 12: Hoare triple {13431#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)} goto; {13431#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)} is VALID [2022-02-20 23:54:10,439 INFO L290 TraceCheckUtils]: 13: Hoare triple {13431#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)} SUMMARY for call main_#t~mem8#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1033-2 {13431#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)} is VALID [2022-02-20 23:54:10,439 INFO L290 TraceCheckUtils]: 14: Hoare triple {13431#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)} assume !!(0 != main_#t~mem8#1);havoc main_#t~mem8#1; {13431#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)} is VALID [2022-02-20 23:54:10,440 INFO L290 TraceCheckUtils]: 15: Hoare triple {13431#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1035-13 {13432#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem9#1.offset|) (= |ULTIMATE.start_main_#t~mem9#1.offset| 0))} is VALID [2022-02-20 23:54:10,440 INFO L290 TraceCheckUtils]: 16: Hoare triple {13432#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem9#1.offset|) (= |ULTIMATE.start_main_#t~mem9#1.offset| 0))} SUMMARY for call main_#t~mem10#1 := read~int(main_#t~mem9#1.base, 8 + main_#t~mem9#1.offset, 4); srcloc: L1035-1 {13433#(<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} is VALID [2022-02-20 23:54:10,441 INFO L290 TraceCheckUtils]: 17: Hoare triple {13433#(<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} main_#t~short14#1 := 0 == main_#t~mem10#1; {13433#(<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} is VALID [2022-02-20 23:54:10,441 INFO L290 TraceCheckUtils]: 18: Hoare triple {13433#(<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} assume main_#t~short14#1; {13433#(<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} is VALID [2022-02-20 23:54:10,441 INFO L290 TraceCheckUtils]: 19: Hoare triple {13433#(<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} assume !!main_#t~short14#1;havoc main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem10#1;havoc main_#t~mem12#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem13#1;havoc main_#t~short14#1; {13433#(<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} is VALID [2022-02-20 23:54:10,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {13433#(<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} goto; {13433#(<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} is VALID [2022-02-20 23:54:10,442 INFO L290 TraceCheckUtils]: 21: Hoare triple {13433#(<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1035-14 {13434#(<= 0 |ULTIMATE.start_main_#t~mem15#1.offset|)} is VALID [2022-02-20 23:54:10,442 INFO L290 TraceCheckUtils]: 22: Hoare triple {13434#(<= 0 |ULTIMATE.start_main_#t~mem15#1.offset|)} 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; {13435#(<= 0 |ULTIMATE.start_main_~x~0#1.offset|)} is VALID [2022-02-20 23:54:10,443 INFO L290 TraceCheckUtils]: 23: Hoare triple {13435#(<= 0 |ULTIMATE.start_main_~x~0#1.offset|)} SUMMARY for call main_#t~mem8#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1033-2 {13436#(and (<= (+ 12 |ULTIMATE.start_main_~x~0#1.offset|) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (<= 0 |ULTIMATE.start_main_~x~0#1.offset|))} is VALID [2022-02-20 23:54:10,443 INFO L290 TraceCheckUtils]: 24: Hoare triple {13436#(and (<= (+ 12 |ULTIMATE.start_main_~x~0#1.offset|) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (<= 0 |ULTIMATE.start_main_~x~0#1.offset|))} assume !!(0 != main_#t~mem8#1);havoc main_#t~mem8#1; {13436#(and (<= (+ 12 |ULTIMATE.start_main_~x~0#1.offset|) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (<= 0 |ULTIMATE.start_main_~x~0#1.offset|))} is VALID [2022-02-20 23:54:10,444 INFO L290 TraceCheckUtils]: 25: Hoare triple {13436#(and (<= (+ 12 |ULTIMATE.start_main_~x~0#1.offset|) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (<= 0 |ULTIMATE.start_main_~x~0#1.offset|))} assume !(4 + main_~x~0#1.offset <= #length[main_~x~0#1.base] && 0 <= main_~x~0#1.offset); {13426#false} is VALID [2022-02-20 23:54:10,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:10,444 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:10,444 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967274572] [2022-02-20 23:54:10,444 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967274572] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:54:10,444 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831778536] [2022-02-20 23:54:10,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:10,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:54:10,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:54:10,448 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 23:54:10,449 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 23:54:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:10,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-20 23:54:10,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:10,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:54:10,713 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 25 treesize of output 17 [2022-02-20 23:54:10,737 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 21 treesize of output 13 [2022-02-20 23:54:10,780 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 19 treesize of output 7 [2022-02-20 23:54:10,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {13425#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {13425#true} is VALID [2022-02-20 23:54:10,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {13425#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;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; {13425#true} is VALID [2022-02-20 23:54:10,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {13425#true} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L998 {13425#true} is VALID [2022-02-20 23:54:10,793 INFO L290 TraceCheckUtils]: 3: Hoare triple {13425#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-1 {13425#true} is VALID [2022-02-20 23:54:10,793 INFO L290 TraceCheckUtils]: 4: Hoare triple {13425#true} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L999 {13425#true} is VALID [2022-02-20 23:54:10,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {13425#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~state~0#1 := 1; {13425#true} is VALID [2022-02-20 23:54:10,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {13425#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {13425#true} is VALID [2022-02-20 23:54:10,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {13425#true} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {13425#true} is VALID [2022-02-20 23:54:10,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {13425#true} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1006-3 {13425#true} is VALID [2022-02-20 23:54:10,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {13425#true} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1028 {13425#true} is VALID [2022-02-20 23:54:10,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {13425#true} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {13425#true} is VALID [2022-02-20 23:54:10,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {13425#true} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {13425#true} is VALID [2022-02-20 23:54:10,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {13425#true} goto; {13425#true} is VALID [2022-02-20 23:54:10,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {13425#true} SUMMARY for call main_#t~mem8#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1033-2 {13425#true} is VALID [2022-02-20 23:54:10,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {13425#true} assume !!(0 != main_#t~mem8#1);havoc main_#t~mem8#1; {13425#true} is VALID [2022-02-20 23:54:10,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {13425#true} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1035-13 {13485#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem9#1.offset|) (= |ULTIMATE.start_main_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-20 23:54:10,795 INFO L290 TraceCheckUtils]: 16: Hoare triple {13485#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem9#1.offset|) (= |ULTIMATE.start_main_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} SUMMARY for call main_#t~mem10#1 := read~int(main_#t~mem9#1.base, 8 + main_#t~mem9#1.offset, 4); srcloc: L1035-1 {13489#(= (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)) |ULTIMATE.start_main_#t~mem10#1|)} is VALID [2022-02-20 23:54:10,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {13489#(= (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)) |ULTIMATE.start_main_#t~mem10#1|)} main_#t~short14#1 := 0 == main_#t~mem10#1; {13493#(or (and (not |ULTIMATE.start_main_#t~short14#1|) (not (= (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)) 0))) (and |ULTIMATE.start_main_#t~short14#1| (= (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)) 0)))} is VALID [2022-02-20 23:54:10,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {13493#(or (and (not |ULTIMATE.start_main_#t~short14#1|) (not (= (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)) 0))) (and |ULTIMATE.start_main_#t~short14#1| (= (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)) 0)))} assume main_#t~short14#1; {13497#(= (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)) 0)} is VALID [2022-02-20 23:54:10,797 INFO L290 TraceCheckUtils]: 19: Hoare triple {13497#(= (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)) 0)} assume !!main_#t~short14#1;havoc main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem10#1;havoc main_#t~mem12#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem13#1;havoc main_#t~short14#1; {13497#(= (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)) 0)} is VALID [2022-02-20 23:54:10,797 INFO L290 TraceCheckUtils]: 20: Hoare triple {13497#(= (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)) 0)} goto; {13497#(= (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)) 0)} is VALID [2022-02-20 23:54:10,797 INFO L290 TraceCheckUtils]: 21: Hoare triple {13497#(= (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)) 0)} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1035-14 {13507#(= (select (select |#memory_int| |ULTIMATE.start_main_#t~mem15#1.base|) (+ 8 |ULTIMATE.start_main_#t~mem15#1.offset|)) 0)} is VALID [2022-02-20 23:54:10,798 INFO L290 TraceCheckUtils]: 22: Hoare triple {13507#(= (select (select |#memory_int| |ULTIMATE.start_main_#t~mem15#1.base|) (+ 8 |ULTIMATE.start_main_#t~mem15#1.offset|)) 0)} 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; {13511#(= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) 0)} is VALID [2022-02-20 23:54:10,798 INFO L290 TraceCheckUtils]: 23: Hoare triple {13511#(= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) 0)} SUMMARY for call main_#t~mem8#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1033-2 {13515#(= |ULTIMATE.start_main_#t~mem8#1| 0)} is VALID [2022-02-20 23:54:10,798 INFO L290 TraceCheckUtils]: 24: Hoare triple {13515#(= |ULTIMATE.start_main_#t~mem8#1| 0)} assume !!(0 != main_#t~mem8#1);havoc main_#t~mem8#1; {13426#false} is VALID [2022-02-20 23:54:10,799 INFO L290 TraceCheckUtils]: 25: Hoare triple {13426#false} assume !(4 + main_~x~0#1.offset <= #length[main_~x~0#1.base] && 0 <= main_~x~0#1.offset); {13426#false} is VALID [2022-02-20 23:54:10,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:10,799 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:54:10,799 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831778536] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:10,799 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:54:10,799 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 19 [2022-02-20 23:54:10,799 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587955528] [2022-02-20 23:54:10,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:10,800 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 23:54:10,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:10,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:10,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:10,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:54:10,815 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:10,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:54:10,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2022-02-20 23:54:10,816 INFO L87 Difference]: Start difference. First operand 137 states and 157 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:11,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:11,362 INFO L93 Difference]: Finished difference Result 155 states and 176 transitions. [2022-02-20 23:54:11,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:54:11,363 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 23:54:11,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:11,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:11,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 91 transitions. [2022-02-20 23:54:11,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:11,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 91 transitions. [2022-02-20 23:54:11,365 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 91 transitions. [2022-02-20 23:54:11,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:11,436 INFO L225 Difference]: With dead ends: 155 [2022-02-20 23:54:11,436 INFO L226 Difference]: Without dead ends: 155 [2022-02-20 23:54:11,437 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2022-02-20 23:54:11,437 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 32 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:11,437 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 319 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:54:11,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-02-20 23:54:11,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 150. [2022-02-20 23:54:11,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:11,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand has 150 states, 132 states have (on average 1.303030303030303) internal successors, (172), 149 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:11,440 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand has 150 states, 132 states have (on average 1.303030303030303) internal successors, (172), 149 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:11,440 INFO L87 Difference]: Start difference. First operand 155 states. Second operand has 150 states, 132 states have (on average 1.303030303030303) internal successors, (172), 149 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:11,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:11,442 INFO L93 Difference]: Finished difference Result 155 states and 176 transitions. [2022-02-20 23:54:11,442 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 176 transitions. [2022-02-20 23:54:11,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:11,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:11,443 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 132 states have (on average 1.303030303030303) internal successors, (172), 149 states have internal predecessors, (172), 0 states have call successors, (0), 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 155 states. [2022-02-20 23:54:11,443 INFO L87 Difference]: Start difference. First operand has 150 states, 132 states have (on average 1.303030303030303) internal successors, (172), 149 states have internal predecessors, (172), 0 states have call successors, (0), 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 155 states. [2022-02-20 23:54:11,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:11,445 INFO L93 Difference]: Finished difference Result 155 states and 176 transitions. [2022-02-20 23:54:11,445 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 176 transitions. [2022-02-20 23:54:11,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:11,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:11,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:11,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:11,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 132 states have (on average 1.303030303030303) internal successors, (172), 149 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:11,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 172 transitions. [2022-02-20 23:54:11,448 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 172 transitions. Word has length 26 [2022-02-20 23:54:11,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:11,448 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 172 transitions. [2022-02-20 23:54:11,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:11,448 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 172 transitions. [2022-02-20 23:54:11,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 23:54:11,448 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:11,449 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:11,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:54:11,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-02-20 23:54:11,663 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2022-02-20 23:54:11,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:11,664 INFO L85 PathProgramCache]: Analyzing trace with hash -301886117, now seen corresponding path program 1 times [2022-02-20 23:54:11,664 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:11,664 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188042993] [2022-02-20 23:54:11,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:11,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:11,826 INFO L290 TraceCheckUtils]: 0: Hoare triple {14146#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {14146#true} is VALID [2022-02-20 23:54:11,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {14146#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;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; {14146#true} is VALID [2022-02-20 23:54:11,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {14146#true} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L998 {14148#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:54:11,827 INFO L290 TraceCheckUtils]: 3: Hoare triple {14148#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-1 {14148#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:54:11,827 INFO L290 TraceCheckUtils]: 4: Hoare triple {14148#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L999 {14148#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:54:11,827 INFO L290 TraceCheckUtils]: 5: Hoare triple {14148#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~state~0#1 := 1; {14149#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:54:11,828 INFO L290 TraceCheckUtils]: 6: Hoare triple {14149#(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; {14149#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:54:11,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {14149#(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);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {14150#(and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_#t~malloc3#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|))} is VALID [2022-02-20 23:54:11,829 INFO L290 TraceCheckUtils]: 8: Hoare triple {14150#(and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_#t~malloc3#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1009 {14151#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:54:11,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {14151#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {14151#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:54:11,830 INFO L290 TraceCheckUtils]: 10: Hoare triple {14151#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1010 {14152#(and (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_#t~mem4#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 23:54:11,831 INFO L290 TraceCheckUtils]: 11: Hoare triple {14152#(and (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_#t~mem4#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))} SUMMARY for 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); srcloc: L1010-1 {14151#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:54:11,831 INFO L290 TraceCheckUtils]: 12: Hoare triple {14151#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {14151#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:54:11,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {14151#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1011 {14153#(and (= |ULTIMATE.start_main_#t~mem5#1.offset| 0) (= |ULTIMATE.start_main_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~head~0#1.base|)))} is VALID [2022-02-20 23:54:11,832 INFO L290 TraceCheckUtils]: 14: Hoare triple {14153#(and (= |ULTIMATE.start_main_#t~mem5#1.offset| 0) (= |ULTIMATE.start_main_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~head~0#1.base|)))} 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; {14154#(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_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} is VALID [2022-02-20 23:54:11,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {14154#(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_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1012 {14154#(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_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} is VALID [2022-02-20 23:54:11,833 INFO L290 TraceCheckUtils]: 16: Hoare triple {14154#(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_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {14154#(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_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} is VALID [2022-02-20 23:54:11,833 INFO L290 TraceCheckUtils]: 17: Hoare triple {14154#(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_~x~0#1.base| (select (select |#memory_$Pointer$.base| |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; {14154#(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_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} is VALID [2022-02-20 23:54:11,834 INFO L290 TraceCheckUtils]: 18: Hoare triple {14154#(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_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1014-1 {14154#(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_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} is VALID [2022-02-20 23:54:11,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {14154#(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_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {14155#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)))} is VALID [2022-02-20 23:54:11,835 INFO L290 TraceCheckUtils]: 20: Hoare triple {14155#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)))} goto; {14155#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)))} is VALID [2022-02-20 23:54:11,835 INFO L290 TraceCheckUtils]: 21: Hoare triple {14155#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {14155#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)))} is VALID [2022-02-20 23:54:11,836 INFO L290 TraceCheckUtils]: 22: Hoare triple {14155#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {14155#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)))} is VALID [2022-02-20 23:54:11,836 INFO L290 TraceCheckUtils]: 23: Hoare triple {14155#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)))} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1006-3 {14156#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:11,837 INFO L290 TraceCheckUtils]: 24: Hoare triple {14156#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1028 {14157#(not (= |ULTIMATE.start_main_#t~mem7#1.base| 0))} is VALID [2022-02-20 23:54:11,837 INFO L290 TraceCheckUtils]: 25: Hoare triple {14157#(not (= |ULTIMATE.start_main_#t~mem7#1.base| 0))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {14158#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} is VALID [2022-02-20 23:54:11,837 INFO L290 TraceCheckUtils]: 26: Hoare triple {14158#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} assume !(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {14147#false} is VALID [2022-02-20 23:54:11,837 INFO L290 TraceCheckUtils]: 27: Hoare triple {14147#false} assume !false; {14147#false} is VALID [2022-02-20 23:54:11,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:11,838 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:11,838 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188042993] [2022-02-20 23:54:11,838 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188042993] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:54:11,841 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754677475] [2022-02-20 23:54:11,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:11,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:54:11,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:54:11,842 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:54:11,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 23:54:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:11,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 32 conjunts are in the unsatisfiable core [2022-02-20 23:54:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:11,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:54:11,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:54:12,053 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:54:12,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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 23:54:12,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:54:12,208 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:54:12,208 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 27 treesize of output 28 [2022-02-20 23:54:12,306 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:54:12,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2022-02-20 23:54:12,351 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:54:12,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2022-02-20 23:54:12,434 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:54:12,434 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 27 treesize of output 28 [2022-02-20 23:54:12,482 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 24 treesize of output 12 [2022-02-20 23:54:12,498 INFO L290 TraceCheckUtils]: 0: Hoare triple {14146#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {14146#true} is VALID [2022-02-20 23:54:12,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {14146#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;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; {14165#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:54:12,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {14165#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L998 {14165#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:54:12,500 INFO L290 TraceCheckUtils]: 3: Hoare triple {14165#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-1 {14165#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:54:12,501 INFO L290 TraceCheckUtils]: 4: Hoare triple {14165#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L999 {14165#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:54:12,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {14165#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~state~0#1 := 1; {14178#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:54:12,502 INFO L290 TraceCheckUtils]: 6: Hoare triple {14178#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {14178#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:54:12,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {14178#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} assume !!(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {14185#(and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| 0)))} is VALID [2022-02-20 23:54:12,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {14185#(and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| 0)))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1009 {14189#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)))} is VALID [2022-02-20 23:54:12,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {14189#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {14189#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)))} is VALID [2022-02-20 23:54:12,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {14189#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)))} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1010 {14196#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_#t~mem4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)))} is VALID [2022-02-20 23:54:12,505 INFO L290 TraceCheckUtils]: 11: Hoare triple {14196#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_#t~mem4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)))} SUMMARY for 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); srcloc: L1010-1 {14189#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)))} is VALID [2022-02-20 23:54:12,505 INFO L290 TraceCheckUtils]: 12: Hoare triple {14189#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)))} havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {14189#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)))} is VALID [2022-02-20 23:54:12,506 INFO L290 TraceCheckUtils]: 13: Hoare triple {14189#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1011 {14206#(and (= |ULTIMATE.start_main_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (not (= (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| 0))} is VALID [2022-02-20 23:54:12,507 INFO L290 TraceCheckUtils]: 14: Hoare triple {14206#(and (= |ULTIMATE.start_main_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (not (= (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| 0))} 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; {14210#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (not (= (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| 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|)))} is VALID [2022-02-20 23:54:12,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {14210#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (not (= (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| 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|)))} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1012 {14210#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (not (= (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| 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|)))} is VALID [2022-02-20 23:54:12,508 INFO L290 TraceCheckUtils]: 16: Hoare triple {14210#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (not (= (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| 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|)))} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {14210#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (not (= (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| 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|)))} is VALID [2022-02-20 23:54:12,508 INFO L290 TraceCheckUtils]: 17: Hoare triple {14210#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (not (= (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| 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|)))} assume !(0 != main_#t~nondet6#1);havoc main_#t~nondet6#1; {14210#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (not (= (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| 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|)))} is VALID [2022-02-20 23:54:12,509 INFO L290 TraceCheckUtils]: 18: Hoare triple {14210#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (not (= (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| 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|)))} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1014-1 {14210#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (not (= (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| 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|)))} is VALID [2022-02-20 23:54:12,510 INFO L290 TraceCheckUtils]: 19: Hoare triple {14210#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (not (= (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| 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|)))} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {14210#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (not (= (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| 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|)))} is VALID [2022-02-20 23:54:12,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {14210#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (not (= (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| 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|)))} goto; {14210#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (not (= (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| 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|)))} is VALID [2022-02-20 23:54:12,511 INFO L290 TraceCheckUtils]: 21: Hoare triple {14210#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (not (= (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| 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|)))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {14210#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (not (= (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| 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|)))} is VALID [2022-02-20 23:54:12,511 INFO L290 TraceCheckUtils]: 22: Hoare triple {14210#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (not (= (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| 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|)))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {14210#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (not (= (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| 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|)))} is VALID [2022-02-20 23:54:12,512 INFO L290 TraceCheckUtils]: 23: Hoare triple {14210#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (not (= (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| 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|)))} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1006-3 {14238#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (not (= (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| 0))} is VALID [2022-02-20 23:54:12,512 INFO L290 TraceCheckUtils]: 24: Hoare triple {14238#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (not (= (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| 0))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1028 {14157#(not (= |ULTIMATE.start_main_#t~mem7#1.base| 0))} is VALID [2022-02-20 23:54:12,513 INFO L290 TraceCheckUtils]: 25: Hoare triple {14157#(not (= |ULTIMATE.start_main_#t~mem7#1.base| 0))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {14158#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} is VALID [2022-02-20 23:54:12,513 INFO L290 TraceCheckUtils]: 26: Hoare triple {14158#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} assume !(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {14147#false} is VALID [2022-02-20 23:54:12,513 INFO L290 TraceCheckUtils]: 27: Hoare triple {14147#false} assume !false; {14147#false} is VALID [2022-02-20 23:54:12,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:12,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:54:12,538 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_840 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_840) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-02-20 23:54:12,591 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_840 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_840) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-02-20 23:54:12,599 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_840 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_840) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-02-20 23:54:12,613 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_837 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (not (= 0 (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_837))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_840)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-02-20 23:54:12,621 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_837 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_837))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_840)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-02-20 23:54:12,637 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:54:12,637 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 37 treesize of output 30 [2022-02-20 23:54:12,647 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:54:12,647 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 141 treesize of output 128 [2022-02-20 23:54:12,656 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:54:12,656 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 112 treesize of output 111 [2022-02-20 23:54:12,659 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 102 treesize of output 98 [2022-02-20 23:54:12,974 INFO L290 TraceCheckUtils]: 27: Hoare triple {14147#false} assume !false; {14147#false} is VALID [2022-02-20 23:54:12,974 INFO L290 TraceCheckUtils]: 26: Hoare triple {14158#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} assume !(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {14147#false} is VALID [2022-02-20 23:54:12,975 INFO L290 TraceCheckUtils]: 25: Hoare triple {14157#(not (= |ULTIMATE.start_main_#t~mem7#1.base| 0))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {14158#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} is VALID [2022-02-20 23:54:12,975 INFO L290 TraceCheckUtils]: 24: Hoare triple {14156#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1028 {14157#(not (= |ULTIMATE.start_main_#t~mem7#1.base| 0))} is VALID [2022-02-20 23:54:12,976 INFO L290 TraceCheckUtils]: 23: Hoare triple {14263#(forall ((v_ArrVal_840 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_840) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1006-3 {14156#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:12,976 INFO L290 TraceCheckUtils]: 22: Hoare triple {14263#(forall ((v_ArrVal_840 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_840) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {14263#(forall ((v_ArrVal_840 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_840) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} is VALID [2022-02-20 23:54:12,977 INFO L290 TraceCheckUtils]: 21: Hoare triple {14263#(forall ((v_ArrVal_840 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_840) |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; {14263#(forall ((v_ArrVal_840 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_840) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} is VALID [2022-02-20 23:54:12,977 INFO L290 TraceCheckUtils]: 20: Hoare triple {14263#(forall ((v_ArrVal_840 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_840) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} goto; {14263#(forall ((v_ArrVal_840 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_840) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} is VALID [2022-02-20 23:54:12,977 INFO L290 TraceCheckUtils]: 19: Hoare triple {14263#(forall ((v_ArrVal_840 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_840) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {14263#(forall ((v_ArrVal_840 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_840) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} is VALID [2022-02-20 23:54:12,982 WARN L290 TraceCheckUtils]: 18: Hoare triple {14263#(forall ((v_ArrVal_840 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_840) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1014-1 {14263#(forall ((v_ArrVal_840 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_840) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} is UNKNOWN [2022-02-20 23:54:12,982 INFO L290 TraceCheckUtils]: 17: Hoare triple {14263#(forall ((v_ArrVal_840 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_840) |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; {14263#(forall ((v_ArrVal_840 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_840) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} is VALID [2022-02-20 23:54:12,982 INFO L290 TraceCheckUtils]: 16: Hoare triple {14263#(forall ((v_ArrVal_840 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_840) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {14263#(forall ((v_ArrVal_840 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_840) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} is VALID [2022-02-20 23:54:12,984 INFO L290 TraceCheckUtils]: 15: Hoare triple {14263#(forall ((v_ArrVal_840 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_840) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1012 {14263#(forall ((v_ArrVal_840 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_840) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} is VALID [2022-02-20 23:54:12,984 INFO L290 TraceCheckUtils]: 14: Hoare triple {14291#(forall ((v_ArrVal_840 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_840) |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_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {14263#(forall ((v_ArrVal_840 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_840) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} is VALID [2022-02-20 23:54:12,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {14295#(forall ((v_ArrVal_840 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_840) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1011 {14291#(forall ((v_ArrVal_840 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_840) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} is VALID [2022-02-20 23:54:12,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {14295#(forall ((v_ArrVal_840 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_840) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {14295#(forall ((v_ArrVal_840 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_840) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} is VALID [2022-02-20 23:54:12,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {14302#(forall ((v_ArrVal_837 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (not (= (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_837) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_837) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_840) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} SUMMARY for 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); srcloc: L1010-1 {14295#(forall ((v_ArrVal_840 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_840) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} is VALID [2022-02-20 23:54:12,987 INFO L290 TraceCheckUtils]: 10: Hoare triple {14306#(forall ((v_ArrVal_837 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (not (= (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_837) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_837) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_840) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1010 {14302#(forall ((v_ArrVal_837 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (not (= (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_837) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_837) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_840) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} is VALID [2022-02-20 23:54:12,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {14306#(forall ((v_ArrVal_837 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (not (= (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_837) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_837) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_840) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {14306#(forall ((v_ArrVal_837 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (not (= (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_837) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_837) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_840) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} is VALID [2022-02-20 23:54:12,988 INFO L290 TraceCheckUtils]: 8: Hoare triple {14313#(and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| 0)))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1009 {14306#(forall ((v_ArrVal_837 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (not (= (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_837) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_837) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_840) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} is VALID [2022-02-20 23:54:12,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {14317#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (or (and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~head~0#1.base|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 0) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6|) 0))))} assume !!(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {14313#(and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| 0)))} is VALID [2022-02-20 23:54:12,989 INFO L290 TraceCheckUtils]: 6: Hoare triple {14317#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (or (and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~head~0#1.base|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 0) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6|) 0))))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {14317#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (or (and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~head~0#1.base|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 0) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6|) 0))))} is VALID [2022-02-20 23:54:12,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {14324#(or (= |ULTIMATE.start_main_~head~0#1.base| 0) (not (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 0)))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~state~0#1 := 1; {14317#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (or (and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~head~0#1.base|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 0) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6|) 0))))} is VALID [2022-02-20 23:54:12,990 INFO L290 TraceCheckUtils]: 4: Hoare triple {14324#(or (= |ULTIMATE.start_main_~head~0#1.base| 0) (not (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 0)))} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L999 {14324#(or (= |ULTIMATE.start_main_~head~0#1.base| 0) (not (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 0)))} is VALID [2022-02-20 23:54:12,991 INFO L290 TraceCheckUtils]: 3: Hoare triple {14324#(or (= |ULTIMATE.start_main_~head~0#1.base| 0) (not (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 0)))} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-1 {14324#(or (= |ULTIMATE.start_main_~head~0#1.base| 0) (not (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 0)))} is VALID [2022-02-20 23:54:12,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {14324#(or (= |ULTIMATE.start_main_~head~0#1.base| 0) (not (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 0)))} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L998 {14324#(or (= |ULTIMATE.start_main_~head~0#1.base| 0) (not (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 0)))} is VALID [2022-02-20 23:54:12,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {14146#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;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; {14324#(or (= |ULTIMATE.start_main_~head~0#1.base| 0) (not (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 0)))} is VALID [2022-02-20 23:54:12,992 INFO L290 TraceCheckUtils]: 0: Hoare triple {14146#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {14146#true} is VALID [2022-02-20 23:54:12,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-02-20 23:54:12,992 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754677475] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:54:12,992 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:54:12,992 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 29 [2022-02-20 23:54:12,992 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616096781] [2022-02-20 23:54:12,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:54:12,993 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-02-20 23:54:12,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:12,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:13,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 73 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:13,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-20 23:54:13,059 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:13,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-20 23:54:13,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=486, Unknown=5, NotChecked=240, Total=812 [2022-02-20 23:54:13,060 INFO L87 Difference]: Start difference. First operand 150 states and 172 transitions. Second operand has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:15,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:15,177 INFO L93 Difference]: Finished difference Result 282 states and 307 transitions. [2022-02-20 23:54:15,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 23:54:15,177 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-02-20 23:54:15,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:15,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:15,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 235 transitions. [2022-02-20 23:54:15,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:15,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 235 transitions. [2022-02-20 23:54:15,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 235 transitions. [2022-02-20 23:54:15,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 233 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:15,363 INFO L225 Difference]: With dead ends: 282 [2022-02-20 23:54:15,363 INFO L226 Difference]: Without dead ends: 282 [2022-02-20 23:54:15,363 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=1005, Unknown=6, NotChecked=350, Total=1560 [2022-02-20 23:54:15,364 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 276 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 1593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 532 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:15,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 1050 Invalid, 1593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1040 Invalid, 0 Unknown, 532 Unchecked, 0.7s Time] [2022-02-20 23:54:15,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-02-20 23:54:15,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 175. [2022-02-20 23:54:15,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:15,367 INFO L82 GeneralOperation]: Start isEquivalent. First operand 282 states. Second operand has 175 states, 157 states have (on average 1.2738853503184713) internal successors, (200), 174 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:15,367 INFO L74 IsIncluded]: Start isIncluded. First operand 282 states. Second operand has 175 states, 157 states have (on average 1.2738853503184713) internal successors, (200), 174 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:15,367 INFO L87 Difference]: Start difference. First operand 282 states. Second operand has 175 states, 157 states have (on average 1.2738853503184713) internal successors, (200), 174 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:15,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:15,371 INFO L93 Difference]: Finished difference Result 282 states and 307 transitions. [2022-02-20 23:54:15,371 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 307 transitions. [2022-02-20 23:54:15,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:15,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:15,372 INFO L74 IsIncluded]: Start isIncluded. First operand has 175 states, 157 states have (on average 1.2738853503184713) internal successors, (200), 174 states have internal predecessors, (200), 0 states have call successors, (0), 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 282 states. [2022-02-20 23:54:15,372 INFO L87 Difference]: Start difference. First operand has 175 states, 157 states have (on average 1.2738853503184713) internal successors, (200), 174 states have internal predecessors, (200), 0 states have call successors, (0), 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 282 states. [2022-02-20 23:54:15,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:15,376 INFO L93 Difference]: Finished difference Result 282 states and 307 transitions. [2022-02-20 23:54:15,376 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 307 transitions. [2022-02-20 23:54:15,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:15,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:15,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:15,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:15,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 157 states have (on average 1.2738853503184713) internal successors, (200), 174 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:15,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 200 transitions. [2022-02-20 23:54:15,379 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 200 transitions. Word has length 28 [2022-02-20 23:54:15,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:15,379 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 200 transitions. [2022-02-20 23:54:15,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:15,379 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 200 transitions. [2022-02-20 23:54:15,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 23:54:15,379 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:15,380 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:15,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 23:54:15,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:54:15,587 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2022-02-20 23:54:15,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:15,588 INFO L85 PathProgramCache]: Analyzing trace with hash -768530862, now seen corresponding path program 1 times [2022-02-20 23:54:15,588 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:15,588 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012067538] [2022-02-20 23:54:15,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:15,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:15,725 INFO L290 TraceCheckUtils]: 0: Hoare triple {15387#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {15387#true} is VALID [2022-02-20 23:54:15,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {15387#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;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; {15387#true} is VALID [2022-02-20 23:54:15,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {15387#true} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L998 {15389#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:54:15,726 INFO L290 TraceCheckUtils]: 3: Hoare triple {15389#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-1 {15389#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:54:15,727 INFO L290 TraceCheckUtils]: 4: Hoare triple {15389#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L999 {15389#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:54:15,727 INFO L290 TraceCheckUtils]: 5: Hoare triple {15389#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~state~0#1 := 1; {15390#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:54:15,727 INFO L290 TraceCheckUtils]: 6: Hoare triple {15390#(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; {15390#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:54:15,728 INFO L290 TraceCheckUtils]: 7: Hoare triple {15390#(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);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {15391#(and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|))} is VALID [2022-02-20 23:54:15,729 INFO L290 TraceCheckUtils]: 8: Hoare triple {15391#(and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1009 {15392#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 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|))))} is VALID [2022-02-20 23:54:15,729 INFO L290 TraceCheckUtils]: 9: Hoare triple {15392#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 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|))))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {15392#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 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|))))} is VALID [2022-02-20 23:54:15,730 INFO L290 TraceCheckUtils]: 10: Hoare triple {15392#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 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|))))} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1010 {15393#(and (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1) (= |ULTIMATE.start_main_#t~mem4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-20 23:54:15,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {15393#(and (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1) (= |ULTIMATE.start_main_#t~mem4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} SUMMARY for 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); srcloc: L1010-1 {15392#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 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|))))} is VALID [2022-02-20 23:54:15,731 INFO L290 TraceCheckUtils]: 12: Hoare triple {15392#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 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|))))} havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {15392#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 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|))))} is VALID [2022-02-20 23:54:15,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {15392#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 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|))))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1011 {15394#(and (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:15,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {15394#(and (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {15395#(and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:15,733 INFO L290 TraceCheckUtils]: 15: Hoare triple {15395#(and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1012 {15395#(and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:15,733 INFO L290 TraceCheckUtils]: 16: Hoare triple {15395#(and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {15395#(and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:15,733 INFO L290 TraceCheckUtils]: 17: Hoare triple {15395#(and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} assume !(0 != main_#t~nondet6#1);havoc main_#t~nondet6#1; {15395#(and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:15,734 INFO L290 TraceCheckUtils]: 18: Hoare triple {15395#(and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1014-1 {15395#(and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:15,734 INFO L290 TraceCheckUtils]: 19: Hoare triple {15395#(and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {15395#(and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:15,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {15395#(and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} goto; {15395#(and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:15,735 INFO L290 TraceCheckUtils]: 21: Hoare triple {15395#(and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {15395#(and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:15,736 INFO L290 TraceCheckUtils]: 22: Hoare triple {15395#(and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {15395#(and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:15,736 INFO L290 TraceCheckUtils]: 23: Hoare triple {15395#(and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1006-3 {15396#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)} is VALID [2022-02-20 23:54:15,737 INFO L290 TraceCheckUtils]: 24: Hoare triple {15396#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1028 {15397#(= (select |#valid| |ULTIMATE.start_main_#t~mem7#1.base|) 1)} is VALID [2022-02-20 23:54:15,737 INFO L290 TraceCheckUtils]: 25: Hoare triple {15397#(= (select |#valid| |ULTIMATE.start_main_#t~mem7#1.base|) 1)} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {15398#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:54:15,737 INFO L290 TraceCheckUtils]: 26: Hoare triple {15398#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {15398#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:54:15,738 INFO L290 TraceCheckUtils]: 27: Hoare triple {15398#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} goto; {15398#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:54:15,738 INFO L290 TraceCheckUtils]: 28: Hoare triple {15398#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !(1 == #valid[main_~x~0#1.base]); {15388#false} is VALID [2022-02-20 23:54:15,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:15,738 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:15,738 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012067538] [2022-02-20 23:54:15,739 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012067538] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:54:15,739 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568703537] [2022-02-20 23:54:15,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:15,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:54:15,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:54:15,740 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:54:15,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 23:54:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:15,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 30 conjunts are in the unsatisfiable core [2022-02-20 23:54:15,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:15,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:54:16,029 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-02-20 23:54:16,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-02-20 23:54:16,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:54:16,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:54:16,121 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-20 23:54:16,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-02-20 23:54:16,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:54:16,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:54:16,251 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-20 23:54:16,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 35 [2022-02-20 23:54:16,368 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-20 23:54:16,368 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 15 [2022-02-20 23:54:16,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {15387#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {15387#true} is VALID [2022-02-20 23:54:16,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {15387#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;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; {15405#(= |ULTIMATE.start_main_~head~0#1.offset| 0)} is VALID [2022-02-20 23:54:16,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {15405#(= |ULTIMATE.start_main_~head~0#1.offset| 0)} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L998 {15405#(= |ULTIMATE.start_main_~head~0#1.offset| 0)} is VALID [2022-02-20 23:54:16,404 INFO L290 TraceCheckUtils]: 3: Hoare triple {15405#(= |ULTIMATE.start_main_~head~0#1.offset| 0)} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-1 {15405#(= |ULTIMATE.start_main_~head~0#1.offset| 0)} is VALID [2022-02-20 23:54:16,404 INFO L290 TraceCheckUtils]: 4: Hoare triple {15405#(= |ULTIMATE.start_main_~head~0#1.offset| 0)} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L999 {15405#(= |ULTIMATE.start_main_~head~0#1.offset| 0)} is VALID [2022-02-20 23:54:16,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {15405#(= |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;main_~state~0#1 := 1; {15418#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:54:16,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {15418#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {15418#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:54:16,406 INFO L290 TraceCheckUtils]: 7: Hoare triple {15418#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} assume !!(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {15418#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:54:16,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {15418#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1009 {15428#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1))} is VALID [2022-02-20 23:54:16,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {15428#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {15428#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1))} is VALID [2022-02-20 23:54:16,407 INFO L290 TraceCheckUtils]: 10: Hoare triple {15428#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1))} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1010 {15428#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1))} is VALID [2022-02-20 23:54:16,408 INFO L290 TraceCheckUtils]: 11: Hoare triple {15428#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1))} SUMMARY for 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); srcloc: L1010-1 {15428#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1))} is VALID [2022-02-20 23:54:16,408 INFO L290 TraceCheckUtils]: 12: Hoare triple {15428#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1))} havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {15428#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1))} is VALID [2022-02-20 23:54:16,409 INFO L290 TraceCheckUtils]: 13: Hoare triple {15428#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1011 {15444#(and (= |ULTIMATE.start_main_#t~mem5#1.base| (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| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:54:16,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {15444#(and (= |ULTIMATE.start_main_#t~mem5#1.base| (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| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} 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; {15448#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} is VALID [2022-02-20 23:54:16,410 INFO L290 TraceCheckUtils]: 15: Hoare triple {15448#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1012 {15452#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} is VALID [2022-02-20 23:54:16,411 INFO L290 TraceCheckUtils]: 16: Hoare triple {15452#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {15452#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} is VALID [2022-02-20 23:54:16,411 INFO L290 TraceCheckUtils]: 17: Hoare triple {15452#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} assume !(0 != main_#t~nondet6#1);havoc main_#t~nondet6#1; {15452#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} is VALID [2022-02-20 23:54:16,412 INFO L290 TraceCheckUtils]: 18: Hoare triple {15452#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1014-1 {15452#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} is VALID [2022-02-20 23:54:16,413 INFO L290 TraceCheckUtils]: 19: Hoare triple {15452#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {15452#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} is VALID [2022-02-20 23:54:16,413 INFO L290 TraceCheckUtils]: 20: Hoare triple {15452#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} goto; {15452#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} is VALID [2022-02-20 23:54:16,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {15452#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {15452#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} is VALID [2022-02-20 23:54:16,414 INFO L290 TraceCheckUtils]: 22: Hoare triple {15452#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {15452#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} is VALID [2022-02-20 23:54:16,416 INFO L290 TraceCheckUtils]: 23: Hoare triple {15452#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1006-3 {15477#(and (exists ((|ULTIMATE.start_main_~x~0#1.offset| Int)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (<= 0 |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:16,416 INFO L290 TraceCheckUtils]: 24: Hoare triple {15477#(and (exists ((|ULTIMATE.start_main_~x~0#1.offset| Int)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (<= 0 |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1028 {15397#(= (select |#valid| |ULTIMATE.start_main_#t~mem7#1.base|) 1)} is VALID [2022-02-20 23:54:16,417 INFO L290 TraceCheckUtils]: 25: Hoare triple {15397#(= (select |#valid| |ULTIMATE.start_main_#t~mem7#1.base|) 1)} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {15398#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:54:16,417 INFO L290 TraceCheckUtils]: 26: Hoare triple {15398#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {15398#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:54:16,417 INFO L290 TraceCheckUtils]: 27: Hoare triple {15398#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} goto; {15398#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:54:16,418 INFO L290 TraceCheckUtils]: 28: Hoare triple {15398#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !(1 == #valid[main_~x~0#1.base]); {15388#false} is VALID [2022-02-20 23:54:16,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:16,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:54:20,343 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:54:20,344 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 120 treesize of output 99 [2022-02-20 23:54:22,021 INFO L356 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2022-02-20 23:54:22,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 64 [2022-02-20 23:54:22,204 INFO L290 TraceCheckUtils]: 28: Hoare triple {15398#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !(1 == #valid[main_~x~0#1.base]); {15388#false} is VALID [2022-02-20 23:54:22,205 INFO L290 TraceCheckUtils]: 27: Hoare triple {15398#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} goto; {15398#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:54:22,205 INFO L290 TraceCheckUtils]: 26: Hoare triple {15398#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {15398#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:54:22,206 INFO L290 TraceCheckUtils]: 25: Hoare triple {15397#(= (select |#valid| |ULTIMATE.start_main_#t~mem7#1.base|) 1)} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {15398#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:54:22,206 INFO L290 TraceCheckUtils]: 24: Hoare triple {15396#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1028 {15397#(= (select |#valid| |ULTIMATE.start_main_#t~mem7#1.base|) 1)} is VALID [2022-02-20 23:54:22,207 INFO L290 TraceCheckUtils]: 23: Hoare triple {15508#(forall ((v_ArrVal_951 Int)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_951)) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1006-3 {15396#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)} is VALID [2022-02-20 23:54:22,208 INFO L290 TraceCheckUtils]: 22: Hoare triple {15508#(forall ((v_ArrVal_951 Int)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_951)) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {15508#(forall ((v_ArrVal_951 Int)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_951)) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:22,208 INFO L290 TraceCheckUtils]: 21: Hoare triple {15508#(forall ((v_ArrVal_951 Int)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_951)) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {15508#(forall ((v_ArrVal_951 Int)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_951)) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:22,209 INFO L290 TraceCheckUtils]: 20: Hoare triple {15508#(forall ((v_ArrVal_951 Int)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_951)) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} goto; {15508#(forall ((v_ArrVal_951 Int)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_951)) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:22,209 INFO L290 TraceCheckUtils]: 19: Hoare triple {15508#(forall ((v_ArrVal_951 Int)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_951)) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {15508#(forall ((v_ArrVal_951 Int)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_951)) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:22,986 INFO L290 TraceCheckUtils]: 18: Hoare triple {15508#(forall ((v_ArrVal_951 Int)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_951)) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1014-1 {15508#(forall ((v_ArrVal_951 Int)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_951)) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:22,987 INFO L290 TraceCheckUtils]: 17: Hoare triple {15508#(forall ((v_ArrVal_951 Int)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_951)) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} assume !(0 != main_#t~nondet6#1);havoc main_#t~nondet6#1; {15508#(forall ((v_ArrVal_951 Int)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_951)) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:22,987 INFO L290 TraceCheckUtils]: 16: Hoare triple {15508#(forall ((v_ArrVal_951 Int)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_951)) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {15508#(forall ((v_ArrVal_951 Int)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_951)) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:22,989 INFO L290 TraceCheckUtils]: 15: Hoare triple {15533#(or (not (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)) (forall ((v_ArrVal_951 Int) (|ULTIMATE.start_main_~x~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~x~0#1.offset|)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| (store (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_951)) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))))} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1012 {15508#(forall ((v_ArrVal_951 Int)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_951)) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:22,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {15537#(or (forall ((v_ArrVal_951 Int) (|ULTIMATE.start_main_~x~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~x~0#1.offset|)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| (store (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_951)) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem5#1.base|) 1)))} 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; {15533#(or (not (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)) (forall ((v_ArrVal_951 Int) (|ULTIMATE.start_main_~x~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~x~0#1.offset|)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| (store (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_951)) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))))} is VALID [2022-02-20 23:54:22,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {15541#(forall ((v_arrayElimCell_25 Int) (v_arrayElimCell_26 Int)) (or (not (= (select |#valid| v_arrayElimCell_25) 1)) (and (= (select |#valid| v_arrayElimCell_26) 1) (or (not (= v_arrayElimCell_25 |ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_951 Int)) (= (select |#valid| v_ArrVal_951) 1)) (< |ULTIMATE.start_main_~head~0#1.offset| 8))) (and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= v_arrayElimCell_26 v_arrayElimCell_25)))))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1011 {15537#(or (forall ((v_ArrVal_951 Int) (|ULTIMATE.start_main_~x~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~x~0#1.offset|)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| (store (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_951)) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem5#1.base|) 1)))} is VALID [2022-02-20 23:54:22,991 INFO L290 TraceCheckUtils]: 12: Hoare triple {15541#(forall ((v_arrayElimCell_25 Int) (v_arrayElimCell_26 Int)) (or (not (= (select |#valid| v_arrayElimCell_25) 1)) (and (= (select |#valid| v_arrayElimCell_26) 1) (or (not (= v_arrayElimCell_25 |ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_951 Int)) (= (select |#valid| v_ArrVal_951) 1)) (< |ULTIMATE.start_main_~head~0#1.offset| 8))) (and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= v_arrayElimCell_26 v_arrayElimCell_25)))))} havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {15541#(forall ((v_arrayElimCell_25 Int) (v_arrayElimCell_26 Int)) (or (not (= (select |#valid| v_arrayElimCell_25) 1)) (and (= (select |#valid| v_arrayElimCell_26) 1) (or (not (= v_arrayElimCell_25 |ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_951 Int)) (= (select |#valid| v_ArrVal_951) 1)) (< |ULTIMATE.start_main_~head~0#1.offset| 8))) (and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= v_arrayElimCell_26 v_arrayElimCell_25)))))} is VALID [2022-02-20 23:54:22,993 INFO L290 TraceCheckUtils]: 11: Hoare triple {15541#(forall ((v_arrayElimCell_25 Int) (v_arrayElimCell_26 Int)) (or (not (= (select |#valid| v_arrayElimCell_25) 1)) (and (= (select |#valid| v_arrayElimCell_26) 1) (or (not (= v_arrayElimCell_25 |ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_951 Int)) (= (select |#valid| v_ArrVal_951) 1)) (< |ULTIMATE.start_main_~head~0#1.offset| 8))) (and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= v_arrayElimCell_26 v_arrayElimCell_25)))))} SUMMARY for 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); srcloc: L1010-1 {15541#(forall ((v_arrayElimCell_25 Int) (v_arrayElimCell_26 Int)) (or (not (= (select |#valid| v_arrayElimCell_25) 1)) (and (= (select |#valid| v_arrayElimCell_26) 1) (or (not (= v_arrayElimCell_25 |ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_951 Int)) (= (select |#valid| v_ArrVal_951) 1)) (< |ULTIMATE.start_main_~head~0#1.offset| 8))) (and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= v_arrayElimCell_26 v_arrayElimCell_25)))))} is VALID [2022-02-20 23:54:22,994 INFO L290 TraceCheckUtils]: 10: Hoare triple {15541#(forall ((v_arrayElimCell_25 Int) (v_arrayElimCell_26 Int)) (or (not (= (select |#valid| v_arrayElimCell_25) 1)) (and (= (select |#valid| v_arrayElimCell_26) 1) (or (not (= v_arrayElimCell_25 |ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_951 Int)) (= (select |#valid| v_ArrVal_951) 1)) (< |ULTIMATE.start_main_~head~0#1.offset| 8))) (and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= v_arrayElimCell_26 v_arrayElimCell_25)))))} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1010 {15541#(forall ((v_arrayElimCell_25 Int) (v_arrayElimCell_26 Int)) (or (not (= (select |#valid| v_arrayElimCell_25) 1)) (and (= (select |#valid| v_arrayElimCell_26) 1) (or (not (= v_arrayElimCell_25 |ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_951 Int)) (= (select |#valid| v_ArrVal_951) 1)) (< |ULTIMATE.start_main_~head~0#1.offset| 8))) (and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= v_arrayElimCell_26 v_arrayElimCell_25)))))} is VALID [2022-02-20 23:54:22,995 INFO L290 TraceCheckUtils]: 9: Hoare triple {15541#(forall ((v_arrayElimCell_25 Int) (v_arrayElimCell_26 Int)) (or (not (= (select |#valid| v_arrayElimCell_25) 1)) (and (= (select |#valid| v_arrayElimCell_26) 1) (or (not (= v_arrayElimCell_25 |ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_951 Int)) (= (select |#valid| v_ArrVal_951) 1)) (< |ULTIMATE.start_main_~head~0#1.offset| 8))) (and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= v_arrayElimCell_26 v_arrayElimCell_25)))))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {15541#(forall ((v_arrayElimCell_25 Int) (v_arrayElimCell_26 Int)) (or (not (= (select |#valid| v_arrayElimCell_25) 1)) (and (= (select |#valid| v_arrayElimCell_26) 1) (or (not (= v_arrayElimCell_25 |ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_951 Int)) (= (select |#valid| v_ArrVal_951) 1)) (< |ULTIMATE.start_main_~head~0#1.offset| 8))) (and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= v_arrayElimCell_26 v_arrayElimCell_25)))))} is VALID [2022-02-20 23:54:22,996 INFO L290 TraceCheckUtils]: 8: Hoare triple {15557#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (< |ULTIMATE.start_main_~head~0#1.offset| 8))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1009 {15541#(forall ((v_arrayElimCell_25 Int) (v_arrayElimCell_26 Int)) (or (not (= (select |#valid| v_arrayElimCell_25) 1)) (and (= (select |#valid| v_arrayElimCell_26) 1) (or (not (= v_arrayElimCell_25 |ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_951 Int)) (= (select |#valid| v_ArrVal_951) 1)) (< |ULTIMATE.start_main_~head~0#1.offset| 8))) (and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= v_arrayElimCell_26 v_arrayElimCell_25)))))} is VALID [2022-02-20 23:54:22,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {15557#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (< |ULTIMATE.start_main_~head~0#1.offset| 8))} assume !!(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {15557#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (< |ULTIMATE.start_main_~head~0#1.offset| 8))} is VALID [2022-02-20 23:54:22,996 INFO L290 TraceCheckUtils]: 6: Hoare triple {15557#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (< |ULTIMATE.start_main_~head~0#1.offset| 8))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {15557#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (< |ULTIMATE.start_main_~head~0#1.offset| 8))} is VALID [2022-02-20 23:54:22,997 INFO L290 TraceCheckUtils]: 5: Hoare triple {15567#(< |ULTIMATE.start_main_~head~0#1.offset| 8)} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~state~0#1 := 1; {15557#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (< |ULTIMATE.start_main_~head~0#1.offset| 8))} is VALID [2022-02-20 23:54:22,997 INFO L290 TraceCheckUtils]: 4: Hoare triple {15567#(< |ULTIMATE.start_main_~head~0#1.offset| 8)} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L999 {15567#(< |ULTIMATE.start_main_~head~0#1.offset| 8)} is VALID [2022-02-20 23:54:22,997 INFO L290 TraceCheckUtils]: 3: Hoare triple {15567#(< |ULTIMATE.start_main_~head~0#1.offset| 8)} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-1 {15567#(< |ULTIMATE.start_main_~head~0#1.offset| 8)} is VALID [2022-02-20 23:54:22,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {15567#(< |ULTIMATE.start_main_~head~0#1.offset| 8)} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L998 {15567#(< |ULTIMATE.start_main_~head~0#1.offset| 8)} is VALID [2022-02-20 23:54:22,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {15387#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;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; {15567#(< |ULTIMATE.start_main_~head~0#1.offset| 8)} is VALID [2022-02-20 23:54:22,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {15387#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {15387#true} is VALID [2022-02-20 23:54:22,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:22,999 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568703537] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:54:22,999 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:54:22,999 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2022-02-20 23:54:22,999 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945778825] [2022-02-20 23:54:22,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:54:23,000 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 25 states have internal predecessors, (76), 0 states have call successors, (0), 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 29 [2022-02-20 23:54:23,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:23,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 25 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 25 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:25,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 75 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:25,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-20 23:54:25,071 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:25,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-20 23:54:25,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=503, Unknown=1, NotChecked=0, Total=600 [2022-02-20 23:54:25,072 INFO L87 Difference]: Start difference. First operand 175 states and 200 transitions. Second operand has 25 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 25 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:25,493 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (= (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1) (or (forall ((v_ArrVal_951 Int) (|ULTIMATE.start_main_~x~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~x~0#1.offset|)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_951)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) 1))) (or (not (= (select |c_#valid| |c_ULTIMATE.start_main_#t~mem5#1.base|) 1)) (forall ((v_ArrVal_951 Int) (|ULTIMATE.start_main_~x~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~x~0#1.offset|)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_951)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1))))) is different from false [2022-02-20 23:54:25,897 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) 1))) (and .cse0 (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select |c_#valid| (select .cse1 |c_ULTIMATE.start_main_~head~0#1.offset|)) 1) (not (= (select .cse1 |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)) (forall ((v_ArrVal_951 Int)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_951)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) (or (forall ((v_ArrVal_951 Int) (|ULTIMATE.start_main_~x~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~x~0#1.offset|)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_951)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1))) (not .cse0)) (or (not (= (select |c_#valid| |c_ULTIMATE.start_main_#t~mem5#1.base|) 1)) (forall ((v_ArrVal_951 Int) (|ULTIMATE.start_main_~x~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~x~0#1.offset|)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_951)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)))))) is different from false [2022-02-20 23:54:43,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:43,802 INFO L93 Difference]: Finished difference Result 321 states and 353 transitions. [2022-02-20 23:54:43,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-20 23:54:43,802 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 25 states have internal predecessors, (76), 0 states have call successors, (0), 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 29 [2022-02-20 23:54:43,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:43,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 25 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:43,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 263 transitions. [2022-02-20 23:54:43,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 25 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:43,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 263 transitions. [2022-02-20 23:54:43,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 263 transitions. [2022-02-20 23:54:46,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 263 edges. 262 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:46,019 INFO L225 Difference]: With dead ends: 321 [2022-02-20 23:54:46,019 INFO L226 Difference]: Without dead ends: 321 [2022-02-20 23:54:46,020 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=385, Invalid=1512, Unknown=3, NotChecked=170, Total=2070 [2022-02-20 23:54:46,020 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 642 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 507 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:46,020 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [642 Valid, 740 Invalid, 1346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 761 Invalid, 0 Unknown, 507 Unchecked, 0.6s Time] [2022-02-20 23:54:46,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-02-20 23:54:46,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 214. [2022-02-20 23:54:46,023 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:46,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 321 states. Second operand has 214 states, 196 states have (on average 1.260204081632653) internal successors, (247), 213 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:46,024 INFO L74 IsIncluded]: Start isIncluded. First operand 321 states. Second operand has 214 states, 196 states have (on average 1.260204081632653) internal successors, (247), 213 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:46,024 INFO L87 Difference]: Start difference. First operand 321 states. Second operand has 214 states, 196 states have (on average 1.260204081632653) internal successors, (247), 213 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:46,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:46,027 INFO L93 Difference]: Finished difference Result 321 states and 353 transitions. [2022-02-20 23:54:46,027 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 353 transitions. [2022-02-20 23:54:46,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:46,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:46,028 INFO L74 IsIncluded]: Start isIncluded. First operand has 214 states, 196 states have (on average 1.260204081632653) internal successors, (247), 213 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 321 states. [2022-02-20 23:54:46,028 INFO L87 Difference]: Start difference. First operand has 214 states, 196 states have (on average 1.260204081632653) internal successors, (247), 213 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 321 states. [2022-02-20 23:54:46,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:46,032 INFO L93 Difference]: Finished difference Result 321 states and 353 transitions. [2022-02-20 23:54:46,032 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 353 transitions. [2022-02-20 23:54:46,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:46,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:46,032 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:46,032 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:46,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 196 states have (on average 1.260204081632653) internal successors, (247), 213 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:46,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 247 transitions. [2022-02-20 23:54:46,035 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 247 transitions. Word has length 29 [2022-02-20 23:54:46,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:46,035 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 247 transitions. [2022-02-20 23:54:46,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 25 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:46,035 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 247 transitions. [2022-02-20 23:54:46,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 23:54:46,035 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:46,036 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:46,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 23:54:46,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-02-20 23:54:46,247 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2022-02-20 23:54:46,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:46,248 INFO L85 PathProgramCache]: Analyzing trace with hash -768530861, now seen corresponding path program 1 times [2022-02-20 23:54:46,248 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:46,248 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642328776] [2022-02-20 23:54:46,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:46,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:46,289 ERROR L253 erpolLogProxyWrapper]: Interpolant 13 not inductive [2022-02-20 23:54:46,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-02-20 23:54:46,294 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:233) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:879) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:803) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:352) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:284) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:216) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:264) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 23:54:46,300 INFO L158 Benchmark]: Toolchain (without parser) took 53957.53ms. Allocated memory was 104.9MB in the beginning and 234.9MB in the end (delta: 130.0MB). Free memory was 67.3MB in the beginning and 89.6MB in the end (delta: -22.3MB). Peak memory consumption was 109.1MB. Max. memory is 16.1GB. [2022-02-20 23:54:46,300 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory is still 85.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:54:46,301 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.67ms. Allocated memory is still 104.9MB. Free memory was 67.1MB in the beginning and 71.5MB in the end (delta: -4.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 23:54:46,301 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.39ms. Allocated memory is still 104.9MB. Free memory was 71.5MB in the beginning and 69.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:54:46,301 INFO L158 Benchmark]: Boogie Preprocessor took 22.28ms. Allocated memory is still 104.9MB. Free memory was 69.4MB in the beginning and 67.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:54:46,301 INFO L158 Benchmark]: RCFGBuilder took 578.30ms. Allocated memory is still 104.9MB. Free memory was 66.9MB in the beginning and 78.7MB in the end (delta: -11.8MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. [2022-02-20 23:54:46,301 INFO L158 Benchmark]: TraceAbstraction took 52968.71ms. Allocated memory was 104.9MB in the beginning and 234.9MB in the end (delta: 130.0MB). Free memory was 78.7MB in the beginning and 89.6MB in the end (delta: -10.9MB). Peak memory consumption was 118.8MB. Max. memory is 16.1GB. [2022-02-20 23:54:46,307 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory is still 85.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 336.67ms. Allocated memory is still 104.9MB. Free memory was 67.1MB in the beginning and 71.5MB in the end (delta: -4.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.39ms. Allocated memory is still 104.9MB. Free memory was 71.5MB in the beginning and 69.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.28ms. Allocated memory is still 104.9MB. Free memory was 69.4MB in the beginning and 67.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 578.30ms. Allocated memory is still 104.9MB. Free memory was 66.9MB in the beginning and 78.7MB in the end (delta: -11.8MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. * TraceAbstraction took 52968.71ms. Allocated memory was 104.9MB in the beginning and 234.9MB in the end (delta: 130.0MB). Free memory was 78.7MB in the beginning and 89.6MB in the end (delta: -10.9MB). Peak memory consumption was 118.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:233) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 23:54:46,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-circular-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b2cf85bdf3ceca18f859bba09ed8bf6de8160130db2f8571365ac2bc4f0e30c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:54:47,888 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:54:47,899 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:54:47,932 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:54:47,932 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:54:47,935 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:54:47,936 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:54:47,939 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:54:47,941 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:54:47,944 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:54:47,945 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:54:47,946 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:54:47,946 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:54:47,947 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:54:47,948 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:54:47,952 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:54:47,953 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:54:47,953 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:54:47,955 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:54:47,959 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:54:47,960 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:54:47,960 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:54:47,961 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:54:47,962 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:54:47,967 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:54:47,967 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:54:47,967 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:54:47,969 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:54:47,969 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:54:47,969 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:54:47,970 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:54:47,970 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:54:47,971 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:54:47,972 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:54:47,973 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:54:47,973 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:54:47,974 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:54:47,974 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:54:47,974 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:54:47,975 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:54:47,975 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:54:47,976 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-02-20 23:54:48,004 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:54:48,004 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:54:48,005 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:54:48,005 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:54:48,006 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:54:48,006 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:54:48,007 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:54:48,007 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:54:48,007 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:54:48,007 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:54:48,008 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:54:48,008 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:54:48,008 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:54:48,008 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:54:48,009 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:54:48,009 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:54:48,009 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:54:48,009 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:54:48,009 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:54:48,009 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:54:48,009 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:54:48,010 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:54:48,010 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:54:48,010 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:54:48,010 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:54:48,010 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:54:48,010 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:54:48,011 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:54:48,011 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:54:48,011 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:54:48,011 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:54:48,011 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:54:48,012 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:54:48,012 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 5b2cf85bdf3ceca18f859bba09ed8bf6de8160130db2f8571365ac2bc4f0e30c [2022-02-20 23:54:48,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:54:48,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:54:48,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:54:48,295 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:54:48,296 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:54:48,297 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-circular-2.i [2022-02-20 23:54:48,345 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/633367867/1213492ca0ba470587f9bfe4869b05d0/FLAGef48e40aa [2022-02-20 23:54:48,782 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:54:48,783 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i [2022-02-20 23:54:48,793 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/633367867/1213492ca0ba470587f9bfe4869b05d0/FLAGef48e40aa [2022-02-20 23:54:48,804 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/633367867/1213492ca0ba470587f9bfe4869b05d0 [2022-02-20 23:54:48,806 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:54:48,807 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:54:48,809 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:54:48,809 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:54:48,811 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:54:48,812 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:54:48" (1/1) ... [2022-02-20 23:54:48,813 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@196396cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:48, skipping insertion in model container [2022-02-20 23:54:48,813 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:54:48" (1/1) ... [2022-02-20 23:54:48,817 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:54:48,850 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:54:49,120 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-circular-2.i[22391,22404] [2022-02-20 23:54:49,123 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-circular-2.i[22497,22510] [2022-02-20 23:54:49,127 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-circular-2.i[22622,22635] [2022-02-20 23:54:49,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:54:49,153 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:54:49,172 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-circular-2.i[22391,22404] [2022-02-20 23:54:49,173 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-circular-2.i[22497,22510] [2022-02-20 23:54:49,174 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-circular-2.i[22622,22635] [2022-02-20 23:54:49,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:54:49,198 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:54:49,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:49 WrapperNode [2022-02-20 23:54:49,199 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:54:49,199 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:54:49,199 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:54:49,199 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:54:49,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:49" (1/1) ... [2022-02-20 23:54:49,215 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:49" (1/1) ... [2022-02-20 23:54:49,242 INFO L137 Inliner]: procedures = 122, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 122 [2022-02-20 23:54:49,245 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:54:49,246 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:54:49,246 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:54:49,246 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:54:49,251 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:49" (1/1) ... [2022-02-20 23:54:49,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:49" (1/1) ... [2022-02-20 23:54:49,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:49" (1/1) ... [2022-02-20 23:54:49,267 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:49" (1/1) ... [2022-02-20 23:54:49,275 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:49" (1/1) ... [2022-02-20 23:54:49,278 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:49" (1/1) ... [2022-02-20 23:54:49,279 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:49" (1/1) ... [2022-02-20 23:54:49,281 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:54:49,282 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:54:49,282 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:54:49,282 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:54:49,282 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:49" (1/1) ... [2022-02-20 23:54:49,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:54:49,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:54:49,305 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:54:49,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:54:49,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 23:54:49,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:54:49,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:54:49,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:54:49,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:54:49,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:54:49,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 23:54:49,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 23:54:49,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:54:49,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:54:49,423 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:54:49,424 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:54:49,793 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:54:49,799 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:54:49,799 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2022-02-20 23:54:49,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:54:49 BoogieIcfgContainer [2022-02-20 23:54:49,800 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:54:49,802 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:54:49,802 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:54:49,803 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:54:49,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:54:48" (1/3) ... [2022-02-20 23:54:49,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20eaa344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:54:49, skipping insertion in model container [2022-02-20 23:54:49,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:49" (2/3) ... [2022-02-20 23:54:49,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20eaa344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:54:49, skipping insertion in model container [2022-02-20 23:54:49,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:54:49" (3/3) ... [2022-02-20 23:54:49,807 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-circular-2.i [2022-02-20 23:54:49,811 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:54:49,811 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2022-02-20 23:54:49,843 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:54:49,848 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:54:49,849 INFO L340 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2022-02-20 23:54:49,871 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 57 states have (on average 2.245614035087719) internal successors, (128), 109 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:49,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:54:49,875 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:49,875 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:54:49,875 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2022-02-20 23:54:49,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:49,880 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-02-20 23:54:49,887 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:54:49,888 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1379022803] [2022-02-20 23:54:49,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:49,888 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:54:49,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:54:49,890 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:54:49,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 23:54:49,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:49,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:54:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:49,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:54:50,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:54:50,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {113#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(17bv32, 2bv32); {113#true} is VALID [2022-02-20 23:54:50,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {113#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12bv32);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; {121#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:54:50,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {121#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~head~0#1.base]); {114#false} is VALID [2022-02-20 23:54:50,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:50,028 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:54:50,029 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:54:50,029 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1379022803] [2022-02-20 23:54:50,030 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1379022803] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:50,030 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:50,030 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:54:50,031 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075056445] [2022-02-20 23:54:50,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:50,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:54:50,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:50,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:50,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:50,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:54:50,045 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:54:50,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:54:50,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:54:50,060 INFO L87 Difference]: Start difference. First operand has 110 states, 57 states have (on average 2.245614035087719) internal successors, (128), 109 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:50,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:50,360 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2022-02-20 23:54:50,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:54:50,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:54:50,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:50,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:50,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2022-02-20 23:54:50,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:50,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2022-02-20 23:54:50,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 140 transitions. [2022-02-20 23:54:50,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:50,525 INFO L225 Difference]: With dead ends: 115 [2022-02-20 23:54:50,525 INFO L226 Difference]: Without dead ends: 113 [2022-02-20 23:54:50,526 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:54:50,528 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 93 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:50,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 78 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:54:50,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-02-20 23:54:50,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2022-02-20 23:54:50,548 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:50,549 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 103 states, 56 states have (on average 1.9464285714285714) internal successors, (109), 102 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:50,549 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 103 states, 56 states have (on average 1.9464285714285714) internal successors, (109), 102 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:50,550 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 103 states, 56 states have (on average 1.9464285714285714) internal successors, (109), 102 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:50,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:50,554 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2022-02-20 23:54:50,554 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2022-02-20 23:54:50,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:50,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:50,555 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 56 states have (on average 1.9464285714285714) internal successors, (109), 102 states have internal predecessors, (109), 0 states have call successors, (0), 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 113 states. [2022-02-20 23:54:50,556 INFO L87 Difference]: Start difference. First operand has 103 states, 56 states have (on average 1.9464285714285714) internal successors, (109), 102 states have internal predecessors, (109), 0 states have call successors, (0), 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 113 states. [2022-02-20 23:54:50,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:50,559 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2022-02-20 23:54:50,559 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2022-02-20 23:54:50,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:50,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:50,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:50,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:50,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 56 states have (on average 1.9464285714285714) internal successors, (109), 102 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:50,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2022-02-20 23:54:50,564 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 109 transitions. Word has length 3 [2022-02-20 23:54:50,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:50,564 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 109 transitions. [2022-02-20 23:54:50,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:50,564 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2022-02-20 23:54:50,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:54:50,565 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:50,565 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:54:50,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 23:54:50,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:54:50,770 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2022-02-20 23:54:50,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:50,771 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-20 23:54:50,771 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:54:50,771 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1675820674] [2022-02-20 23:54:50,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:50,772 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:54:50,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:54:50,773 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:54:50,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 23:54:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:50,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:54:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:50,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:54:50,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:54:50,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {568#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(17bv32, 2bv32); {568#true} is VALID [2022-02-20 23:54:50,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {568#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12bv32);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; {576#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) (_ bv12 32)) (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:54:50,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {576#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) (_ bv12 32)) (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|))} assume !((~bvule32(~bvadd32(4bv32, main_~head~0#1.offset), #length[main_~head~0#1.base]) && ~bvule32(main_~head~0#1.offset, ~bvadd32(4bv32, main_~head~0#1.offset))) && ~bvule32(0bv32, main_~head~0#1.offset)); {569#false} is VALID [2022-02-20 23:54:50,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:50,864 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:54:50,864 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:54:50,865 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1675820674] [2022-02-20 23:54:50,865 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1675820674] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:50,865 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:50,865 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:54:50,865 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558347005] [2022-02-20 23:54:50,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:50,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:54:50,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:50,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:50,871 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:50,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:54:50,871 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:54:50,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:54:50,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:54:50,872 INFO L87 Difference]: Start difference. First operand 103 states and 109 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:51,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:51,191 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2022-02-20 23:54:51,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:54:51,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:54:51,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:51,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:51,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2022-02-20 23:54:51,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:51,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2022-02-20 23:54:51,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 121 transitions. [2022-02-20 23:54:51,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:51,328 INFO L225 Difference]: With dead ends: 110 [2022-02-20 23:54:51,328 INFO L226 Difference]: Without dead ends: 110 [2022-02-20 23:54:51,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:54:51,329 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 90 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:51,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 78 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:54:51,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-02-20 23:54:51,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 98. [2022-02-20 23:54:51,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:51,340 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 98 states, 56 states have (on average 1.8571428571428572) internal successors, (104), 97 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:51,341 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 98 states, 56 states have (on average 1.8571428571428572) internal successors, (104), 97 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:51,341 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 98 states, 56 states have (on average 1.8571428571428572) internal successors, (104), 97 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:51,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:51,350 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2022-02-20 23:54:51,350 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 116 transitions. [2022-02-20 23:54:51,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:51,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:51,352 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 56 states have (on average 1.8571428571428572) internal successors, (104), 97 states have internal predecessors, (104), 0 states have call successors, (0), 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 110 states. [2022-02-20 23:54:51,353 INFO L87 Difference]: Start difference. First operand has 98 states, 56 states have (on average 1.8571428571428572) internal successors, (104), 97 states have internal predecessors, (104), 0 states have call successors, (0), 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 110 states. [2022-02-20 23:54:51,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:51,358 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2022-02-20 23:54:51,363 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 116 transitions. [2022-02-20 23:54:51,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:51,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:51,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:51,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:51,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 56 states have (on average 1.8571428571428572) internal successors, (104), 97 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:51,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2022-02-20 23:54:51,372 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 3 [2022-02-20 23:54:51,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:51,373 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2022-02-20 23:54:51,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:51,373 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2022-02-20 23:54:51,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:54:51,374 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:51,374 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:51,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:54:51,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:54:51,588 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2022-02-20 23:54:51,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:51,589 INFO L85 PathProgramCache]: Analyzing trace with hash 59261800, now seen corresponding path program 1 times [2022-02-20 23:54:51,589 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:54:51,589 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1434083096] [2022-02-20 23:54:51,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:51,590 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:54:51,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:54:51,591 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:54:51,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 23:54:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:51,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:54:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:51,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:54:51,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:54:51,685 INFO L290 TraceCheckUtils]: 0: Hoare triple {1007#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(17bv32, 2bv32); {1007#true} is VALID [2022-02-20 23:54:51,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {1007#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12bv32);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; {1015#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:54:51,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {1015#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4bv32); srcloc: L998 {1015#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:54:51,688 INFO L290 TraceCheckUtils]: 3: Hoare triple {1015#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~head~0#1.base, ~bvadd32(4bv32, main_~head~0#1.offset), 4bv32); srcloc: L998-1 {1015#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:54:51,688 INFO L290 TraceCheckUtils]: 4: Hoare triple {1015#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} SUMMARY for call write~intINTTYPE4(0bv32, main_~head~0#1.base, ~bvadd32(8bv32, main_~head~0#1.offset), 4bv32); srcloc: L999 {1015#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:54:51,689 INFO L290 TraceCheckUtils]: 5: Hoare triple {1015#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~state~0#1 := 1bv32; {1028#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:54:51,689 INFO L290 TraceCheckUtils]: 6: Hoare triple {1028#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))} assume !(0bv32 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {1028#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:54:51,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {1028#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~x~0#1.base]); {1008#false} is VALID [2022-02-20 23:54:51,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:51,690 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:54:51,690 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:54:51,690 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1434083096] [2022-02-20 23:54:51,690 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1434083096] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:51,690 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:51,691 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:54:51,691 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940654323] [2022-02-20 23:54:51,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:51,691 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:54:51,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:51,692 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:51,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:51,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:54:51,700 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:54:51,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:54:51,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:54:51,701 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:52,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:52,075 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2022-02-20 23:54:52,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:54:52,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:54:52,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:52,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:52,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 115 transitions. [2022-02-20 23:54:52,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:52,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 115 transitions. [2022-02-20 23:54:52,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 115 transitions. [2022-02-20 23:54:52,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:52,178 INFO L225 Difference]: With dead ends: 95 [2022-02-20 23:54:52,178 INFO L226 Difference]: Without dead ends: 95 [2022-02-20 23:54:52,178 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:54:52,179 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 146 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:52,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 52 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:54:52,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-02-20 23:54:52,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 86. [2022-02-20 23:54:52,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:52,183 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 86 states, 56 states have (on average 1.6428571428571428) internal successors, (92), 85 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:52,184 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 86 states, 56 states have (on average 1.6428571428571428) internal successors, (92), 85 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:52,184 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 86 states, 56 states have (on average 1.6428571428571428) internal successors, (92), 85 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:52,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:52,186 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2022-02-20 23:54:52,186 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2022-02-20 23:54:52,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:52,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:52,187 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 56 states have (on average 1.6428571428571428) internal successors, (92), 85 states have internal predecessors, (92), 0 states have call successors, (0), 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 95 states. [2022-02-20 23:54:52,187 INFO L87 Difference]: Start difference. First operand has 86 states, 56 states have (on average 1.6428571428571428) internal successors, (92), 85 states have internal predecessors, (92), 0 states have call successors, (0), 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 95 states. [2022-02-20 23:54:52,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:52,189 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2022-02-20 23:54:52,189 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2022-02-20 23:54:52,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:52,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:52,190 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:52,190 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:52,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 56 states have (on average 1.6428571428571428) internal successors, (92), 85 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:52,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2022-02-20 23:54:52,192 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 8 [2022-02-20 23:54:52,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:52,192 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2022-02-20 23:54:52,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:52,192 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2022-02-20 23:54:52,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:54:52,193 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:52,193 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:52,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 23:54:52,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:54:52,401 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2022-02-20 23:54:52,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:52,401 INFO L85 PathProgramCache]: Analyzing trace with hash 59261801, now seen corresponding path program 1 times [2022-02-20 23:54:52,402 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:54:52,402 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [968142844] [2022-02-20 23:54:52,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:52,402 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:54:52,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:54:52,403 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:54:52,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 23:54:52,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:52,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:54:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:52,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:54:52,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:54:52,554 INFO L290 TraceCheckUtils]: 0: Hoare triple {1407#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(17bv32, 2bv32); {1407#true} is VALID [2022-02-20 23:54:52,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {1407#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12bv32);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; {1415#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) (_ bv12 32)) (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:54:52,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {1415#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) (_ bv12 32)) (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|))} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4bv32); srcloc: L998 {1415#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) (_ bv12 32)) (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:54:52,556 INFO L290 TraceCheckUtils]: 3: Hoare triple {1415#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) (_ bv12 32)) (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~head~0#1.base, ~bvadd32(4bv32, main_~head~0#1.offset), 4bv32); srcloc: L998-1 {1415#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) (_ bv12 32)) (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:54:52,557 INFO L290 TraceCheckUtils]: 4: Hoare triple {1415#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) (_ bv12 32)) (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|))} SUMMARY for call write~intINTTYPE4(0bv32, main_~head~0#1.base, ~bvadd32(8bv32, main_~head~0#1.offset), 4bv32); srcloc: L999 {1415#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) (_ bv12 32)) (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:54:52,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {1415#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) (_ bv12 32)) (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~state~0#1 := 1bv32; {1428#(and (= (select |#length| |ULTIMATE.start_main_~x~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:54:52,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {1428#(and (= (select |#length| |ULTIMATE.start_main_~x~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32)))} assume !(0bv32 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {1428#(and (= (select |#length| |ULTIMATE.start_main_~x~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:54:52,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {1428#(and (= (select |#length| |ULTIMATE.start_main_~x~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(8bv32, main_~x~0#1.offset)), #length[main_~x~0#1.base]) && ~bvule32(~bvadd32(8bv32, main_~x~0#1.offset), ~bvadd32(4bv32, ~bvadd32(8bv32, main_~x~0#1.offset)))) && ~bvule32(0bv32, ~bvadd32(8bv32, main_~x~0#1.offset))); {1408#false} is VALID [2022-02-20 23:54:52,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:52,559 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:54:52,559 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:54:52,559 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [968142844] [2022-02-20 23:54:52,559 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [968142844] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:52,559 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:52,559 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:54:52,559 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212231098] [2022-02-20 23:54:52,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:52,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:54:52,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:52,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:52,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:52,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:54:52,572 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:54:52,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:54:52,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:54:52,572 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:53,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:53,074 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2022-02-20 23:54:53,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:54:53,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:54:53,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:53,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:53,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2022-02-20 23:54:53,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:53,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2022-02-20 23:54:53,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 121 transitions. [2022-02-20 23:54:53,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:53,191 INFO L225 Difference]: With dead ends: 110 [2022-02-20 23:54:53,192 INFO L226 Difference]: Without dead ends: 110 [2022-02-20 23:54:53,192 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:54:53,193 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 100 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:53,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 97 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:54:53,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-02-20 23:54:53,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 94. [2022-02-20 23:54:53,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:53,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 94 states, 64 states have (on average 1.609375) internal successors, (103), 93 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:53,197 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 94 states, 64 states have (on average 1.609375) internal successors, (103), 93 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:53,197 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 94 states, 64 states have (on average 1.609375) internal successors, (103), 93 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:53,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:53,199 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2022-02-20 23:54:53,199 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2022-02-20 23:54:53,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:53,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:53,200 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 64 states have (on average 1.609375) internal successors, (103), 93 states have internal predecessors, (103), 0 states have call successors, (0), 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 110 states. [2022-02-20 23:54:53,200 INFO L87 Difference]: Start difference. First operand has 94 states, 64 states have (on average 1.609375) internal successors, (103), 93 states have internal predecessors, (103), 0 states have call successors, (0), 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 110 states. [2022-02-20 23:54:53,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:53,202 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2022-02-20 23:54:53,202 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2022-02-20 23:54:53,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:53,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:53,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:53,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:53,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 64 states have (on average 1.609375) internal successors, (103), 93 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:53,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2022-02-20 23:54:53,204 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 8 [2022-02-20 23:54:53,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:53,204 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2022-02-20 23:54:53,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:53,205 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2022-02-20 23:54:53,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:54:53,205 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:53,205 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:53,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 23:54:53,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:54:53,414 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2022-02-20 23:54:53,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:53,415 INFO L85 PathProgramCache]: Analyzing trace with hash 236809587, now seen corresponding path program 1 times [2022-02-20 23:54:53,415 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:54:53,415 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1503928373] [2022-02-20 23:54:53,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:53,415 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:54:53,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:54:53,416 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:54:53,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 23:54:53,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:53,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:54:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:53,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:54:53,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:54:53,522 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:54:53,539 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 17 treesize of output 9 [2022-02-20 23:54:53,544 INFO L290 TraceCheckUtils]: 0: Hoare triple {1860#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(17bv32, 2bv32); {1860#true} is VALID [2022-02-20 23:54:53,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {1860#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12bv32);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; {1860#true} is VALID [2022-02-20 23:54:53,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {1860#true} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4bv32); srcloc: L998 {1860#true} is VALID [2022-02-20 23:54:53,544 INFO L290 TraceCheckUtils]: 3: Hoare triple {1860#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~head~0#1.base, ~bvadd32(4bv32, main_~head~0#1.offset), 4bv32); srcloc: L998-1 {1860#true} is VALID [2022-02-20 23:54:53,544 INFO L290 TraceCheckUtils]: 4: Hoare triple {1860#true} SUMMARY for call write~intINTTYPE4(0bv32, main_~head~0#1.base, ~bvadd32(8bv32, main_~head~0#1.offset), 4bv32); srcloc: L999 {1860#true} is VALID [2022-02-20 23:54:53,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {1860#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~state~0#1 := 1bv32; {1860#true} is VALID [2022-02-20 23:54:53,546 INFO L290 TraceCheckUtils]: 6: Hoare triple {1860#true} assume !!(0bv32 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32); {1883#(= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:54:53,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {1883#(= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4bv32); srcloc: L1009 {1887#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (_ bv1 1))} is VALID [2022-02-20 23:54:53,547 INFO L290 TraceCheckUtils]: 8: Hoare triple {1887#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (_ bv1 1))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1887#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (_ bv1 1))} is VALID [2022-02-20 23:54:53,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {1887#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (_ bv1 1))} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4bv32); srcloc: L1010 {1894#(= (select |#valid| |ULTIMATE.start_main_#t~mem4#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:54:53,548 INFO L290 TraceCheckUtils]: 10: Hoare triple {1894#(= (select |#valid| |ULTIMATE.start_main_#t~mem4#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_#t~mem4#1.base]); {1861#false} is VALID [2022-02-20 23:54:53,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:53,548 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:54:53,548 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:54:53,548 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1503928373] [2022-02-20 23:54:53,549 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1503928373] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:53,549 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:53,549 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:54:53,549 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761705688] [2022-02-20 23:54:53,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:53,549 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 23:54:53,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:53,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:53,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:53,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:54:53,560 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:54:53,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:54:53,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:54:53,561 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:54,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:54,169 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2022-02-20 23:54:54,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:54:54,170 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 23:54:54,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:54,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:54,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2022-02-20 23:54:54,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:54,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2022-02-20 23:54:54,172 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 92 transitions. [2022-02-20 23:54:54,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:54,246 INFO L225 Difference]: With dead ends: 93 [2022-02-20 23:54:54,246 INFO L226 Difference]: Without dead ends: 93 [2022-02-20 23:54:54,246 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:54:54,247 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 9 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:54,247 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 221 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:54:54,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-02-20 23:54:54,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-02-20 23:54:54,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:54,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 64 states have (on average 1.578125) internal successors, (101), 92 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:54,250 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 64 states have (on average 1.578125) internal successors, (101), 92 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:54,250 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 64 states have (on average 1.578125) internal successors, (101), 92 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:54,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:54,252 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2022-02-20 23:54:54,252 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2022-02-20 23:54:54,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:54,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:54,252 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 64 states have (on average 1.578125) internal successors, (101), 92 states have internal predecessors, (101), 0 states have call successors, (0), 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 93 states. [2022-02-20 23:54:54,253 INFO L87 Difference]: Start difference. First operand has 93 states, 64 states have (on average 1.578125) internal successors, (101), 92 states have internal predecessors, (101), 0 states have call successors, (0), 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 93 states. [2022-02-20 23:54:54,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:54,254 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2022-02-20 23:54:54,254 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2022-02-20 23:54:54,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:54,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:54,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:54,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:54,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 64 states have (on average 1.578125) internal successors, (101), 92 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:54,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2022-02-20 23:54:54,256 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 11 [2022-02-20 23:54:54,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:54,257 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2022-02-20 23:54:54,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:54,257 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2022-02-20 23:54:54,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:54:54,257 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:54,257 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:54,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 23:54:54,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:54:54,474 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2022-02-20 23:54:54,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:54,475 INFO L85 PathProgramCache]: Analyzing trace with hash 236809588, now seen corresponding path program 1 times [2022-02-20 23:54:54,475 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:54:54,475 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1290090110] [2022-02-20 23:54:54,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:54,475 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:54:54,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:54:54,476 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:54:54,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 23:54:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:54,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 23:54:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:54,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:54:54,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:54:54,596 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:54:54,603 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:54:54,643 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 17 treesize of output 9 [2022-02-20 23:54:54,652 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 23:54:54,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {2273#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(17bv32, 2bv32); {2273#true} is VALID [2022-02-20 23:54:54,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {2273#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12bv32);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; {2273#true} is VALID [2022-02-20 23:54:54,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {2273#true} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4bv32); srcloc: L998 {2273#true} is VALID [2022-02-20 23:54:54,665 INFO L290 TraceCheckUtils]: 3: Hoare triple {2273#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~head~0#1.base, ~bvadd32(4bv32, main_~head~0#1.offset), 4bv32); srcloc: L998-1 {2273#true} is VALID [2022-02-20 23:54:54,665 INFO L290 TraceCheckUtils]: 4: Hoare triple {2273#true} SUMMARY for call write~intINTTYPE4(0bv32, main_~head~0#1.base, ~bvadd32(8bv32, main_~head~0#1.offset), 4bv32); srcloc: L999 {2273#true} is VALID [2022-02-20 23:54:54,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {2273#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~state~0#1 := 1bv32; {2273#true} is VALID [2022-02-20 23:54:54,666 INFO L290 TraceCheckUtils]: 6: Hoare triple {2273#true} assume !!(0bv32 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32); {2296#(and (= (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_#t~malloc3#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:54:54,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {2296#(and (= (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_#t~malloc3#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4bv32); srcloc: L1009 {2300#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:54:54,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {2300#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32)))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {2300#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:54:54,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {2300#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32)))} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4bv32); srcloc: L1010 {2307#(and (= |ULTIMATE.start_main_#t~mem4#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_#t~mem4#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:54:54,669 INFO L290 TraceCheckUtils]: 10: Hoare triple {2307#(and (= |ULTIMATE.start_main_#t~mem4#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_#t~mem4#1.base|) (_ bv12 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, main_#t~mem4#1.offset)), #length[main_#t~mem4#1.base]) && ~bvule32(~bvadd32(4bv32, main_#t~mem4#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, main_#t~mem4#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, main_#t~mem4#1.offset))); {2274#false} is VALID [2022-02-20 23:54:54,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:54,671 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:54:54,671 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:54:54,671 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1290090110] [2022-02-20 23:54:54,671 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1290090110] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:54,671 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:54,671 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:54:54,671 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540926083] [2022-02-20 23:54:54,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:54,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 23:54:54,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:54,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:54,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:54,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:54:54,685 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:54:54,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:54:54,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:54:54,686 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:55,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:55,400 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2022-02-20 23:54:55,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:54:55,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 23:54:55,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:55,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:55,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2022-02-20 23:54:55,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:55,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2022-02-20 23:54:55,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 91 transitions. [2022-02-20 23:54:55,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:55,472 INFO L225 Difference]: With dead ends: 92 [2022-02-20 23:54:55,472 INFO L226 Difference]: Without dead ends: 92 [2022-02-20 23:54:55,473 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:54:55,473 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 4 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:55,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 216 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:54:55,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-02-20 23:54:55,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-02-20 23:54:55,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:55,479 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 92 states, 64 states have (on average 1.546875) internal successors, (99), 91 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:55,479 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 92 states, 64 states have (on average 1.546875) internal successors, (99), 91 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:55,479 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 92 states, 64 states have (on average 1.546875) internal successors, (99), 91 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:55,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:55,483 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2022-02-20 23:54:55,483 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2022-02-20 23:54:55,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:55,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:55,483 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 64 states have (on average 1.546875) internal successors, (99), 91 states have internal predecessors, (99), 0 states have call successors, (0), 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 92 states. [2022-02-20 23:54:55,484 INFO L87 Difference]: Start difference. First operand has 92 states, 64 states have (on average 1.546875) internal successors, (99), 91 states have internal predecessors, (99), 0 states have call successors, (0), 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 92 states. [2022-02-20 23:54:55,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:55,485 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2022-02-20 23:54:55,486 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2022-02-20 23:54:55,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:55,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:55,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:55,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:55,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 64 states have (on average 1.546875) internal successors, (99), 91 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:55,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2022-02-20 23:54:55,488 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 11 [2022-02-20 23:54:55,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:55,488 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2022-02-20 23:54:55,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:55,489 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2022-02-20 23:54:55,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:54:55,489 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:55,489 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:55,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-02-20 23:54:55,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:54:55,698 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 48 more)] === [2022-02-20 23:54:55,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:55,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1249789621, now seen corresponding path program 1 times [2022-02-20 23:54:55,699 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:54:55,699 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1914555478] [2022-02-20 23:54:55,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:55,699 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:54:55,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:54:55,700 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:54:55,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process