./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-circular-1.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/sll-circular-1.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 6c54160550402a2cf6139371c972b70bfa4a53acf207c90f67eed3e784812b38 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:54:57,835 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:54:57,836 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:54:57,884 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:54:57,884 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:54:57,887 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:54:57,888 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:54:57,890 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:54:57,892 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:54:57,895 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:54:57,896 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:54:57,897 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:54:57,897 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:54:57,898 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:54:57,899 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:54:57,902 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:54:57,902 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:54:57,903 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:54:57,904 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:54:57,909 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:54:57,909 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:54:57,910 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:54:57,911 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:54:57,912 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:54:57,916 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:54:57,917 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:54:57,917 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:54:57,918 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:54:57,918 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:54:57,919 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:54:57,919 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:54:57,920 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:54:57,921 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:54:57,922 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:54:57,922 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:54:57,923 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:54:57,923 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:54:57,923 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:54:57,923 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:54:57,924 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:54:57,924 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:54:57,926 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:54:57,951 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:54:57,952 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:54:57,952 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:54:57,952 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:54:57,953 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:54:57,953 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:54:57,953 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:54:57,954 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:54:57,954 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:54:57,954 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:54:57,955 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:54:57,955 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:54:57,955 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:54:57,955 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:54:57,955 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:54:57,956 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:54:57,956 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:54:57,956 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:54:57,956 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:54:57,956 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:54:57,956 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:54:57,957 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:54:57,957 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:54:57,957 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:54:57,957 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:54:57,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:54:57,957 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:54:57,958 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:54:57,959 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:54:57,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:54:57,959 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 -> 6c54160550402a2cf6139371c972b70bfa4a53acf207c90f67eed3e784812b38 [2022-02-20 23:54:58,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:54:58,173 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:54:58,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:54:58,177 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:54:58,177 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:54:58,178 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-circular-1.i [2022-02-20 23:54:58,244 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43f5ac055/8b06934b3d8f48c28f547dcac9887bea/FLAG48d19f89a [2022-02-20 23:54:58,594 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:54:58,595 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i [2022-02-20 23:54:58,614 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43f5ac055/8b06934b3d8f48c28f547dcac9887bea/FLAG48d19f89a [2022-02-20 23:54:58,623 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43f5ac055/8b06934b3d8f48c28f547dcac9887bea [2022-02-20 23:54:58,625 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:54:58,626 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:54:58,629 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:54:58,629 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:54:58,631 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:54:58,632 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:54:58" (1/1) ... [2022-02-20 23:54:58,633 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1497691e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:58, skipping insertion in model container [2022-02-20 23:54:58,633 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:54:58" (1/1) ... [2022-02-20 23:54:58,637 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:54:58,673 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:54:58,945 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i[22324,22337] [2022-02-20 23:54:58,949 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i[22430,22443] [2022-02-20 23:54:58,953 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i[22555,22568] [2022-02-20 23:54:58,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:54:58,970 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:54:58,999 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i[22324,22337] [2022-02-20 23:54:59,008 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i[22430,22443] [2022-02-20 23:54:59,011 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i[22555,22568] [2022-02-20 23:54:59,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:54:59,033 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:54:59,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:59 WrapperNode [2022-02-20 23:54:59,034 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:54:59,035 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:54:59,035 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:54:59,035 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:54:59,040 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:59" (1/1) ... [2022-02-20 23:54:59,048 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:59" (1/1) ... [2022-02-20 23:54:59,067 INFO L137 Inliner]: procedures = 119, calls = 28, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 119 [2022-02-20 23:54:59,071 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:54:59,071 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:54:59,071 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:54:59,072 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:54:59,077 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:59" (1/1) ... [2022-02-20 23:54:59,077 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:59" (1/1) ... [2022-02-20 23:54:59,085 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:59" (1/1) ... [2022-02-20 23:54:59,087 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:59" (1/1) ... [2022-02-20 23:54:59,097 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:59" (1/1) ... [2022-02-20 23:54:59,101 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:59" (1/1) ... [2022-02-20 23:54:59,102 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:59" (1/1) ... [2022-02-20 23:54:59,103 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:54:59,104 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:54:59,104 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:54:59,104 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:54:59,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:59" (1/1) ... [2022-02-20 23:54:59,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:54:59,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:54:59,126 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:59,133 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:59,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:54:59,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:54:59,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:54:59,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:54:59,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:54:59,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:54:59,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:54:59,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:54:59,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:54:59,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:54:59,212 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:54:59,214 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:54:59,516 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:54:59,521 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:54:59,521 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2022-02-20 23:54:59,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:54:59 BoogieIcfgContainer [2022-02-20 23:54:59,523 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:54:59,524 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:54:59,524 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:54:59,526 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:54:59,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:54:58" (1/3) ... [2022-02-20 23:54:59,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a7fdf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:54:59, skipping insertion in model container [2022-02-20 23:54:59,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:59" (2/3) ... [2022-02-20 23:54:59,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a7fdf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:54:59, skipping insertion in model container [2022-02-20 23:54:59,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:54:59" (3/3) ... [2022-02-20 23:54:59,529 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-circular-1.i [2022-02-20 23:54:59,532 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:54:59,532 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2022-02-20 23:54:59,560 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:54:59,564 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:59,565 INFO L340 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2022-02-20 23:54:59,576 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 55 states have (on average 2.1818181818181817) internal successors, (120), 101 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call 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:59,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:54:59,580 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:59,580 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:54:59,581 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:54:59,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:59,584 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-02-20 23:54:59,590 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:59,591 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386635422] [2022-02-20 23:54:59,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:59,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:59,727 INFO L290 TraceCheckUtils]: 0: Hoare triple {105#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); {105#true} is VALID [2022-02-20 23:54:59,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {105#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {107#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:54:59,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {107#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} assume !(1 == #valid[main_~head~0#1.base]); {106#false} is VALID [2022-02-20 23:54:59,730 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:59,731 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:59,731 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386635422] [2022-02-20 23:54:59,731 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386635422] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:59,732 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:59,732 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:54:59,733 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606376464] [2022-02-20 23:54:59,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:59,737 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:59,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:59,740 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:59,748 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:59,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:54:59,749 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:59,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:54:59,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:54:59,769 INFO L87 Difference]: Start difference. First operand has 102 states, 55 states have (on average 2.1818181818181817) internal successors, (120), 101 states have internal predecessors, (120), 0 states have call successors, (0), 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:59,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:59,935 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2022-02-20 23:54:59,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:54:59,936 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:59,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:59,937 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:59,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2022-02-20 23:54:59,961 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:59,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2022-02-20 23:54:59,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 132 transitions. [2022-02-20 23:55:00,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:00,059 INFO L225 Difference]: With dead ends: 108 [2022-02-20 23:55:00,060 INFO L226 Difference]: Without dead ends: 106 [2022-02-20 23:55:00,061 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:55:00,063 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 86 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:00,063 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 77 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:55:00,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-02-20 23:55:00,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 96. [2022-02-20 23:55:00,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:00,083 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 96 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 95 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:55:00,084 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 96 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 95 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:55:00,085 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 96 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 95 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:55:00,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:00,089 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2022-02-20 23:55:00,089 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2022-02-20 23:55:00,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:00,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:00,090 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 95 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 106 states. [2022-02-20 23:55:00,091 INFO L87 Difference]: Start difference. First operand has 96 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 95 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 106 states. [2022-02-20 23:55:00,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:00,094 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2022-02-20 23:55:00,095 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2022-02-20 23:55:00,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:00,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:00,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:00,096 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:00,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 95 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:55:00,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2022-02-20 23:55:00,099 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 3 [2022-02-20 23:55:00,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:00,100 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2022-02-20 23:55:00,100 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:55:00,100 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2022-02-20 23:55:00,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:55:00,100 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:00,100 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:55:00,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:55:00,101 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:00,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:00,101 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-20 23:55:00,102 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:00,102 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530658829] [2022-02-20 23:55:00,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:00,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:00,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {526#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); {526#true} is VALID [2022-02-20 23:55:00,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {526#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {528#(and (<= 8 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:55:00,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {528#(and (<= 8 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} assume !(4 + main_~head~0#1.offset <= #length[main_~head~0#1.base] && 0 <= main_~head~0#1.offset); {527#false} is VALID [2022-02-20 23:55:00,137 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:55:00,138 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:00,138 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530658829] [2022-02-20 23:55:00,138 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530658829] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:00,138 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:00,138 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:55:00,139 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217914850] [2022-02-20 23:55:00,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:00,140 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:55:00,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:00,140 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:55:00,143 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:55:00,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:55:00,143 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:00,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:55:00,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:55:00,144 INFO L87 Difference]: Start difference. First operand 96 states and 102 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:55:00,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:00,278 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2022-02-20 23:55:00,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:55:00,278 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:55:00,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:00,278 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:55:00,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2022-02-20 23:55:00,280 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:55:00,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2022-02-20 23:55:00,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 114 transitions. [2022-02-20 23:55:00,366 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:55:00,368 INFO L225 Difference]: With dead ends: 104 [2022-02-20 23:55:00,368 INFO L226 Difference]: Without dead ends: 104 [2022-02-20 23:55:00,369 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:55:00,369 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 84 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:00,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 77 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:55:00,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-02-20 23:55:00,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 92. [2022-02-20 23:55:00,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:00,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 92 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 91 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:00,374 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 92 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 91 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:00,374 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 92 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 91 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:00,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:00,376 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2022-02-20 23:55:00,376 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2022-02-20 23:55:00,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:00,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:00,377 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 91 states have internal predecessors, (98), 0 states have call successors, (0), 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 104 states. [2022-02-20 23:55:00,378 INFO L87 Difference]: Start difference. First operand has 92 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 91 states have internal predecessors, (98), 0 states have call successors, (0), 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 104 states. [2022-02-20 23:55:00,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:00,380 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2022-02-20 23:55:00,380 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2022-02-20 23:55:00,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:00,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:00,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:00,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:00,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 91 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:00,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2022-02-20 23:55:00,383 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 3 [2022-02-20 23:55:00,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:00,383 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2022-02-20 23:55:00,383 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:55:00,383 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2022-02-20 23:55:00,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:55:00,384 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:00,384 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:55:00,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:55:00,384 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:00,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:00,385 INFO L85 PathProgramCache]: Analyzing trace with hash 59263652, now seen corresponding path program 1 times [2022-02-20 23:55:00,385 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:00,385 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110805500] [2022-02-20 23:55:00,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:00,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:00,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:00,422 INFO L290 TraceCheckUtils]: 0: Hoare triple {935#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); {935#true} is VALID [2022-02-20 23:55:00,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {935#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {935#true} is VALID [2022-02-20 23:55:00,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {935#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: L997 {937#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:55:00,424 INFO L290 TraceCheckUtils]: 3: Hoare triple {937#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} SUMMARY for call write~int(0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {937#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:55:00,424 INFO L290 TraceCheckUtils]: 4: Hoare triple {937#(= (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; {938#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:55:00,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {938#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {938#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:55:00,425 INFO L290 TraceCheckUtils]: 6: Hoare triple {938#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {938#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:55:00,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {938#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !(1 == #valid[main_~x~0#1.base]); {936#false} is VALID [2022-02-20 23:55:00,425 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:55:00,426 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:00,426 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110805500] [2022-02-20 23:55:00,426 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110805500] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:00,426 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:00,426 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:55:00,426 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819511208] [2022-02-20 23:55:00,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:00,427 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:55:00,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:00,427 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:55:00,433 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:55:00,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:55:00,433 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:00,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:55:00,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:55:00,434 INFO L87 Difference]: Start difference. First operand 92 states and 98 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:55:00,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:00,607 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2022-02-20 23:55:00,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:55:00,608 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:55:00,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:00,608 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:55:00,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2022-02-20 23:55:00,618 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:55:00,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2022-02-20 23:55:00,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 109 transitions. [2022-02-20 23:55:00,733 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:55:00,736 INFO L225 Difference]: With dead ends: 90 [2022-02-20 23:55:00,736 INFO L226 Difference]: Without dead ends: 90 [2022-02-20 23:55:00,739 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:55:00,741 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 137 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:00,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 52 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:55:00,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-02-20 23:55:00,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 81. [2022-02-20 23:55:00,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:00,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 81 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 80 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:00,752 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 81 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 80 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:00,752 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 81 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 80 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:00,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:00,754 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2022-02-20 23:55:00,754 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2022-02-20 23:55:00,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:00,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:00,754 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 80 states have internal predecessors, (87), 0 states have call successors, (0), 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 90 states. [2022-02-20 23:55:00,755 INFO L87 Difference]: Start difference. First operand has 81 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 80 states have internal predecessors, (87), 0 states have call successors, (0), 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 90 states. [2022-02-20 23:55:00,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:00,756 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2022-02-20 23:55:00,756 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2022-02-20 23:55:00,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:00,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:00,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:00,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:00,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 80 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:00,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2022-02-20 23:55:00,759 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 8 [2022-02-20 23:55:00,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:00,759 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2022-02-20 23:55:00,761 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:55:00,761 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2022-02-20 23:55:00,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:55:00,762 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:00,762 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:55:00,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:55:00,762 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:00,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:00,763 INFO L85 PathProgramCache]: Analyzing trace with hash 59263653, now seen corresponding path program 1 times [2022-02-20 23:55:00,763 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:00,763 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548187528] [2022-02-20 23:55:00,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:00,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:00,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:00,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {1294#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); {1294#true} is VALID [2022-02-20 23:55:00,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {1294#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {1296#(and (<= 8 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:55:00,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {1296#(and (<= 8 (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: L997 {1296#(and (<= 8 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:55:00,880 INFO L290 TraceCheckUtils]: 3: Hoare triple {1296#(and (<= 8 (select |#length| |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, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {1296#(and (<= 8 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:55:00,881 INFO L290 TraceCheckUtils]: 4: Hoare triple {1296#(and (<= 8 (select |#length| |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; {1297#(and (<= 8 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} is VALID [2022-02-20 23:55:00,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {1297#(and (<= 8 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1297#(and (<= 8 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} is VALID [2022-02-20 23:55:00,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {1297#(and (<= 8 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {1297#(and (<= 8 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} is VALID [2022-02-20 23:55:00,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {1297#(and (<= 8 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} assume !(4 + (4 + main_~x~0#1.offset) <= #length[main_~x~0#1.base] && 0 <= 4 + main_~x~0#1.offset); {1295#false} is VALID [2022-02-20 23:55:00,882 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:55:00,883 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:00,883 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548187528] [2022-02-20 23:55:00,883 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548187528] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:00,883 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:00,883 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:55:00,883 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014034139] [2022-02-20 23:55:00,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:00,883 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:55:00,884 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:00,884 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:55:00,890 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:55:00,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:55:00,890 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:00,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:55:00,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:55:00,891 INFO L87 Difference]: Start difference. First operand 81 states and 87 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:55:01,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:01,106 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2022-02-20 23:55:01,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:55:01,106 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:55:01,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:01,106 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:55:01,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-02-20 23:55:01,108 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:55:01,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-02-20 23:55:01,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 111 transitions. [2022-02-20 23:55:01,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:01,190 INFO L225 Difference]: With dead ends: 101 [2022-02-20 23:55:01,190 INFO L226 Difference]: Without dead ends: 101 [2022-02-20 23:55:01,190 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:55:01,191 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 87 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:01,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 97 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:55:01,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-02-20 23:55:01,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87. [2022-02-20 23:55:01,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:01,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 87 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 86 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:55:01,198 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 87 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 86 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:55:01,198 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 87 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 86 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:55:01,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:01,200 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2022-02-20 23:55:01,200 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2022-02-20 23:55:01,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:01,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:01,201 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 86 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 101 states. [2022-02-20 23:55:01,201 INFO L87 Difference]: Start difference. First operand has 87 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 86 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 101 states. [2022-02-20 23:55:01,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:01,203 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2022-02-20 23:55:01,203 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2022-02-20 23:55:01,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:01,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:01,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:01,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:01,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 86 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:55:01,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2022-02-20 23:55:01,206 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 8 [2022-02-20 23:55:01,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:01,206 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2022-02-20 23:55:01,206 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:55:01,206 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2022-02-20 23:55:01,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:55:01,207 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:01,207 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:55:01,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:55:01,207 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:01,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:01,208 INFO L85 PathProgramCache]: Analyzing trace with hash 460324999, now seen corresponding path program 1 times [2022-02-20 23:55:01,208 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:01,208 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817990842] [2022-02-20 23:55:01,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:01,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:01,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {1692#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); {1692#true} is VALID [2022-02-20 23:55:01,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {1692#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {1694#(and (not (= |ULTIMATE.start_main_~head~0#1.base| 0)) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:55:01,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {1694#(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: L997 {1695#(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:55:01,315 INFO L290 TraceCheckUtils]: 3: Hoare triple {1695#(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, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {1695#(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:55:01,316 INFO L290 TraceCheckUtils]: 4: Hoare triple {1695#(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; {1696#(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| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} is VALID [2022-02-20 23:55:01,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {1696#(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| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1696#(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| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} is VALID [2022-02-20 23:55:01,317 INFO L290 TraceCheckUtils]: 6: Hoare triple {1696#(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| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {1696#(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| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} is VALID [2022-02-20 23:55:01,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {1696#(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| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1004-3 {1697#(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:55:01,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {1697#(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~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1025 {1698#(not (= |ULTIMATE.start_main_#t~mem6#1.base| 0))} is VALID [2022-02-20 23:55:01,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {1698#(not (= |ULTIMATE.start_main_#t~mem6#1.base| 0))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {1699#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} is VALID [2022-02-20 23:55:01,319 INFO L290 TraceCheckUtils]: 10: Hoare triple {1699#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} assume !(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {1693#false} is VALID [2022-02-20 23:55:01,319 INFO L290 TraceCheckUtils]: 11: Hoare triple {1693#false} assume !false; {1693#false} is VALID [2022-02-20 23:55:01,320 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:55:01,320 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:01,320 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817990842] [2022-02-20 23:55:01,320 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817990842] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:01,320 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:01,321 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:55:01,321 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444112585] [2022-02-20 23:55:01,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:01,321 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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:55:01,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:01,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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:55:01,336 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:55:01,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:55:01,336 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:01,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:55:01,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:55:01,337 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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:55:01,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:01,819 INFO L93 Difference]: Finished difference Result 170 states and 181 transitions. [2022-02-20 23:55:01,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:55:01,819 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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:55:01,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:01,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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:55:01,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 182 transitions. [2022-02-20 23:55:01,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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:55:01,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 182 transitions. [2022-02-20 23:55:01,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 182 transitions. [2022-02-20 23:55:01,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:01,944 INFO L225 Difference]: With dead ends: 170 [2022-02-20 23:55:01,944 INFO L226 Difference]: Without dead ends: 170 [2022-02-20 23:55:01,945 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 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:55:01,945 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 316 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:01,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [316 Valid, 295 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:55:01,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-02-20 23:55:01,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 90. [2022-02-20 23:55:01,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:01,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand has 90 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 89 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:01,948 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand has 90 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 89 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:01,948 INFO L87 Difference]: Start difference. First operand 170 states. Second operand has 90 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 89 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:01,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:01,951 INFO L93 Difference]: Finished difference Result 170 states and 181 transitions. [2022-02-20 23:55:01,951 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 181 transitions. [2022-02-20 23:55:01,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:01,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:01,951 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 89 states have internal predecessors, (97), 0 states have call successors, (0), 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 170 states. [2022-02-20 23:55:01,952 INFO L87 Difference]: Start difference. First operand has 90 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 89 states have internal predecessors, (97), 0 states have call successors, (0), 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 170 states. [2022-02-20 23:55:01,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:01,954 INFO L93 Difference]: Finished difference Result 170 states and 181 transitions. [2022-02-20 23:55:01,955 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 181 transitions. [2022-02-20 23:55:01,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:01,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:01,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:01,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:01,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 89 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:01,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2022-02-20 23:55:01,957 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 12 [2022-02-20 23:55:01,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:01,957 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2022-02-20 23:55:01,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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:55:01,958 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2022-02-20 23:55:01,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:55:01,958 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:01,958 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:55:01,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:55:01,958 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:01,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:01,959 INFO L85 PathProgramCache]: Analyzing trace with hash 467003055, now seen corresponding path program 1 times [2022-02-20 23:55:01,959 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:01,959 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210874572] [2022-02-20 23:55:01,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:01,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:02,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {2312#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); {2312#true} is VALID [2022-02-20 23:55:02,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {2312#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {2312#true} is VALID [2022-02-20 23:55:02,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {2312#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: L997 {2312#true} is VALID [2022-02-20 23:55:02,011 INFO L290 TraceCheckUtils]: 3: Hoare triple {2312#true} SUMMARY for call write~int(0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {2312#true} is VALID [2022-02-20 23:55:02,011 INFO L290 TraceCheckUtils]: 4: Hoare triple {2312#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; {2312#true} is VALID [2022-02-20 23:55:02,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {2312#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {2312#true} is VALID [2022-02-20 23:55:02,012 INFO L290 TraceCheckUtils]: 6: Hoare triple {2312#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(8); {2314#(= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1)} is VALID [2022-02-20 23:55:02,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {2314#(= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1)} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1007 {2315#(= (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:55:02,013 INFO L290 TraceCheckUtils]: 8: Hoare triple {2315#(= (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; {2315#(= (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:55:02,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {2315#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1008 {2316#(= (select |#valid| |ULTIMATE.start_main_#t~mem4#1.base|) 1)} is VALID [2022-02-20 23:55:02,014 INFO L290 TraceCheckUtils]: 10: Hoare triple {2316#(= (select |#valid| |ULTIMATE.start_main_#t~mem4#1.base|) 1)} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem4#1.base, main_#t~mem4#1.offset;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {2317#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:55:02,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {2317#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !(1 == #valid[main_~x~0#1.base]); {2313#false} is VALID [2022-02-20 23:55:02,015 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:55:02,015 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:02,015 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210874572] [2022-02-20 23:55:02,015 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210874572] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:02,015 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:02,015 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:55:02,016 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803470865] [2022-02-20 23:55:02,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:02,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 23:55:02,016 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:02,016 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:02,024 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:55:02,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:55:02,025 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:02,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:55:02,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:55:02,026 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:02,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:02,371 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2022-02-20 23:55:02,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:55:02,371 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 23:55:02,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:02,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:02,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2022-02-20 23:55:02,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:02,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2022-02-20 23:55:02,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 92 transitions. [2022-02-20 23:55:02,431 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:55:02,432 INFO L225 Difference]: With dead ends: 89 [2022-02-20 23:55:02,432 INFO L226 Difference]: Without dead ends: 89 [2022-02-20 23:55:02,432 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:55:02,433 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 60 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:02,433 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 183 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:55:02,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-02-20 23:55:02,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-02-20 23:55:02,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:02,435 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 89 states, 63 states have (on average 1.5238095238095237) internal successors, (96), 88 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:02,436 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 89 states, 63 states have (on average 1.5238095238095237) internal successors, (96), 88 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:02,436 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 89 states, 63 states have (on average 1.5238095238095237) internal successors, (96), 88 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:02,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:02,437 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2022-02-20 23:55:02,437 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2022-02-20 23:55:02,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:02,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:02,437 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 63 states have (on average 1.5238095238095237) internal successors, (96), 88 states have internal predecessors, (96), 0 states have call successors, (0), 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 89 states. [2022-02-20 23:55:02,438 INFO L87 Difference]: Start difference. First operand has 89 states, 63 states have (on average 1.5238095238095237) internal successors, (96), 88 states have internal predecessors, (96), 0 states have call successors, (0), 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 89 states. [2022-02-20 23:55:02,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:02,439 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2022-02-20 23:55:02,439 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2022-02-20 23:55:02,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:02,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:02,439 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:02,439 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:02,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 63 states have (on average 1.5238095238095237) internal successors, (96), 88 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:02,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2022-02-20 23:55:02,441 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 12 [2022-02-20 23:55:02,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:02,441 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2022-02-20 23:55:02,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:02,442 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2022-02-20 23:55:02,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:55:02,442 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:02,442 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:55:02,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:55:02,442 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:02,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:02,443 INFO L85 PathProgramCache]: Analyzing trace with hash 467003056, now seen corresponding path program 1 times [2022-02-20 23:55:02,443 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:02,443 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848643244] [2022-02-20 23:55:02,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:02,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:02,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {2684#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); {2684#true} is VALID [2022-02-20 23:55:02,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {2684#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {2684#true} is VALID [2022-02-20 23:55:02,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {2684#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: L997 {2684#true} is VALID [2022-02-20 23:55:02,512 INFO L290 TraceCheckUtils]: 3: Hoare triple {2684#true} SUMMARY for call write~int(0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {2684#true} is VALID [2022-02-20 23:55:02,513 INFO L290 TraceCheckUtils]: 4: Hoare triple {2684#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; {2684#true} is VALID [2022-02-20 23:55:02,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {2684#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {2684#true} is VALID [2022-02-20 23:55:02,513 INFO L290 TraceCheckUtils]: 6: Hoare triple {2684#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(8); {2686#(and (= |ULTIMATE.start_main_#t~malloc3#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|) 8))} is VALID [2022-02-20 23:55:02,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {2686#(and (= |ULTIMATE.start_main_#t~malloc3#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|) 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: L1007 {2687#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8))} is VALID [2022-02-20 23:55:02,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {2687#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {2687#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8))} is VALID [2022-02-20 23:55:02,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {2687#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8))} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1008 {2688#(and (= 8 (select |#length| |ULTIMATE.start_main_#t~mem4#1.base|)) (= |ULTIMATE.start_main_#t~mem4#1.offset| 0))} is VALID [2022-02-20 23:55:02,516 INFO L290 TraceCheckUtils]: 10: Hoare triple {2688#(and (= 8 (select |#length| |ULTIMATE.start_main_#t~mem4#1.base|)) (= |ULTIMATE.start_main_#t~mem4#1.offset| 0))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem4#1.base, main_#t~mem4#1.offset;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {2689#(and (= (+ (select |#length| |ULTIMATE.start_main_~x~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} is VALID [2022-02-20 23:55:02,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {2689#(and (= (+ (select |#length| |ULTIMATE.start_main_~x~0#1.base|) (- 8)) 0) (= |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); {2685#false} is VALID [2022-02-20 23:55:02,516 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:55:02,516 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:02,517 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848643244] [2022-02-20 23:55:02,517 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848643244] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:02,517 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:02,517 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:55:02,517 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934110325] [2022-02-20 23:55:02,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:02,518 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 23:55:02,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:02,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:02,525 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:55:02,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:55:02,525 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:02,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:55:02,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:55:02,526 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:02,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:02,933 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2022-02-20 23:55:02,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:55:02,934 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 23:55:02,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:02,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:02,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 96 transitions. [2022-02-20 23:55:02,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:02,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 96 transitions. [2022-02-20 23:55:02,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 96 transitions. [2022-02-20 23:55:02,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:02,997 INFO L225 Difference]: With dead ends: 85 [2022-02-20 23:55:02,997 INFO L226 Difference]: Without dead ends: 85 [2022-02-20 23:55:02,997 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:55:03,000 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 22 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 238 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:55:03,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 238 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:55:03,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-02-20 23:55:03,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2022-02-20 23:55:03,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:03,003 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 81 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 80 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:03,004 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 81 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 80 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:03,004 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 81 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 80 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:03,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:03,005 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2022-02-20 23:55:03,005 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2022-02-20 23:55:03,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:03,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:03,006 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 80 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 85 states. [2022-02-20 23:55:03,006 INFO L87 Difference]: Start difference. First operand has 81 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 80 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 85 states. [2022-02-20 23:55:03,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:03,007 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2022-02-20 23:55:03,007 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2022-02-20 23:55:03,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:03,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:03,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:03,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:03,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 80 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:03,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2022-02-20 23:55:03,009 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 12 [2022-02-20 23:55:03,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:03,010 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2022-02-20 23:55:03,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:03,010 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2022-02-20 23:55:03,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:55:03,010 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:03,010 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:55:03,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 23:55:03,011 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:03,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:03,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1385177244, now seen corresponding path program 1 times [2022-02-20 23:55:03,013 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:03,013 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202116913] [2022-02-20 23:55:03,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:03,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:03,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {3040#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); {3040#true} is VALID [2022-02-20 23:55:03,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {3040#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {3042#(= |ULTIMATE.start_main_~head~0#1.offset| 0)} is VALID [2022-02-20 23:55:03,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {3042#(= |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: L997 {3043#(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:55:03,126 INFO L290 TraceCheckUtils]: 3: Hoare triple {3043#(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, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {3043#(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:55:03,127 INFO L290 TraceCheckUtils]: 4: Hoare triple {3043#(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; {3044#(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| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} is VALID [2022-02-20 23:55:03,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {3044#(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| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {3044#(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| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} is VALID [2022-02-20 23:55:03,127 INFO L290 TraceCheckUtils]: 6: Hoare triple {3044#(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| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {3044#(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| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} is VALID [2022-02-20 23:55:03,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {3044#(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| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1004-3 {3045#(= (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:55:03,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {3045#(= (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~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1025 {3046#(= (select |#valid| |ULTIMATE.start_main_#t~mem6#1.base|) 1)} is VALID [2022-02-20 23:55:03,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {3046#(= (select |#valid| |ULTIMATE.start_main_#t~mem6#1.base|) 1)} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {3047#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:55:03,129 INFO L290 TraceCheckUtils]: 10: Hoare triple {3047#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {3047#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:55:03,130 INFO L290 TraceCheckUtils]: 11: Hoare triple {3047#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} goto; {3047#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:55:03,130 INFO L290 TraceCheckUtils]: 12: Hoare triple {3047#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !(1 == #valid[main_~x~0#1.base]); {3041#false} is VALID [2022-02-20 23:55:03,130 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:55:03,130 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:03,130 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202116913] [2022-02-20 23:55:03,131 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202116913] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:03,131 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:03,131 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:55:03,131 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675895856] [2022-02-20 23:55:03,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:03,131 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) 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:55:03,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:03,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.8571428571428572) 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:55:03,147 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:55:03,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:55:03,147 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:03,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:55:03,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:55:03,148 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) 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:55:03,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:03,576 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2022-02-20 23:55:03,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:55:03,577 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) 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:55:03,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:03,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.8571428571428572) 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:55:03,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2022-02-20 23:55:03,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.8571428571428572) 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:55:03,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2022-02-20 23:55:03,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 134 transitions. [2022-02-20 23:55:03,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:03,648 INFO L225 Difference]: With dead ends: 124 [2022-02-20 23:55:03,648 INFO L226 Difference]: Without dead ends: 124 [2022-02-20 23:55:03,648 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 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:55:03,649 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 293 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:03,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [293 Valid, 200 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:55:03,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-02-20 23:55:03,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 83. [2022-02-20 23:55:03,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:03,651 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 83 states, 62 states have (on average 1.467741935483871) internal successors, (91), 82 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:03,651 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 83 states, 62 states have (on average 1.467741935483871) internal successors, (91), 82 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:03,651 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 83 states, 62 states have (on average 1.467741935483871) internal successors, (91), 82 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:03,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:03,653 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2022-02-20 23:55:03,653 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 133 transitions. [2022-02-20 23:55:03,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:03,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:03,653 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 62 states have (on average 1.467741935483871) internal successors, (91), 82 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 124 states. [2022-02-20 23:55:03,654 INFO L87 Difference]: Start difference. First operand has 83 states, 62 states have (on average 1.467741935483871) internal successors, (91), 82 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 124 states. [2022-02-20 23:55:03,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:03,655 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2022-02-20 23:55:03,655 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 133 transitions. [2022-02-20 23:55:03,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:03,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:03,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:03,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:03,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 62 states have (on average 1.467741935483871) internal successors, (91), 82 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:03,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2022-02-20 23:55:03,657 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 13 [2022-02-20 23:55:03,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:03,658 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2022-02-20 23:55:03,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) 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:55:03,658 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2022-02-20 23:55:03,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:55:03,658 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:03,658 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:55:03,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 23:55:03,659 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:03,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:03,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1385177245, now seen corresponding path program 1 times [2022-02-20 23:55:03,659 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:03,659 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265951493] [2022-02-20 23:55:03,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:03,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:03,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {3515#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); {3515#true} is VALID [2022-02-20 23:55:03,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {3515#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {3517#(and (<= 8 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:55:03,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {3517#(and (<= 8 (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: L997 {3518#(and (<= 8 (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:55:03,798 INFO L290 TraceCheckUtils]: 3: Hoare triple {3518#(and (<= 8 (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, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {3518#(and (<= 8 (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:55:03,798 INFO L290 TraceCheckUtils]: 4: Hoare triple {3518#(and (<= 8 (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; {3519#(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|) (<= 8 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:55:03,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {3519#(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|) (<= 8 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {3519#(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|) (<= 8 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:55:03,803 INFO L290 TraceCheckUtils]: 6: Hoare triple {3519#(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|) (<= 8 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {3519#(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|) (<= 8 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:55:03,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {3519#(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|) (<= 8 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~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, 4 + main_~x~0#1.offset, 4); srcloc: L1004-3 {3520#(and (<= 8 (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:55:03,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {3520#(and (<= 8 (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~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1025 {3521#(and (= |ULTIMATE.start_main_#t~mem6#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_#t~mem6#1.base|)))} is VALID [2022-02-20 23:55:03,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {3521#(and (= |ULTIMATE.start_main_#t~mem6#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_#t~mem6#1.base|)))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {3522#(and (<= 8 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} is VALID [2022-02-20 23:55:03,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {3522#(and (<= 8 (select |#length| |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); {3522#(and (<= 8 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} is VALID [2022-02-20 23:55:03,806 INFO L290 TraceCheckUtils]: 11: Hoare triple {3522#(and (<= 8 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} goto; {3522#(and (<= 8 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} is VALID [2022-02-20 23:55:03,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {3522#(and (<= 8 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} assume !(4 + (4 + main_~x~0#1.offset) <= #length[main_~x~0#1.base] && 0 <= 4 + main_~x~0#1.offset); {3516#false} is VALID [2022-02-20 23:55:03,806 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:55:03,806 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:03,807 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265951493] [2022-02-20 23:55:03,807 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265951493] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:03,807 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:03,807 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:55:03,807 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676597693] [2022-02-20 23:55:03,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:03,808 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) 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:55:03,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:03,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.8571428571428572) 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:55:03,817 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:55:03,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:55:03,818 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:03,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:55:03,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:55:03,818 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) 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:55:04,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:04,570 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2022-02-20 23:55:04,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:55:04,570 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) 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:55:04,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:04,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.8571428571428572) 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:55:04,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 174 transitions. [2022-02-20 23:55:04,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.8571428571428572) 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:55:04,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 174 transitions. [2022-02-20 23:55:04,574 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 174 transitions. [2022-02-20 23:55:04,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:04,684 INFO L225 Difference]: With dead ends: 158 [2022-02-20 23:55:04,685 INFO L226 Difference]: Without dead ends: 158 [2022-02-20 23:55:04,685 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 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:55:04,685 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 168 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:04,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 288 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:55:04,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-02-20 23:55:04,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 95. [2022-02-20 23:55:04,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:04,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand has 95 states, 74 states have (on average 1.472972972972973) internal successors, (109), 94 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:55:04,688 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand has 95 states, 74 states have (on average 1.472972972972973) internal successors, (109), 94 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:55:04,688 INFO L87 Difference]: Start difference. First operand 158 states. Second operand has 95 states, 74 states have (on average 1.472972972972973) internal successors, (109), 94 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:55:04,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:04,690 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2022-02-20 23:55:04,690 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2022-02-20 23:55:04,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:04,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:04,691 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 74 states have (on average 1.472972972972973) internal successors, (109), 94 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 158 states. [2022-02-20 23:55:04,691 INFO L87 Difference]: Start difference. First operand has 95 states, 74 states have (on average 1.472972972972973) internal successors, (109), 94 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 158 states. [2022-02-20 23:55:04,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:04,693 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2022-02-20 23:55:04,693 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2022-02-20 23:55:04,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:04,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:04,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:04,694 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:04,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 74 states have (on average 1.472972972972973) internal successors, (109), 94 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:55:04,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2022-02-20 23:55:04,695 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 13 [2022-02-20 23:55:04,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:04,695 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2022-02-20 23:55:04,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) 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:55:04,695 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2022-02-20 23:55:04,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:55:04,696 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:04,696 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:55:04,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 23:55:04,696 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:04,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:04,697 INFO L85 PathProgramCache]: Analyzing trace with hash -230426379, now seen corresponding path program 1 times [2022-02-20 23:55:04,697 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:04,697 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802679559] [2022-02-20 23:55:04,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:04,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:04,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:04,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {4102#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); {4102#true} is VALID [2022-02-20 23:55:04,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {4102#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {4104#(= |ULTIMATE.start_main_~head~0#1.offset| 0)} is VALID [2022-02-20 23:55:04,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {4104#(= |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: L997 {4105#(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:55:04,821 INFO L290 TraceCheckUtils]: 3: Hoare triple {4105#(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, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {4105#(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:55:04,823 INFO L290 TraceCheckUtils]: 4: Hoare triple {4105#(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; {4106#(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| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (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:55:04,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {4106#(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| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (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; {4106#(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| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (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:55:04,824 INFO L290 TraceCheckUtils]: 6: Hoare triple {4106#(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| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (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; {4106#(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| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (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:55:04,825 INFO L290 TraceCheckUtils]: 7: Hoare triple {4106#(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| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (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, 4 + main_~x~0#1.offset, 4); srcloc: L1004-3 {4107#(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:55:04,825 INFO L290 TraceCheckUtils]: 8: Hoare triple {4107#(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~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1025 {4108#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem6#1.base|) |ULTIMATE.start_main_#t~mem6#1.offset|)) 1)} is VALID [2022-02-20 23:55:04,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {4108#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem6#1.base|) |ULTIMATE.start_main_#t~mem6#1.offset|)) 1)} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {4109#(= (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:55:04,826 INFO L290 TraceCheckUtils]: 10: Hoare triple {4109#(= (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); {4109#(= (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:55:04,826 INFO L290 TraceCheckUtils]: 11: Hoare triple {4109#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} goto; {4109#(= (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:55:04,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {4109#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} SUMMARY for call main_#t~mem7#1 := read~int(main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1030-2 {4109#(= (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:55:04,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {4109#(= (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~mem7#1);havoc main_#t~mem7#1; {4109#(= (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:55:04,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {4109#(= (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.base, main_#t~mem8#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1032-13 {4110#(= (select |#valid| |ULTIMATE.start_main_#t~mem8#1.base|) 1)} is VALID [2022-02-20 23:55:04,828 INFO L290 TraceCheckUtils]: 15: Hoare triple {4110#(= (select |#valid| |ULTIMATE.start_main_#t~mem8#1.base|) 1)} assume !(1 == #valid[main_#t~mem8#1.base]); {4103#false} is VALID [2022-02-20 23:55:04,828 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:55:04,828 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:04,828 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802679559] [2022-02-20 23:55:04,828 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802679559] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:04,829 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:04,829 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:55:04,829 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655860611] [2022-02-20 23:55:04,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:04,829 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:55:04,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:04,830 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:55:04,843 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:55:04,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:55:04,843 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:04,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:55:04,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:55:04,844 INFO L87 Difference]: Start difference. First operand 95 states and 109 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:55:05,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:05,533 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2022-02-20 23:55:05,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:55:05,534 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:55:05,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:05,534 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:55:05,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 155 transitions. [2022-02-20 23:55:05,535 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:55:05,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 155 transitions. [2022-02-20 23:55:05,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 155 transitions. [2022-02-20 23:55:05,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:05,647 INFO L225 Difference]: With dead ends: 143 [2022-02-20 23:55:05,648 INFO L226 Difference]: Without dead ends: 143 [2022-02-20 23:55:05,648 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2022-02-20 23:55:05,648 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 289 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:05,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [289 Valid, 338 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:55:05,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-02-20 23:55:05,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 95. [2022-02-20 23:55:05,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:05,651 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 95 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 94 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:55:05,651 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 95 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 94 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:55:05,652 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 95 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 94 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:55:05,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:05,653 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2022-02-20 23:55:05,653 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 154 transitions. [2022-02-20 23:55:05,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:05,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:05,654 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 94 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 143 states. [2022-02-20 23:55:05,654 INFO L87 Difference]: Start difference. First operand has 95 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 94 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 143 states. [2022-02-20 23:55:05,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:05,656 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2022-02-20 23:55:05,656 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 154 transitions. [2022-02-20 23:55:05,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:05,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:05,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:05,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:05,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 94 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:55:05,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2022-02-20 23:55:05,658 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 16 [2022-02-20 23:55:05,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:05,658 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2022-02-20 23:55:05,658 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:55:05,658 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2022-02-20 23:55:05,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:55:05,659 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:05,659 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:55:05,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 23:55:05,659 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:05,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:05,659 INFO L85 PathProgramCache]: Analyzing trace with hash -230426378, now seen corresponding path program 1 times [2022-02-20 23:55:05,660 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:05,660 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636494625] [2022-02-20 23:55:05,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:05,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:05,793 INFO L290 TraceCheckUtils]: 0: Hoare triple {4651#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); {4651#true} is VALID [2022-02-20 23:55:05,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {4651#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {4653#(and (<= 8 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:55:05,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {4653#(and (<= 8 (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: L997 {4654#(and (<= 8 (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:55:05,795 INFO L290 TraceCheckUtils]: 3: Hoare triple {4654#(and (<= 8 (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, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {4654#(and (<= 8 (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:55:05,796 INFO L290 TraceCheckUtils]: 4: Hoare triple {4654#(and (<= 8 (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; {4655#(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|) (<= 8 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.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|) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:55:05,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {4655#(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|) (<= 8 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.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|) |ULTIMATE.start_main_~head~0#1.offset|))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {4655#(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|) (<= 8 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.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|) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:55:05,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {4655#(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|) (<= 8 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.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|) |ULTIMATE.start_main_~head~0#1.offset|))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {4655#(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|) (<= 8 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.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|) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:55:05,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {4655#(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|) (<= 8 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.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|) |ULTIMATE.start_main_~head~0#1.offset|))} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1004-3 {4654#(and (<= 8 (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:55:05,800 INFO L290 TraceCheckUtils]: 8: Hoare triple {4654#(and (<= 8 (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~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1025 {4656#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem6#1.base|) |ULTIMATE.start_main_#t~mem6#1.offset|) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem6#1.base|) |ULTIMATE.start_main_#t~mem6#1.offset|))))} is VALID [2022-02-20 23:55:05,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {4656#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem6#1.base|) |ULTIMATE.start_main_#t~mem6#1.offset|) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem6#1.base|) |ULTIMATE.start_main_#t~mem6#1.offset|))))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {4657#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:55:05,801 INFO L290 TraceCheckUtils]: 10: Hoare triple {4657#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {4657#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:55:05,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {4657#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} goto; {4657#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:55:05,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {4657#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} SUMMARY for call main_#t~mem7#1 := read~int(main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1030-2 {4657#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:55:05,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {4657#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} assume !!(0 != main_#t~mem7#1);havoc main_#t~mem7#1; {4657#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:55:05,803 INFO L290 TraceCheckUtils]: 14: Hoare triple {4657#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1032-13 {4658#(and (= |ULTIMATE.start_main_#t~mem8#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_#t~mem8#1.base|)))} is VALID [2022-02-20 23:55:05,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {4658#(and (= |ULTIMATE.start_main_#t~mem8#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_#t~mem8#1.base|)))} assume !(4 + (4 + main_#t~mem8#1.offset) <= #length[main_#t~mem8#1.base] && 0 <= 4 + main_#t~mem8#1.offset); {4652#false} is VALID [2022-02-20 23:55:05,804 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:55:05,804 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:05,805 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636494625] [2022-02-20 23:55:05,805 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636494625] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:05,805 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:05,805 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:55:05,805 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306033231] [2022-02-20 23:55:05,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:05,805 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:55:05,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:05,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:05,818 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:55:05,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:55:05,818 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:05,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:55:05,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:55:05,819 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:06,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:06,713 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2022-02-20 23:55:06,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:55:06,713 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:55:06,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:06,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:06,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2022-02-20 23:55:06,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:06,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2022-02-20 23:55:06,715 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 165 transitions. [2022-02-20 23:55:06,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:06,855 INFO L225 Difference]: With dead ends: 153 [2022-02-20 23:55:06,855 INFO L226 Difference]: Without dead ends: 153 [2022-02-20 23:55:06,855 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:55:06,856 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 214 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:06,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 262 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:55:06,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-02-20 23:55:06,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 95. [2022-02-20 23:55:06,857 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:06,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand has 95 states, 74 states have (on average 1.445945945945946) internal successors, (107), 94 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:06,858 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand has 95 states, 74 states have (on average 1.445945945945946) internal successors, (107), 94 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:06,858 INFO L87 Difference]: Start difference. First operand 153 states. Second operand has 95 states, 74 states have (on average 1.445945945945946) internal successors, (107), 94 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:06,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:06,859 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2022-02-20 23:55:06,859 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 164 transitions. [2022-02-20 23:55:06,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:06,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:06,860 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 74 states have (on average 1.445945945945946) internal successors, (107), 94 states have internal predecessors, (107), 0 states have call successors, (0), 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:55:06,860 INFO L87 Difference]: Start difference. First operand has 95 states, 74 states have (on average 1.445945945945946) internal successors, (107), 94 states have internal predecessors, (107), 0 states have call successors, (0), 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:55:06,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:06,862 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2022-02-20 23:55:06,862 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 164 transitions. [2022-02-20 23:55:06,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:06,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:06,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:06,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:06,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 74 states have (on average 1.445945945945946) internal successors, (107), 94 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:06,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2022-02-20 23:55:06,870 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 16 [2022-02-20 23:55:06,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:06,870 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2022-02-20 23:55:06,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:06,873 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2022-02-20 23:55:06,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:55:06,873 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:06,873 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:55:06,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 23:55:06,876 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:06,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:06,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1446702036, now seen corresponding path program 1 times [2022-02-20 23:55:06,877 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:06,877 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043013059] [2022-02-20 23:55:06,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:06,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:06,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:06,982 INFO L290 TraceCheckUtils]: 0: Hoare triple {5225#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); {5225#true} is VALID [2022-02-20 23:55:06,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {5225#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {5227#(= |ULTIMATE.start_main_~head~0#1.offset| 0)} is VALID [2022-02-20 23:55:06,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {5227#(= |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: L997 {5228#(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:55:06,992 INFO L290 TraceCheckUtils]: 3: Hoare triple {5228#(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, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {5228#(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:55:06,994 INFO L290 TraceCheckUtils]: 4: Hoare triple {5228#(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; {5229#(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| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} is VALID [2022-02-20 23:55:06,995 INFO L290 TraceCheckUtils]: 5: Hoare triple {5229#(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| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {5229#(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| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} is VALID [2022-02-20 23:55:06,995 INFO L290 TraceCheckUtils]: 6: Hoare triple {5229#(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| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {5229#(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| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} is VALID [2022-02-20 23:55:06,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {5229#(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| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1004-3 {5230#(= (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:55:06,997 INFO L290 TraceCheckUtils]: 8: Hoare triple {5230#(= (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~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1025 {5230#(= (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:55:06,997 INFO L290 TraceCheckUtils]: 9: Hoare triple {5230#(= (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~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {5230#(= (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:55:06,998 INFO L290 TraceCheckUtils]: 10: Hoare triple {5230#(= (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); {5230#(= (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:55:06,999 INFO L290 TraceCheckUtils]: 11: Hoare triple {5230#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)} goto; {5230#(= (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:55:06,999 INFO L290 TraceCheckUtils]: 12: Hoare triple {5230#(= (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 := read~int(main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1030-2 {5230#(= (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:55:06,999 INFO L290 TraceCheckUtils]: 13: Hoare triple {5230#(= (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~mem7#1);havoc main_#t~mem7#1; {5230#(= (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:55:07,000 INFO L290 TraceCheckUtils]: 14: Hoare triple {5230#(= (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~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1030-3 {5231#(= (select |#valid| |ULTIMATE.start_main_#t~mem15#1.base|) 1)} is VALID [2022-02-20 23:55:07,000 INFO L290 TraceCheckUtils]: 15: Hoare triple {5231#(= (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; {5232#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:55:07,001 INFO L290 TraceCheckUtils]: 16: Hoare triple {5232#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !(1 == #valid[main_~x~0#1.base]); {5226#false} is VALID [2022-02-20 23:55:07,001 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:55:07,001 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:07,001 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043013059] [2022-02-20 23:55:07,001 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043013059] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:07,001 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:07,001 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:55:07,002 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741197709] [2022-02-20 23:55:07,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:07,002 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:55:07,002 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:07,002 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:55:07,015 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:55:07,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:55:07,015 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:07,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:55:07,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:55:07,018 INFO L87 Difference]: Start difference. First operand 95 states and 107 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:55:07,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:07,557 INFO L93 Difference]: Finished difference Result 134 states and 148 transitions. [2022-02-20 23:55:07,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:55:07,557 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:55:07,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:07,558 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:55:07,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2022-02-20 23:55:07,562 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:55:07,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2022-02-20 23:55:07,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 131 transitions. [2022-02-20 23:55:07,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:07,643 INFO L225 Difference]: With dead ends: 134 [2022-02-20 23:55:07,643 INFO L226 Difference]: Without dead ends: 134 [2022-02-20 23:55:07,643 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 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:55:07,644 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 267 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:07,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 208 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:55:07,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-02-20 23:55:07,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 112. [2022-02-20 23:55:07,646 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:07,647 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 112 states, 91 states have (on average 1.5164835164835164) internal successors, (138), 111 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:07,647 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 112 states, 91 states have (on average 1.5164835164835164) internal successors, (138), 111 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:07,647 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 112 states, 91 states have (on average 1.5164835164835164) internal successors, (138), 111 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:07,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:07,649 INFO L93 Difference]: Finished difference Result 134 states and 148 transitions. [2022-02-20 23:55:07,649 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 148 transitions. [2022-02-20 23:55:07,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:07,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:07,649 INFO L74 IsIncluded]: Start isIncluded. First operand has 112 states, 91 states have (on average 1.5164835164835164) internal successors, (138), 111 states have internal predecessors, (138), 0 states have call successors, (0), 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 134 states. [2022-02-20 23:55:07,650 INFO L87 Difference]: Start difference. First operand has 112 states, 91 states have (on average 1.5164835164835164) internal successors, (138), 111 states have internal predecessors, (138), 0 states have call successors, (0), 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 134 states. [2022-02-20 23:55:07,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:07,651 INFO L93 Difference]: Finished difference Result 134 states and 148 transitions. [2022-02-20 23:55:07,651 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 148 transitions. [2022-02-20 23:55:07,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:07,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:07,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:07,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:07,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 91 states have (on average 1.5164835164835164) internal successors, (138), 111 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:07,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 138 transitions. [2022-02-20 23:55:07,654 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 138 transitions. Word has length 17 [2022-02-20 23:55:07,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:07,654 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 138 transitions. [2022-02-20 23:55:07,654 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:55:07,654 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions. [2022-02-20 23:55:07,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:55:07,654 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:07,655 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:55:07,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 23:55:07,655 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:07,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:07,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1446702037, now seen corresponding path program 1 times [2022-02-20 23:55:07,655 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:07,656 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584981953] [2022-02-20 23:55:07,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:07,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:07,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {5759#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); {5759#true} is VALID [2022-02-20 23:55:07,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {5759#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {5761#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 8))} is VALID [2022-02-20 23:55:07,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {5761#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 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: L997 {5762#(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 |#length| |ULTIMATE.start_main_~head~0#1.base|) 8) (= (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:55:07,793 INFO L290 TraceCheckUtils]: 3: Hoare triple {5762#(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 |#length| |ULTIMATE.start_main_~head~0#1.base|) 8) (= (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, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {5762#(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 |#length| |ULTIMATE.start_main_~head~0#1.base|) 8) (= (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:55:07,794 INFO L290 TraceCheckUtils]: 4: Hoare triple {5762#(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 |#length| |ULTIMATE.start_main_~head~0#1.base|) 8) (= (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; {5763#(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|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:55:07,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {5763#(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|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {5763#(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|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:55:07,795 INFO L290 TraceCheckUtils]: 6: Hoare triple {5763#(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|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {5763#(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|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:55:07,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {5763#(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|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~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, 4 + main_~x~0#1.offset, 4); srcloc: L1004-3 {5764#(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|) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 8) (= (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:55:07,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {5764#(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|) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 8) (= (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~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1025 {5764#(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|) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 8) (= (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:55:07,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {5764#(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|) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 8) (= (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~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {5764#(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|) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 8) (= (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:55:07,797 INFO L290 TraceCheckUtils]: 10: Hoare triple {5764#(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|) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 8) (= (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); {5764#(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|) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 8) (= (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:55:07,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {5764#(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|) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} goto; {5764#(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|) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 8) (= (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:55:07,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {5764#(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|) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 8) (= (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 := read~int(main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1030-2 {5764#(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|) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 8) (= (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:55:07,798 INFO L290 TraceCheckUtils]: 13: Hoare triple {5764#(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|) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1; {5764#(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|) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 8) (= (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:55:07,799 INFO L290 TraceCheckUtils]: 14: Hoare triple {5764#(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|) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 8) (= (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~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1030-3 {5765#(and (= (select |#length| |ULTIMATE.start_main_#t~mem15#1.base|) 8) (= |ULTIMATE.start_main_#t~mem15#1.offset| 0))} is VALID [2022-02-20 23:55:07,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {5765#(and (= (select |#length| |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; {5766#(and (= (+ (select |#length| |ULTIMATE.start_main_~x~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} is VALID [2022-02-20 23:55:07,799 INFO L290 TraceCheckUtils]: 16: Hoare triple {5766#(and (= (+ (select |#length| |ULTIMATE.start_main_~x~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} assume !(4 + (4 + main_~x~0#1.offset) <= #length[main_~x~0#1.base] && 0 <= 4 + main_~x~0#1.offset); {5760#false} is VALID [2022-02-20 23:55:07,800 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:55:07,800 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:07,800 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584981953] [2022-02-20 23:55:07,800 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584981953] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:07,800 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:07,800 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:55:07,800 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910258503] [2022-02-20 23:55:07,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:07,800 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:55:07,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:07,801 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:55:07,813 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:55:07,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:55:07,813 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:07,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:55:07,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:55:07,814 INFO L87 Difference]: Start difference. First operand 112 states and 138 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:55:08,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:08,340 INFO L93 Difference]: Finished difference Result 152 states and 166 transitions. [2022-02-20 23:55:08,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:55:08,340 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:55:08,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:08,340 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:55:08,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2022-02-20 23:55:08,341 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:55:08,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2022-02-20 23:55:08,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 152 transitions. [2022-02-20 23:55:08,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:08,443 INFO L225 Difference]: With dead ends: 152 [2022-02-20 23:55:08,443 INFO L226 Difference]: Without dead ends: 152 [2022-02-20 23:55:08,443 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 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:55:08,443 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 205 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:08,444 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 199 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:55:08,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-02-20 23:55:08,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 117. [2022-02-20 23:55:08,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:08,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand has 117 states, 96 states have (on average 1.4895833333333333) internal successors, (143), 116 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:08,446 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand has 117 states, 96 states have (on average 1.4895833333333333) internal successors, (143), 116 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:08,446 INFO L87 Difference]: Start difference. First operand 152 states. Second operand has 117 states, 96 states have (on average 1.4895833333333333) internal successors, (143), 116 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:08,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:08,447 INFO L93 Difference]: Finished difference Result 152 states and 166 transitions. [2022-02-20 23:55:08,447 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 166 transitions. [2022-02-20 23:55:08,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:08,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:08,448 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 96 states have (on average 1.4895833333333333) internal successors, (143), 116 states have internal predecessors, (143), 0 states have call successors, (0), 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 152 states. [2022-02-20 23:55:08,448 INFO L87 Difference]: Start difference. First operand has 117 states, 96 states have (on average 1.4895833333333333) internal successors, (143), 116 states have internal predecessors, (143), 0 states have call successors, (0), 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 152 states. [2022-02-20 23:55:08,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:08,449 INFO L93 Difference]: Finished difference Result 152 states and 166 transitions. [2022-02-20 23:55:08,449 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 166 transitions. [2022-02-20 23:55:08,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:08,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:08,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:08,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:08,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 96 states have (on average 1.4895833333333333) internal successors, (143), 116 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:08,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2022-02-20 23:55:08,451 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 17 [2022-02-20 23:55:08,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:08,451 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2022-02-20 23:55:08,451 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:55:08,451 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2022-02-20 23:55:08,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:55:08,452 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:08,452 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:55:08,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 23:55:08,452 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:08,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:08,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1499460812, now seen corresponding path program 1 times [2022-02-20 23:55:08,452 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:08,452 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285323002] [2022-02-20 23:55:08,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:08,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:08,488 INFO L290 TraceCheckUtils]: 0: Hoare triple {6350#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); {6350#true} is VALID [2022-02-20 23:55:08,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {6350#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {6350#true} is VALID [2022-02-20 23:55:08,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {6350#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: L997 {6350#true} is VALID [2022-02-20 23:55:08,489 INFO L290 TraceCheckUtils]: 3: Hoare triple {6350#true} SUMMARY for call write~int(0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {6350#true} is VALID [2022-02-20 23:55:08,489 INFO L290 TraceCheckUtils]: 4: Hoare triple {6350#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; {6350#true} is VALID [2022-02-20 23:55:08,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {6350#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {6350#true} is VALID [2022-02-20 23:55:08,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {6350#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(8); {6352#(not (= |ULTIMATE.start_main_#t~malloc3#1.base| 0))} is VALID [2022-02-20 23:55:08,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {6352#(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: L1007 {6353#(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:55:08,490 INFO L290 TraceCheckUtils]: 8: Hoare triple {6353#(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; {6353#(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:55:08,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {6353#(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: L1008 {6354#(not (= |ULTIMATE.start_main_#t~mem4#1.base| 0))} is VALID [2022-02-20 23:55:08,491 INFO L290 TraceCheckUtils]: 10: Hoare triple {6354#(not (= |ULTIMATE.start_main_#t~mem4#1.base| 0))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem4#1.base, main_#t~mem4#1.offset;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {6355#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} is VALID [2022-02-20 23:55:08,491 INFO L290 TraceCheckUtils]: 11: Hoare triple {6355#(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: L1009 {6355#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} is VALID [2022-02-20 23:55:08,492 INFO L290 TraceCheckUtils]: 12: Hoare triple {6355#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {6355#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} is VALID [2022-02-20 23:55:08,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {6355#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} assume !(0 != main_#t~nondet5#1);havoc main_#t~nondet5#1; {6355#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} is VALID [2022-02-20 23:55:08,496 INFO L290 TraceCheckUtils]: 14: Hoare triple {6355#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1011-1 {6355#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} is VALID [2022-02-20 23:55:08,496 INFO L290 TraceCheckUtils]: 15: Hoare triple {6355#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} assume !(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {6351#false} is VALID [2022-02-20 23:55:08,496 INFO L290 TraceCheckUtils]: 16: Hoare triple {6351#false} assume !false; {6351#false} is VALID [2022-02-20 23:55:08,496 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:55:08,496 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:08,496 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285323002] [2022-02-20 23:55:08,496 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285323002] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:08,496 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:08,496 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:55:08,497 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340264144] [2022-02-20 23:55:08,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:08,497 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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:55:08,497 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:08,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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:55:08,508 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:55:08,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:55:08,508 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:08,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:55:08,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:55:08,509 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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:55:08,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:08,768 INFO L93 Difference]: Finished difference Result 119 states and 145 transitions. [2022-02-20 23:55:08,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:55:08,768 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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:55:08,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:08,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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:55:08,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 90 transitions. [2022-02-20 23:55:08,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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:55:08,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 90 transitions. [2022-02-20 23:55:08,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 90 transitions. [2022-02-20 23:55:08,824 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:55:08,826 INFO L225 Difference]: With dead ends: 119 [2022-02-20 23:55:08,826 INFO L226 Difference]: Without dead ends: 119 [2022-02-20 23:55:08,826 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:55:08,827 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 17 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:08,827 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 307 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:55:08,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-02-20 23:55:08,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2022-02-20 23:55:08,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:08,829 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 115 states, 95 states have (on average 1.4842105263157894) internal successors, (141), 114 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:55:08,829 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 115 states, 95 states have (on average 1.4842105263157894) internal successors, (141), 114 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:55:08,829 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 115 states, 95 states have (on average 1.4842105263157894) internal successors, (141), 114 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:55:08,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:08,831 INFO L93 Difference]: Finished difference Result 119 states and 145 transitions. [2022-02-20 23:55:08,831 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2022-02-20 23:55:08,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:08,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:08,831 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 95 states have (on average 1.4842105263157894) internal successors, (141), 114 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 119 states. [2022-02-20 23:55:08,831 INFO L87 Difference]: Start difference. First operand has 115 states, 95 states have (on average 1.4842105263157894) internal successors, (141), 114 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 119 states. [2022-02-20 23:55:08,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:08,833 INFO L93 Difference]: Finished difference Result 119 states and 145 transitions. [2022-02-20 23:55:08,833 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2022-02-20 23:55:08,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:08,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:08,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:08,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:08,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 95 states have (on average 1.4842105263157894) internal successors, (141), 114 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:55:08,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 141 transitions. [2022-02-20 23:55:08,835 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 141 transitions. Word has length 17 [2022-02-20 23:55:08,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:08,835 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 141 transitions. [2022-02-20 23:55:08,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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:55:08,835 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 141 transitions. [2022-02-20 23:55:08,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 23:55:08,836 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:08,836 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] [2022-02-20 23:55:08,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 23:55:08,836 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:08,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:08,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1296321320, now seen corresponding path program 1 times [2022-02-20 23:55:08,836 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:08,837 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297720537] [2022-02-20 23:55:08,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:08,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:08,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:08,997 INFO L290 TraceCheckUtils]: 0: Hoare triple {6842#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); {6842#true} is VALID [2022-02-20 23:55:08,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {6842#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {6844#(and (<= (+ |ULTIMATE.start_main_~head~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:55:08,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {6844#(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: L997 {6845#(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:55:08,999 INFO L290 TraceCheckUtils]: 3: Hoare triple {6845#(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, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {6845#(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:55:09,000 INFO L290 TraceCheckUtils]: 4: Hoare triple {6845#(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; {6846#(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|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (<= (+ |ULTIMATE.start_main_~head~0#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 23:55:09,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {6846#(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|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (<= (+ |ULTIMATE.start_main_~head~0#1.base| 1) |#StackHeapBarrier|))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {6846#(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|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (<= (+ |ULTIMATE.start_main_~head~0#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 23:55:09,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {6846#(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|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (<= (+ |ULTIMATE.start_main_~head~0#1.base| 1) |#StackHeapBarrier|))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {6846#(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|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (<= (+ |ULTIMATE.start_main_~head~0#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 23:55:09,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {6846#(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|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (<= (+ |ULTIMATE.start_main_~head~0#1.base| 1) |#StackHeapBarrier|))} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1004-3 {6847#(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:55:09,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {6847#(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~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1025 {6847#(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:55:09,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {6847#(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~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {6847#(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:55:09,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {6847#(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); {6847#(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:55:09,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {6847#(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; {6847#(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:55:09,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {6847#(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 := read~int(main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1030-2 {6847#(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:55:09,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {6847#(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~mem7#1);havoc main_#t~mem7#1; {6847#(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:55:09,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {6847#(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~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1030-3 {6848#(<= (+ |ULTIMATE.start_main_#t~mem15#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:55:09,006 INFO L290 TraceCheckUtils]: 15: Hoare triple {6848#(<= (+ |ULTIMATE.start_main_#t~mem15#1.base| 1) |#StackHeapBarrier|)} 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; {6849#(<= (+ |ULTIMATE.start_main_~x~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:55:09,006 INFO L290 TraceCheckUtils]: 16: Hoare triple {6849#(<= (+ |ULTIMATE.start_main_~x~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call main_#t~mem16#1 := read~int(main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1038-3 {6849#(<= (+ |ULTIMATE.start_main_~x~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:55:09,007 INFO L290 TraceCheckUtils]: 17: Hoare triple {6849#(<= (+ |ULTIMATE.start_main_~x~0#1.base| 1) |#StackHeapBarrier|)} assume !(0 != main_#t~mem16#1);havoc main_#t~mem16#1; {6849#(<= (+ |ULTIMATE.start_main_~x~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:55:09,007 INFO L290 TraceCheckUtils]: 18: Hoare triple {6849#(<= (+ |ULTIMATE.start_main_~x~0#1.base| 1) |#StackHeapBarrier|)} assume 0 == main_~x~0#1.offset; {6849#(<= (+ |ULTIMATE.start_main_~x~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:55:09,008 INFO L290 TraceCheckUtils]: 19: Hoare triple {6849#(<= (+ |ULTIMATE.start_main_~x~0#1.base| 1) |#StackHeapBarrier|)} assume !(main_~x~0#1.base < #StackHeapBarrier); {6843#false} is VALID [2022-02-20 23:55:09,008 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:55:09,008 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:09,008 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297720537] [2022-02-20 23:55:09,008 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297720537] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:09,008 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:09,008 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:55:09,008 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045241413] [2022-02-20 23:55:09,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:09,009 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 23:55:09,009 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:09,009 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:09,026 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:09,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:55:09,026 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:09,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:55:09,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:55:09,027 INFO L87 Difference]: Start difference. First operand 115 states and 141 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:09,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:09,680 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2022-02-20 23:55:09,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:55:09,680 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 23:55:09,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:09,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:09,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2022-02-20 23:55:09,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:09,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2022-02-20 23:55:09,682 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 142 transitions. [2022-02-20 23:55:09,779 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:55:09,780 INFO L225 Difference]: With dead ends: 146 [2022-02-20 23:55:09,780 INFO L226 Difference]: Without dead ends: 146 [2022-02-20 23:55:09,780 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 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:55:09,781 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 160 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:09,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 279 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:55:09,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-02-20 23:55:09,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 116. [2022-02-20 23:55:09,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:09,783 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 116 states, 96 states have (on average 1.4791666666666667) 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:55:09,783 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 116 states, 96 states have (on average 1.4791666666666667) 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:55:09,783 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 116 states, 96 states have (on average 1.4791666666666667) 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:55:09,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:09,785 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2022-02-20 23:55:09,785 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 160 transitions. [2022-02-20 23:55:09,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:09,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:09,785 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 96 states have (on average 1.4791666666666667) 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 146 states. [2022-02-20 23:55:09,785 INFO L87 Difference]: Start difference. First operand has 116 states, 96 states have (on average 1.4791666666666667) 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 146 states. [2022-02-20 23:55:09,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:09,787 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2022-02-20 23:55:09,787 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 160 transitions. [2022-02-20 23:55:09,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:09,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:09,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:09,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:09,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 96 states have (on average 1.4791666666666667) 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:55:09,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 142 transitions. [2022-02-20 23:55:09,788 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 142 transitions. Word has length 20 [2022-02-20 23:55:09,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:09,788 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 142 transitions. [2022-02-20 23:55:09,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:09,789 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 142 transitions. [2022-02-20 23:55:09,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 23:55:09,789 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:09,789 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] [2022-02-20 23:55:09,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-20 23:55:09,790 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:09,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:09,790 INFO L85 PathProgramCache]: Analyzing trace with hash -852633064, now seen corresponding path program 1 times [2022-02-20 23:55:09,790 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:09,790 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646207775] [2022-02-20 23:55:09,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:09,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:09,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {7414#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); {7414#true} is VALID [2022-02-20 23:55:09,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {7414#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {7414#true} is VALID [2022-02-20 23:55:09,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {7414#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: L997 {7414#true} is VALID [2022-02-20 23:55:09,818 INFO L290 TraceCheckUtils]: 3: Hoare triple {7414#true} SUMMARY for call write~int(0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {7414#true} is VALID [2022-02-20 23:55:09,818 INFO L290 TraceCheckUtils]: 4: Hoare triple {7414#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; {7414#true} is VALID [2022-02-20 23:55:09,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {7414#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {7414#true} is VALID [2022-02-20 23:55:09,818 INFO L290 TraceCheckUtils]: 6: Hoare triple {7414#true} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {7414#true} is VALID [2022-02-20 23:55:09,818 INFO L290 TraceCheckUtils]: 7: Hoare triple {7414#true} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1004-3 {7414#true} is VALID [2022-02-20 23:55:09,818 INFO L290 TraceCheckUtils]: 8: Hoare triple {7414#true} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1025 {7414#true} is VALID [2022-02-20 23:55:09,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {7414#true} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {7414#true} is VALID [2022-02-20 23:55:09,819 INFO L290 TraceCheckUtils]: 10: Hoare triple {7414#true} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {7414#true} is VALID [2022-02-20 23:55:09,819 INFO L290 TraceCheckUtils]: 11: Hoare triple {7414#true} goto; {7414#true} is VALID [2022-02-20 23:55:09,819 INFO L290 TraceCheckUtils]: 12: Hoare triple {7414#true} SUMMARY for call main_#t~mem7#1 := read~int(main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1030-2 {7414#true} is VALID [2022-02-20 23:55:09,819 INFO L290 TraceCheckUtils]: 13: Hoare triple {7414#true} assume !!(0 != main_#t~mem7#1);havoc main_#t~mem7#1; {7414#true} is VALID [2022-02-20 23:55:09,819 INFO L290 TraceCheckUtils]: 14: Hoare triple {7414#true} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1032-13 {7414#true} is VALID [2022-02-20 23:55:09,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {7414#true} SUMMARY for call main_#t~mem9#1 := read~int(main_#t~mem8#1.base, 4 + main_#t~mem8#1.offset, 4); srcloc: L1032-1 {7414#true} is VALID [2022-02-20 23:55:09,820 INFO L290 TraceCheckUtils]: 16: Hoare triple {7414#true} main_#t~short13#1 := 0 == main_#t~mem9#1; {7414#true} is VALID [2022-02-20 23:55:09,823 INFO L290 TraceCheckUtils]: 17: Hoare triple {7414#true} assume main_#t~short13#1; {7416#|ULTIMATE.start_main_#t~short13#1|} is VALID [2022-02-20 23:55:09,823 INFO L290 TraceCheckUtils]: 18: Hoare triple {7416#|ULTIMATE.start_main_#t~short13#1|} assume !main_#t~short13#1;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem9#1;havoc main_#t~mem11#1;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem12#1;havoc main_#t~short13#1; {7415#false} is VALID [2022-02-20 23:55:09,823 INFO L290 TraceCheckUtils]: 19: Hoare triple {7415#false} assume !false; {7415#false} is VALID [2022-02-20 23:55:09,823 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:55:09,823 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:09,823 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646207775] [2022-02-20 23:55:09,824 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646207775] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:09,824 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:09,825 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:55:09,825 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761870349] [2022-02-20 23:55:09,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:09,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 23:55:09,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:09,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:09,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:09,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:55:09,836 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:09,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:55:09,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:55:09,837 INFO L87 Difference]: Start difference. First operand 116 states and 142 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:09,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:09,894 INFO L93 Difference]: Finished difference Result 119 states and 145 transitions. [2022-02-20 23:55:09,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:55:09,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 23:55:09,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:09,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:09,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2022-02-20 23:55:09,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:09,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2022-02-20 23:55:09,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 81 transitions. [2022-02-20 23:55:09,942 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:09,944 INFO L225 Difference]: With dead ends: 119 [2022-02-20 23:55:09,944 INFO L226 Difference]: Without dead ends: 119 [2022-02-20 23:55:09,944 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:55:09,944 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 150 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:55:09,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:55:09,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-02-20 23:55:09,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-02-20 23:55:09,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:09,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 119 states, 99 states have (on average 1.4646464646464648) internal successors, (145), 118 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:55:09,947 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 119 states, 99 states have (on average 1.4646464646464648) internal successors, (145), 118 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:55:09,947 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 119 states, 99 states have (on average 1.4646464646464648) internal successors, (145), 118 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:55:09,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:09,948 INFO L93 Difference]: Finished difference Result 119 states and 145 transitions. [2022-02-20 23:55:09,948 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2022-02-20 23:55:09,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:09,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:09,948 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 99 states have (on average 1.4646464646464648) internal successors, (145), 118 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 119 states. [2022-02-20 23:55:09,949 INFO L87 Difference]: Start difference. First operand has 119 states, 99 states have (on average 1.4646464646464648) internal successors, (145), 118 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 119 states. [2022-02-20 23:55:09,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:09,950 INFO L93 Difference]: Finished difference Result 119 states and 145 transitions. [2022-02-20 23:55:09,950 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2022-02-20 23:55:09,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:09,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:09,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:09,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:09,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 99 states have (on average 1.4646464646464648) internal successors, (145), 118 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:55:09,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2022-02-20 23:55:09,951 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 20 [2022-02-20 23:55:09,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:09,952 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2022-02-20 23:55:09,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:09,952 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2022-02-20 23:55:09,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 23:55:09,952 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:09,952 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:55:09,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-20 23:55:09,952 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:09,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:09,953 INFO L85 PathProgramCache]: Analyzing trace with hash -661774329, now seen corresponding path program 1 times [2022-02-20 23:55:09,953 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:09,953 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33723002] [2022-02-20 23:55:09,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:09,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:09,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {7895#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); {7895#true} is VALID [2022-02-20 23:55:09,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {7895#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {7895#true} is VALID [2022-02-20 23:55:09,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {7895#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: L997 {7895#true} is VALID [2022-02-20 23:55:09,991 INFO L290 TraceCheckUtils]: 3: Hoare triple {7895#true} SUMMARY for call write~int(0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {7895#true} is VALID [2022-02-20 23:55:09,991 INFO L290 TraceCheckUtils]: 4: Hoare triple {7895#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; {7895#true} is VALID [2022-02-20 23:55:09,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {7895#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {7895#true} is VALID [2022-02-20 23:55:09,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {7895#true} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {7895#true} is VALID [2022-02-20 23:55:09,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {7895#true} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1004-3 {7895#true} is VALID [2022-02-20 23:55:09,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {7895#true} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1025 {7895#true} is VALID [2022-02-20 23:55:09,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {7895#true} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {7895#true} is VALID [2022-02-20 23:55:09,992 INFO L290 TraceCheckUtils]: 10: Hoare triple {7895#true} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {7895#true} is VALID [2022-02-20 23:55:09,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {7895#true} goto; {7895#true} is VALID [2022-02-20 23:55:09,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {7895#true} SUMMARY for call main_#t~mem7#1 := read~int(main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1030-2 {7895#true} is VALID [2022-02-20 23:55:09,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {7895#true} assume !!(0 != main_#t~mem7#1);havoc main_#t~mem7#1; {7895#true} is VALID [2022-02-20 23:55:09,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {7895#true} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1032-13 {7897#(= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem8#1.base|)} is VALID [2022-02-20 23:55:09,993 INFO L290 TraceCheckUtils]: 15: Hoare triple {7897#(= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem8#1.base|)} SUMMARY for call main_#t~mem9#1 := read~int(main_#t~mem8#1.base, 4 + main_#t~mem8#1.offset, 4); srcloc: L1032-1 {7898#(= (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:55:09,993 INFO L290 TraceCheckUtils]: 16: Hoare triple {7898#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} main_#t~short13#1 := 0 == main_#t~mem9#1; {7898#(= (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:55:09,994 INFO L290 TraceCheckUtils]: 17: Hoare triple {7898#(= (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~short13#1; {7898#(= (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:55:09,994 INFO L290 TraceCheckUtils]: 18: Hoare triple {7898#(= (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 := read~int(main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1032-5 {7898#(= (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:55:09,994 INFO L290 TraceCheckUtils]: 19: Hoare triple {7898#(= (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~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1032-6 {7899#(= (select |#valid| |ULTIMATE.start_main_#t~mem10#1.base|) 1)} is VALID [2022-02-20 23:55:09,995 INFO L290 TraceCheckUtils]: 20: Hoare triple {7899#(= (select |#valid| |ULTIMATE.start_main_#t~mem10#1.base|) 1)} assume !(1 == #valid[main_#t~mem10#1.base]); {7896#false} is VALID [2022-02-20 23:55:09,995 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:55:09,995 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:09,995 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33723002] [2022-02-20 23:55:09,995 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33723002] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:09,996 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:09,996 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:55:09,996 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683571568] [2022-02-20 23:55:09,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:09,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) 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:55:09,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:09,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 5.25) 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:55:10,009 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:55:10,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:55:10,010 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:10,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:55:10,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:55:10,010 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand has 5 states, 4 states have (on average 5.25) 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:55:10,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:10,198 INFO L93 Difference]: Finished difference Result 118 states and 142 transitions. [2022-02-20 23:55:10,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:55:10,198 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) 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:55:10,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:10,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.25) 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:55:10,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-02-20 23:55:10,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.25) 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:55:10,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-02-20 23:55:10,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 80 transitions. [2022-02-20 23:55:10,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:10,276 INFO L225 Difference]: With dead ends: 118 [2022-02-20 23:55:10,276 INFO L226 Difference]: Without dead ends: 118 [2022-02-20 23:55:10,276 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:55:10,277 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 29 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:10,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 157 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:55:10,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-02-20 23:55:10,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-02-20 23:55:10,278 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:10,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 118 states, 99 states have (on average 1.4343434343434343) internal successors, (142), 117 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:55:10,279 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 118 states, 99 states have (on average 1.4343434343434343) internal successors, (142), 117 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:55:10,279 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 118 states, 99 states have (on average 1.4343434343434343) internal successors, (142), 117 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:55:10,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:10,281 INFO L93 Difference]: Finished difference Result 118 states and 142 transitions. [2022-02-20 23:55:10,281 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 142 transitions. [2022-02-20 23:55:10,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:10,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:10,281 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 99 states have (on average 1.4343434343434343) internal successors, (142), 117 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 118 states. [2022-02-20 23:55:10,281 INFO L87 Difference]: Start difference. First operand has 118 states, 99 states have (on average 1.4343434343434343) internal successors, (142), 117 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 118 states. [2022-02-20 23:55:10,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:10,283 INFO L93 Difference]: Finished difference Result 118 states and 142 transitions. [2022-02-20 23:55:10,283 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 142 transitions. [2022-02-20 23:55:10,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:10,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:10,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:10,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:10,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 99 states have (on average 1.4343434343434343) internal successors, (142), 117 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:55:10,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 142 transitions. [2022-02-20 23:55:10,285 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 142 transitions. Word has length 21 [2022-02-20 23:55:10,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:10,285 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 142 transitions. [2022-02-20 23:55:10,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) 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:55:10,285 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 142 transitions. [2022-02-20 23:55:10,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 23:55:10,286 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:10,286 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:55:10,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-20 23:55:10,286 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:10,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:10,286 INFO L85 PathProgramCache]: Analyzing trace with hash -661774328, now seen corresponding path program 1 times [2022-02-20 23:55:10,287 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:10,287 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325614221] [2022-02-20 23:55:10,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:10,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:10,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:10,421 INFO L290 TraceCheckUtils]: 0: Hoare triple {8378#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); {8378#true} is VALID [2022-02-20 23:55:10,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {8378#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {8380#(= |ULTIMATE.start_main_~head~0#1.offset| 0)} is VALID [2022-02-20 23:55:10,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {8380#(= |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: L997 {8381#(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:55:10,424 INFO L290 TraceCheckUtils]: 3: Hoare triple {8381#(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, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {8381#(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:55:10,424 INFO L290 TraceCheckUtils]: 4: Hoare triple {8381#(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; {8382#(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|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.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|) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:55:10,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {8382#(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|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.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|) |ULTIMATE.start_main_~head~0#1.offset|))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {8382#(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|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.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|) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:55:10,425 INFO L290 TraceCheckUtils]: 6: Hoare triple {8382#(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|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.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|) |ULTIMATE.start_main_~head~0#1.offset|))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {8382#(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|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.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|) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:55:10,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {8382#(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|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.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|) |ULTIMATE.start_main_~head~0#1.offset|))} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1004-3 {8381#(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:55:10,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {8381#(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~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1025 {8383#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem6#1.base|) |ULTIMATE.start_main_#t~mem6#1.offset|) 0)} is VALID [2022-02-20 23:55:10,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {8383#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem6#1.base|) |ULTIMATE.start_main_#t~mem6#1.offset|) 0)} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {8384#(= (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:55:10,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {8384#(= (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); {8384#(= (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:55:10,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {8384#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)} goto; {8384#(= (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:55:10,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {8384#(= (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~mem7#1 := read~int(main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1030-2 {8384#(= (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:55:10,429 INFO L290 TraceCheckUtils]: 13: Hoare triple {8384#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)} assume !!(0 != main_#t~mem7#1);havoc main_#t~mem7#1; {8384#(= (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:55:10,429 INFO L290 TraceCheckUtils]: 14: Hoare triple {8384#(= (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.base, main_#t~mem8#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1032-13 {8385#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem8#1.offset|) (= |ULTIMATE.start_main_#t~mem8#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem8#1.base|))} is VALID [2022-02-20 23:55:10,430 INFO L290 TraceCheckUtils]: 15: Hoare triple {8385#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem8#1.offset|) (= |ULTIMATE.start_main_#t~mem8#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem8#1.base|))} SUMMARY for call main_#t~mem9#1 := read~int(main_#t~mem8#1.base, 4 + main_#t~mem8#1.offset, 4); srcloc: L1032-1 {8386#(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|) 8) (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:55:10,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {8386#(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|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} main_#t~short13#1 := 0 == main_#t~mem9#1; {8386#(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|) 8) (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:55:10,431 INFO L290 TraceCheckUtils]: 17: Hoare triple {8386#(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|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} assume !main_#t~short13#1; {8386#(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|) 8) (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:55:10,432 INFO L290 TraceCheckUtils]: 18: Hoare triple {8386#(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|) 8) (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~mem11#1 := read~int(main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1032-5 {8386#(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|) 8) (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:55:10,432 INFO L290 TraceCheckUtils]: 19: Hoare triple {8386#(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|) 8) (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~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1032-6 {8387#(and (<= 0 |ULTIMATE.start_main_#t~mem10#1.offset|) (<= (+ |ULTIMATE.start_main_#t~mem10#1.offset| 8) (select |#length| |ULTIMATE.start_main_#t~mem10#1.base|)))} is VALID [2022-02-20 23:55:10,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {8387#(and (<= 0 |ULTIMATE.start_main_#t~mem10#1.offset|) (<= (+ |ULTIMATE.start_main_#t~mem10#1.offset| 8) (select |#length| |ULTIMATE.start_main_#t~mem10#1.base|)))} assume !(4 + (4 + main_#t~mem10#1.offset) <= #length[main_#t~mem10#1.base] && 0 <= 4 + main_#t~mem10#1.offset); {8379#false} is VALID [2022-02-20 23:55:10,433 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:55:10,433 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:10,433 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325614221] [2022-02-20 23:55:10,433 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325614221] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:10,434 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:10,434 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:55:10,434 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236119177] [2022-02-20 23:55:10,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:10,434 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 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:55:10,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:10,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 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:55:10,453 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:55:10,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:55:10,453 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:10,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:55:10,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:55:10,454 INFO L87 Difference]: Start difference. First operand 118 states and 142 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 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:55:11,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:11,176 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2022-02-20 23:55:11,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 23:55:11,177 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 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:55:11,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:11,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 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:55:11,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 145 transitions. [2022-02-20 23:55:11,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 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:55:11,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 145 transitions. [2022-02-20 23:55:11,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 145 transitions. [2022-02-20 23:55:11,281 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:55:11,282 INFO L225 Difference]: With dead ends: 138 [2022-02-20 23:55:11,282 INFO L226 Difference]: Without dead ends: 138 [2022-02-20 23:55:11,282 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2022-02-20 23:55:11,283 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 179 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:11,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 371 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:55:11,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-02-20 23:55:11,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 118. [2022-02-20 23:55:11,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:11,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand has 118 states, 99 states have (on average 1.4242424242424243) internal successors, (141), 117 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:55:11,285 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand has 118 states, 99 states have (on average 1.4242424242424243) internal successors, (141), 117 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:55:11,285 INFO L87 Difference]: Start difference. First operand 138 states. Second operand has 118 states, 99 states have (on average 1.4242424242424243) internal successors, (141), 117 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:55:11,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:11,286 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2022-02-20 23:55:11,286 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2022-02-20 23:55:11,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:11,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:11,286 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 99 states have (on average 1.4242424242424243) internal successors, (141), 117 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 138 states. [2022-02-20 23:55:11,287 INFO L87 Difference]: Start difference. First operand has 118 states, 99 states have (on average 1.4242424242424243) internal successors, (141), 117 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 138 states. [2022-02-20 23:55:11,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:11,288 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2022-02-20 23:55:11,288 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2022-02-20 23:55:11,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:11,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:11,289 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:11,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:11,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 99 states have (on average 1.4242424242424243) internal successors, (141), 117 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:55:11,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 141 transitions. [2022-02-20 23:55:11,290 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 141 transitions. Word has length 21 [2022-02-20 23:55:11,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:11,291 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 141 transitions. [2022-02-20 23:55:11,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 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:55:11,291 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 141 transitions. [2022-02-20 23:55:11,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 23:55:11,291 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:11,291 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:55:11,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-20 23:55:11,292 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:11,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:11,292 INFO L85 PathProgramCache]: Analyzing trace with hash -2015766217, now seen corresponding path program 1 times [2022-02-20 23:55:11,292 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:11,292 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228070292] [2022-02-20 23:55:11,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:11,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:11,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {8938#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); {8938#true} is VALID [2022-02-20 23:55:11,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {8938#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {8938#true} is VALID [2022-02-20 23:55:11,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {8938#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: L997 {8938#true} is VALID [2022-02-20 23:55:11,317 INFO L290 TraceCheckUtils]: 3: Hoare triple {8938#true} SUMMARY for call write~int(0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {8938#true} is VALID [2022-02-20 23:55:11,317 INFO L290 TraceCheckUtils]: 4: Hoare triple {8938#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; {8940#(= |ULTIMATE.start_main_~state~0#1| 1)} is VALID [2022-02-20 23:55:11,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {8940#(= |ULTIMATE.start_main_~state~0#1| 1)} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {8940#(= |ULTIMATE.start_main_~state~0#1| 1)} is VALID [2022-02-20 23:55:11,318 INFO L290 TraceCheckUtils]: 6: Hoare triple {8940#(= |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(8); {8940#(= |ULTIMATE.start_main_~state~0#1| 1)} is VALID [2022-02-20 23:55:11,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {8940#(= |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: L1007 {8940#(= |ULTIMATE.start_main_~state~0#1| 1)} is VALID [2022-02-20 23:55:11,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {8940#(= |ULTIMATE.start_main_~state~0#1| 1)} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {8940#(= |ULTIMATE.start_main_~state~0#1| 1)} is VALID [2022-02-20 23:55:11,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {8940#(= |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: L1008 {8940#(= |ULTIMATE.start_main_~state~0#1| 1)} is VALID [2022-02-20 23:55:11,319 INFO L290 TraceCheckUtils]: 10: Hoare triple {8940#(= |ULTIMATE.start_main_~state~0#1| 1)} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem4#1.base, main_#t~mem4#1.offset;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {8940#(= |ULTIMATE.start_main_~state~0#1| 1)} is VALID [2022-02-20 23:55:11,319 INFO L290 TraceCheckUtils]: 11: Hoare triple {8940#(= |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: L1009 {8940#(= |ULTIMATE.start_main_~state~0#1| 1)} is VALID [2022-02-20 23:55:11,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {8940#(= |ULTIMATE.start_main_~state~0#1| 1)} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {8940#(= |ULTIMATE.start_main_~state~0#1| 1)} is VALID [2022-02-20 23:55:11,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {8940#(= |ULTIMATE.start_main_~state~0#1| 1)} assume 0 != main_#t~nondet5#1;havoc main_#t~nondet5#1; {8940#(= |ULTIMATE.start_main_~state~0#1| 1)} is VALID [2022-02-20 23:55:11,320 INFO L290 TraceCheckUtils]: 14: Hoare triple {8940#(= |ULTIMATE.start_main_~state~0#1| 1)} assume !(1 == main_~state~0#1); {8939#false} is VALID [2022-02-20 23:55:11,320 INFO L290 TraceCheckUtils]: 15: Hoare triple {8939#false} assume !(2 == main_~state~0#1); {8939#false} is VALID [2022-02-20 23:55:11,320 INFO L290 TraceCheckUtils]: 16: Hoare triple {8939#false} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1004-3 {8939#false} is VALID [2022-02-20 23:55:11,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {8939#false} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1025 {8939#false} is VALID [2022-02-20 23:55:11,321 INFO L290 TraceCheckUtils]: 18: Hoare triple {8939#false} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {8939#false} is VALID [2022-02-20 23:55:11,321 INFO L290 TraceCheckUtils]: 19: Hoare triple {8939#false} assume !(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {8939#false} is VALID [2022-02-20 23:55:11,321 INFO L290 TraceCheckUtils]: 20: Hoare triple {8939#false} assume !false; {8939#false} is VALID [2022-02-20 23:55:11,321 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:55:11,321 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:11,321 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228070292] [2022-02-20 23:55:11,321 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228070292] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:11,322 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:11,322 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:55:11,322 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011427445] [2022-02-20 23:55:11,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:11,322 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:55:11,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:11,322 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:55:11,334 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:55:11,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:55:11,335 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:11,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:55:11,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:55:11,335 INFO L87 Difference]: Start difference. First operand 118 states and 141 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:55:11,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:11,410 INFO L93 Difference]: Finished difference Result 185 states and 212 transitions. [2022-02-20 23:55:11,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:55:11,410 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:55:11,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:11,411 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:55:11,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2022-02-20 23:55:11,411 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:55:11,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2022-02-20 23:55:11,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 149 transitions. [2022-02-20 23:55:11,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:11,504 INFO L225 Difference]: With dead ends: 185 [2022-02-20 23:55:11,504 INFO L226 Difference]: Without dead ends: 185 [2022-02-20 23:55:11,504 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:55:11,505 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 60 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 145 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:55:11,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 145 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:55:11,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-02-20 23:55:11,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 131. [2022-02-20 23:55:11,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:11,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand has 131 states, 112 states have (on average 1.3928571428571428) internal successors, (156), 130 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:11,508 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand has 131 states, 112 states have (on average 1.3928571428571428) internal successors, (156), 130 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:11,508 INFO L87 Difference]: Start difference. First operand 185 states. Second operand has 131 states, 112 states have (on average 1.3928571428571428) internal successors, (156), 130 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:11,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:11,510 INFO L93 Difference]: Finished difference Result 185 states and 212 transitions. [2022-02-20 23:55:11,510 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 212 transitions. [2022-02-20 23:55:11,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:11,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:11,544 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 112 states have (on average 1.3928571428571428) internal successors, (156), 130 states have internal predecessors, (156), 0 states have call successors, (0), 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 185 states. [2022-02-20 23:55:11,544 INFO L87 Difference]: Start difference. First operand has 131 states, 112 states have (on average 1.3928571428571428) internal successors, (156), 130 states have internal predecessors, (156), 0 states have call successors, (0), 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 185 states. [2022-02-20 23:55:11,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:11,546 INFO L93 Difference]: Finished difference Result 185 states and 212 transitions. [2022-02-20 23:55:11,546 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 212 transitions. [2022-02-20 23:55:11,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:11,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:11,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:11,546 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:11,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 112 states have (on average 1.3928571428571428) internal successors, (156), 130 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:11,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 156 transitions. [2022-02-20 23:55:11,548 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 156 transitions. Word has length 21 [2022-02-20 23:55:11,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:11,548 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 156 transitions. [2022-02-20 23:55:11,548 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:55:11,548 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 156 transitions. [2022-02-20 23:55:11,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:55:11,548 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:11,548 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:55:11,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-20 23:55:11,548 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:11,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:11,549 INFO L85 PathProgramCache]: Analyzing trace with hash -224265605, now seen corresponding path program 1 times [2022-02-20 23:55:11,549 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:11,549 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303264737] [2022-02-20 23:55:11,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:11,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:11,765 INFO L290 TraceCheckUtils]: 0: Hoare triple {9629#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); {9629#true} is VALID [2022-02-20 23:55:11,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {9629#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {9631#(= |ULTIMATE.start_main_~head~0#1.offset| 0)} is VALID [2022-02-20 23:55:11,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {9631#(= |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: L997 {9632#(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:55:11,767 INFO L290 TraceCheckUtils]: 3: Hoare triple {9632#(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, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {9632#(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:55:11,768 INFO L290 TraceCheckUtils]: 4: Hoare triple {9632#(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; {9633#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |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))} is VALID [2022-02-20 23:55:11,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {9633#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |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))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {9633#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |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))} is VALID [2022-02-20 23:55:11,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {9633#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |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))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {9633#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |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))} is VALID [2022-02-20 23:55:11,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {9633#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |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))} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1004-3 {9634#(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| 4)) 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:55:11,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {9634#(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| 4)) 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~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1025 {9635#(and (= (select (select |#memory_int| |ULTIMATE.start_main_#t~mem6#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) 1) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_#t~mem6#1.offset| 0))} is VALID [2022-02-20 23:55:11,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {9635#(and (= (select (select |#memory_int| |ULTIMATE.start_main_#t~mem6#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) 1) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_#t~mem6#1.offset| 0))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {9636#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) 1) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~head~0#1.offset| 4) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)))} is VALID [2022-02-20 23:55:11,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {9636#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) 1) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~head~0#1.offset| 4) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)))} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {9636#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) 1) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~head~0#1.offset| 4) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)))} is VALID [2022-02-20 23:55:11,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {9636#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) 1) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~head~0#1.offset| 4) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)))} goto; {9636#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) 1) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~head~0#1.offset| 4) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)))} is VALID [2022-02-20 23:55:11,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {9636#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) 1) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~head~0#1.offset| 4) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)))} SUMMARY for call main_#t~mem7#1 := read~int(main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1030-2 {9637#(and (= |ULTIMATE.start_main_#t~mem7#1| 1) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:55:11,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {9637#(and (= |ULTIMATE.start_main_#t~mem7#1| 1) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1; {9630#false} is VALID [2022-02-20 23:55:11,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {9630#false} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1030-3 {9630#false} is VALID [2022-02-20 23:55:11,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {9630#false} 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; {9630#false} is VALID [2022-02-20 23:55:11,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {9630#false} SUMMARY for call main_#t~mem16#1 := read~int(main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1038-3 {9630#false} is VALID [2022-02-20 23:55:11,788 INFO L290 TraceCheckUtils]: 17: Hoare triple {9630#false} assume !(0 != main_#t~mem16#1);havoc main_#t~mem16#1; {9630#false} is VALID [2022-02-20 23:55:11,788 INFO L290 TraceCheckUtils]: 18: Hoare triple {9630#false} assume 0 == main_~x~0#1.offset; {9630#false} is VALID [2022-02-20 23:55:11,789 INFO L290 TraceCheckUtils]: 19: Hoare triple {9630#false} assume main_~x~0#1.base < #StackHeapBarrier; {9630#false} is VALID [2022-02-20 23:55:11,789 INFO L290 TraceCheckUtils]: 20: Hoare triple {9630#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; {9630#false} is VALID [2022-02-20 23:55:11,789 INFO L290 TraceCheckUtils]: 21: Hoare triple {9630#false} assume !(#valid == main_old_#valid#1); {9630#false} is VALID [2022-02-20 23:55:11,789 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:55:11,789 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:11,789 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303264737] [2022-02-20 23:55:11,790 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303264737] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:11,790 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:11,790 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:55:11,790 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581745221] [2022-02-20 23:55:11,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:11,790 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) 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:55:11,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:11,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.4444444444444446) 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:55:11,809 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:55:11,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:55:11,810 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:11,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:55:11,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:55:11,810 INFO L87 Difference]: Start difference. First operand 131 states and 156 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) 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:55:12,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:12,358 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2022-02-20 23:55:12,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:55:12,359 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) 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:55:12,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:12,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) 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:55:12,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 141 transitions. [2022-02-20 23:55:12,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) 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:55:12,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 141 transitions. [2022-02-20 23:55:12,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 141 transitions. [2022-02-20 23:55:12,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:12,463 INFO L225 Difference]: With dead ends: 149 [2022-02-20 23:55:12,463 INFO L226 Difference]: Without dead ends: 149 [2022-02-20 23:55:12,463 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:55:12,463 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 256 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:12,463 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [256 Valid, 313 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:55:12,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-02-20 23:55:12,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 131. [2022-02-20 23:55:12,465 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:12,465 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand has 131 states, 112 states have (on average 1.3839285714285714) internal successors, (155), 130 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:12,466 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand has 131 states, 112 states have (on average 1.3839285714285714) internal successors, (155), 130 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:12,466 INFO L87 Difference]: Start difference. First operand 149 states. Second operand has 131 states, 112 states have (on average 1.3839285714285714) internal successors, (155), 130 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:12,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:12,467 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2022-02-20 23:55:12,467 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 161 transitions. [2022-02-20 23:55:12,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:12,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:12,468 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 112 states have (on average 1.3839285714285714) internal successors, (155), 130 states have internal predecessors, (155), 0 states have call successors, (0), 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 149 states. [2022-02-20 23:55:12,468 INFO L87 Difference]: Start difference. First operand has 131 states, 112 states have (on average 1.3839285714285714) internal successors, (155), 130 states have internal predecessors, (155), 0 states have call successors, (0), 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 149 states. [2022-02-20 23:55:12,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:12,469 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2022-02-20 23:55:12,469 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 161 transitions. [2022-02-20 23:55:12,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:12,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:12,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:12,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:12,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 112 states have (on average 1.3839285714285714) internal successors, (155), 130 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:12,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 155 transitions. [2022-02-20 23:55:12,471 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 155 transitions. Word has length 22 [2022-02-20 23:55:12,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:12,471 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 155 transitions. [2022-02-20 23:55:12,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) 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:55:12,471 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 155 transitions. [2022-02-20 23:55:12,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:55:12,472 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:12,472 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:55:12,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-20 23:55:12,472 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:12,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:12,472 INFO L85 PathProgramCache]: Analyzing trace with hash -350969464, now seen corresponding path program 1 times [2022-02-20 23:55:12,472 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:12,473 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329189611] [2022-02-20 23:55:12,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:12,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:12,506 INFO L290 TraceCheckUtils]: 0: Hoare triple {10228#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); {10228#true} is VALID [2022-02-20 23:55:12,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {10228#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {10228#true} is VALID [2022-02-20 23:55:12,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {10228#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: L997 {10228#true} is VALID [2022-02-20 23:55:12,506 INFO L290 TraceCheckUtils]: 3: Hoare triple {10228#true} SUMMARY for call write~int(0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {10228#true} is VALID [2022-02-20 23:55:12,507 INFO L290 TraceCheckUtils]: 4: Hoare triple {10228#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; {10228#true} is VALID [2022-02-20 23:55:12,507 INFO L290 TraceCheckUtils]: 5: Hoare triple {10228#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {10228#true} is VALID [2022-02-20 23:55:12,507 INFO L290 TraceCheckUtils]: 6: Hoare triple {10228#true} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {10228#true} is VALID [2022-02-20 23:55:12,507 INFO L290 TraceCheckUtils]: 7: Hoare triple {10228#true} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1004-3 {10228#true} is VALID [2022-02-20 23:55:12,507 INFO L290 TraceCheckUtils]: 8: Hoare triple {10228#true} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1025 {10228#true} is VALID [2022-02-20 23:55:12,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {10228#true} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {10228#true} is VALID [2022-02-20 23:55:12,507 INFO L290 TraceCheckUtils]: 10: Hoare triple {10228#true} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {10228#true} is VALID [2022-02-20 23:55:12,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {10228#true} goto; {10228#true} is VALID [2022-02-20 23:55:12,508 INFO L290 TraceCheckUtils]: 12: Hoare triple {10228#true} SUMMARY for call main_#t~mem7#1 := read~int(main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1030-2 {10228#true} is VALID [2022-02-20 23:55:12,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {10228#true} assume !!(0 != main_#t~mem7#1);havoc main_#t~mem7#1; {10228#true} is VALID [2022-02-20 23:55:12,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {10228#true} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1032-13 {10230#(= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem8#1.base|)} is VALID [2022-02-20 23:55:12,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {10230#(= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem8#1.base|)} SUMMARY for call main_#t~mem9#1 := read~int(main_#t~mem8#1.base, 4 + main_#t~mem8#1.offset, 4); srcloc: L1032-1 {10231#(= (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:55:12,509 INFO L290 TraceCheckUtils]: 16: Hoare triple {10231#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} main_#t~short13#1 := 0 == main_#t~mem9#1; {10231#(= (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:55:12,509 INFO L290 TraceCheckUtils]: 17: Hoare triple {10231#(= (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~short13#1; {10231#(= (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:55:12,509 INFO L290 TraceCheckUtils]: 18: Hoare triple {10231#(= (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~short13#1;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem9#1;havoc main_#t~mem11#1;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem12#1;havoc main_#t~short13#1; {10231#(= (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:55:12,510 INFO L290 TraceCheckUtils]: 19: Hoare triple {10231#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} goto; {10231#(= (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:55:12,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {10231#(= (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~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1032-14 {10232#(= (select |#valid| |ULTIMATE.start_main_#t~mem14#1.base|) 1)} is VALID [2022-02-20 23:55:12,511 INFO L290 TraceCheckUtils]: 21: Hoare triple {10232#(= (select |#valid| |ULTIMATE.start_main_#t~mem14#1.base|) 1)} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem14#1.base, main_#t~mem14#1.offset;havoc main_#t~mem14#1.base, main_#t~mem14#1.offset; {10233#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:55:12,511 INFO L290 TraceCheckUtils]: 22: Hoare triple {10233#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !(1 == #valid[main_~x~0#1.base]); {10229#false} is VALID [2022-02-20 23:55:12,511 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:55:12,511 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:12,511 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329189611] [2022-02-20 23:55:12,511 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329189611] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:12,512 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:12,512 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:55:12,512 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20740545] [2022-02-20 23:55:12,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:12,512 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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:55:12,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:12,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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:55:12,526 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:55:12,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:55:12,526 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:12,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:55:12,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:55:12,527 INFO L87 Difference]: Start difference. First operand 131 states and 155 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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:55:12,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:12,813 INFO L93 Difference]: Finished difference Result 134 states and 157 transitions. [2022-02-20 23:55:12,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:55:12,813 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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:55:12,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:12,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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:55:12,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2022-02-20 23:55:12,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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:55:12,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2022-02-20 23:55:12,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 86 transitions. [2022-02-20 23:55:12,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:12,880 INFO L225 Difference]: With dead ends: 134 [2022-02-20 23:55:12,880 INFO L226 Difference]: Without dead ends: 134 [2022-02-20 23:55:12,880 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:55:12,880 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 73 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:12,881 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 154 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:55:12,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-02-20 23:55:12,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2022-02-20 23:55:12,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:12,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 132 states, 113 states have (on average 1.3805309734513274) internal successors, (156), 131 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:12,883 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 132 states, 113 states have (on average 1.3805309734513274) internal successors, (156), 131 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:12,883 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 132 states, 113 states have (on average 1.3805309734513274) internal successors, (156), 131 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:12,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:12,884 INFO L93 Difference]: Finished difference Result 134 states and 157 transitions. [2022-02-20 23:55:12,884 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 157 transitions. [2022-02-20 23:55:12,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:12,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:12,885 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 113 states have (on average 1.3805309734513274) internal successors, (156), 131 states have internal predecessors, (156), 0 states have call successors, (0), 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 134 states. [2022-02-20 23:55:12,885 INFO L87 Difference]: Start difference. First operand has 132 states, 113 states have (on average 1.3805309734513274) internal successors, (156), 131 states have internal predecessors, (156), 0 states have call successors, (0), 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 134 states. [2022-02-20 23:55:12,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:12,886 INFO L93 Difference]: Finished difference Result 134 states and 157 transitions. [2022-02-20 23:55:12,886 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 157 transitions. [2022-02-20 23:55:12,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:12,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:12,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:12,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:12,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 113 states have (on average 1.3805309734513274) internal successors, (156), 131 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:12,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 156 transitions. [2022-02-20 23:55:12,888 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 156 transitions. Word has length 23 [2022-02-20 23:55:12,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:12,889 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 156 transitions. [2022-02-20 23:55:12,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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:55:12,889 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 156 transitions. [2022-02-20 23:55:12,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:55:12,889 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:12,889 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:55:12,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-20 23:55:12,890 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:12,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:12,890 INFO L85 PathProgramCache]: Analyzing trace with hash -350969463, now seen corresponding path program 1 times [2022-02-20 23:55:12,890 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:12,890 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095832875] [2022-02-20 23:55:12,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:12,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:13,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {10778#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); {10778#true} is VALID [2022-02-20 23:55:13,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {10778#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {10780#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 8))} is VALID [2022-02-20 23:55:13,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {10780#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 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: L997 {10781#(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 |#length| |ULTIMATE.start_main_~head~0#1.base|) 8) (= (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:55:13,103 INFO L290 TraceCheckUtils]: 3: Hoare triple {10781#(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 |#length| |ULTIMATE.start_main_~head~0#1.base|) 8) (= (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, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {10781#(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 |#length| |ULTIMATE.start_main_~head~0#1.base|) 8) (= (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:55:13,104 INFO L290 TraceCheckUtils]: 4: Hoare triple {10781#(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 |#length| |ULTIMATE.start_main_~head~0#1.base|) 8) (= (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; {10782#(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|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 8) (= (select (select |#memory_$Pointer$.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|) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:55:13,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {10782#(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|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 8) (= (select (select |#memory_$Pointer$.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|) |ULTIMATE.start_main_~head~0#1.offset|))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {10782#(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|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 8) (= (select (select |#memory_$Pointer$.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|) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:55:13,105 INFO L290 TraceCheckUtils]: 6: Hoare triple {10782#(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|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 8) (= (select (select |#memory_$Pointer$.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|) |ULTIMATE.start_main_~head~0#1.offset|))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {10782#(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|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 8) (= (select (select |#memory_$Pointer$.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|) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:55:13,106 INFO L290 TraceCheckUtils]: 7: Hoare triple {10782#(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|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 8) (= (select (select |#memory_$Pointer$.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|) |ULTIMATE.start_main_~head~0#1.offset|))} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1004-3 {10781#(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 |#length| |ULTIMATE.start_main_~head~0#1.base|) 8) (= (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:55:13,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {10781#(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 |#length| |ULTIMATE.start_main_~head~0#1.base|) 8) (= (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~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1025 {10783#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem6#1.base|) |ULTIMATE.start_main_#t~mem6#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem6#1.base|) |ULTIMATE.start_main_#t~mem6#1.offset|)) 8))} is VALID [2022-02-20 23:55:13,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {10783#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem6#1.base|) |ULTIMATE.start_main_#t~mem6#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem6#1.base|) |ULTIMATE.start_main_#t~mem6#1.offset|)) 8))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {10784#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8))} is VALID [2022-02-20 23:55:13,108 INFO L290 TraceCheckUtils]: 10: Hoare triple {10784#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8))} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {10784#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8))} is VALID [2022-02-20 23:55:13,108 INFO L290 TraceCheckUtils]: 11: Hoare triple {10784#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8))} goto; {10784#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8))} is VALID [2022-02-20 23:55:13,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {10784#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8))} SUMMARY for call main_#t~mem7#1 := read~int(main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1030-2 {10784#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8))} is VALID [2022-02-20 23:55:13,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {10784#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8))} assume !!(0 != main_#t~mem7#1);havoc main_#t~mem7#1; {10784#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8))} is VALID [2022-02-20 23:55:13,109 INFO L290 TraceCheckUtils]: 14: Hoare triple {10784#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1032-13 {10785#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem8#1.offset|) (= |ULTIMATE.start_main_#t~mem8#1.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8))} is VALID [2022-02-20 23:55:13,110 INFO L290 TraceCheckUtils]: 15: Hoare triple {10785#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem8#1.offset|) (= |ULTIMATE.start_main_#t~mem8#1.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8))} SUMMARY for call main_#t~mem9#1 := read~int(main_#t~mem8#1.base, 4 + main_#t~mem8#1.offset, 4); srcloc: L1032-1 {10784#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8))} is VALID [2022-02-20 23:55:13,110 INFO L290 TraceCheckUtils]: 16: Hoare triple {10784#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8))} main_#t~short13#1 := 0 == main_#t~mem9#1; {10784#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8))} is VALID [2022-02-20 23:55:13,111 INFO L290 TraceCheckUtils]: 17: Hoare triple {10784#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8))} assume main_#t~short13#1; {10784#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8))} is VALID [2022-02-20 23:55:13,111 INFO L290 TraceCheckUtils]: 18: Hoare triple {10784#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8))} assume !!main_#t~short13#1;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem9#1;havoc main_#t~mem11#1;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem12#1;havoc main_#t~short13#1; {10784#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8))} is VALID [2022-02-20 23:55:13,112 INFO L290 TraceCheckUtils]: 19: Hoare triple {10784#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8))} goto; {10784#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8))} is VALID [2022-02-20 23:55:13,112 INFO L290 TraceCheckUtils]: 20: Hoare triple {10784#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8))} SUMMARY for call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1032-14 {10786#(and (= (select |#length| |ULTIMATE.start_main_#t~mem14#1.base|) 8) (<= |ULTIMATE.start_main_#t~mem14#1.offset| 0) (<= 0 |ULTIMATE.start_main_#t~mem14#1.offset|))} is VALID [2022-02-20 23:55:13,113 INFO L290 TraceCheckUtils]: 21: Hoare triple {10786#(and (= (select |#length| |ULTIMATE.start_main_#t~mem14#1.base|) 8) (<= |ULTIMATE.start_main_#t~mem14#1.offset| 0) (<= 0 |ULTIMATE.start_main_#t~mem14#1.offset|))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem14#1.base, main_#t~mem14#1.offset;havoc main_#t~mem14#1.base, main_#t~mem14#1.offset; {10787#(and (= (+ (select |#length| |ULTIMATE.start_main_~x~0#1.base|) (- 8)) 0) (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0))} is VALID [2022-02-20 23:55:13,113 INFO L290 TraceCheckUtils]: 22: Hoare triple {10787#(and (= (+ (select |#length| |ULTIMATE.start_main_~x~0#1.base|) (- 8)) 0) (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0))} assume !(4 + (4 + main_~x~0#1.offset) <= #length[main_~x~0#1.base] && 0 <= 4 + main_~x~0#1.offset); {10779#false} is VALID [2022-02-20 23:55:13,113 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:55:13,114 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:13,114 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095832875] [2022-02-20 23:55:13,114 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095832875] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:55:13,114 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538382555] [2022-02-20 23:55:13,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:13,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:55:13,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:55:13,128 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:55:13,139 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:55:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:13,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 23:55:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:13,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:13,471 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:55:13,488 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:55:13,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {10778#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); {10778#true} is VALID [2022-02-20 23:55:13,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {10778#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {10778#true} is VALID [2022-02-20 23:55:13,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {10778#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: L997 {10778#true} is VALID [2022-02-20 23:55:13,539 INFO L290 TraceCheckUtils]: 3: Hoare triple {10778#true} SUMMARY for call write~int(0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {10778#true} is VALID [2022-02-20 23:55:13,540 INFO L290 TraceCheckUtils]: 4: Hoare triple {10778#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; {10778#true} is VALID [2022-02-20 23:55:13,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {10778#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {10778#true} is VALID [2022-02-20 23:55:13,540 INFO L290 TraceCheckUtils]: 6: Hoare triple {10778#true} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {10778#true} is VALID [2022-02-20 23:55:13,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {10778#true} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1004-3 {10778#true} is VALID [2022-02-20 23:55:13,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {10778#true} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1025 {10778#true} is VALID [2022-02-20 23:55:13,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {10778#true} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {10778#true} is VALID [2022-02-20 23:55:13,540 INFO L290 TraceCheckUtils]: 10: Hoare triple {10778#true} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {10778#true} is VALID [2022-02-20 23:55:13,541 INFO L290 TraceCheckUtils]: 11: Hoare triple {10778#true} goto; {10778#true} is VALID [2022-02-20 23:55:13,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {10778#true} SUMMARY for call main_#t~mem7#1 := read~int(main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1030-2 {10778#true} is VALID [2022-02-20 23:55:13,541 INFO L290 TraceCheckUtils]: 13: Hoare triple {10778#true} assume !!(0 != main_#t~mem7#1);havoc main_#t~mem7#1; {10778#true} is VALID [2022-02-20 23:55:13,542 INFO L290 TraceCheckUtils]: 14: Hoare triple {10778#true} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1032-13 {10833#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem8#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem8#1.base|))} is VALID [2022-02-20 23:55:13,542 INFO L290 TraceCheckUtils]: 15: Hoare triple {10833#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem8#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem8#1.base|))} SUMMARY for call main_#t~mem9#1 := read~int(main_#t~mem8#1.base, 4 + main_#t~mem8#1.offset, 4); srcloc: L1032-1 {10837#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 8) (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:55:13,543 INFO L290 TraceCheckUtils]: 16: Hoare triple {10837#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} main_#t~short13#1 := 0 == main_#t~mem9#1; {10837#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 8) (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:55:13,543 INFO L290 TraceCheckUtils]: 17: Hoare triple {10837#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} assume main_#t~short13#1; {10837#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 8) (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:55:13,544 INFO L290 TraceCheckUtils]: 18: Hoare triple {10837#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} assume !!main_#t~short13#1;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem9#1;havoc main_#t~mem11#1;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem12#1;havoc main_#t~short13#1; {10837#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 8) (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:55:13,544 INFO L290 TraceCheckUtils]: 19: Hoare triple {10837#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} goto; {10837#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 8) (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:55:13,545 INFO L290 TraceCheckUtils]: 20: Hoare triple {10837#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 8) (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~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1032-14 {10853#(and (<= 0 (+ 4 |ULTIMATE.start_main_#t~mem14#1.offset|)) (<= (+ 8 |ULTIMATE.start_main_#t~mem14#1.offset|) (select |#length| |ULTIMATE.start_main_#t~mem14#1.base|)))} is VALID [2022-02-20 23:55:13,545 INFO L290 TraceCheckUtils]: 21: Hoare triple {10853#(and (<= 0 (+ 4 |ULTIMATE.start_main_#t~mem14#1.offset|)) (<= (+ 8 |ULTIMATE.start_main_#t~mem14#1.offset|) (select |#length| |ULTIMATE.start_main_#t~mem14#1.base|)))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem14#1.base, main_#t~mem14#1.offset;havoc main_#t~mem14#1.base, main_#t~mem14#1.offset; {10857#(and (<= 0 (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) (<= (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)))} is VALID [2022-02-20 23:55:13,545 INFO L290 TraceCheckUtils]: 22: Hoare triple {10857#(and (<= 0 (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) (<= (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)))} assume !(4 + (4 + main_~x~0#1.offset) <= #length[main_~x~0#1.base] && 0 <= 4 + main_~x~0#1.offset); {10779#false} is VALID [2022-02-20 23:55:13,546 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:55:13,546 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:55:13,546 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538382555] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:13,546 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:55:13,546 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2022-02-20 23:55:13,547 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307389027] [2022-02-20 23:55:13,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:13,548 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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:55:13,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:13,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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:55:13,564 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:55:13,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:55:13,564 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:13,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:55:13,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:55:13,565 INFO L87 Difference]: Start difference. First operand 132 states and 156 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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:55:14,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:14,044 INFO L93 Difference]: Finished difference Result 132 states and 153 transitions. [2022-02-20 23:55:14,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:55:14,045 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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:55:14,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:14,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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:55:14,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2022-02-20 23:55:14,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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:55:14,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2022-02-20 23:55:14,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 84 transitions. [2022-02-20 23:55:14,105 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:55:14,107 INFO L225 Difference]: With dead ends: 132 [2022-02-20 23:55:14,107 INFO L226 Difference]: Without dead ends: 132 [2022-02-20 23:55:14,107 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-02-20 23:55:14,107 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 61 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:14,108 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 165 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:55:14,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-02-20 23:55:14,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2022-02-20 23:55:14,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:14,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 131 states, 113 states have (on average 1.345132743362832) internal successors, (152), 130 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:14,109 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 131 states, 113 states have (on average 1.345132743362832) internal successors, (152), 130 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:14,110 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 131 states, 113 states have (on average 1.345132743362832) internal successors, (152), 130 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:14,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:14,111 INFO L93 Difference]: Finished difference Result 132 states and 153 transitions. [2022-02-20 23:55:14,111 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 153 transitions. [2022-02-20 23:55:14,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:14,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:14,111 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 113 states have (on average 1.345132743362832) internal successors, (152), 130 states have internal predecessors, (152), 0 states have call successors, (0), 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 132 states. [2022-02-20 23:55:14,112 INFO L87 Difference]: Start difference. First operand has 131 states, 113 states have (on average 1.345132743362832) internal successors, (152), 130 states have internal predecessors, (152), 0 states have call successors, (0), 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 132 states. [2022-02-20 23:55:14,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:14,113 INFO L93 Difference]: Finished difference Result 132 states and 153 transitions. [2022-02-20 23:55:14,114 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 153 transitions. [2022-02-20 23:55:14,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:14,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:14,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:14,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:14,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 113 states have (on average 1.345132743362832) internal successors, (152), 130 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:14,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 152 transitions. [2022-02-20 23:55:14,116 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 152 transitions. Word has length 23 [2022-02-20 23:55:14,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:14,116 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 152 transitions. [2022-02-20 23:55:14,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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:55:14,116 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 152 transitions. [2022-02-20 23:55:14,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 23:55:14,116 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:14,116 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:55:14,148 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:55:14,317 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,SelfDestructingSolverStorable21 [2022-02-20 23:55:14,317 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:14,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:14,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1019044192, now seen corresponding path program 1 times [2022-02-20 23:55:14,318 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:14,318 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229904856] [2022-02-20 23:55:14,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:14,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:14,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:14,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {11395#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); {11395#true} is VALID [2022-02-20 23:55:14,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {11395#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {11397#(= |ULTIMATE.start_main_~head~0#1.offset| 0)} is VALID [2022-02-20 23:55:14,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {11397#(= |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: L997 {11398#(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:55:14,510 INFO L290 TraceCheckUtils]: 3: Hoare triple {11398#(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, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {11398#(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:55:14,511 INFO L290 TraceCheckUtils]: 4: Hoare triple {11398#(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; {11399#(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|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= |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|) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:55:14,511 INFO L290 TraceCheckUtils]: 5: Hoare triple {11399#(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|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= |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|) |ULTIMATE.start_main_~head~0#1.offset|))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {11399#(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|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= |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|) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:55:14,512 INFO L290 TraceCheckUtils]: 6: Hoare triple {11399#(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|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= |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|) |ULTIMATE.start_main_~head~0#1.offset|))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {11399#(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|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= |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|) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:55:14,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {11399#(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|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= |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|) |ULTIMATE.start_main_~head~0#1.offset|))} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1004-3 {11398#(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:55:14,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {11398#(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~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1025 {11400#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem6#1.base|) |ULTIMATE.start_main_#t~mem6#1.offset|) 0) (= |ULTIMATE.start_main_#t~mem6#1.offset| 0) (= |ULTIMATE.start_main_#t~mem6#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem6#1.base|) |ULTIMATE.start_main_#t~mem6#1.offset|)))} is VALID [2022-02-20 23:55:14,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {11400#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem6#1.base|) |ULTIMATE.start_main_#t~mem6#1.offset|) 0) (= |ULTIMATE.start_main_#t~mem6#1.offset| 0) (= |ULTIMATE.start_main_#t~mem6#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem6#1.base|) |ULTIMATE.start_main_#t~mem6#1.offset|)))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {11401#(and (= (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|)) (= 4 (+ |ULTIMATE.start_main_~x~0#1.offset| 4)))} is VALID [2022-02-20 23:55:14,514 INFO L290 TraceCheckUtils]: 10: Hoare triple {11401#(and (= (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|)) (= 4 (+ |ULTIMATE.start_main_~x~0#1.offset| 4)))} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {11401#(and (= (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|)) (= 4 (+ |ULTIMATE.start_main_~x~0#1.offset| 4)))} is VALID [2022-02-20 23:55:14,515 INFO L290 TraceCheckUtils]: 11: Hoare triple {11401#(and (= (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|)) (= 4 (+ |ULTIMATE.start_main_~x~0#1.offset| 4)))} goto; {11401#(and (= (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|)) (= 4 (+ |ULTIMATE.start_main_~x~0#1.offset| 4)))} is VALID [2022-02-20 23:55:14,515 INFO L290 TraceCheckUtils]: 12: Hoare triple {11401#(and (= (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|)) (= 4 (+ |ULTIMATE.start_main_~x~0#1.offset| 4)))} SUMMARY for call main_#t~mem7#1 := read~int(main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1030-2 {11401#(and (= (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|)) (= 4 (+ |ULTIMATE.start_main_~x~0#1.offset| 4)))} is VALID [2022-02-20 23:55:14,516 INFO L290 TraceCheckUtils]: 13: Hoare triple {11401#(and (= (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|)) (= 4 (+ |ULTIMATE.start_main_~x~0#1.offset| 4)))} assume !!(0 != main_#t~mem7#1);havoc main_#t~mem7#1; {11401#(and (= (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|)) (= 4 (+ |ULTIMATE.start_main_~x~0#1.offset| 4)))} is VALID [2022-02-20 23:55:14,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {11401#(and (= (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|)) (= 4 (+ |ULTIMATE.start_main_~x~0#1.offset| 4)))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1032-13 {11401#(and (= (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|)) (= 4 (+ |ULTIMATE.start_main_~x~0#1.offset| 4)))} is VALID [2022-02-20 23:55:14,517 INFO L290 TraceCheckUtils]: 15: Hoare triple {11401#(and (= (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|)) (= 4 (+ |ULTIMATE.start_main_~x~0#1.offset| 4)))} SUMMARY for call main_#t~mem9#1 := read~int(main_#t~mem8#1.base, 4 + main_#t~mem8#1.offset, 4); srcloc: L1032-1 {11401#(and (= (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|)) (= 4 (+ |ULTIMATE.start_main_~x~0#1.offset| 4)))} is VALID [2022-02-20 23:55:14,517 INFO L290 TraceCheckUtils]: 16: Hoare triple {11401#(and (= (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|)) (= 4 (+ |ULTIMATE.start_main_~x~0#1.offset| 4)))} main_#t~short13#1 := 0 == main_#t~mem9#1; {11401#(and (= (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|)) (= 4 (+ |ULTIMATE.start_main_~x~0#1.offset| 4)))} is VALID [2022-02-20 23:55:14,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {11401#(and (= (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|)) (= 4 (+ |ULTIMATE.start_main_~x~0#1.offset| 4)))} assume !main_#t~short13#1; {11401#(and (= (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|)) (= 4 (+ |ULTIMATE.start_main_~x~0#1.offset| 4)))} is VALID [2022-02-20 23:55:14,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {11401#(and (= (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|)) (= 4 (+ |ULTIMATE.start_main_~x~0#1.offset| 4)))} SUMMARY for call main_#t~mem11#1 := read~int(main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1032-5 {11402#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) |ULTIMATE.start_main_#t~mem11#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|)) (= 4 (+ |ULTIMATE.start_main_~x~0#1.offset| 4)))} is VALID [2022-02-20 23:55:14,519 INFO L290 TraceCheckUtils]: 19: Hoare triple {11402#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) |ULTIMATE.start_main_#t~mem11#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|)) (= 4 (+ |ULTIMATE.start_main_~x~0#1.offset| 4)))} SUMMARY for call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1032-6 {11403#(= (select (select |#memory_int| |ULTIMATE.start_main_#t~mem10#1.base|) (+ |ULTIMATE.start_main_#t~mem10#1.offset| 4)) |ULTIMATE.start_main_#t~mem11#1|)} is VALID [2022-02-20 23:55:14,520 INFO L290 TraceCheckUtils]: 20: Hoare triple {11403#(= (select (select |#memory_int| |ULTIMATE.start_main_#t~mem10#1.base|) (+ |ULTIMATE.start_main_#t~mem10#1.offset| 4)) |ULTIMATE.start_main_#t~mem11#1|)} SUMMARY for call main_#t~mem12#1 := read~int(main_#t~mem10#1.base, 4 + main_#t~mem10#1.offset, 4); srcloc: L1032-7 {11404#(= (+ (* (- 1) |ULTIMATE.start_main_#t~mem12#1|) |ULTIMATE.start_main_#t~mem11#1|) 0)} is VALID [2022-02-20 23:55:14,520 INFO L290 TraceCheckUtils]: 21: Hoare triple {11404#(= (+ (* (- 1) |ULTIMATE.start_main_#t~mem12#1|) |ULTIMATE.start_main_#t~mem11#1|) 0)} main_#t~short13#1 := main_#t~mem11#1 <= main_#t~mem12#1; {11405#|ULTIMATE.start_main_#t~short13#1|} is VALID [2022-02-20 23:55:14,521 INFO L290 TraceCheckUtils]: 22: Hoare triple {11405#|ULTIMATE.start_main_#t~short13#1|} assume !main_#t~short13#1;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem9#1;havoc main_#t~mem11#1;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem12#1;havoc main_#t~short13#1; {11396#false} is VALID [2022-02-20 23:55:14,521 INFO L290 TraceCheckUtils]: 23: Hoare triple {11396#false} assume !false; {11396#false} is VALID [2022-02-20 23:55:14,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:55:14,521 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:14,521 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229904856] [2022-02-20 23:55:14,521 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229904856] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:14,522 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:14,522 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-20 23:55:14,522 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579255684] [2022-02-20 23:55:14,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:14,522 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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:55:14,522 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:14,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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:55:14,542 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:55:14,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 23:55:14,543 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:14,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 23:55:14,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:55:14,544 INFO L87 Difference]: Start difference. First operand 131 states and 152 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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:55:15,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:15,224 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2022-02-20 23:55:15,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 23:55:15,225 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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:55:15,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:15,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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:55:15,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 138 transitions. [2022-02-20 23:55:15,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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:55:15,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 138 transitions. [2022-02-20 23:55:15,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 138 transitions. [2022-02-20 23:55:15,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:15,362 INFO L225 Difference]: With dead ends: 144 [2022-02-20 23:55:15,362 INFO L226 Difference]: Without dead ends: 144 [2022-02-20 23:55:15,363 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 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:55:15,363 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 136 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:15,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 418 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:55:15,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-02-20 23:55:15,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 130. [2022-02-20 23:55:15,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:15,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand has 130 states, 112 states have (on average 1.3392857142857142) internal successors, (150), 129 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:15,366 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand has 130 states, 112 states have (on average 1.3392857142857142) internal successors, (150), 129 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:15,366 INFO L87 Difference]: Start difference. First operand 144 states. Second operand has 130 states, 112 states have (on average 1.3392857142857142) internal successors, (150), 129 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:15,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:15,368 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2022-02-20 23:55:15,368 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2022-02-20 23:55:15,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:15,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:15,369 INFO L74 IsIncluded]: Start isIncluded. First operand has 130 states, 112 states have (on average 1.3392857142857142) internal successors, (150), 129 states have internal predecessors, (150), 0 states have call successors, (0), 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 144 states. [2022-02-20 23:55:15,369 INFO L87 Difference]: Start difference. First operand has 130 states, 112 states have (on average 1.3392857142857142) internal successors, (150), 129 states have internal predecessors, (150), 0 states have call successors, (0), 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 144 states. [2022-02-20 23:55:15,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:15,370 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2022-02-20 23:55:15,370 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2022-02-20 23:55:15,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:15,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:15,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:15,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:15,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 112 states have (on average 1.3392857142857142) internal successors, (150), 129 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:15,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 150 transitions. [2022-02-20 23:55:15,372 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 150 transitions. Word has length 24 [2022-02-20 23:55:15,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:15,372 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 150 transitions. [2022-02-20 23:55:15,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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:55:15,372 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 150 transitions. [2022-02-20 23:55:15,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 23:55:15,373 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:15,373 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] [2022-02-20 23:55:15,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-20 23:55:15,373 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:15,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:15,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1710834765, now seen corresponding path program 1 times [2022-02-20 23:55:15,374 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:15,374 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890403142] [2022-02-20 23:55:15,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:15,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:15,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {11990#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); {11990#true} is VALID [2022-02-20 23:55:15,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {11990#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {11990#true} is VALID [2022-02-20 23:55:15,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {11990#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: L997 {11992#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:55:15,554 INFO L290 TraceCheckUtils]: 3: Hoare triple {11992#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} SUMMARY for call write~int(0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {11992#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:55:15,554 INFO L290 TraceCheckUtils]: 4: Hoare triple {11992#(= (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; {11993#(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:55:15,555 INFO L290 TraceCheckUtils]: 5: Hoare triple {11993#(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; {11993#(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:55:15,555 INFO L290 TraceCheckUtils]: 6: Hoare triple {11993#(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(8); {11994#(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:55:15,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {11994#(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: L1007 {11995#(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:55:15,557 INFO L290 TraceCheckUtils]: 8: Hoare triple {11995#(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; {11995#(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:55:15,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {11995#(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: L1008 {11996#(and (= |ULTIMATE.start_main_#t~mem4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= |ULTIMATE.start_main_#t~mem4#1.offset| 0) (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~head~0#1.base|)))} is VALID [2022-02-20 23:55:15,558 INFO L290 TraceCheckUtils]: 10: Hoare triple {11996#(and (= |ULTIMATE.start_main_#t~mem4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= |ULTIMATE.start_main_#t~mem4#1.offset| 0) (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~head~0#1.base|)))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem4#1.base, main_#t~mem4#1.offset;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {11997#(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:55:15,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {11997#(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: L1009 {11997#(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:55:15,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {11997#(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~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {11997#(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:55:15,560 INFO L290 TraceCheckUtils]: 13: Hoare triple {11997#(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~nondet5#1);havoc main_#t~nondet5#1; {11997#(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:55:15,561 INFO L290 TraceCheckUtils]: 14: Hoare triple {11997#(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, 4 + main_~x~0#1.offset, 4); srcloc: L1011-1 {11997#(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:55:15,562 INFO L290 TraceCheckUtils]: 15: Hoare triple {11997#(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); {11998#(and (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:55:15,562 INFO L290 TraceCheckUtils]: 16: Hoare triple {11998#(and (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; {11998#(and (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:55:15,562 INFO L290 TraceCheckUtils]: 17: Hoare triple {11998#(and (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; {11998#(and (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:55:15,563 INFO L290 TraceCheckUtils]: 18: Hoare triple {11998#(and (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; {11998#(and (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:55:15,563 INFO L290 TraceCheckUtils]: 19: Hoare triple {11998#(and (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, 4 + main_~x~0#1.offset, 4); srcloc: L1004-3 {11999#(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:55:15,564 INFO L290 TraceCheckUtils]: 20: Hoare triple {11999#(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~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1025 {12000#(not (= |ULTIMATE.start_main_#t~mem6#1.base| 0))} is VALID [2022-02-20 23:55:15,564 INFO L290 TraceCheckUtils]: 21: Hoare triple {12000#(not (= |ULTIMATE.start_main_#t~mem6#1.base| 0))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {12001#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} is VALID [2022-02-20 23:55:15,565 INFO L290 TraceCheckUtils]: 22: Hoare triple {12001#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} assume !(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {11991#false} is VALID [2022-02-20 23:55:15,565 INFO L290 TraceCheckUtils]: 23: Hoare triple {11991#false} assume !false; {11991#false} is VALID [2022-02-20 23:55:15,565 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:55:15,565 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:15,565 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890403142] [2022-02-20 23:55:15,565 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890403142] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:55:15,565 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009482087] [2022-02-20 23:55:15,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:15,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:55:15,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:55:15,567 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:55:15,612 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:55:15,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:15,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 29 conjunts are in the unsatisfiable core [2022-02-20 23:55:15,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:15,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:15,694 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:55:15,786 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:55:15,787 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:55:15,857 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:55:15,989 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:55:15,990 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:55:16,051 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:55:16,052 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:55:16,111 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:55:16,111 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:55:16,144 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:55:16,157 INFO L290 TraceCheckUtils]: 0: Hoare triple {11990#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); {11990#true} is VALID [2022-02-20 23:55:16,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {11990#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {12008#(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:55:16,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {12008#(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: L997 {12008#(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:55:16,159 INFO L290 TraceCheckUtils]: 3: Hoare triple {12008#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} SUMMARY for call write~int(0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {12008#(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:55:16,159 INFO L290 TraceCheckUtils]: 4: Hoare triple {12008#(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; {12018#(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:55:16,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {12018#(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; {12018#(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:55:16,160 INFO L290 TraceCheckUtils]: 6: Hoare triple {12018#(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(8); {12025#(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:55:16,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {12025#(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: L1007 {12029#(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:55:16,161 INFO L290 TraceCheckUtils]: 8: Hoare triple {12029#(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; {12029#(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:55:16,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {12029#(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: L1008 {12036#(and (= |ULTIMATE.start_main_#t~mem4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (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:55:16,162 INFO L290 TraceCheckUtils]: 10: Hoare triple {12036#(and (= |ULTIMATE.start_main_#t~mem4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (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~mem4#1.base, main_#t~mem4#1.offset;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {12040#(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:55:16,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {12040#(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: L1009 {12040#(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:55:16,164 INFO L290 TraceCheckUtils]: 12: Hoare triple {12040#(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~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {12040#(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:55:16,164 INFO L290 TraceCheckUtils]: 13: Hoare triple {12040#(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~nondet5#1);havoc main_#t~nondet5#1; {12040#(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:55:16,165 INFO L290 TraceCheckUtils]: 14: Hoare triple {12040#(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, 4 + main_~x~0#1.offset, 4); srcloc: L1011-1 {12040#(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:55:16,165 INFO L290 TraceCheckUtils]: 15: Hoare triple {12040#(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); {12040#(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:55:16,165 INFO L290 TraceCheckUtils]: 16: Hoare triple {12040#(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; {12040#(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:55:16,166 INFO L290 TraceCheckUtils]: 17: Hoare triple {12040#(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; {12040#(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:55:16,166 INFO L290 TraceCheckUtils]: 18: Hoare triple {12040#(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; {12040#(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:55:16,167 INFO L290 TraceCheckUtils]: 19: Hoare triple {12040#(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, 4 + main_~x~0#1.offset, 4); srcloc: L1004-3 {12068#(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:55:16,167 INFO L290 TraceCheckUtils]: 20: Hoare triple {12068#(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~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1025 {12000#(not (= |ULTIMATE.start_main_#t~mem6#1.base| 0))} is VALID [2022-02-20 23:55:16,168 INFO L290 TraceCheckUtils]: 21: Hoare triple {12000#(not (= |ULTIMATE.start_main_#t~mem6#1.base| 0))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {12001#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} is VALID [2022-02-20 23:55:16,168 INFO L290 TraceCheckUtils]: 22: Hoare triple {12001#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} assume !(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {11991#false} is VALID [2022-02-20 23:55:16,168 INFO L290 TraceCheckUtils]: 23: Hoare triple {11991#false} assume !false; {11991#false} is VALID [2022-02-20 23:55:16,168 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:55:16,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:55:16,189 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_551 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_551) |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:55:16,239 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_551 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_551) |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:55:16,249 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_551 (Array Int Int))) (not (= (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_551) |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:55:16,263 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:55:16,263 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 19 treesize of output 20 [2022-02-20 23:55:16,279 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:55:16,279 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 33 treesize of output 36 [2022-02-20 23:55:16,282 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 20 treesize of output 18 [2022-02-20 23:55:16,460 INFO L290 TraceCheckUtils]: 23: Hoare triple {11991#false} assume !false; {11991#false} is VALID [2022-02-20 23:55:16,461 INFO L290 TraceCheckUtils]: 22: Hoare triple {12001#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} assume !(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {11991#false} is VALID [2022-02-20 23:55:16,461 INFO L290 TraceCheckUtils]: 21: Hoare triple {12000#(not (= |ULTIMATE.start_main_#t~mem6#1.base| 0))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {12001#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} is VALID [2022-02-20 23:55:16,461 INFO L290 TraceCheckUtils]: 20: Hoare triple {11999#(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~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1025 {12000#(not (= |ULTIMATE.start_main_#t~mem6#1.base| 0))} is VALID [2022-02-20 23:55:16,462 INFO L290 TraceCheckUtils]: 19: Hoare triple {12093#(forall ((v_ArrVal_551 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_551) |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, 4 + main_~x~0#1.offset, 4); srcloc: L1004-3 {11999#(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:55:16,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {12093#(forall ((v_ArrVal_551 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_551) |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; {12093#(forall ((v_ArrVal_551 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_551) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} is VALID [2022-02-20 23:55:16,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {12093#(forall ((v_ArrVal_551 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_551) |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; {12093#(forall ((v_ArrVal_551 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_551) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} is VALID [2022-02-20 23:55:16,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {12093#(forall ((v_ArrVal_551 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_551) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} goto; {12093#(forall ((v_ArrVal_551 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_551) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} is VALID [2022-02-20 23:55:16,464 INFO L290 TraceCheckUtils]: 15: Hoare triple {12093#(forall ((v_ArrVal_551 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_551) |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); {12093#(forall ((v_ArrVal_551 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_551) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} is VALID [2022-02-20 23:55:16,465 WARN L290 TraceCheckUtils]: 14: Hoare triple {12093#(forall ((v_ArrVal_551 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_551) |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, 4 + main_~x~0#1.offset, 4); srcloc: L1011-1 {12093#(forall ((v_ArrVal_551 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_551) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} is UNKNOWN [2022-02-20 23:55:16,466 INFO L290 TraceCheckUtils]: 13: Hoare triple {12093#(forall ((v_ArrVal_551 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_551) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} assume !(0 != main_#t~nondet5#1);havoc main_#t~nondet5#1; {12093#(forall ((v_ArrVal_551 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_551) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} is VALID [2022-02-20 23:55:16,466 INFO L290 TraceCheckUtils]: 12: Hoare triple {12093#(forall ((v_ArrVal_551 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_551) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {12093#(forall ((v_ArrVal_551 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_551) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} is VALID [2022-02-20 23:55:16,467 WARN L290 TraceCheckUtils]: 11: Hoare triple {12093#(forall ((v_ArrVal_551 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_551) |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: L1009 {12093#(forall ((v_ArrVal_551 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_551) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} is UNKNOWN [2022-02-20 23:55:16,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {12121#(forall ((v_ArrVal_551 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_551) |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~mem4#1.base, main_#t~mem4#1.offset;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {12093#(forall ((v_ArrVal_551 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_551) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} is VALID [2022-02-20 23:55:16,469 INFO L290 TraceCheckUtils]: 9: Hoare triple {12125#(forall ((v_ArrVal_551 (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_551) |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: L1008 {12121#(forall ((v_ArrVal_551 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_551) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} is VALID [2022-02-20 23:55:16,469 INFO L290 TraceCheckUtils]: 8: Hoare triple {12125#(forall ((v_ArrVal_551 (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_551) |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; {12125#(forall ((v_ArrVal_551 (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_551) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} is VALID [2022-02-20 23:55:16,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {12132#(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: L1007 {12125#(forall ((v_ArrVal_551 (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_551) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} is VALID [2022-02-20 23:55:16,473 INFO L290 TraceCheckUtils]: 6: Hoare triple {12136#(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(8); {12132#(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:55:16,474 INFO L290 TraceCheckUtils]: 5: Hoare triple {12136#(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; {12136#(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:55:16,474 INFO L290 TraceCheckUtils]: 4: Hoare triple {12143#(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; {12136#(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:55:16,475 INFO L290 TraceCheckUtils]: 3: Hoare triple {12143#(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, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {12143#(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:55:16,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {12143#(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: L997 {12143#(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:55:16,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {11990#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {12143#(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:55:16,476 INFO L290 TraceCheckUtils]: 0: Hoare triple {11990#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); {11990#true} is VALID [2022-02-20 23:55:16,476 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:55:16,476 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009482087] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:55:16,476 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:55:16,476 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 25 [2022-02-20 23:55:16,477 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507829918] [2022-02-20 23:55:16,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:55:16,478 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.52) internal successors, (63), 25 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 23:55:16,479 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:16,479 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.52) internal successors, (63), 25 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:16,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 61 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:16,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-20 23:55:16,535 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:16,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-20 23:55:16,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=401, Unknown=3, NotChecked=126, Total=600 [2022-02-20 23:55:16,536 INFO L87 Difference]: Start difference. First operand 130 states and 150 transitions. Second operand has 25 states, 25 states have (on average 2.52) internal successors, (63), 25 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:18,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:18,262 INFO L93 Difference]: Finished difference Result 235 states and 263 transitions. [2022-02-20 23:55:18,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 23:55:18,262 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.52) internal successors, (63), 25 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 23:55:18,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:18,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.52) internal successors, (63), 25 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:18,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 184 transitions. [2022-02-20 23:55:18,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.52) internal successors, (63), 25 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:18,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 184 transitions. [2022-02-20 23:55:18,264 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 184 transitions. [2022-02-20 23:55:18,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:18,440 INFO L225 Difference]: With dead ends: 235 [2022-02-20 23:55:18,440 INFO L226 Difference]: Without dead ends: 235 [2022-02-20 23:55:18,441 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=804, Unknown=3, NotChecked=186, Total=1190 [2022-02-20 23:55:18,441 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 476 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 1391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 586 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:18,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [476 Valid, 700 Invalid, 1391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 746 Invalid, 0 Unknown, 586 Unchecked, 0.5s Time] [2022-02-20 23:55:18,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-02-20 23:55:18,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 152. [2022-02-20 23:55:18,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:18,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 235 states. Second operand has 152 states, 134 states have (on average 1.3059701492537314) internal successors, (175), 151 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:18,444 INFO L74 IsIncluded]: Start isIncluded. First operand 235 states. Second operand has 152 states, 134 states have (on average 1.3059701492537314) internal successors, (175), 151 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:18,444 INFO L87 Difference]: Start difference. First operand 235 states. Second operand has 152 states, 134 states have (on average 1.3059701492537314) internal successors, (175), 151 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:18,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:18,448 INFO L93 Difference]: Finished difference Result 235 states and 263 transitions. [2022-02-20 23:55:18,448 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 263 transitions. [2022-02-20 23:55:18,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:18,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:18,448 INFO L74 IsIncluded]: Start isIncluded. First operand has 152 states, 134 states have (on average 1.3059701492537314) internal successors, (175), 151 states have internal predecessors, (175), 0 states have call successors, (0), 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 235 states. [2022-02-20 23:55:18,449 INFO L87 Difference]: Start difference. First operand has 152 states, 134 states have (on average 1.3059701492537314) internal successors, (175), 151 states have internal predecessors, (175), 0 states have call successors, (0), 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 235 states. [2022-02-20 23:55:18,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:18,451 INFO L93 Difference]: Finished difference Result 235 states and 263 transitions. [2022-02-20 23:55:18,451 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 263 transitions. [2022-02-20 23:55:18,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:18,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:18,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:18,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:18,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 134 states have (on average 1.3059701492537314) internal successors, (175), 151 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:18,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 175 transitions. [2022-02-20 23:55:18,453 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 175 transitions. Word has length 24 [2022-02-20 23:55:18,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:18,454 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 175 transitions. [2022-02-20 23:55:18,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.52) internal successors, (63), 25 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:18,454 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 175 transitions. [2022-02-20 23:55:18,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:55:18,455 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:18,455 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] [2022-02-20 23:55:18,474 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:55:18,671 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,SelfDestructingSolverStorable23 [2022-02-20 23:55:18,672 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:18,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:18,672 INFO L85 PathProgramCache]: Analyzing trace with hash 2020763981, now seen corresponding path program 1 times [2022-02-20 23:55:18,672 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:18,672 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826648148] [2022-02-20 23:55:18,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:18,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:18,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:18,843 INFO L290 TraceCheckUtils]: 0: Hoare triple {13033#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); {13033#true} is VALID [2022-02-20 23:55:18,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {13033#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {13035#(= |ULTIMATE.start_main_~head~0#1.offset| 0)} is VALID [2022-02-20 23:55:18,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {13035#(= |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: L997 {13036#(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:55:18,846 INFO L290 TraceCheckUtils]: 3: Hoare triple {13036#(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, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {13036#(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:55:18,846 INFO L290 TraceCheckUtils]: 4: Hoare triple {13036#(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; {13037#(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|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.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|) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:55:18,847 INFO L290 TraceCheckUtils]: 5: Hoare triple {13037#(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|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.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|) |ULTIMATE.start_main_~head~0#1.offset|))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {13037#(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|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.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|) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:55:18,848 INFO L290 TraceCheckUtils]: 6: Hoare triple {13037#(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|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.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|) |ULTIMATE.start_main_~head~0#1.offset|))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {13037#(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|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.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|) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:55:18,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {13037#(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|) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.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|) |ULTIMATE.start_main_~head~0#1.offset|))} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1004-3 {13036#(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:55:18,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {13036#(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~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1025 {13038#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem6#1.base|) |ULTIMATE.start_main_#t~mem6#1.offset|) 0)} is VALID [2022-02-20 23:55:18,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {13038#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem6#1.base|) |ULTIMATE.start_main_#t~mem6#1.offset|) 0)} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {13039#(= (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:55:18,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {13039#(= (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); {13039#(= (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:55:18,851 INFO L290 TraceCheckUtils]: 11: Hoare triple {13039#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)} goto; {13039#(= (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:55:18,851 INFO L290 TraceCheckUtils]: 12: Hoare triple {13039#(= (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~mem7#1 := read~int(main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1030-2 {13039#(= (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:55:18,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {13039#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)} assume !!(0 != main_#t~mem7#1);havoc main_#t~mem7#1; {13039#(= (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:55:18,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {13039#(= (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.base, main_#t~mem8#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1032-13 {13040#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem8#1.offset|) (= |ULTIMATE.start_main_#t~mem8#1.offset| 0))} is VALID [2022-02-20 23:55:18,853 INFO L290 TraceCheckUtils]: 15: Hoare triple {13040#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem8#1.offset|) (= |ULTIMATE.start_main_#t~mem8#1.offset| 0))} SUMMARY for call main_#t~mem9#1 := read~int(main_#t~mem8#1.base, 4 + main_#t~mem8#1.offset, 4); srcloc: L1032-1 {13041#(<= 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:55:18,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {13041#(<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} main_#t~short13#1 := 0 == main_#t~mem9#1; {13041#(<= 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:55:18,853 INFO L290 TraceCheckUtils]: 17: Hoare triple {13041#(<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} assume main_#t~short13#1; {13041#(<= 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:55:18,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {13041#(<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} assume !!main_#t~short13#1;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem9#1;havoc main_#t~mem11#1;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem12#1;havoc main_#t~short13#1; {13041#(<= 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:55:18,854 INFO L290 TraceCheckUtils]: 19: Hoare triple {13041#(<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} goto; {13041#(<= 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:55:18,855 INFO L290 TraceCheckUtils]: 20: Hoare triple {13041#(<= 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~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1032-14 {13042#(<= 0 |ULTIMATE.start_main_#t~mem14#1.offset|)} is VALID [2022-02-20 23:55:18,855 INFO L290 TraceCheckUtils]: 21: Hoare triple {13042#(<= 0 |ULTIMATE.start_main_#t~mem14#1.offset|)} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem14#1.base, main_#t~mem14#1.offset;havoc main_#t~mem14#1.base, main_#t~mem14#1.offset; {13043#(<= 0 |ULTIMATE.start_main_~x~0#1.offset|)} is VALID [2022-02-20 23:55:18,856 INFO L290 TraceCheckUtils]: 22: Hoare triple {13043#(<= 0 |ULTIMATE.start_main_~x~0#1.offset|)} SUMMARY for call main_#t~mem7#1 := read~int(main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1030-2 {13044#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)))} is VALID [2022-02-20 23:55:18,856 INFO L290 TraceCheckUtils]: 23: Hoare triple {13044#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)))} assume !!(0 != main_#t~mem7#1);havoc main_#t~mem7#1; {13044#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)))} is VALID [2022-02-20 23:55:18,857 INFO L290 TraceCheckUtils]: 24: Hoare triple {13044#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)))} assume !(4 + main_~x~0#1.offset <= #length[main_~x~0#1.base] && 0 <= main_~x~0#1.offset); {13034#false} is VALID [2022-02-20 23:55:18,857 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:55:18,857 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:18,857 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826648148] [2022-02-20 23:55:18,857 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826648148] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:55:18,857 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025498040] [2022-02-20 23:55:18,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:18,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:55:18,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:55:18,872 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:55:18,873 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:55:18,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:18,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-20 23:55:18,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:18,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:19,113 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:55:19,125 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:55:19,187 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:55:19,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {13033#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); {13033#true} is VALID [2022-02-20 23:55:19,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {13033#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {13033#true} is VALID [2022-02-20 23:55:19,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {13033#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: L997 {13033#true} is VALID [2022-02-20 23:55:19,207 INFO L290 TraceCheckUtils]: 3: Hoare triple {13033#true} SUMMARY for call write~int(0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {13033#true} is VALID [2022-02-20 23:55:19,207 INFO L290 TraceCheckUtils]: 4: Hoare triple {13033#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; {13033#true} is VALID [2022-02-20 23:55:19,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {13033#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {13033#true} is VALID [2022-02-20 23:55:19,207 INFO L290 TraceCheckUtils]: 6: Hoare triple {13033#true} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {13033#true} is VALID [2022-02-20 23:55:19,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {13033#true} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1004-3 {13033#true} is VALID [2022-02-20 23:55:19,208 INFO L290 TraceCheckUtils]: 8: Hoare triple {13033#true} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1025 {13033#true} is VALID [2022-02-20 23:55:19,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {13033#true} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {13033#true} is VALID [2022-02-20 23:55:19,208 INFO L290 TraceCheckUtils]: 10: Hoare triple {13033#true} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {13033#true} is VALID [2022-02-20 23:55:19,208 INFO L290 TraceCheckUtils]: 11: Hoare triple {13033#true} goto; {13033#true} is VALID [2022-02-20 23:55:19,208 INFO L290 TraceCheckUtils]: 12: Hoare triple {13033#true} SUMMARY for call main_#t~mem7#1 := read~int(main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1030-2 {13033#true} is VALID [2022-02-20 23:55:19,208 INFO L290 TraceCheckUtils]: 13: Hoare triple {13033#true} assume !!(0 != main_#t~mem7#1);havoc main_#t~mem7#1; {13033#true} is VALID [2022-02-20 23:55:19,209 INFO L290 TraceCheckUtils]: 14: Hoare triple {13033#true} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1032-13 {13090#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem8#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem8#1.base|))} is VALID [2022-02-20 23:55:19,210 INFO L290 TraceCheckUtils]: 15: Hoare triple {13090#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem8#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem8#1.base|))} SUMMARY for call main_#t~mem9#1 := read~int(main_#t~mem8#1.base, 4 + main_#t~mem8#1.offset, 4); srcloc: L1032-1 {13094#(= |ULTIMATE.start_main_#t~mem9#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|) 4)))} is VALID [2022-02-20 23:55:19,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {13094#(= |ULTIMATE.start_main_#t~mem9#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|) 4)))} main_#t~short13#1 := 0 == main_#t~mem9#1; {13098#(or (and (= (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|) 4)) 0) |ULTIMATE.start_main_#t~short13#1|) (and (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|) 4)) 0)) (not |ULTIMATE.start_main_#t~short13#1|)))} is VALID [2022-02-20 23:55:19,211 INFO L290 TraceCheckUtils]: 17: Hoare triple {13098#(or (and (= (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|) 4)) 0) |ULTIMATE.start_main_#t~short13#1|) (and (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|) 4)) 0)) (not |ULTIMATE.start_main_#t~short13#1|)))} assume main_#t~short13#1; {13102#(= (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|) 4)) 0)} is VALID [2022-02-20 23:55:19,212 INFO L290 TraceCheckUtils]: 18: Hoare triple {13102#(= (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|) 4)) 0)} assume !!main_#t~short13#1;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem9#1;havoc main_#t~mem11#1;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem12#1;havoc main_#t~short13#1; {13102#(= (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|) 4)) 0)} is VALID [2022-02-20 23:55:19,212 INFO L290 TraceCheckUtils]: 19: Hoare triple {13102#(= (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|) 4)) 0)} goto; {13102#(= (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|) 4)) 0)} is VALID [2022-02-20 23:55:19,213 INFO L290 TraceCheckUtils]: 20: Hoare triple {13102#(= (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|) 4)) 0)} SUMMARY for call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1032-14 {13112#(= (select (select |#memory_int| |ULTIMATE.start_main_#t~mem14#1.base|) (+ 4 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0)} is VALID [2022-02-20 23:55:19,214 INFO L290 TraceCheckUtils]: 21: Hoare triple {13112#(= (select (select |#memory_int| |ULTIMATE.start_main_#t~mem14#1.base|) (+ 4 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0)} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem14#1.base, main_#t~mem14#1.offset;havoc main_#t~mem14#1.base, main_#t~mem14#1.offset; {13116#(= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) 0)} is VALID [2022-02-20 23:55:19,214 INFO L290 TraceCheckUtils]: 22: Hoare triple {13116#(= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) 0)} SUMMARY for call main_#t~mem7#1 := read~int(main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1030-2 {13120#(= |ULTIMATE.start_main_#t~mem7#1| 0)} is VALID [2022-02-20 23:55:19,214 INFO L290 TraceCheckUtils]: 23: Hoare triple {13120#(= |ULTIMATE.start_main_#t~mem7#1| 0)} assume !!(0 != main_#t~mem7#1);havoc main_#t~mem7#1; {13034#false} is VALID [2022-02-20 23:55:19,215 INFO L290 TraceCheckUtils]: 24: Hoare triple {13034#false} assume !(4 + main_~x~0#1.offset <= #length[main_~x~0#1.base] && 0 <= main_~x~0#1.offset); {13034#false} is VALID [2022-02-20 23:55:19,215 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:55:19,215 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:55:19,215 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025498040] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:19,215 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:55:19,215 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 19 [2022-02-20 23:55:19,216 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052397535] [2022-02-20 23:55:19,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:19,216 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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:55:19,217 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:19,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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:55:19,236 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:55:19,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:55:19,236 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:19,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:55:19,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2022-02-20 23:55:19,237 INFO L87 Difference]: Start difference. First operand 152 states and 175 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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:55:19,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:19,804 INFO L93 Difference]: Finished difference Result 170 states and 194 transitions. [2022-02-20 23:55:19,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:55:19,804 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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:55:19,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:19,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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:55:19,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 87 transitions. [2022-02-20 23:55:19,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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:55:19,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 87 transitions. [2022-02-20 23:55:19,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 87 transitions. [2022-02-20 23:55:19,867 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:55:19,868 INFO L225 Difference]: With dead ends: 170 [2022-02-20 23:55:19,869 INFO L226 Difference]: Without dead ends: 170 [2022-02-20 23:55:19,869 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 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:55:19,869 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 32 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:19,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 304 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:55:19,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-02-20 23:55:19,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 165. [2022-02-20 23:55:19,871 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:19,871 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand has 165 states, 147 states have (on average 1.2925170068027212) internal successors, (190), 164 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:19,871 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand has 165 states, 147 states have (on average 1.2925170068027212) internal successors, (190), 164 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:19,872 INFO L87 Difference]: Start difference. First operand 170 states. Second operand has 165 states, 147 states have (on average 1.2925170068027212) internal successors, (190), 164 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:19,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:19,874 INFO L93 Difference]: Finished difference Result 170 states and 194 transitions. [2022-02-20 23:55:19,874 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 194 transitions. [2022-02-20 23:55:19,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:19,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:19,874 INFO L74 IsIncluded]: Start isIncluded. First operand has 165 states, 147 states have (on average 1.2925170068027212) internal successors, (190), 164 states have internal predecessors, (190), 0 states have call successors, (0), 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 170 states. [2022-02-20 23:55:19,875 INFO L87 Difference]: Start difference. First operand has 165 states, 147 states have (on average 1.2925170068027212) internal successors, (190), 164 states have internal predecessors, (190), 0 states have call successors, (0), 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 170 states. [2022-02-20 23:55:19,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:19,876 INFO L93 Difference]: Finished difference Result 170 states and 194 transitions. [2022-02-20 23:55:19,877 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 194 transitions. [2022-02-20 23:55:19,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:19,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:19,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:19,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:19,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 147 states have (on average 1.2925170068027212) internal successors, (190), 164 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:19,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 190 transitions. [2022-02-20 23:55:19,879 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 190 transitions. Word has length 25 [2022-02-20 23:55:19,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:19,879 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 190 transitions. [2022-02-20 23:55:19,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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:55:19,879 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 190 transitions. [2022-02-20 23:55:19,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:55:19,880 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:19,880 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] [2022-02-20 23:55:19,897 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:55:20,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:55:20,098 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:20,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:20,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1496266000, now seen corresponding path program 1 times [2022-02-20 23:55:20,098 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:20,098 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964467763] [2022-02-20 23:55:20,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:20,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:20,241 INFO L290 TraceCheckUtils]: 0: Hoare triple {13811#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); {13811#true} is VALID [2022-02-20 23:55:20,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {13811#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {13811#true} is VALID [2022-02-20 23:55:20,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {13811#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: L997 {13813#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:55:20,242 INFO L290 TraceCheckUtils]: 3: Hoare triple {13813#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} SUMMARY for call write~int(0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {13813#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:55:20,242 INFO L290 TraceCheckUtils]: 4: Hoare triple {13813#(= (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; {13814#(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:55:20,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {13814#(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; {13814#(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:55:20,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {13814#(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(8); {13815#(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:55:20,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {13815#(and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1007 {13816#(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:55:20,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {13816#(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; {13816#(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:55:20,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {13816#(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: L1008 {13817#(and (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:55:20,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {13817#(and (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem4#1.base, main_#t~mem4#1.offset;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {13818#(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:55:20,247 INFO L290 TraceCheckUtils]: 11: Hoare triple {13818#(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: L1009 {13818#(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:55:20,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {13818#(and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {13818#(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:55:20,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {13818#(and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} assume !(0 != main_#t~nondet5#1);havoc main_#t~nondet5#1; {13818#(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:55:20,249 INFO L290 TraceCheckUtils]: 14: Hoare triple {13818#(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, 4 + main_~x~0#1.offset, 4); srcloc: L1011-1 {13818#(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:55:20,250 INFO L290 TraceCheckUtils]: 15: Hoare triple {13818#(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); {13818#(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:55:20,250 INFO L290 TraceCheckUtils]: 16: Hoare triple {13818#(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; {13818#(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:55:20,251 INFO L290 TraceCheckUtils]: 17: Hoare triple {13818#(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; {13818#(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:55:20,251 INFO L290 TraceCheckUtils]: 18: Hoare triple {13818#(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; {13818#(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:55:20,252 INFO L290 TraceCheckUtils]: 19: Hoare triple {13818#(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, 4 + main_~x~0#1.offset, 4); srcloc: L1004-3 {13819#(= (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:55:20,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {13819#(= (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~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1025 {13820#(= (select |#valid| |ULTIMATE.start_main_#t~mem6#1.base|) 1)} is VALID [2022-02-20 23:55:20,253 INFO L290 TraceCheckUtils]: 21: Hoare triple {13820#(= (select |#valid| |ULTIMATE.start_main_#t~mem6#1.base|) 1)} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {13821#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:55:20,253 INFO L290 TraceCheckUtils]: 22: Hoare triple {13821#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {13821#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:55:20,253 INFO L290 TraceCheckUtils]: 23: Hoare triple {13821#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} goto; {13821#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:55:20,254 INFO L290 TraceCheckUtils]: 24: Hoare triple {13821#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !(1 == #valid[main_~x~0#1.base]); {13812#false} is VALID [2022-02-20 23:55:20,254 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:55:20,254 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:20,254 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964467763] [2022-02-20 23:55:20,254 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964467763] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:55:20,255 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146893202] [2022-02-20 23:55:20,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:20,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:55:20,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:55:20,257 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:55:20,257 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:55:20,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:20,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 30 conjunts are in the unsatisfiable core [2022-02-20 23:55:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:20,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:20,381 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:55:20,461 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-20 23:55:20,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-02-20 23:55:20,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:55:20,661 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:55:20,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-02-20 23:55:20,727 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:55:20,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-02-20 23:55:20,821 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:55:20,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-02-20 23:55:20,869 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 13 [2022-02-20 23:55:21,065 INFO L290 TraceCheckUtils]: 0: Hoare triple {13811#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); {13811#true} is VALID [2022-02-20 23:55:21,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {13811#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {13828#(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:55:21,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {13828#(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: L997 {13828#(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:55:21,068 INFO L290 TraceCheckUtils]: 3: Hoare triple {13828#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} SUMMARY for call write~int(0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {13828#(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:55:21,068 INFO L290 TraceCheckUtils]: 4: Hoare triple {13828#(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; {13838#(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:55:21,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {13838#(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; {13838#(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:55:21,070 INFO L290 TraceCheckUtils]: 6: Hoare triple {13838#(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(8); {13845#(and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:55:21,071 INFO L290 TraceCheckUtils]: 7: Hoare triple {13845#(and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1007 {13849#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1))} is VALID [2022-02-20 23:55:21,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {13849#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {13849#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1))} is VALID [2022-02-20 23:55:21,072 INFO L290 TraceCheckUtils]: 9: Hoare triple {13849#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1))} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1008 {13856#(and (= |ULTIMATE.start_main_#t~mem4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:55:21,072 INFO L290 TraceCheckUtils]: 10: Hoare triple {13856#(and (= |ULTIMATE.start_main_#t~mem4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem4#1.base, main_#t~mem4#1.offset;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {13860#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:55:21,073 INFO L290 TraceCheckUtils]: 11: Hoare triple {13860#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1009 {13860#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:55:21,074 INFO L290 TraceCheckUtils]: 12: Hoare triple {13860#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {13860#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:55:21,074 INFO L290 TraceCheckUtils]: 13: Hoare triple {13860#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} assume !(0 != main_#t~nondet5#1);havoc main_#t~nondet5#1; {13860#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:55:21,075 INFO L290 TraceCheckUtils]: 14: Hoare triple {13860#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1011-1 {13860#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:55:21,076 INFO L290 TraceCheckUtils]: 15: Hoare triple {13860#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {13860#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:55:21,077 INFO L290 TraceCheckUtils]: 16: Hoare triple {13860#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} goto; {13860#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:55:21,077 INFO L290 TraceCheckUtils]: 17: Hoare triple {13860#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {13860#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:55:21,078 INFO L290 TraceCheckUtils]: 18: Hoare triple {13860#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {13860#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:55:21,079 INFO L290 TraceCheckUtils]: 19: Hoare triple {13860#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} SUMMARY for call write~int(main_~state~0#1, main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1004-3 {13888#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:55:21,080 INFO L290 TraceCheckUtils]: 20: Hoare triple {13888#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1025 {13892#(and (= (select |#valid| |ULTIMATE.start_main_#t~mem6#1.base|) 1) (exists ((|ULTIMATE.start_main_~head~0#1.base| Int)) (and (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (not (= |ULTIMATE.start_main_#t~mem6#1.base| |ULTIMATE.start_main_~head~0#1.base|)))))} is VALID [2022-02-20 23:55:21,080 INFO L290 TraceCheckUtils]: 21: Hoare triple {13892#(and (= (select |#valid| |ULTIMATE.start_main_#t~mem6#1.base|) 1) (exists ((|ULTIMATE.start_main_~head~0#1.base| Int)) (and (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (not (= |ULTIMATE.start_main_#t~mem6#1.base| |ULTIMATE.start_main_~head~0#1.base|)))))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {13896#(and (exists ((|ULTIMATE.start_main_~head~0#1.base| Int)) (and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1))} is VALID [2022-02-20 23:55:21,081 INFO L290 TraceCheckUtils]: 22: Hoare triple {13896#(and (exists ((|ULTIMATE.start_main_~head~0#1.base| Int)) (and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1))} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {13896#(and (exists ((|ULTIMATE.start_main_~head~0#1.base| Int)) (and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1))} is VALID [2022-02-20 23:55:21,082 INFO L290 TraceCheckUtils]: 23: Hoare triple {13896#(and (exists ((|ULTIMATE.start_main_~head~0#1.base| Int)) (and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1))} goto; {13896#(and (exists ((|ULTIMATE.start_main_~head~0#1.base| Int)) (and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1))} is VALID [2022-02-20 23:55:21,082 INFO L290 TraceCheckUtils]: 24: Hoare triple {13896#(and (exists ((|ULTIMATE.start_main_~head~0#1.base| Int)) (and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1))} assume !(1 == #valid[main_~x~0#1.base]); {13812#false} is VALID [2022-02-20 23:55:21,083 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:55:21,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:55:21,175 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_678 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_678) |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:55:21,184 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_678 (Array Int Int))) (= (select |c_#valid| (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_678) |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:55:21,200 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:55:21,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-02-20 23:55:21,207 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:55:21,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2022-02-20 23:55:21,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-02-20 23:55:23,937 INFO L290 TraceCheckUtils]: 24: Hoare triple {13821#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !(1 == #valid[main_~x~0#1.base]); {13812#false} is VALID [2022-02-20 23:55:23,938 INFO L290 TraceCheckUtils]: 23: Hoare triple {13821#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} goto; {13821#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:55:23,938 INFO L290 TraceCheckUtils]: 22: Hoare triple {13821#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {13821#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:55:23,939 INFO L290 TraceCheckUtils]: 21: Hoare triple {13820#(= (select |#valid| |ULTIMATE.start_main_#t~mem6#1.base|) 1)} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {13821#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:55:23,939 INFO L290 TraceCheckUtils]: 20: Hoare triple {13819#(= (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~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1025 {13820#(= (select |#valid| |ULTIMATE.start_main_#t~mem6#1.base|) 1)} is VALID [2022-02-20 23:55:23,940 INFO L290 TraceCheckUtils]: 19: Hoare triple {13921#(forall ((v_ArrVal_678 (Array Int Int))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_678) |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, 4 + main_~x~0#1.offset, 4); srcloc: L1004-3 {13819#(= (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:55:23,941 INFO L290 TraceCheckUtils]: 18: Hoare triple {13921#(forall ((v_ArrVal_678 (Array Int Int))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_678) |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; {13921#(forall ((v_ArrVal_678 (Array Int Int))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_678) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:55:23,941 INFO L290 TraceCheckUtils]: 17: Hoare triple {13921#(forall ((v_ArrVal_678 (Array Int Int))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_678) |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; {13921#(forall ((v_ArrVal_678 (Array Int Int))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_678) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:55:23,941 INFO L290 TraceCheckUtils]: 16: Hoare triple {13921#(forall ((v_ArrVal_678 (Array Int Int))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_678) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} goto; {13921#(forall ((v_ArrVal_678 (Array Int Int))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_678) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:55:23,942 INFO L290 TraceCheckUtils]: 15: Hoare triple {13921#(forall ((v_ArrVal_678 (Array Int Int))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_678) |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); {13921#(forall ((v_ArrVal_678 (Array Int Int))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_678) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:55:23,944 WARN L290 TraceCheckUtils]: 14: Hoare triple {13921#(forall ((v_ArrVal_678 (Array Int Int))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_678) |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, 4 + main_~x~0#1.offset, 4); srcloc: L1011-1 {13921#(forall ((v_ArrVal_678 (Array Int Int))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_678) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is UNKNOWN [2022-02-20 23:55:23,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {13921#(forall ((v_ArrVal_678 (Array Int Int))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_678) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} assume !(0 != main_#t~nondet5#1);havoc main_#t~nondet5#1; {13921#(forall ((v_ArrVal_678 (Array Int Int))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_678) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:55:23,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {13921#(forall ((v_ArrVal_678 (Array Int Int))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_678) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {13921#(forall ((v_ArrVal_678 (Array Int Int))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_678) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:55:23,947 WARN L290 TraceCheckUtils]: 11: Hoare triple {13921#(forall ((v_ArrVal_678 (Array Int Int))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_678) |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: L1009 {13921#(forall ((v_ArrVal_678 (Array Int Int))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_678) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is UNKNOWN [2022-02-20 23:55:23,947 INFO L290 TraceCheckUtils]: 10: Hoare triple {13949#(forall ((v_ArrVal_678 (Array Int Int))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_678) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem4#1.base, main_#t~mem4#1.offset;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {13921#(forall ((v_ArrVal_678 (Array Int Int))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_678) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:55:23,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {13953#(forall ((v_ArrVal_678 (Array Int Int))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_678) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1008 {13949#(forall ((v_ArrVal_678 (Array Int Int))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_678) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:55:23,948 INFO L290 TraceCheckUtils]: 8: Hoare triple {13953#(forall ((v_ArrVal_678 (Array Int Int))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_678) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {13953#(forall ((v_ArrVal_678 (Array Int Int))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_678) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:55:23,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {13960#(or (forall ((v_arrayElimCell_23 Int)) (= (select |#valid| v_arrayElimCell_23) 1)) (forall ((v_arrayElimCell_22 Int)) (or (and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| v_arrayElimCell_22) 1)) (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_#t~malloc3#1.base| v_arrayElimCell_22))))))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1007 {13953#(forall ((v_ArrVal_678 (Array Int Int))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_678) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:55:23,967 INFO L290 TraceCheckUtils]: 6: Hoare triple {13964#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_9| Int) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_9|) 0)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_9| 1) v_arrayElimCell_23) 1) (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_9| v_arrayElimCell_22))) (and (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_9| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_9| 1) v_arrayElimCell_22) 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(8); {13960#(or (forall ((v_arrayElimCell_23 Int)) (= (select |#valid| v_arrayElimCell_23) 1)) (forall ((v_arrayElimCell_22 Int)) (or (and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| v_arrayElimCell_22) 1)) (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_#t~malloc3#1.base| v_arrayElimCell_22))))))} is VALID [2022-02-20 23:55:23,978 INFO L290 TraceCheckUtils]: 5: Hoare triple {13964#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_9| Int) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_9|) 0)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_9| 1) v_arrayElimCell_23) 1) (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_9| v_arrayElimCell_22))) (and (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_9| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_9| 1) v_arrayElimCell_22) 1))))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {13964#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_9| Int) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_9|) 0)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_9| 1) v_arrayElimCell_23) 1) (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_9| v_arrayElimCell_22))) (and (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_9| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_9| 1) v_arrayElimCell_22) 1))))} is VALID [2022-02-20 23:55:23,979 INFO L290 TraceCheckUtils]: 4: Hoare triple {13971#(or (forall ((v_arrayElimCell_23 Int)) (= (select (store |#valid| |ULTIMATE.start_main_~head~0#1.base| 1) v_arrayElimCell_23) 1)) (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; {13964#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_9| Int) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_9|) 0)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_9| 1) v_arrayElimCell_23) 1) (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_9| v_arrayElimCell_22))) (and (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_9| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_9| 1) v_arrayElimCell_22) 1))))} is VALID [2022-02-20 23:55:23,979 INFO L290 TraceCheckUtils]: 3: Hoare triple {13971#(or (forall ((v_arrayElimCell_23 Int)) (= (select (store |#valid| |ULTIMATE.start_main_~head~0#1.base| 1) v_arrayElimCell_23) 1)) (not (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 0)))} SUMMARY for call write~int(0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {13971#(or (forall ((v_arrayElimCell_23 Int)) (= (select (store |#valid| |ULTIMATE.start_main_~head~0#1.base| 1) v_arrayElimCell_23) 1)) (not (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 0)))} is VALID [2022-02-20 23:55:23,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {13971#(or (forall ((v_arrayElimCell_23 Int)) (= (select (store |#valid| |ULTIMATE.start_main_~head~0#1.base| 1) v_arrayElimCell_23) 1)) (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: L997 {13971#(or (forall ((v_arrayElimCell_23 Int)) (= (select (store |#valid| |ULTIMATE.start_main_~head~0#1.base| 1) v_arrayElimCell_23) 1)) (not (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 0)))} is VALID [2022-02-20 23:55:23,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {13811#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {13971#(or (forall ((v_arrayElimCell_23 Int)) (= (select (store |#valid| |ULTIMATE.start_main_~head~0#1.base| 1) v_arrayElimCell_23) 1)) (not (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 0)))} is VALID [2022-02-20 23:55:23,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {13811#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); {13811#true} is VALID [2022-02-20 23:55:23,981 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:55:23,981 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146893202] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:55:23,981 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:55:23,981 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2022-02-20 23:55:23,981 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843517299] [2022-02-20 23:55:23,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:55:23,982 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.72) internal successors, (68), 26 states have internal predecessors, (68), 0 states have call successors, (0), 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:55:23,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:23,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 26 states, 25 states have (on average 2.72) internal successors, (68), 26 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:28,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 64 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:28,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-02-20 23:55:28,055 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:28,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-02-20 23:55:28,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=439, Unknown=11, NotChecked=90, Total=650 [2022-02-20 23:55:28,056 INFO L87 Difference]: Start difference. First operand 165 states and 190 transitions. Second operand has 26 states, 25 states have (on average 2.72) internal successors, (68), 26 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:29,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:29,433 INFO L93 Difference]: Finished difference Result 259 states and 300 transitions. [2022-02-20 23:55:29,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-20 23:55:29,433 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.72) internal successors, (68), 26 states have internal predecessors, (68), 0 states have call successors, (0), 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:55:29,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:29,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 2.72) internal successors, (68), 26 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:29,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 194 transitions. [2022-02-20 23:55:29,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 2.72) internal successors, (68), 26 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:29,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 194 transitions. [2022-02-20 23:55:29,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 194 transitions. [2022-02-20 23:55:29,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:29,582 INFO L225 Difference]: With dead ends: 259 [2022-02-20 23:55:29,582 INFO L226 Difference]: Without dead ends: 259 [2022-02-20 23:55:29,583 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=257, Invalid=927, Unknown=14, NotChecked=134, Total=1332 [2022-02-20 23:55:29,583 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 301 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 701 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:29,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [301 Valid, 672 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 509 Invalid, 0 Unknown, 701 Unchecked, 0.4s Time] [2022-02-20 23:55:29,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-02-20 23:55:29,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 167. [2022-02-20 23:55:29,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:29,586 INFO L82 GeneralOperation]: Start isEquivalent. First operand 259 states. Second operand has 167 states, 149 states have (on average 1.2953020134228188) internal successors, (193), 166 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:29,587 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand has 167 states, 149 states have (on average 1.2953020134228188) internal successors, (193), 166 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:29,587 INFO L87 Difference]: Start difference. First operand 259 states. Second operand has 167 states, 149 states have (on average 1.2953020134228188) internal successors, (193), 166 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:29,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:29,590 INFO L93 Difference]: Finished difference Result 259 states and 300 transitions. [2022-02-20 23:55:29,590 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 300 transitions. [2022-02-20 23:55:29,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:29,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:29,591 INFO L74 IsIncluded]: Start isIncluded. First operand has 167 states, 149 states have (on average 1.2953020134228188) internal successors, (193), 166 states have internal predecessors, (193), 0 states have call successors, (0), 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 259 states. [2022-02-20 23:55:29,592 INFO L87 Difference]: Start difference. First operand has 167 states, 149 states have (on average 1.2953020134228188) internal successors, (193), 166 states have internal predecessors, (193), 0 states have call successors, (0), 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 259 states. [2022-02-20 23:55:29,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:29,595 INFO L93 Difference]: Finished difference Result 259 states and 300 transitions. [2022-02-20 23:55:29,595 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 300 transitions. [2022-02-20 23:55:29,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:29,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:29,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:29,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:29,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 149 states have (on average 1.2953020134228188) internal successors, (193), 166 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:29,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 193 transitions. [2022-02-20 23:55:29,597 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 193 transitions. Word has length 25 [2022-02-20 23:55:29,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:29,597 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 193 transitions. [2022-02-20 23:55:29,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.72) internal successors, (68), 26 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:29,598 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 193 transitions. [2022-02-20 23:55:29,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:55:29,598 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:29,598 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] [2022-02-20 23:55:29,623 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:55:29,816 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,SelfDestructingSolverStorable25 [2022-02-20 23:55:29,816 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:29,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:29,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1496265999, now seen corresponding path program 1 times [2022-02-20 23:55:29,817 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:29,817 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783265248] [2022-02-20 23:55:29,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:29,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:29,851 ERROR L253 erpolLogProxyWrapper]: Interpolant 9 not inductive [2022-02-20 23:55:29,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-02-20 23:55:29,862 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:55:29,866 INFO L158 Benchmark]: Toolchain (without parser) took 31240.01ms. Allocated memory was 134.2MB in the beginning and 348.1MB in the end (delta: 213.9MB). Free memory was 98.1MB in the beginning and 267.3MB in the end (delta: -169.3MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. [2022-02-20 23:55:29,867 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 134.2MB. Free memory was 106.2MB in the beginning and 106.1MB in the end (delta: 26.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:55:29,867 INFO L158 Benchmark]: CACSL2BoogieTranslator took 405.66ms. Allocated memory is still 134.2MB. Free memory was 97.8MB in the beginning and 99.9MB in the end (delta: -2.2MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2022-02-20 23:55:29,867 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.93ms. Allocated memory is still 134.2MB. Free memory was 99.9MB in the beginning and 97.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:55:29,867 INFO L158 Benchmark]: Boogie Preprocessor took 31.97ms. Allocated memory is still 134.2MB. Free memory was 97.8MB in the beginning and 95.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:55:29,867 INFO L158 Benchmark]: RCFGBuilder took 419.28ms. Allocated memory is still 134.2MB. Free memory was 95.8MB in the beginning and 71.9MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-02-20 23:55:29,867 INFO L158 Benchmark]: TraceAbstraction took 30341.73ms. Allocated memory was 134.2MB in the beginning and 348.1MB in the end (delta: 213.9MB). Free memory was 71.9MB in the beginning and 267.3MB in the end (delta: -195.4MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2022-02-20 23:55:29,868 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.16ms. Allocated memory is still 134.2MB. Free memory was 106.2MB in the beginning and 106.1MB in the end (delta: 26.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 405.66ms. Allocated memory is still 134.2MB. Free memory was 97.8MB in the beginning and 99.9MB in the end (delta: -2.2MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.93ms. Allocated memory is still 134.2MB. Free memory was 99.9MB in the beginning and 97.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.97ms. Allocated memory is still 134.2MB. Free memory was 97.8MB in the beginning and 95.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 419.28ms. Allocated memory is still 134.2MB. Free memory was 95.8MB in the beginning and 71.9MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 30341.73ms. Allocated memory was 134.2MB in the beginning and 348.1MB in the end (delta: 213.9MB). Free memory was 71.9MB in the beginning and 267.3MB in the end (delta: -195.4MB). Peak memory consumption was 19.0MB. 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:55:29,937 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/sll-circular-1.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 6c54160550402a2cf6139371c972b70bfa4a53acf207c90f67eed3e784812b38 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:55:31,778 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:55:31,779 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:55:31,798 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:55:31,802 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:55:31,803 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:55:31,804 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:55:31,808 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:55:31,810 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:55:31,817 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:55:31,818 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:55:31,819 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:55:31,820 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:55:31,822 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:55:31,823 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:55:31,824 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:55:31,826 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:55:31,830 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:55:31,831 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:55:31,832 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:55:31,836 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:55:31,837 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:55:31,838 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:55:31,838 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:55:31,840 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:55:31,842 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:55:31,842 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:55:31,843 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:55:31,845 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:55:31,846 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:55:31,846 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:55:31,846 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:55:31,847 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:55:31,848 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:55:31,849 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:55:31,849 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:55:31,850 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:55:31,850 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:55:31,851 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:55:31,851 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:55:31,853 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:55:31,853 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:55:31,876 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:55:31,877 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:55:31,877 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:55:31,878 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:55:31,878 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:55:31,878 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:55:31,879 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:55:31,879 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:55:31,879 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:55:31,880 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:55:31,881 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:55:31,881 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:55:31,881 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:55:31,881 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:55:31,881 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:55:31,881 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:55:31,881 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:55:31,882 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:55:31,882 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:55:31,882 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:55:31,882 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:55:31,882 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:55:31,882 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:55:31,882 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:55:31,882 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:55:31,883 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:55:31,883 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:55:31,883 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:55:31,883 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:55:31,883 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:55:31,883 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:55:31,883 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:55:31,884 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:55:31,884 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 -> 6c54160550402a2cf6139371c972b70bfa4a53acf207c90f67eed3e784812b38 [2022-02-20 23:55:32,137 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:55:32,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:55:32,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:55:32,166 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:55:32,168 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:55:32,169 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-circular-1.i [2022-02-20 23:55:32,220 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0f22f3f4/7d22aa6cc5dd4b3887d2425331a18208/FLAGbfff2053d [2022-02-20 23:55:32,676 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:55:32,678 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i [2022-02-20 23:55:32,690 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0f22f3f4/7d22aa6cc5dd4b3887d2425331a18208/FLAGbfff2053d [2022-02-20 23:55:32,705 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0f22f3f4/7d22aa6cc5dd4b3887d2425331a18208 [2022-02-20 23:55:32,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:55:32,711 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:55:32,712 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:55:32,712 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:55:32,715 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:55:32,717 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:55:32" (1/1) ... [2022-02-20 23:55:32,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39dd3b6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:32, skipping insertion in model container [2022-02-20 23:55:32,718 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:55:32" (1/1) ... [2022-02-20 23:55:32,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:55:32,757 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:55:33,008 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i[22324,22337] [2022-02-20 23:55:33,012 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i[22430,22443] [2022-02-20 23:55:33,015 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i[22555,22568] [2022-02-20 23:55:33,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:55:33,035 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:55:33,065 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i[22324,22337] [2022-02-20 23:55:33,068 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i[22430,22443] [2022-02-20 23:55:33,070 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i[22555,22568] [2022-02-20 23:55:33,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:55:33,098 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:55:33,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:33 WrapperNode [2022-02-20 23:55:33,098 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:55:33,099 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:55:33,099 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:55:33,099 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:55:33,103 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:55:33" (1/1) ... [2022-02-20 23:55:33,132 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:55:33" (1/1) ... [2022-02-20 23:55:33,159 INFO L137 Inliner]: procedures = 122, calls = 28, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 118 [2022-02-20 23:55:33,160 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:55:33,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:55:33,161 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:55:33,161 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:55:33,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:33" (1/1) ... [2022-02-20 23:55:33,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:33" (1/1) ... [2022-02-20 23:55:33,174 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:33" (1/1) ... [2022-02-20 23:55:33,175 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:33" (1/1) ... [2022-02-20 23:55:33,203 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:33" (1/1) ... [2022-02-20 23:55:33,206 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:33" (1/1) ... [2022-02-20 23:55:33,211 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:33" (1/1) ... [2022-02-20 23:55:33,213 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:55:33,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:55:33,217 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:55:33,219 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:55:33,219 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:33" (1/1) ... [2022-02-20 23:55:33,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:55:33,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:55:33,258 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:55:33,266 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:55:33,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 23:55:33,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:55:33,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:55:33,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:55:33,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:55:33,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:55:33,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 23:55:33,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 23:55:33,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:55:33,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:55:33,393 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:55:33,394 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:55:33,647 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:55:33,665 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:55:33,665 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2022-02-20 23:55:33,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:55:33 BoogieIcfgContainer [2022-02-20 23:55:33,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:55:33,668 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:55:33,668 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:55:33,670 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:55:33,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:55:32" (1/3) ... [2022-02-20 23:55:33,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@168ef61e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:55:33, skipping insertion in model container [2022-02-20 23:55:33,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:33" (2/3) ... [2022-02-20 23:55:33,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@168ef61e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:55:33, skipping insertion in model container [2022-02-20 23:55:33,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:55:33" (3/3) ... [2022-02-20 23:55:33,671 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-circular-1.i [2022-02-20 23:55:33,675 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:55:33,675 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2022-02-20 23:55:33,706 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:55:33,711 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:55:33,711 INFO L340 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2022-02-20 23:55:33,724 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 53 states have (on average 2.2264150943396226) internal successors, (118), 99 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:33,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:55:33,727 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:33,727 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:55:33,727 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:33,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:33,731 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-02-20 23:55:33,738 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:55:33,739 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1318540114] [2022-02-20 23:55:33,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:33,739 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:55:33,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:55:33,741 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:55:33,757 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:55:33,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:33,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:55:33,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:33,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:33,882 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:55:33,895 INFO L290 TraceCheckUtils]: 0: Hoare triple {103#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); {103#true} is VALID [2022-02-20 23:55:33,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {103#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8bv32);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; {111#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:55:33,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {111#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~head~0#1.base]); {104#false} is VALID [2022-02-20 23:55:33,898 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:55:33,899 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:55:33,899 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:55:33,900 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1318540114] [2022-02-20 23:55:33,900 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1318540114] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:33,900 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:33,901 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:55:33,902 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414161893] [2022-02-20 23:55:33,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:33,905 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:55:33,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:33,908 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:55:33,914 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:55:33,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:55:33,914 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:55:33,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:55:33,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:55:33,929 INFO L87 Difference]: Start difference. First operand has 100 states, 53 states have (on average 2.2264150943396226) internal successors, (118), 99 states have internal predecessors, (118), 0 states have call successors, (0), 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:55:34,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:34,205 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2022-02-20 23:55:34,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:55:34,206 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:55:34,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:34,207 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:55:34,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2022-02-20 23:55:34,212 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:55:34,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2022-02-20 23:55:34,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 130 transitions. [2022-02-20 23:55:34,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:34,357 INFO L225 Difference]: With dead ends: 106 [2022-02-20 23:55:34,358 INFO L226 Difference]: Without dead ends: 104 [2022-02-20 23:55:34,360 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:55:34,363 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 84 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:34,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 75 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:55:34,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-02-20 23:55:34,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2022-02-20 23:55:34,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:34,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 94 states, 52 states have (on average 1.9230769230769231) internal successors, (100), 93 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:34,397 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 94 states, 52 states have (on average 1.9230769230769231) internal successors, (100), 93 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:34,398 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 94 states, 52 states have (on average 1.9230769230769231) internal successors, (100), 93 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:34,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:34,406 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2022-02-20 23:55:34,406 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2022-02-20 23:55:34,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:34,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:34,408 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 52 states have (on average 1.9230769230769231) internal successors, (100), 93 states have internal predecessors, (100), 0 states have call successors, (0), 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 104 states. [2022-02-20 23:55:34,408 INFO L87 Difference]: Start difference. First operand has 94 states, 52 states have (on average 1.9230769230769231) internal successors, (100), 93 states have internal predecessors, (100), 0 states have call successors, (0), 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 104 states. [2022-02-20 23:55:34,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:34,420 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2022-02-20 23:55:34,420 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2022-02-20 23:55:34,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:34,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:34,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:34,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:34,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 52 states have (on average 1.9230769230769231) internal successors, (100), 93 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:34,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2022-02-20 23:55:34,426 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 3 [2022-02-20 23:55:34,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:34,426 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2022-02-20 23:55:34,427 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:55:34,429 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2022-02-20 23:55:34,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:55:34,429 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:34,429 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:55:34,451 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:55:34,635 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:55:34,636 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:34,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:34,637 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-20 23:55:34,637 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:55:34,637 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [910201085] [2022-02-20 23:55:34,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:34,638 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:55:34,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:55:34,639 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:55:34,678 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:55:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:34,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:55:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:34,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:34,717 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:55:34,724 INFO L290 TraceCheckUtils]: 0: Hoare triple {522#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); {522#true} is VALID [2022-02-20 23:55:34,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {522#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8bv32);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; {530#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)))} is VALID [2022-02-20 23:55:34,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {530#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)))} 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)); {523#false} is VALID [2022-02-20 23:55:34,728 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:55:34,728 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:55:34,728 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:55:34,728 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [910201085] [2022-02-20 23:55:34,729 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [910201085] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:34,729 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:34,729 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:55:34,729 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37157266] [2022-02-20 23:55:34,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:34,730 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:55:34,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:34,730 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:55:34,734 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:55:34,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:55:34,734 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:55:34,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:55:34,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:55:34,735 INFO L87 Difference]: Start difference. First operand 94 states and 100 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:55:34,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:34,988 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2022-02-20 23:55:34,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:55:34,988 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:55:34,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:34,988 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:55:34,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-02-20 23:55:34,990 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:55:34,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-02-20 23:55:34,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 112 transitions. [2022-02-20 23:55:35,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:35,109 INFO L225 Difference]: With dead ends: 102 [2022-02-20 23:55:35,110 INFO L226 Difference]: Without dead ends: 102 [2022-02-20 23:55:35,110 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:55:35,111 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 82 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:35,111 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 75 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:55:35,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-02-20 23:55:35,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 90. [2022-02-20 23:55:35,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:35,114 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 90 states, 52 states have (on average 1.8461538461538463) internal successors, (96), 89 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:35,114 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 90 states, 52 states have (on average 1.8461538461538463) internal successors, (96), 89 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:35,114 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 90 states, 52 states have (on average 1.8461538461538463) internal successors, (96), 89 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:35,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:35,117 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2022-02-20 23:55:35,117 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2022-02-20 23:55:35,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:35,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:35,118 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 52 states have (on average 1.8461538461538463) internal successors, (96), 89 states have internal predecessors, (96), 0 states have call successors, (0), 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 102 states. [2022-02-20 23:55:35,124 INFO L87 Difference]: Start difference. First operand has 90 states, 52 states have (on average 1.8461538461538463) internal successors, (96), 89 states have internal predecessors, (96), 0 states have call successors, (0), 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 102 states. [2022-02-20 23:55:35,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:35,126 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2022-02-20 23:55:35,126 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2022-02-20 23:55:35,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:35,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:35,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:35,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:35,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 52 states have (on average 1.8461538461538463) internal successors, (96), 89 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:35,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2022-02-20 23:55:35,129 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 3 [2022-02-20 23:55:35,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:35,129 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2022-02-20 23:55:35,129 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:55:35,129 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2022-02-20 23:55:35,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:55:35,130 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:35,130 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:55:35,137 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:55:35,335 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:55:35,336 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:35,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:35,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1803027163, now seen corresponding path program 1 times [2022-02-20 23:55:35,337 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:55:35,337 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1558955128] [2022-02-20 23:55:35,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:35,337 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:55:35,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:55:35,339 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:55:35,340 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:55:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:35,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:55:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:35,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:35,408 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:55:35,434 INFO L290 TraceCheckUtils]: 0: Hoare triple {929#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); {929#true} is VALID [2022-02-20 23:55:35,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {929#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8bv32);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; {937#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:55:35,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {937#(= (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: L997 {937#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:55:35,436 INFO L290 TraceCheckUtils]: 3: Hoare triple {937#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} SUMMARY for call write~intINTTYPE4(0bv32, main_~head~0#1.base, ~bvadd32(4bv32, main_~head~0#1.offset), 4bv32); srcloc: L997-1 {937#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:55:35,437 INFO L290 TraceCheckUtils]: 4: Hoare triple {937#(= (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; {947#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:55:35,438 INFO L290 TraceCheckUtils]: 5: Hoare triple {947#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))} assume !(0bv32 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {947#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:55:35,438 INFO L290 TraceCheckUtils]: 6: Hoare triple {947#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~x~0#1.base]); {930#false} is VALID [2022-02-20 23:55:35,438 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:55:35,438 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:55:35,438 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:55:35,439 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1558955128] [2022-02-20 23:55:35,439 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1558955128] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:35,439 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:35,439 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:55:35,439 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727400298] [2022-02-20 23:55:35,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:35,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:55:35,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:35,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:35,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:35,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:55:35,447 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:55:35,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:55:35,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:55:35,448 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:35,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:35,777 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2022-02-20 23:55:35,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:55:35,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:55:35,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:35,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:35,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2022-02-20 23:55:35,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:35,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2022-02-20 23:55:35,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 107 transitions. [2022-02-20 23:55:35,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:35,889 INFO L225 Difference]: With dead ends: 88 [2022-02-20 23:55:35,889 INFO L226 Difference]: Without dead ends: 88 [2022-02-20 23:55:35,890 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:55:35,890 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 134 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:35,890 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 50 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:55:35,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-02-20 23:55:35,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2022-02-20 23:55:35,893 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:35,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 79 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 78 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:35,893 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 79 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 78 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:35,893 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 79 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 78 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:35,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:35,895 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2022-02-20 23:55:35,895 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2022-02-20 23:55:35,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:35,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:35,895 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 78 states have internal predecessors, (85), 0 states have call successors, (0), 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 88 states. [2022-02-20 23:55:35,896 INFO L87 Difference]: Start difference. First operand has 79 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 78 states have internal predecessors, (85), 0 states have call successors, (0), 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 88 states. [2022-02-20 23:55:35,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:35,898 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2022-02-20 23:55:35,898 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2022-02-20 23:55:35,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:35,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:35,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:35,898 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:35,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 78 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:35,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2022-02-20 23:55:35,900 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 7 [2022-02-20 23:55:35,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:35,900 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2022-02-20 23:55:35,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:35,900 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2022-02-20 23:55:35,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:55:35,901 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:35,901 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:55:35,917 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:55:36,117 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:55:36,118 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:36,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:36,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1803027164, now seen corresponding path program 1 times [2022-02-20 23:55:36,119 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:55:36,119 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821488540] [2022-02-20 23:55:36,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:36,119 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:55:36,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:55:36,124 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:55:36,127 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:55:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:36,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:55:36,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:36,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:36,214 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:55:36,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {1298#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); {1298#true} is VALID [2022-02-20 23:55:36,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {1298#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8bv32);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; {1306#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)))} is VALID [2022-02-20 23:55:36,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {1306#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)))} 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: L997 {1306#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)))} is VALID [2022-02-20 23:55:36,274 INFO L290 TraceCheckUtils]: 3: Hoare triple {1306#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)))} SUMMARY for call write~intINTTYPE4(0bv32, main_~head~0#1.base, ~bvadd32(4bv32, main_~head~0#1.offset), 4bv32); srcloc: L997-1 {1306#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)))} is VALID [2022-02-20 23:55:36,274 INFO L290 TraceCheckUtils]: 4: Hoare triple {1306#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~state~0#1 := 1bv32; {1316#(and (= (select |#length| |ULTIMATE.start_main_~x~0#1.base|) (_ bv8 32)) (= |ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:55:36,275 INFO L290 TraceCheckUtils]: 5: Hoare triple {1316#(and (= (select |#length| |ULTIMATE.start_main_~x~0#1.base|) (_ bv8 32)) (= |ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32)))} assume !(0bv32 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {1316#(and (= (select |#length| |ULTIMATE.start_main_~x~0#1.base|) (_ bv8 32)) (= |ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:55:36,275 INFO L290 TraceCheckUtils]: 6: Hoare triple {1316#(and (= (select |#length| |ULTIMATE.start_main_~x~0#1.base|) (_ bv8 32)) (= |ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, main_~x~0#1.offset)), #length[main_~x~0#1.base]) && ~bvule32(~bvadd32(4bv32, main_~x~0#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, main_~x~0#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, main_~x~0#1.offset))); {1299#false} is VALID [2022-02-20 23:55:36,275 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:55:36,275 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:55:36,275 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:55:36,275 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [821488540] [2022-02-20 23:55:36,276 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [821488540] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:36,276 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:36,276 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:55:36,276 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845134530] [2022-02-20 23:55:36,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:36,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:55:36,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:36,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:36,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:36,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:55:36,285 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:55:36,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:55:36,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:55:36,285 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:36,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:36,763 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2022-02-20 23:55:36,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:55:36,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:55:36,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:36,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:36,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-02-20 23:55:36,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:36,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-02-20 23:55:36,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 108 transitions. [2022-02-20 23:55:36,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:36,873 INFO L225 Difference]: With dead ends: 98 [2022-02-20 23:55:36,873 INFO L226 Difference]: Without dead ends: 98 [2022-02-20 23:55:36,874 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:55:36,874 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 84 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:36,875 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 93 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:55:36,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-02-20 23:55:36,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 84. [2022-02-20 23:55:36,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:36,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 84 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 83 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:36,878 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 84 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 83 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:36,878 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 84 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 83 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:36,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:36,880 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2022-02-20 23:55:36,880 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2022-02-20 23:55:36,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:36,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:36,880 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 83 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 98 states. [2022-02-20 23:55:36,881 INFO L87 Difference]: Start difference. First operand has 84 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 83 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 98 states. [2022-02-20 23:55:36,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:36,883 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2022-02-20 23:55:36,883 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2022-02-20 23:55:36,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:36,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:36,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:36,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:36,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 83 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:36,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2022-02-20 23:55:36,885 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 7 [2022-02-20 23:55:36,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:36,885 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2022-02-20 23:55:36,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:36,885 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2022-02-20 23:55:36,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:55:36,886 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:36,886 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:55:36,896 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:55:37,094 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:55:37,095 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:37,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:37,095 INFO L85 PathProgramCache]: Analyzing trace with hash 399103166, now seen corresponding path program 1 times [2022-02-20 23:55:37,095 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:55:37,095 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1937935428] [2022-02-20 23:55:37,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:37,095 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:55:37,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:55:37,096 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:55:37,098 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:55:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:37,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 23:55:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:37,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:37,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:55:37,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:55:37,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:55:37,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:55:37,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:55:37,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:55:37,450 INFO L290 TraceCheckUtils]: 0: Hoare triple {1702#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); {1702#true} is VALID [2022-02-20 23:55:37,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {1702#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8bv32);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; {1710#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:55:37,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {1710#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32))))} 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: L997 {1714#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32))) (= (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|))} is VALID [2022-02-20 23:55:37,454 INFO L290 TraceCheckUtils]: 3: Hoare triple {1714#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32))) (= (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|))} SUMMARY for call write~intINTTYPE4(0bv32, main_~head~0#1.base, ~bvadd32(4bv32, main_~head~0#1.offset), 4bv32); srcloc: L997-1 {1714#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32))) (= (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|))} is VALID [2022-02-20 23:55:37,454 INFO L290 TraceCheckUtils]: 4: Hoare triple {1714#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32))) (= (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|))} 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; {1721#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~head~0#1.offset|) (not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32))) (= (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|))} is VALID [2022-02-20 23:55:37,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {1721#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~head~0#1.offset|) (not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32))) (= (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|))} assume !(0bv32 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {1721#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~head~0#1.offset|) (not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32))) (= (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|))} is VALID [2022-02-20 23:55:37,457 INFO L290 TraceCheckUtils]: 6: Hoare triple {1721#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~head~0#1.offset|) (not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32))) (= (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|))} SUMMARY for call write~intINTTYPE4(main_~state~0#1, main_~x~0#1.base, ~bvadd32(4bv32, main_~x~0#1.offset), 4bv32); srcloc: L1004-2 {1714#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32))) (= (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|))} is VALID [2022-02-20 23:55:37,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {1714#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32))) (= (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|))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4bv32); srcloc: L1025 {1731#(not (= |ULTIMATE.start_main_#t~mem6#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:55:37,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {1731#(not (= |ULTIMATE.start_main_#t~mem6#1.base| (_ bv0 32)))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {1735#(not (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:55:37,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {1735#(not (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32)))} assume !(0bv32 != main_~x~0#1.base || 0bv32 != main_~x~0#1.offset); {1703#false} is VALID [2022-02-20 23:55:37,458 INFO L290 TraceCheckUtils]: 10: Hoare triple {1703#false} assume !false; {1703#false} is VALID [2022-02-20 23:55:37,459 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:55:37,459 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:55:37,459 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:55:37,459 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1937935428] [2022-02-20 23:55:37,459 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1937935428] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:37,459 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:37,459 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:55:37,459 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424293465] [2022-02-20 23:55:37,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:37,460 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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:55:37,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:37,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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:55:37,487 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:55:37,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:55:37,487 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:55:37,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:55:37,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:55:37,488 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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:55:38,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:38,480 INFO L93 Difference]: Finished difference Result 167 states and 178 transitions. [2022-02-20 23:55:38,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:55:38,481 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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:55:38,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:38,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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:55:38,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 179 transitions. [2022-02-20 23:55:38,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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:55:38,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 179 transitions. [2022-02-20 23:55:38,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 179 transitions. [2022-02-20 23:55:38,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:38,652 INFO L225 Difference]: With dead ends: 167 [2022-02-20 23:55:38,652 INFO L226 Difference]: Without dead ends: 167 [2022-02-20 23:55:38,652 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:55:38,653 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 184 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:38,653 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 300 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:55:38,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-02-20 23:55:38,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 87. [2022-02-20 23:55:38,656 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:38,656 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand has 87 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 86 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:55:38,656 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand has 87 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 86 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:55:38,657 INFO L87 Difference]: Start difference. First operand 167 states. Second operand has 87 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 86 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:55:38,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:38,659 INFO L93 Difference]: Finished difference Result 167 states and 178 transitions. [2022-02-20 23:55:38,659 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 178 transitions. [2022-02-20 23:55:38,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:38,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:38,660 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 86 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 167 states. [2022-02-20 23:55:38,660 INFO L87 Difference]: Start difference. First operand has 87 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 86 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 167 states. [2022-02-20 23:55:38,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:38,663 INFO L93 Difference]: Finished difference Result 167 states and 178 transitions. [2022-02-20 23:55:38,663 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 178 transitions. [2022-02-20 23:55:38,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:38,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:38,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:38,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:38,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 86 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:55:38,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2022-02-20 23:55:38,665 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 11 [2022-02-20 23:55:38,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:38,665 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2022-02-20 23:55:38,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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:55:38,665 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2022-02-20 23:55:38,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:55:38,665 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:38,666 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:55:38,688 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:55:38,872 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:55:38,873 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:38,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:38,873 INFO L85 PathProgramCache]: Analyzing trace with hash 406735527, now seen corresponding path program 1 times [2022-02-20 23:55:38,873 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:55:38,874 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2128905434] [2022-02-20 23:55:38,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:38,874 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:55:38,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:55:38,875 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:55:38,876 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:55:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:38,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 23:55:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:38,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:38,955 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:55:38,979 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:55:39,010 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:55:39,023 INFO L290 TraceCheckUtils]: 0: Hoare triple {2335#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); {2335#true} is VALID [2022-02-20 23:55:39,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {2335#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8bv32);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; {2335#true} is VALID [2022-02-20 23:55:39,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {2335#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: L997 {2335#true} is VALID [2022-02-20 23:55:39,024 INFO L290 TraceCheckUtils]: 3: Hoare triple {2335#true} SUMMARY for call write~intINTTYPE4(0bv32, main_~head~0#1.base, ~bvadd32(4bv32, main_~head~0#1.offset), 4bv32); srcloc: L997-1 {2335#true} is VALID [2022-02-20 23:55:39,024 INFO L290 TraceCheckUtils]: 4: Hoare triple {2335#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; {2335#true} is VALID [2022-02-20 23:55:39,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {2335#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(8bv32); {2355#(= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:55:39,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {2355#(= (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: L1007 {2359#(= (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:55:39,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {2359#(= (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; {2359#(= (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:55:39,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {2359#(= (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: L1008 {2366#(= (select |#valid| |ULTIMATE.start_main_#t~mem4#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:55:39,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {2366#(= (select |#valid| |ULTIMATE.start_main_#t~mem4#1.base|) (_ bv1 1))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem4#1.base, main_#t~mem4#1.offset;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {2370#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:55:39,028 INFO L290 TraceCheckUtils]: 10: Hoare triple {2370#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~x~0#1.base]); {2336#false} is VALID [2022-02-20 23:55:39,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:55:39,028 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:55:39,028 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:55:39,028 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2128905434] [2022-02-20 23:55:39,028 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2128905434] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:39,028 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:39,028 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:55:39,028 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708331920] [2022-02-20 23:55:39,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:39,029 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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:55:39,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:39,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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:55:39,040 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:55:39,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:55:39,040 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:55:39,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:55:39,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:55:39,041 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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:55:39,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:39,817 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2022-02-20 23:55:39,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:55:39,817 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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:55:39,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:39,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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:55:39,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2022-02-20 23:55:39,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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:55:39,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2022-02-20 23:55:39,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 89 transitions. [2022-02-20 23:55:39,894 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:55:39,895 INFO L225 Difference]: With dead ends: 86 [2022-02-20 23:55:39,895 INFO L226 Difference]: Without dead ends: 86 [2022-02-20 23:55:39,895 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:55:39,895 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 58 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:39,896 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 170 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:55:39,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-02-20 23:55:39,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-02-20 23:55:39,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:39,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 86 states, 60 states have (on average 1.55) internal successors, (93), 85 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:39,898 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 86 states, 60 states have (on average 1.55) internal successors, (93), 85 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:39,898 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 86 states, 60 states have (on average 1.55) internal successors, (93), 85 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:39,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:39,899 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2022-02-20 23:55:39,900 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2022-02-20 23:55:39,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:39,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:39,900 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 60 states have (on average 1.55) internal successors, (93), 85 states have internal predecessors, (93), 0 states have call successors, (0), 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 86 states. [2022-02-20 23:55:39,900 INFO L87 Difference]: Start difference. First operand has 86 states, 60 states have (on average 1.55) internal successors, (93), 85 states have internal predecessors, (93), 0 states have call successors, (0), 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 86 states. [2022-02-20 23:55:39,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:39,902 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2022-02-20 23:55:39,902 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2022-02-20 23:55:39,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:39,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:39,902 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:39,902 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:39,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 60 states have (on average 1.55) internal successors, (93), 85 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:39,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2022-02-20 23:55:39,904 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 11 [2022-02-20 23:55:39,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:39,904 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2022-02-20 23:55:39,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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:55:39,904 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2022-02-20 23:55:39,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:55:39,904 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:39,904 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:55:39,911 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:55:40,111 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:55:40,111 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:40,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:40,112 INFO L85 PathProgramCache]: Analyzing trace with hash 406735528, now seen corresponding path program 1 times [2022-02-20 23:55:40,112 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:55:40,112 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [17089300] [2022-02-20 23:55:40,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:40,112 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:55:40,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:55:40,113 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:55:40,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-02-20 23:55:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:40,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 23:55:40,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:40,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:40,214 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:55:40,245 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:55:40,256 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:55:40,303 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:55:40,307 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:55:40,349 INFO L290 TraceCheckUtils]: 0: Hoare triple {2725#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); {2725#true} is VALID [2022-02-20 23:55:40,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {2725#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8bv32);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; {2725#true} is VALID [2022-02-20 23:55:40,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {2725#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: L997 {2725#true} is VALID [2022-02-20 23:55:40,350 INFO L290 TraceCheckUtils]: 3: Hoare triple {2725#true} SUMMARY for call write~intINTTYPE4(0bv32, main_~head~0#1.base, ~bvadd32(4bv32, main_~head~0#1.offset), 4bv32); srcloc: L997-1 {2725#true} is VALID [2022-02-20 23:55:40,350 INFO L290 TraceCheckUtils]: 4: Hoare triple {2725#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; {2725#true} is VALID [2022-02-20 23:55:40,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {2725#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(8bv32); {2745#(and (= (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|) (_ bv8 32)) (= |ULTIMATE.start_main_#t~malloc3#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:55:40,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {2745#(and (= (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|) (_ bv8 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: L1007 {2749#(and (= (_ bv8 32) (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|) (_ bv0 32)))} is VALID [2022-02-20 23:55:40,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {2749#(and (= (_ bv8 32) (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|) (_ bv0 32)))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {2749#(and (= (_ bv8 32) (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|) (_ bv0 32)))} is VALID [2022-02-20 23:55:40,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {2749#(and (= (_ bv8 32) (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|) (_ 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: L1008 {2756#(and (= |ULTIMATE.start_main_#t~mem4#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_#t~mem4#1.base|)))} is VALID [2022-02-20 23:55:40,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {2756#(and (= |ULTIMATE.start_main_#t~mem4#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_#t~mem4#1.base|)))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem4#1.base, main_#t~mem4#1.offset;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {2760#(and (= (select |#length| |ULTIMATE.start_main_~x~0#1.base|) (_ bv8 32)) (= |ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:55:40,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {2760#(and (= (select |#length| |ULTIMATE.start_main_~x~0#1.base|) (_ bv8 32)) (= |ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, main_~x~0#1.offset), #length[main_~x~0#1.base]) && ~bvule32(main_~x~0#1.offset, ~bvadd32(4bv32, main_~x~0#1.offset))) && ~bvule32(0bv32, main_~x~0#1.offset)); {2726#false} is VALID [2022-02-20 23:55:40,358 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:55:40,358 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:55:40,358 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:55:40,358 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [17089300] [2022-02-20 23:55:40,359 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [17089300] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:40,359 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:40,359 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:55:40,359 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814544014] [2022-02-20 23:55:40,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:40,359 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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:55:40,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:40,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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:55:40,377 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:55:40,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:55:40,378 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:55:40,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:55:40,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:55:40,378 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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:55:41,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:41,464 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2022-02-20 23:55:41,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:55:41,464 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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:55:41,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:41,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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:55:41,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 93 transitions. [2022-02-20 23:55:41,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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:55:41,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 93 transitions. [2022-02-20 23:55:41,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 93 transitions. [2022-02-20 23:55:41,549 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:55:41,550 INFO L225 Difference]: With dead ends: 82 [2022-02-20 23:55:41,550 INFO L226 Difference]: Without dead ends: 82 [2022-02-20 23:55:41,550 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:55:41,551 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 20 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 225 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.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:41,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 225 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:55:41,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-02-20 23:55:41,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2022-02-20 23:55:41,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:41,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 78 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 77 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:41,554 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 78 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 77 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:41,554 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 78 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 77 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:41,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:41,556 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2022-02-20 23:55:41,556 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2022-02-20 23:55:41,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:41,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:41,557 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 77 states have internal predecessors, (85), 0 states have call successors, (0), 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 82 states. [2022-02-20 23:55:41,557 INFO L87 Difference]: Start difference. First operand has 78 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 77 states have internal predecessors, (85), 0 states have call successors, (0), 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 82 states. [2022-02-20 23:55:41,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:41,558 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2022-02-20 23:55:41,558 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2022-02-20 23:55:41,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:41,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:41,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:41,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:41,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 77 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:41,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2022-02-20 23:55:41,560 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 11 [2022-02-20 23:55:41,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:41,560 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2022-02-20 23:55:41,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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:55:41,561 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2022-02-20 23:55:41,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:55:41,561 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:41,561 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:55:41,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-02-20 23:55:41,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:55:41,768 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:41,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:41,768 INFO L85 PathProgramCache]: Analyzing trace with hash -512699581, now seen corresponding path program 1 times [2022-02-20 23:55:41,769 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:55:41,769 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [143107105] [2022-02-20 23:55:41,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:41,769 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:55:41,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:55:41,770 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:55:41,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-02-20 23:55:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:41,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 23:55:41,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:41,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:41,896 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:55:41,936 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:55:41,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:55:41,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:55:42,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:55:42,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:55:42,127 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:55:42,163 INFO L290 TraceCheckUtils]: 0: Hoare triple {3099#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); {3099#true} is VALID [2022-02-20 23:55:42,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {3099#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8bv32);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; {3107#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:55:42,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {3107#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (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: L997 {3111#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (= (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|))} is VALID [2022-02-20 23:55:42,166 INFO L290 TraceCheckUtils]: 3: Hoare triple {3111#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (= (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|))} SUMMARY for call write~intINTTYPE4(0bv32, main_~head~0#1.base, ~bvadd32(4bv32, main_~head~0#1.offset), 4bv32); srcloc: L997-1 {3111#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (= (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|))} is VALID [2022-02-20 23:55:42,167 INFO L290 TraceCheckUtils]: 4: Hoare triple {3111#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (= (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|))} 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; {3118#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.offset| |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|))} is VALID [2022-02-20 23:55:42,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {3118#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.offset| |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|))} assume !(0bv32 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {3118#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.offset| |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|))} is VALID [2022-02-20 23:55:42,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {3118#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.offset| |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|))} SUMMARY for call write~intINTTYPE4(main_~state~0#1, main_~x~0#1.base, ~bvadd32(4bv32, main_~x~0#1.offset), 4bv32); srcloc: L1004-2 {3111#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (= (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|))} is VALID [2022-02-20 23:55:42,169 INFO L290 TraceCheckUtils]: 7: Hoare triple {3111#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (= (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|))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4bv32); srcloc: L1025 {3128#(= (select |#valid| |ULTIMATE.start_main_#t~mem6#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:55:42,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {3128#(= (select |#valid| |ULTIMATE.start_main_#t~mem6#1.base|) (_ bv1 1))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {3132#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:55:42,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {3132#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))} assume !!(0bv32 != main_~x~0#1.base || 0bv32 != main_~x~0#1.offset); {3132#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:55:42,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {3132#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))} goto; {3132#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:55:42,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {3132#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~x~0#1.base]); {3100#false} is VALID [2022-02-20 23:55:42,171 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:55:42,171 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:55:42,171 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:55:42,172 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [143107105] [2022-02-20 23:55:42,172 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [143107105] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:42,172 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:42,172 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:55:42,172 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220755454] [2022-02-20 23:55:42,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:42,172 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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:55:42,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:42,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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:55:42,186 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:55:42,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:55:42,186 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:55:42,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:55:42,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:55:42,187 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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:55:42,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:42,944 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2022-02-20 23:55:42,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:55:42,945 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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:55:42,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:42,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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:55:42,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2022-02-20 23:55:42,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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:55:42,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2022-02-20 23:55:42,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 140 transitions. [2022-02-20 23:55:43,084 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:55:43,085 INFO L225 Difference]: With dead ends: 128 [2022-02-20 23:55:43,086 INFO L226 Difference]: Without dead ends: 128 [2022-02-20 23:55:43,086 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:55:43,087 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 193 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:43,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 143 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:55:43,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-02-20 23:55:43,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 80. [2022-02-20 23:55:43,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:43,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand has 80 states, 59 states have (on average 1.4915254237288136) internal successors, (88), 79 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:43,097 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand has 80 states, 59 states have (on average 1.4915254237288136) internal successors, (88), 79 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:43,097 INFO L87 Difference]: Start difference. First operand 128 states. Second operand has 80 states, 59 states have (on average 1.4915254237288136) internal successors, (88), 79 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:43,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:43,102 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2022-02-20 23:55:43,102 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2022-02-20 23:55:43,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:43,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:43,103 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 59 states have (on average 1.4915254237288136) internal successors, (88), 79 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 128 states. [2022-02-20 23:55:43,103 INFO L87 Difference]: Start difference. First operand has 80 states, 59 states have (on average 1.4915254237288136) internal successors, (88), 79 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 128 states. [2022-02-20 23:55:43,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:43,110 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2022-02-20 23:55:43,110 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2022-02-20 23:55:43,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:43,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:43,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:43,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:43,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 59 states have (on average 1.4915254237288136) internal successors, (88), 79 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:43,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2022-02-20 23:55:43,125 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 12 [2022-02-20 23:55:43,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:43,125 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2022-02-20 23:55:43,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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:55:43,130 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2022-02-20 23:55:43,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:55:43,131 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:43,131 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:55:43,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-02-20 23:55:43,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:55:43,332 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:43,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:43,333 INFO L85 PathProgramCache]: Analyzing trace with hash -512699580, now seen corresponding path program 1 times [2022-02-20 23:55:43,334 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:55:43,334 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2042019294] [2022-02-20 23:55:43,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:43,334 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:55:43,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:55:43,340 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:55:43,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-02-20 23:55:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:43,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-20 23:55:43,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:43,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:43,422 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:55:43,447 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:55:43,452 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:55:43,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:55:43,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:55:43,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:55:43,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:55:43,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:55:43,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:55:43,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:55:43,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:55:43,646 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:55:43,648 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:55:43,692 INFO L290 TraceCheckUtils]: 0: Hoare triple {3611#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); {3611#true} is VALID [2022-02-20 23:55:43,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {3611#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8bv32);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; {3619#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)))} is VALID [2022-02-20 23:55:43,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {3619#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)))} 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: L997 {3623#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv8 32) (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|))} is VALID [2022-02-20 23:55:43,695 INFO L290 TraceCheckUtils]: 3: Hoare triple {3623#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv8 32) (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|))} SUMMARY for call write~intINTTYPE4(0bv32, main_~head~0#1.base, ~bvadd32(4bv32, main_~head~0#1.offset), 4bv32); srcloc: L997-1 {3623#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv8 32) (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|))} is VALID [2022-02-20 23:55:43,696 INFO L290 TraceCheckUtils]: 4: Hoare triple {3623#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv8 32) (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|))} 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; {3630#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| |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|))} is VALID [2022-02-20 23:55:43,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {3630#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| |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|))} assume !(0bv32 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {3630#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| |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|))} is VALID [2022-02-20 23:55:43,698 INFO L290 TraceCheckUtils]: 6: Hoare triple {3630#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| |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|))} SUMMARY for call write~intINTTYPE4(main_~state~0#1, main_~x~0#1.base, ~bvadd32(4bv32, main_~x~0#1.offset), 4bv32); srcloc: L1004-2 {3623#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv8 32) (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|))} is VALID [2022-02-20 23:55:43,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {3623#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv8 32) (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|))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4bv32); srcloc: L1025 {3640#(and (= |ULTIMATE.start_main_#t~mem6#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_#t~mem6#1.base|) (_ bv8 32)))} is VALID [2022-02-20 23:55:43,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {3640#(and (= |ULTIMATE.start_main_#t~mem6#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_#t~mem6#1.base|) (_ bv8 32)))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {3644#(and (= (select |#length| |ULTIMATE.start_main_~x~0#1.base|) (_ bv8 32)) (= |ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:55:43,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {3644#(and (= (select |#length| |ULTIMATE.start_main_~x~0#1.base|) (_ bv8 32)) (= |ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32)))} assume !!(0bv32 != main_~x~0#1.base || 0bv32 != main_~x~0#1.offset); {3644#(and (= (select |#length| |ULTIMATE.start_main_~x~0#1.base|) (_ bv8 32)) (= |ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:55:43,700 INFO L290 TraceCheckUtils]: 10: Hoare triple {3644#(and (= (select |#length| |ULTIMATE.start_main_~x~0#1.base|) (_ bv8 32)) (= |ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32)))} goto; {3644#(and (= (select |#length| |ULTIMATE.start_main_~x~0#1.base|) (_ bv8 32)) (= |ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:55:43,700 INFO L290 TraceCheckUtils]: 11: Hoare triple {3644#(and (= (select |#length| |ULTIMATE.start_main_~x~0#1.base|) (_ bv8 32)) (= |ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, main_~x~0#1.offset)), #length[main_~x~0#1.base]) && ~bvule32(~bvadd32(4bv32, main_~x~0#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, main_~x~0#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, main_~x~0#1.offset))); {3612#false} is VALID [2022-02-20 23:55:43,701 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:55:43,701 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:55:43,701 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:55:43,701 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2042019294] [2022-02-20 23:55:43,701 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2042019294] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:43,701 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:43,701 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:55:43,701 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147078014] [2022-02-20 23:55:43,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:43,702 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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:55:43,702 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:43,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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:55:43,717 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:55:43,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:55:43,718 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:55:43,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:55:43,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:55:43,718 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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:55:44,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:44,890 INFO L93 Difference]: Finished difference Result 155 states and 166 transitions. [2022-02-20 23:55:44,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:55:44,890 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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:55:44,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:44,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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:55:44,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions. [2022-02-20 23:55:44,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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:55:44,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions. [2022-02-20 23:55:44,894 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 171 transitions. [2022-02-20 23:55:45,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:45,103 INFO L225 Difference]: With dead ends: 155 [2022-02-20 23:55:45,103 INFO L226 Difference]: Without dead ends: 155 [2022-02-20 23:55:45,103 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:55:45,104 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 162 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:45,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 226 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:55:45,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-02-20 23:55:45,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 92. [2022-02-20 23:55:45,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:45,106 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand has 92 states, 71 states have (on average 1.4929577464788732) internal successors, (106), 91 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:55:45,106 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand has 92 states, 71 states have (on average 1.4929577464788732) internal successors, (106), 91 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:55:45,106 INFO L87 Difference]: Start difference. First operand 155 states. Second operand has 92 states, 71 states have (on average 1.4929577464788732) internal successors, (106), 91 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:55:45,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:45,108 INFO L93 Difference]: Finished difference Result 155 states and 166 transitions. [2022-02-20 23:55:45,108 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 166 transitions. [2022-02-20 23:55:45,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:45,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:45,109 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 71 states have (on average 1.4929577464788732) internal successors, (106), 91 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 155 states. [2022-02-20 23:55:45,114 INFO L87 Difference]: Start difference. First operand has 92 states, 71 states have (on average 1.4929577464788732) internal successors, (106), 91 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 155 states. [2022-02-20 23:55:45,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:45,116 INFO L93 Difference]: Finished difference Result 155 states and 166 transitions. [2022-02-20 23:55:45,116 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 166 transitions. [2022-02-20 23:55:45,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:45,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:45,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:45,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:45,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 71 states have (on average 1.4929577464788732) internal successors, (106), 91 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:55:45,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2022-02-20 23:55:45,118 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 106 transitions. Word has length 12 [2022-02-20 23:55:45,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:45,118 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 106 transitions. [2022-02-20 23:55:45,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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:55:45,119 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2022-02-20 23:55:45,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:55:45,119 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:45,119 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:55:45,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-02-20 23:55:45,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:55:45,327 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:45,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:45,327 INFO L85 PathProgramCache]: Analyzing trace with hash -929437396, now seen corresponding path program 1 times [2022-02-20 23:55:45,328 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:55:45,328 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [984907577] [2022-02-20 23:55:45,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:45,328 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:55:45,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:55:45,329 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:55:45,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-02-20 23:55:45,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:45,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-20 23:55:45,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:45,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:45,462 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-02-20 23:55:45,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 21 [2022-02-20 23:55:45,472 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:55:45,507 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:55:45,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:55:45,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:55:45,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:55:45,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:55:45,981 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:55:45,993 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-20 23:55:46,184 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:55:46,189 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-20 23:55:46,190 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 19 treesize of output 13 [2022-02-20 23:55:46,215 INFO L290 TraceCheckUtils]: 0: Hoare triple {4216#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); {4221#(= (_ bv0 1) (select |#valid| (_ bv0 32)))} is VALID [2022-02-20 23:55:46,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {4221#(= (_ bv0 1) (select |#valid| (_ bv0 32)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8bv32);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; {4225#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (or (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))))} is VALID [2022-02-20 23:55:46,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {4225#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (or (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))))} 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: L997 {4229#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (or (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))) (= (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|))} is VALID [2022-02-20 23:55:46,219 INFO L290 TraceCheckUtils]: 3: Hoare triple {4229#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (or (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))) (= (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|))} SUMMARY for call write~intINTTYPE4(0bv32, main_~head~0#1.base, ~bvadd32(4bv32, main_~head~0#1.offset), 4bv32); srcloc: L997-1 {4229#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (or (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))) (= (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|))} is VALID [2022-02-20 23:55:46,219 INFO L290 TraceCheckUtils]: 4: Hoare triple {4229#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (or (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))) (= (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|))} 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; {4236#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (or (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))) (= |ULTIMATE.start_main_~x~0#1.offset| |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|))} is VALID [2022-02-20 23:55:46,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {4236#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (or (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))) (= |ULTIMATE.start_main_~x~0#1.offset| |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|))} assume !(0bv32 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {4236#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (or (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))) (= |ULTIMATE.start_main_~x~0#1.offset| |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|))} is VALID [2022-02-20 23:55:46,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {4236#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (or (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))) (= |ULTIMATE.start_main_~x~0#1.offset| |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|))} SUMMARY for call write~intINTTYPE4(main_~state~0#1, main_~x~0#1.base, ~bvadd32(4bv32, main_~x~0#1.offset), 4bv32); srcloc: L1004-2 {4229#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (or (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))) (= (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|))} is VALID [2022-02-20 23:55:46,222 INFO L290 TraceCheckUtils]: 7: Hoare triple {4229#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (or (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))) (= (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|))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4bv32); srcloc: L1025 {4246#(exists ((|ULTIMATE.start_main_~head~0#1.base| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_#t~mem6#1.base|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (or (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))) (= |ULTIMATE.start_main_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32)))))} is VALID [2022-02-20 23:55:46,223 INFO L290 TraceCheckUtils]: 8: Hoare triple {4246#(exists ((|ULTIMATE.start_main_~head~0#1.base| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_#t~mem6#1.base|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (or (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))) (= |ULTIMATE.start_main_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32)))))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {4250#(exists ((|ULTIMATE.start_main_~head~0#1.base| (_ BitVec 32))) (and (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (or (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32))) (= |ULTIMATE.start_main_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32)))))} is VALID [2022-02-20 23:55:46,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {4250#(exists ((|ULTIMATE.start_main_~head~0#1.base| (_ BitVec 32))) (and (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (or (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32))) (= |ULTIMATE.start_main_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32)))))} assume !!(0bv32 != main_~x~0#1.base || 0bv32 != main_~x~0#1.offset); {4250#(exists ((|ULTIMATE.start_main_~head~0#1.base| (_ BitVec 32))) (and (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (or (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32))) (= |ULTIMATE.start_main_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32)))))} is VALID [2022-02-20 23:55:46,225 INFO L290 TraceCheckUtils]: 10: Hoare triple {4250#(exists ((|ULTIMATE.start_main_~head~0#1.base| (_ BitVec 32))) (and (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (or (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32))) (= |ULTIMATE.start_main_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32)))))} goto; {4250#(exists ((|ULTIMATE.start_main_~head~0#1.base| (_ BitVec 32))) (and (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (or (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32))) (= |ULTIMATE.start_main_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32)))))} is VALID [2022-02-20 23:55:46,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {4250#(exists ((|ULTIMATE.start_main_~head~0#1.base| (_ BitVec 32))) (and (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (or (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32))) (= |ULTIMATE.start_main_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32)))))} SUMMARY for call main_#t~mem7#1 := read~intINTTYPE4(main_~x~0#1.base, ~bvadd32(4bv32, main_~x~0#1.offset), 4bv32); srcloc: L1030-2 {4260#(and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~x~0#1.offset|) (_ bv8 32)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~x~0#1.offset|)) (exists ((|ULTIMATE.start_main_~head~0#1.base| (_ BitVec 32))) (and (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (or (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32))) (= |ULTIMATE.start_main_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32))))))} is VALID [2022-02-20 23:55:46,229 INFO L290 TraceCheckUtils]: 12: Hoare triple {4260#(and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~x~0#1.offset|) (_ bv8 32)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~x~0#1.offset|)) (exists ((|ULTIMATE.start_main_~head~0#1.base| (_ BitVec 32))) (and (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (or (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32))) (= |ULTIMATE.start_main_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32))))))} assume !!(0bv32 != main_#t~mem7#1);havoc main_#t~mem7#1; {4260#(and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~x~0#1.offset|) (_ bv8 32)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~x~0#1.offset|)) (exists ((|ULTIMATE.start_main_~head~0#1.base| (_ BitVec 32))) (and (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (or (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32))) (= |ULTIMATE.start_main_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32))))))} is VALID [2022-02-20 23:55:46,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {4260#(and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~x~0#1.offset|) (_ bv8 32)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~x~0#1.offset|)) (exists ((|ULTIMATE.start_main_~head~0#1.base| (_ BitVec 32))) (and (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (or (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32))) (= |ULTIMATE.start_main_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32))))))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4bv32); srcloc: L1032-13 {4267#(and (or (= |ULTIMATE.start_main_#t~mem8#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_#t~mem8#1.base|)))} is VALID [2022-02-20 23:55:46,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {4267#(and (or (= |ULTIMATE.start_main_#t~mem8#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_#t~mem8#1.base|)))} assume !(1bv1 == #valid[main_#t~mem8#1.base]); {4217#false} is VALID [2022-02-20 23:55:46,232 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:55:46,232 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:55:46,232 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:55:46,232 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [984907577] [2022-02-20 23:55:46,232 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [984907577] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:46,232 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:46,232 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:55:46,232 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043473299] [2022-02-20 23:55:46,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:46,233 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:55:46,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:46,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:46,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:46,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:55:46,262 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:55:46,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:55:46,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:55:46,263 INFO L87 Difference]: Start difference. First operand 92 states and 106 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:47,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:47,243 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2022-02-20 23:55:47,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:55:47,244 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:55:47,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:47,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:47,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2022-02-20 23:55:47,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:47,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2022-02-20 23:55:47,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 106 transitions. [2022-02-20 23:55:47,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:47,386 INFO L225 Difference]: With dead ends: 97 [2022-02-20 23:55:47,386 INFO L226 Difference]: Without dead ends: 97 [2022-02-20 23:55:47,386 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:55:47,387 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 66 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 159 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:47,388 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 267 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 100 Invalid, 0 Unknown, 159 Unchecked, 0.3s Time] [2022-02-20 23:55:47,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-02-20 23:55:47,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92. [2022-02-20 23:55:47,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:47,392 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 92 states, 71 states have (on average 1.4788732394366197) internal successors, (105), 91 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:55:47,392 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 92 states, 71 states have (on average 1.4788732394366197) internal successors, (105), 91 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:55:47,393 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 92 states, 71 states have (on average 1.4788732394366197) internal successors, (105), 91 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:55:47,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:47,398 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2022-02-20 23:55:47,398 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2022-02-20 23:55:47,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:47,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:47,399 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 71 states have (on average 1.4788732394366197) internal successors, (105), 91 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 97 states. [2022-02-20 23:55:47,399 INFO L87 Difference]: Start difference. First operand has 92 states, 71 states have (on average 1.4788732394366197) internal successors, (105), 91 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 97 states. [2022-02-20 23:55:47,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:47,401 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2022-02-20 23:55:47,401 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2022-02-20 23:55:47,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:47,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:47,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:47,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:47,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 71 states have (on average 1.4788732394366197) internal successors, (105), 91 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:55:47,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2022-02-20 23:55:47,402 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 15 [2022-02-20 23:55:47,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:47,403 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2022-02-20 23:55:47,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:47,403 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2022-02-20 23:55:47,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:55:47,404 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:47,404 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:55:47,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-02-20 23:55:47,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:55:47,611 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:47,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:47,612 INFO L85 PathProgramCache]: Analyzing trace with hash -929437395, now seen corresponding path program 1 times [2022-02-20 23:55:47,612 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:55:47,612 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1489294728] [2022-02-20 23:55:47,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:47,612 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:55:47,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:55:47,613 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:55:47,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-02-20 23:55:47,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:47,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-20 23:55:47,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:47,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:47,718 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:55:47,736 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:55:47,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:55:47,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:55:47,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:55:47,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:55:48,029 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-02-20 23:55:48,029 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 53 treesize of output 35 [2022-02-20 23:55:48,037 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-20 23:55:48,037 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 51 treesize of output 29 [2022-02-20 23:55:48,085 INFO L290 TraceCheckUtils]: 0: Hoare triple {4662#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); {4662#true} is VALID [2022-02-20 23:55:48,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {4662#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8bv32);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; {4670#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)))} is VALID [2022-02-20 23:55:48,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {4670#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)))} 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: L997 {4674#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv8 32) (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|))} is VALID [2022-02-20 23:55:48,088 INFO L290 TraceCheckUtils]: 3: Hoare triple {4674#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv8 32) (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|))} SUMMARY for call write~intINTTYPE4(0bv32, main_~head~0#1.base, ~bvadd32(4bv32, main_~head~0#1.offset), 4bv32); srcloc: L997-1 {4674#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv8 32) (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|))} is VALID [2022-02-20 23:55:48,088 INFO L290 TraceCheckUtils]: 4: Hoare triple {4674#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv8 32) (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|))} 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; {4681#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| |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|))} is VALID [2022-02-20 23:55:48,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {4681#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| |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|))} assume !(0bv32 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {4681#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| |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|))} is VALID [2022-02-20 23:55:48,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {4681#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| |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|))} SUMMARY for call write~intINTTYPE4(main_~state~0#1, main_~x~0#1.base, ~bvadd32(4bv32, main_~x~0#1.offset), 4bv32); srcloc: L1004-2 {4674#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv8 32) (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|))} is VALID [2022-02-20 23:55:48,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {4674#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv8 32) (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|))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4bv32); srcloc: L1025 {4691#(exists ((|ULTIMATE.start_main_~head~0#1.base| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_#t~mem6#1.base|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_#t~mem6#1.offset|) (= |ULTIMATE.start_main_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32)))))} is VALID [2022-02-20 23:55:48,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {4691#(exists ((|ULTIMATE.start_main_~head~0#1.base| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_#t~mem6#1.base|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_#t~mem6#1.offset|) (= |ULTIMATE.start_main_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32)))))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {4695#(exists ((|ULTIMATE.start_main_~head~0#1.base| (_ BitVec 32))) (and (= (_ bv8 32) (select |#length| |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|) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32)))))} is VALID [2022-02-20 23:55:48,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {4695#(exists ((|ULTIMATE.start_main_~head~0#1.base| (_ BitVec 32))) (and (= (_ bv8 32) (select |#length| |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|) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32)))))} assume !!(0bv32 != main_~x~0#1.base || 0bv32 != main_~x~0#1.offset); {4695#(exists ((|ULTIMATE.start_main_~head~0#1.base| (_ BitVec 32))) (and (= (_ bv8 32) (select |#length| |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|) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32)))))} is VALID [2022-02-20 23:55:48,093 INFO L290 TraceCheckUtils]: 10: Hoare triple {4695#(exists ((|ULTIMATE.start_main_~head~0#1.base| (_ BitVec 32))) (and (= (_ bv8 32) (select |#length| |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|) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32)))))} goto; {4695#(exists ((|ULTIMATE.start_main_~head~0#1.base| (_ BitVec 32))) (and (= (_ bv8 32) (select |#length| |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|) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32)))))} is VALID [2022-02-20 23:55:48,095 INFO L290 TraceCheckUtils]: 11: Hoare triple {4695#(exists ((|ULTIMATE.start_main_~head~0#1.base| (_ BitVec 32))) (and (= (_ bv8 32) (select |#length| |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|) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32)))))} SUMMARY for call main_#t~mem7#1 := read~intINTTYPE4(main_~x~0#1.base, ~bvadd32(4bv32, main_~x~0#1.offset), 4bv32); srcloc: L1030-2 {4705#(and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~x~0#1.offset|) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~x~0#1.offset|)) (exists ((|ULTIMATE.start_main_~head~0#1.base| (_ BitVec 32))) (and (= (_ bv8 32) (select |#length| |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|) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32))))))} is VALID [2022-02-20 23:55:48,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {4705#(and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~x~0#1.offset|) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~x~0#1.offset|)) (exists ((|ULTIMATE.start_main_~head~0#1.base| (_ BitVec 32))) (and (= (_ bv8 32) (select |#length| |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|) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32))))))} assume !!(0bv32 != main_#t~mem7#1);havoc main_#t~mem7#1; {4705#(and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~x~0#1.offset|) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~x~0#1.offset|)) (exists ((|ULTIMATE.start_main_~head~0#1.base| (_ BitVec 32))) (and (= (_ bv8 32) (select |#length| |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|) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32))))))} is VALID [2022-02-20 23:55:48,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {4705#(and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~x~0#1.offset|) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~x~0#1.offset|)) (exists ((|ULTIMATE.start_main_~head~0#1.base| (_ BitVec 32))) (and (= (_ bv8 32) (select |#length| |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|) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32))))))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4bv32); srcloc: L1032-13 {4712#(and (bvule |ULTIMATE.start_main_#t~mem8#1.offset| (bvadd (_ bv4 32) |ULTIMATE.start_main_#t~mem8#1.offset|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_main_#t~mem8#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_main_#t~mem8#1.offset|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_#t~mem8#1.offset|) (select |#length| |ULTIMATE.start_main_#t~mem8#1.base|)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_#t~mem8#1.base|)))} is VALID [2022-02-20 23:55:48,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {4712#(and (bvule |ULTIMATE.start_main_#t~mem8#1.offset| (bvadd (_ bv4 32) |ULTIMATE.start_main_#t~mem8#1.offset|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_main_#t~mem8#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_main_#t~mem8#1.offset|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_#t~mem8#1.offset|) (select |#length| |ULTIMATE.start_main_#t~mem8#1.base|)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_#t~mem8#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, main_#t~mem8#1.offset)), #length[main_#t~mem8#1.base]) && ~bvule32(~bvadd32(4bv32, main_#t~mem8#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, main_#t~mem8#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, main_#t~mem8#1.offset))); {4663#false} is VALID [2022-02-20 23:55:48,101 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:55:48,101 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:55:48,101 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:55:48,101 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1489294728] [2022-02-20 23:55:48,101 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1489294728] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:48,101 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:48,101 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:55:48,101 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955507435] [2022-02-20 23:55:48,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:48,102 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:55:48,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:48,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:48,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:48,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:55:48,124 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:55:48,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:55:48,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:55:48,125 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:49,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:49,126 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-02-20 23:55:49,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:55:49,126 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:55:49,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:49,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:49,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2022-02-20 23:55:49,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:49,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2022-02-20 23:55:49,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 105 transitions. [2022-02-20 23:55:49,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:49,235 INFO L225 Difference]: With dead ends: 96 [2022-02-20 23:55:49,235 INFO L226 Difference]: Without dead ends: 96 [2022-02-20 23:55:49,235 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:55:49,235 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 38 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:49,236 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 246 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 124 Invalid, 0 Unknown, 93 Unchecked, 0.3s Time] [2022-02-20 23:55:49,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-02-20 23:55:49,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2022-02-20 23:55:49,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:49,237 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 92 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 91 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:55:49,237 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 92 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 91 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:55:49,238 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 92 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 91 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:55:49,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:49,239 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-02-20 23:55:49,239 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2022-02-20 23:55:49,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:49,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:49,239 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 91 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:55:49,239 INFO L87 Difference]: Start difference. First operand has 92 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 91 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:55:49,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:49,240 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-02-20 23:55:49,240 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2022-02-20 23:55:49,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:49,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:49,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:49,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:49,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 91 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:55:49,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2022-02-20 23:55:49,241 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 15 [2022-02-20 23:55:49,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:49,241 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2022-02-20 23:55:49,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:49,242 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2022-02-20 23:55:49,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:55:49,242 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:49,242 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:55:49,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-02-20 23:55:49,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:55:49,449 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:49,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:49,450 INFO L85 PathProgramCache]: Analyzing trace with hash -448678999, now seen corresponding path program 1 times [2022-02-20 23:55:49,450 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:55:49,450 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1686182339] [2022-02-20 23:55:49,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:49,450 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:55:49,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:55:49,451 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:55:49,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-02-20 23:55:49,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:49,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:55:49,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:49,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:49,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:55:49,569 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 16 treesize of output 8 [2022-02-20 23:55:49,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {5097#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); {5097#true} is VALID [2022-02-20 23:55:49,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {5097#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8bv32);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; {5097#true} is VALID [2022-02-20 23:55:49,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {5097#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: L997 {5097#true} is VALID [2022-02-20 23:55:49,594 INFO L290 TraceCheckUtils]: 3: Hoare triple {5097#true} SUMMARY for call write~intINTTYPE4(0bv32, main_~head~0#1.base, ~bvadd32(4bv32, main_~head~0#1.offset), 4bv32); srcloc: L997-1 {5097#true} is VALID [2022-02-20 23:55:49,594 INFO L290 TraceCheckUtils]: 4: Hoare triple {5097#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; {5097#true} is VALID [2022-02-20 23:55:49,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {5097#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(8bv32); {5117#(not (= |ULTIMATE.start_main_#t~malloc3#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:55:49,596 INFO L290 TraceCheckUtils]: 6: Hoare triple {5117#(not (= |ULTIMATE.start_main_#t~malloc3#1.base| (_ 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: L1007 {5121#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:55:49,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {5121#(not (= (select (select |#memory_$Pointer$.base| |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; {5121#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:55:49,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {5121#(not (= (select (select |#memory_$Pointer$.base| |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: L1008 {5128#(not (= (_ bv0 32) |ULTIMATE.start_main_#t~mem4#1.base|))} is VALID [2022-02-20 23:55:49,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {5128#(not (= (_ bv0 32) |ULTIMATE.start_main_#t~mem4#1.base|))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem4#1.base, main_#t~mem4#1.offset;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {5132#(not (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:55:49,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {5132#(not (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32)))} 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, 4bv32); srcloc: L1009 {5132#(not (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:55:49,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {5132#(not (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32)))} assume !(0bv32 != main_#t~nondet5#1);havoc main_#t~nondet5#1; {5132#(not (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:55:49,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {5132#(not (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(main_~state~0#1, main_~x~0#1.base, ~bvadd32(4bv32, main_~x~0#1.offset), 4bv32); srcloc: L1011 {5132#(not (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:55:49,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {5132#(not (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32)))} assume !(0bv32 != main_~x~0#1.base || 0bv32 != main_~x~0#1.offset); {5098#false} is VALID [2022-02-20 23:55:49,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {5098#false} assume !false; {5098#false} is VALID [2022-02-20 23:55:49,605 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:55:49,605 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:55:49,605 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:55:49,605 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1686182339] [2022-02-20 23:55:49,606 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1686182339] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:49,606 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:49,606 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:55:49,606 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829176694] [2022-02-20 23:55:49,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:49,606 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:55:49,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:49,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:49,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:49,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:55:49,626 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:55:49,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:55:49,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:55:49,627 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:50,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:50,217 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2022-02-20 23:55:50,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:55:50,217 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:55:50,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:50,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:50,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 87 transitions. [2022-02-20 23:55:50,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:50,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 87 transitions. [2022-02-20 23:55:50,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 87 transitions. [2022-02-20 23:55:50,289 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:55:50,290 INFO L225 Difference]: With dead ends: 94 [2022-02-20 23:55:50,290 INFO L226 Difference]: Without dead ends: 94 [2022-02-20 23:55:50,290 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:55:50,290 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 16 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:50,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 294 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:55:50,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-02-20 23:55:50,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2022-02-20 23:55:50,292 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:50,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 90 states, 70 states have (on average 1.457142857142857) internal successors, (102), 89 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:55:50,292 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 90 states, 70 states have (on average 1.457142857142857) internal successors, (102), 89 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:55:50,292 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 90 states, 70 states have (on average 1.457142857142857) internal successors, (102), 89 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:55:50,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:50,293 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2022-02-20 23:55:50,293 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2022-02-20 23:55:50,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:50,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:50,294 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 70 states have (on average 1.457142857142857) internal successors, (102), 89 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 94 states. [2022-02-20 23:55:50,294 INFO L87 Difference]: Start difference. First operand has 90 states, 70 states have (on average 1.457142857142857) internal successors, (102), 89 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 94 states. [2022-02-20 23:55:50,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:50,295 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2022-02-20 23:55:50,295 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2022-02-20 23:55:50,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:50,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:50,295 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:50,295 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:50,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 70 states have (on average 1.457142857142857) internal successors, (102), 89 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:55:50,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2022-02-20 23:55:50,296 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 15 [2022-02-20 23:55:50,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:50,296 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2022-02-20 23:55:50,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:50,297 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2022-02-20 23:55:50,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:55:50,297 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:50,297 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:55:50,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-02-20 23:55:50,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:55:50,498 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:50,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:50,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1252196987, now seen corresponding path program 1 times [2022-02-20 23:55:50,498 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:55:50,498 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2008910665] [2022-02-20 23:55:50,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:50,498 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:55:50,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:55:50,499 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:55:50,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-02-20 23:55:50,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:50,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:55:50,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:50,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:50,613 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:55:50,629 INFO L290 TraceCheckUtils]: 0: Hoare triple {5531#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); {5531#true} is VALID [2022-02-20 23:55:50,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {5531#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8bv32);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; {5531#true} is VALID [2022-02-20 23:55:50,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {5531#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: L997 {5531#true} is VALID [2022-02-20 23:55:50,629 INFO L290 TraceCheckUtils]: 3: Hoare triple {5531#true} SUMMARY for call write~intINTTYPE4(0bv32, main_~head~0#1.base, ~bvadd32(4bv32, main_~head~0#1.offset), 4bv32); srcloc: L997-1 {5531#true} is VALID [2022-02-20 23:55:50,629 INFO L290 TraceCheckUtils]: 4: Hoare triple {5531#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; {5531#true} is VALID [2022-02-20 23:55:50,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {5531#true} assume !(0bv32 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {5531#true} is VALID [2022-02-20 23:55:50,630 INFO L290 TraceCheckUtils]: 6: Hoare triple {5531#true} SUMMARY for call write~intINTTYPE4(main_~state~0#1, main_~x~0#1.base, ~bvadd32(4bv32, main_~x~0#1.offset), 4bv32); srcloc: L1004-2 {5531#true} is VALID [2022-02-20 23:55:50,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {5531#true} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4bv32); srcloc: L1025 {5557#(= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_#t~mem6#1.base|)} is VALID [2022-02-20 23:55:50,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {5557#(= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_#t~mem6#1.base|)} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {5561#(= |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:55:50,631 INFO L290 TraceCheckUtils]: 9: Hoare triple {5561#(= |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 !!(0bv32 != main_~x~0#1.base || 0bv32 != main_~x~0#1.offset); {5561#(= |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:55:50,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {5561#(= |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; {5561#(= |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:55:50,632 INFO L290 TraceCheckUtils]: 11: Hoare triple {5561#(= |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 main_#t~mem7#1 := read~intINTTYPE4(main_~x~0#1.base, ~bvadd32(4bv32, main_~x~0#1.offset), 4bv32); srcloc: L1030-2 {5571#(= (_ bv1 1) (select |#valid| (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:55:50,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {5571#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} assume !(0bv32 != main_#t~mem7#1);havoc main_#t~mem7#1; {5571#(= (_ bv1 1) (select |#valid| (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:55:50,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {5571#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4bv32); srcloc: L1030-3 {5578#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_#t~mem15#1.base|))} is VALID [2022-02-20 23:55:50,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {5578#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_#t~mem15#1.base|))} 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; {5582#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:55:50,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {5582#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~x~0#1.base]); {5532#false} is VALID [2022-02-20 23:55:50,634 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:55:50,634 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:55:50,634 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:55:50,634 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2008910665] [2022-02-20 23:55:50,634 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2008910665] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:50,634 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:50,634 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:55:50,634 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680255623] [2022-02-20 23:55:50,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:50,635 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 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:55:50,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:50,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 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:55:50,650 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:55:50,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:55:50,650 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:55:50,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:55:50,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:55:50,651 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 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:55:51,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:51,725 INFO L93 Difference]: Finished difference Result 127 states and 142 transitions. [2022-02-20 23:55:51,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:55:51,725 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 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:55:51,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:51,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 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:55:51,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2022-02-20 23:55:51,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 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:55:51,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2022-02-20 23:55:51,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 121 transitions. [2022-02-20 23:55:51,855 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:55:51,857 INFO L225 Difference]: With dead ends: 127 [2022-02-20 23:55:51,857 INFO L226 Difference]: Without dead ends: 127 [2022-02-20 23:55:51,857 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:55:51,858 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 172 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:51,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 162 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:55:51,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-02-20 23:55:51,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 91. [2022-02-20 23:55:51,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:51,860 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand has 91 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 90 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:55:51,860 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand has 91 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 90 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:55:51,860 INFO L87 Difference]: Start difference. First operand 127 states. Second operand has 91 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 90 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:55:51,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:51,862 INFO L93 Difference]: Finished difference Result 127 states and 142 transitions. [2022-02-20 23:55:51,862 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 142 transitions. [2022-02-20 23:55:51,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:51,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:51,862 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 90 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 127 states. [2022-02-20 23:55:51,863 INFO L87 Difference]: Start difference. First operand has 91 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 90 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 127 states. [2022-02-20 23:55:51,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:51,865 INFO L93 Difference]: Finished difference Result 127 states and 142 transitions. [2022-02-20 23:55:51,865 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 142 transitions. [2022-02-20 23:55:51,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:51,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:51,865 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:51,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:51,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 90 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:55:51,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2022-02-20 23:55:51,867 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 16 [2022-02-20 23:55:51,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:51,867 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2022-02-20 23:55:51,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 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:55:51,868 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2022-02-20 23:55:51,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:55:51,868 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:51,868 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:55:51,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-02-20 23:55:52,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:55:52,076 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:52,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:52,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1252196988, now seen corresponding path program 1 times [2022-02-20 23:55:52,076 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:55:52,076 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844489255] [2022-02-20 23:55:52,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:52,076 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:55:52,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:55:52,078 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:55:52,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-02-20 23:55:52,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:52,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 23:55:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:52,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:52,268 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:55:52,270 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 34 treesize of output 18 [2022-02-20 23:55:52,341 INFO L290 TraceCheckUtils]: 0: Hoare triple {6067#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); {6067#true} is VALID [2022-02-20 23:55:52,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {6067#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8bv32);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; {6067#true} is VALID [2022-02-20 23:55:52,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {6067#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: L997 {6067#true} is VALID [2022-02-20 23:55:52,341 INFO L290 TraceCheckUtils]: 3: Hoare triple {6067#true} SUMMARY for call write~intINTTYPE4(0bv32, main_~head~0#1.base, ~bvadd32(4bv32, main_~head~0#1.offset), 4bv32); srcloc: L997-1 {6067#true} is VALID [2022-02-20 23:55:52,341 INFO L290 TraceCheckUtils]: 4: Hoare triple {6067#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; {6067#true} is VALID [2022-02-20 23:55:52,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {6067#true} assume !(0bv32 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {6067#true} is VALID [2022-02-20 23:55:52,341 INFO L290 TraceCheckUtils]: 6: Hoare triple {6067#true} SUMMARY for call write~intINTTYPE4(main_~state~0#1, main_~x~0#1.base, ~bvadd32(4bv32, main_~x~0#1.offset), 4bv32); srcloc: L1004-2 {6067#true} is VALID [2022-02-20 23:55:52,342 INFO L290 TraceCheckUtils]: 7: Hoare triple {6067#true} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4bv32); srcloc: L1025 {6093#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_#t~mem6#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_#t~mem6#1.base|))} is VALID [2022-02-20 23:55:52,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {6093#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_#t~mem6#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_#t~mem6#1.base|))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {6097#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.offset|) (= |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:55:52,343 INFO L290 TraceCheckUtils]: 9: Hoare triple {6097#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.offset|) (= |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 !!(0bv32 != main_~x~0#1.base || 0bv32 != main_~x~0#1.offset); {6097#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.offset|) (= |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:55:52,343 INFO L290 TraceCheckUtils]: 10: Hoare triple {6097#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.offset|) (= |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; {6097#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.offset|) (= |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:55:52,344 INFO L290 TraceCheckUtils]: 11: Hoare triple {6097#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.offset|) (= |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 main_#t~mem7#1 := read~intINTTYPE4(main_~x~0#1.base, ~bvadd32(4bv32, main_~x~0#1.offset), 4bv32); srcloc: L1030-2 {6107#(and (bvule (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))))} is VALID [2022-02-20 23:55:52,345 INFO L290 TraceCheckUtils]: 12: Hoare triple {6107#(and (bvule (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))))} assume !(0bv32 != main_#t~mem7#1);havoc main_#t~mem7#1; {6107#(and (bvule (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))))} is VALID [2022-02-20 23:55:52,345 INFO L290 TraceCheckUtils]: 13: Hoare triple {6107#(and (bvule (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))))} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4bv32); srcloc: L1030-3 {6114#(and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_#t~mem15#1.offset|) (select |#length| |ULTIMATE.start_main_#t~mem15#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_main_#t~mem15#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_main_#t~mem15#1.offset|)))} is VALID [2022-02-20 23:55:52,346 INFO L290 TraceCheckUtils]: 14: Hoare triple {6114#(and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_#t~mem15#1.offset|) (select |#length| |ULTIMATE.start_main_#t~mem15#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_main_#t~mem15#1.offset|) (bvadd (_ bv8 32) |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; {6118#(and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~x~0#1.offset|) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-20 23:55:52,346 INFO L290 TraceCheckUtils]: 15: Hoare triple {6118#(and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~x~0#1.offset|) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~x~0#1.offset|)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, main_~x~0#1.offset)), #length[main_~x~0#1.base]) && ~bvule32(~bvadd32(4bv32, main_~x~0#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, main_~x~0#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, main_~x~0#1.offset))); {6068#false} is VALID [2022-02-20 23:55:52,346 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:55:52,346 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:55:52,346 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:55:52,346 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [844489255] [2022-02-20 23:55:52,346 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [844489255] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:52,346 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:52,347 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:55:52,347 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033585247] [2022-02-20 23:55:52,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:52,347 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 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:55:52,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:52,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 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:55:52,365 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:55:52,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:55:52,365 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:55:52,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:55:52,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:55:52,366 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 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:55:54,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:54,775 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2022-02-20 23:55:54,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:55:54,775 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 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:55:54,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:54,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 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:55:54,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2022-02-20 23:55:54,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 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:55:54,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2022-02-20 23:55:54,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 120 transitions. [2022-02-20 23:55:54,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:54,974 INFO L225 Difference]: With dead ends: 126 [2022-02-20 23:55:54,974 INFO L226 Difference]: Without dead ends: 126 [2022-02-20 23:55:54,974 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:55:54,974 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 158 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:54,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 177 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 23:55:54,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-02-20 23:55:54,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 90. [2022-02-20 23:55:54,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:54,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand has 90 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 89 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:55:54,976 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand has 90 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 89 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:55:54,976 INFO L87 Difference]: Start difference. First operand 126 states. Second operand has 90 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 89 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:55:54,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:54,978 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2022-02-20 23:55:54,978 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 140 transitions. [2022-02-20 23:55:54,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:54,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:54,978 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 89 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 126 states. [2022-02-20 23:55:54,979 INFO L87 Difference]: Start difference. First operand has 90 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 89 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 126 states. [2022-02-20 23:55:54,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:54,980 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2022-02-20 23:55:54,980 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 140 transitions. [2022-02-20 23:55:54,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:54,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:54,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:54,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:54,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 89 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:55:54,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2022-02-20 23:55:54,982 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 16 [2022-02-20 23:55:54,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:54,982 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2022-02-20 23:55:54,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 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:55:54,982 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2022-02-20 23:55:54,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:55:54,982 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:54,982 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:55:54,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-02-20 23:55:55,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:55:55,190 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:55,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:55,190 INFO L85 PathProgramCache]: Analyzing trace with hash 770466058, now seen corresponding path program 1 times [2022-02-20 23:55:55,190 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:55:55,190 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2020614139] [2022-02-20 23:55:55,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:55,190 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:55:55,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:55:55,193 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:55:55,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-02-20 23:55:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:55,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 27 conjunts are in the unsatisfiable core [2022-02-20 23:55:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:55,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:55,289 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:55:55,301 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:55:55,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:55:55,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:55:55,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:55:55,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:55:55,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:55:55,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:55:55,409 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 13 treesize of output 9 [2022-02-20 23:55:55,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:55:55,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:55:55,441 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:55:55,443 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:55:55,489 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:55:55,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {6599#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); {6599#true} is VALID [2022-02-20 23:55:55,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {6599#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8bv32);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; {6607#(= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|)} is VALID [2022-02-20 23:55:55,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {6607#(= (_ 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: L997 {6611#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv0 32) |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|))} is VALID [2022-02-20 23:55:55,513 INFO L290 TraceCheckUtils]: 3: Hoare triple {6611#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv0 32) |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|))} SUMMARY for call write~intINTTYPE4(0bv32, main_~head~0#1.base, ~bvadd32(4bv32, main_~head~0#1.offset), 4bv32); srcloc: L997-1 {6611#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv0 32) |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|))} is VALID [2022-02-20 23:55:55,513 INFO L290 TraceCheckUtils]: 4: Hoare triple {6611#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv0 32) |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|))} 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; {6618#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~state~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~x~0#1.offset| |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|))} is VALID [2022-02-20 23:55:55,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {6618#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~state~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~x~0#1.offset| |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|))} assume !(0bv32 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {6618#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~state~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~x~0#1.offset| |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|))} is VALID [2022-02-20 23:55:55,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {6618#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~state~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~x~0#1.offset| |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|))} SUMMARY for call write~intINTTYPE4(main_~state~0#1, main_~x~0#1.base, ~bvadd32(4bv32, main_~x~0#1.offset), 4bv32); srcloc: L1004-2 {6625#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 32)) (= (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|))} is VALID [2022-02-20 23:55:55,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {6625#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 32)) (= (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|))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4bv32); srcloc: L1025 {6629#(and (= |ULTIMATE.start_main_#t~mem6#1.offset| (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |ULTIMATE.start_main_#t~mem6#1.base|) (_ bv4 32))))} is VALID [2022-02-20 23:55:55,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {6629#(and (= |ULTIMATE.start_main_#t~mem6#1.offset| (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |ULTIMATE.start_main_#t~mem6#1.base|) (_ bv4 32))))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {6633#(and (= (_ bv1 32) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (_ bv4 32))) (= |ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:55:55,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {6633#(and (= (_ bv1 32) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (_ bv4 32))) (= |ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32)))} assume !!(0bv32 != main_~x~0#1.base || 0bv32 != main_~x~0#1.offset); {6633#(and (= (_ bv1 32) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (_ bv4 32))) (= |ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:55:55,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {6633#(and (= (_ bv1 32) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (_ bv4 32))) (= |ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32)))} goto; {6633#(and (= (_ bv1 32) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (_ bv4 32))) (= |ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:55:55,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {6633#(and (= (_ bv1 32) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (_ bv4 32))) (= |ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32)))} SUMMARY for call main_#t~mem7#1 := read~intINTTYPE4(main_~x~0#1.base, ~bvadd32(4bv32, main_~x~0#1.offset), 4bv32); srcloc: L1030-2 {6643#(= (_ bv1 32) |ULTIMATE.start_main_#t~mem7#1|)} is VALID [2022-02-20 23:55:55,520 INFO L290 TraceCheckUtils]: 12: Hoare triple {6643#(= (_ bv1 32) |ULTIMATE.start_main_#t~mem7#1|)} assume !(0bv32 != main_#t~mem7#1);havoc main_#t~mem7#1; {6600#false} is VALID [2022-02-20 23:55:55,520 INFO L290 TraceCheckUtils]: 13: Hoare triple {6600#false} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4bv32); srcloc: L1030-3 {6600#false} is VALID [2022-02-20 23:55:55,520 INFO L290 TraceCheckUtils]: 14: Hoare triple {6600#false} 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; {6600#false} is VALID [2022-02-20 23:55:55,520 INFO L290 TraceCheckUtils]: 15: Hoare triple {6600#false} SUMMARY for call main_#t~mem16#1 := read~intINTTYPE4(main_~x~0#1.base, ~bvadd32(4bv32, main_~x~0#1.offset), 4bv32); srcloc: L1038-3 {6600#false} is VALID [2022-02-20 23:55:55,520 INFO L290 TraceCheckUtils]: 16: Hoare triple {6600#false} assume !(0bv32 != main_#t~mem16#1);havoc main_#t~mem16#1; {6600#false} is VALID [2022-02-20 23:55:55,520 INFO L290 TraceCheckUtils]: 17: Hoare triple {6600#false} assume !(0bv32 == main_~x~0#1.offset); {6600#false} is VALID [2022-02-20 23:55:55,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:55:55,522 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:55:55,522 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:55:55,522 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2020614139] [2022-02-20 23:55:55,522 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2020614139] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:55,522 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:55,522 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:55:55,522 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694938321] [2022-02-20 23:55:55,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:55,523 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 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:55:55,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:55,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 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:55:55,561 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:55:55,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:55:55,563 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:55:55,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:55:55,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:55:55,564 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 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:55:57,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:57,145 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2022-02-20 23:55:57,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:55:57,145 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 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:55:57,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:57,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 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:55:57,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 142 transitions. [2022-02-20 23:55:57,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 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:55:57,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 142 transitions. [2022-02-20 23:55:57,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 142 transitions. [2022-02-20 23:55:57,281 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:55:57,283 INFO L225 Difference]: With dead ends: 132 [2022-02-20 23:55:57,283 INFO L226 Difference]: Without dead ends: 132 [2022-02-20 23:55:57,284 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:55:57,286 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 146 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:57,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 404 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 23:55:57,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-02-20 23:55:57,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 90. [2022-02-20 23:55:57,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:57,288 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 90 states, 71 states have (on average 1.4225352112676057) internal successors, (101), 89 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:55:57,288 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 90 states, 71 states have (on average 1.4225352112676057) internal successors, (101), 89 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:55:57,289 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 90 states, 71 states have (on average 1.4225352112676057) internal successors, (101), 89 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:55:57,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:57,290 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2022-02-20 23:55:57,290 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2022-02-20 23:55:57,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:57,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:57,291 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 71 states have (on average 1.4225352112676057) internal successors, (101), 89 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 132 states. [2022-02-20 23:55:57,291 INFO L87 Difference]: Start difference. First operand has 90 states, 71 states have (on average 1.4225352112676057) internal successors, (101), 89 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 132 states. [2022-02-20 23:55:57,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:57,293 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2022-02-20 23:55:57,293 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2022-02-20 23:55:57,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:57,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:57,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:57,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:57,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 71 states have (on average 1.4225352112676057) internal successors, (101), 89 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:55:57,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2022-02-20 23:55:57,295 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 18 [2022-02-20 23:55:57,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:57,295 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2022-02-20 23:55:57,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 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:55:57,295 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2022-02-20 23:55:57,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 23:55:57,296 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:57,296 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:55:57,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-02-20 23:55:57,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:55:57,505 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:57,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:57,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1441667505, now seen corresponding path program 1 times [2022-02-20 23:55:57,505 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:55:57,506 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2124664440] [2022-02-20 23:55:57,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:57,506 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:55:57,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:55:57,520 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:55:57,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-02-20 23:55:57,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:57,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 23:55:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:57,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:57,658 INFO L290 TraceCheckUtils]: 0: Hoare triple {7155#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); {7155#true} is VALID [2022-02-20 23:55:57,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {7155#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8bv32);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#true} is VALID [2022-02-20 23:55:57,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {7155#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: L997 {7155#true} is VALID [2022-02-20 23:55:57,658 INFO L290 TraceCheckUtils]: 3: Hoare triple {7155#true} SUMMARY for call write~intINTTYPE4(0bv32, main_~head~0#1.base, ~bvadd32(4bv32, main_~head~0#1.offset), 4bv32); srcloc: L997-1 {7155#true} is VALID [2022-02-20 23:55:57,659 INFO L290 TraceCheckUtils]: 4: Hoare triple {7155#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; {7155#true} is VALID [2022-02-20 23:55:57,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {7155#true} assume !(0bv32 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {7155#true} is VALID [2022-02-20 23:55:57,659 INFO L290 TraceCheckUtils]: 6: Hoare triple {7155#true} SUMMARY for call write~intINTTYPE4(main_~state~0#1, main_~x~0#1.base, ~bvadd32(4bv32, main_~x~0#1.offset), 4bv32); srcloc: L1004-2 {7155#true} is VALID [2022-02-20 23:55:57,659 INFO L290 TraceCheckUtils]: 7: Hoare triple {7155#true} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4bv32); srcloc: L1025 {7155#true} is VALID [2022-02-20 23:55:57,659 INFO L290 TraceCheckUtils]: 8: Hoare triple {7155#true} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {7155#true} is VALID [2022-02-20 23:55:57,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {7155#true} assume !!(0bv32 != main_~x~0#1.base || 0bv32 != main_~x~0#1.offset); {7155#true} is VALID [2022-02-20 23:55:57,659 INFO L290 TraceCheckUtils]: 10: Hoare triple {7155#true} goto; {7155#true} is VALID [2022-02-20 23:55:57,659 INFO L290 TraceCheckUtils]: 11: Hoare triple {7155#true} SUMMARY for call main_#t~mem7#1 := read~intINTTYPE4(main_~x~0#1.base, ~bvadd32(4bv32, main_~x~0#1.offset), 4bv32); srcloc: L1030-2 {7155#true} is VALID [2022-02-20 23:55:57,660 INFO L290 TraceCheckUtils]: 12: Hoare triple {7155#true} assume !!(0bv32 != main_#t~mem7#1);havoc main_#t~mem7#1; {7155#true} is VALID [2022-02-20 23:55:57,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {7155#true} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4bv32); srcloc: L1032-13 {7155#true} is VALID [2022-02-20 23:55:57,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {7155#true} SUMMARY for call main_#t~mem9#1 := read~intINTTYPE4(main_#t~mem8#1.base, ~bvadd32(4bv32, main_#t~mem8#1.offset), 4bv32); srcloc: L1032-1 {7155#true} is VALID [2022-02-20 23:55:57,660 INFO L290 TraceCheckUtils]: 15: Hoare triple {7155#true} main_#t~short13#1 := 0bv32 == main_#t~mem9#1; {7155#true} is VALID [2022-02-20 23:55:57,660 INFO L290 TraceCheckUtils]: 16: Hoare triple {7155#true} assume main_#t~short13#1; {7208#|ULTIMATE.start_main_#t~short13#1|} is VALID [2022-02-20 23:55:57,661 INFO L290 TraceCheckUtils]: 17: Hoare triple {7208#|ULTIMATE.start_main_#t~short13#1|} assume !main_#t~short13#1;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem9#1;havoc main_#t~mem11#1;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem12#1;havoc main_#t~short13#1; {7156#false} is VALID [2022-02-20 23:55:57,661 INFO L290 TraceCheckUtils]: 18: Hoare triple {7156#false} assume !false; {7156#false} is VALID [2022-02-20 23:55:57,661 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:55:57,661 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:55:57,661 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:55:57,661 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2124664440] [2022-02-20 23:55:57,661 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2124664440] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:57,661 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:57,661 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:55:57,661 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978621223] [2022-02-20 23:55:57,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:57,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 23:55:57,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:57,662 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:57,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:57,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:55:57,681 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:55:57,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:55:57,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:55:57,681 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:57,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:57,852 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2022-02-20 23:55:57,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:55:57,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 23:55:57,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:57,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:57,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2022-02-20 23:55:57,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:57,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2022-02-20 23:55:57,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 78 transitions. [2022-02-20 23:55:57,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:57,972 INFO L225 Difference]: With dead ends: 92 [2022-02-20 23:55:57,972 INFO L226 Difference]: Without dead ends: 92 [2022-02-20 23:55:57,972 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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:55:57,974 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 144 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:55:57,974 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:55:57,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-02-20 23:55:57,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-02-20 23:55:57,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:57,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 92 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 91 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:55:57,976 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 92 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 91 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:55:57,976 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 92 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 91 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:55:57,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:57,977 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2022-02-20 23:55:57,977 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2022-02-20 23:55:57,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:57,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:57,978 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 91 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 92 states. [2022-02-20 23:55:57,978 INFO L87 Difference]: Start difference. First operand has 92 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 91 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 92 states. [2022-02-20 23:55:57,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:57,979 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2022-02-20 23:55:57,979 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2022-02-20 23:55:57,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:57,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:57,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:57,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:57,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 91 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:55:57,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2022-02-20 23:55:57,981 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 19 [2022-02-20 23:55:57,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:57,981 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2022-02-20 23:55:57,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:57,982 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2022-02-20 23:55:57,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 23:55:57,982 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:57,982 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:55:58,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-02-20 23:55:58,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:55:58,189 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:58,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:58,190 INFO L85 PathProgramCache]: Analyzing trace with hash -740864340, now seen corresponding path program 1 times [2022-02-20 23:55:58,190 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:55:58,190 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1001292841] [2022-02-20 23:55:58,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:58,191 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:55:58,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:55:58,192 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:55:58,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-02-20 23:55:58,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:58,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 23:55:58,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:58,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:58,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {7582#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); {7582#true} is VALID [2022-02-20 23:55:58,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {7582#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8bv32);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; {7582#true} is VALID [2022-02-20 23:55:58,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {7582#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: L997 {7582#true} is VALID [2022-02-20 23:55:58,355 INFO L290 TraceCheckUtils]: 3: Hoare triple {7582#true} SUMMARY for call write~intINTTYPE4(0bv32, main_~head~0#1.base, ~bvadd32(4bv32, main_~head~0#1.offset), 4bv32); srcloc: L997-1 {7582#true} is VALID [2022-02-20 23:55:58,356 INFO L290 TraceCheckUtils]: 4: Hoare triple {7582#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; {7599#(= |ULTIMATE.start_main_~state~0#1| (_ bv1 32))} is VALID [2022-02-20 23:55:58,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {7599#(= |ULTIMATE.start_main_~state~0#1| (_ bv1 32))} assume !!(0bv32 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32); {7599#(= |ULTIMATE.start_main_~state~0#1| (_ bv1 32))} is VALID [2022-02-20 23:55:58,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {7599#(= |ULTIMATE.start_main_~state~0#1| (_ bv1 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: L1007 {7599#(= |ULTIMATE.start_main_~state~0#1| (_ bv1 32))} is VALID [2022-02-20 23:55:58,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {7599#(= |ULTIMATE.start_main_~state~0#1| (_ bv1 32))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {7599#(= |ULTIMATE.start_main_~state~0#1| (_ bv1 32))} is VALID [2022-02-20 23:55:58,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {7599#(= |ULTIMATE.start_main_~state~0#1| (_ bv1 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: L1008 {7599#(= |ULTIMATE.start_main_~state~0#1| (_ bv1 32))} is VALID [2022-02-20 23:55:58,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {7599#(= |ULTIMATE.start_main_~state~0#1| (_ bv1 32))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem4#1.base, main_#t~mem4#1.offset;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {7599#(= |ULTIMATE.start_main_~state~0#1| (_ bv1 32))} is VALID [2022-02-20 23:55:58,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {7599#(= |ULTIMATE.start_main_~state~0#1| (_ bv1 32))} 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, 4bv32); srcloc: L1009 {7599#(= |ULTIMATE.start_main_~state~0#1| (_ bv1 32))} is VALID [2022-02-20 23:55:58,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {7599#(= |ULTIMATE.start_main_~state~0#1| (_ bv1 32))} assume 0bv32 != main_#t~nondet5#1;havoc main_#t~nondet5#1; {7599#(= |ULTIMATE.start_main_~state~0#1| (_ bv1 32))} is VALID [2022-02-20 23:55:58,359 INFO L290 TraceCheckUtils]: 12: Hoare triple {7599#(= |ULTIMATE.start_main_~state~0#1| (_ bv1 32))} assume !(1bv32 == main_~state~0#1); {7583#false} is VALID [2022-02-20 23:55:58,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {7583#false} assume !(2bv32 == main_~state~0#1); {7583#false} is VALID [2022-02-20 23:55:58,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {7583#false} SUMMARY for call write~intINTTYPE4(main_~state~0#1, main_~x~0#1.base, ~bvadd32(4bv32, main_~x~0#1.offset), 4bv32); srcloc: L1004-2 {7583#false} is VALID [2022-02-20 23:55:58,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {7583#false} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4bv32); srcloc: L1025 {7583#false} is VALID [2022-02-20 23:55:58,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {7583#false} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {7583#false} is VALID [2022-02-20 23:55:58,360 INFO L290 TraceCheckUtils]: 17: Hoare triple {7583#false} assume !(0bv32 != main_~x~0#1.base || 0bv32 != main_~x~0#1.offset); {7583#false} is VALID [2022-02-20 23:55:58,360 INFO L290 TraceCheckUtils]: 18: Hoare triple {7583#false} assume !false; {7583#false} is VALID [2022-02-20 23:55:58,360 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:55:58,360 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:55:58,360 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:55:58,360 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1001292841] [2022-02-20 23:55:58,360 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1001292841] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:58,361 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:58,361 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:55:58,361 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263599494] [2022-02-20 23:55:58,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:58,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 23:55:58,361 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:58,361 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:58,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:58,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:55:58,385 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:55:58,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:55:58,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:55:58,386 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:58,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:58,595 INFO L93 Difference]: Finished difference Result 158 states and 173 transitions. [2022-02-20 23:55:58,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:55:58,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 23:55:58,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:58,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:58,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 145 transitions. [2022-02-20 23:55:58,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:58,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 145 transitions. [2022-02-20 23:55:58,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 145 transitions. [2022-02-20 23:55:58,722 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:55:58,724 INFO L225 Difference]: With dead ends: 158 [2022-02-20 23:55:58,724 INFO L226 Difference]: Without dead ends: 158 [2022-02-20 23:55:58,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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:55:58,725 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 60 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 141 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:55:58,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 141 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:55:58,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-02-20 23:55:58,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 103. [2022-02-20 23:55:58,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:58,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand has 103 states, 84 states have (on average 1.380952380952381) internal successors, (116), 102 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:58,729 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand has 103 states, 84 states have (on average 1.380952380952381) internal successors, (116), 102 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:58,729 INFO L87 Difference]: Start difference. First operand 158 states. Second operand has 103 states, 84 states have (on average 1.380952380952381) internal successors, (116), 102 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:58,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:58,732 INFO L93 Difference]: Finished difference Result 158 states and 173 transitions. [2022-02-20 23:55:58,732 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 173 transitions. [2022-02-20 23:55:58,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:58,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:58,732 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 84 states have (on average 1.380952380952381) internal successors, (116), 102 states have internal predecessors, (116), 0 states have call successors, (0), 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 158 states. [2022-02-20 23:55:58,733 INFO L87 Difference]: Start difference. First operand has 103 states, 84 states have (on average 1.380952380952381) internal successors, (116), 102 states have internal predecessors, (116), 0 states have call successors, (0), 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 158 states. [2022-02-20 23:55:58,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:58,735 INFO L93 Difference]: Finished difference Result 158 states and 173 transitions. [2022-02-20 23:55:58,735 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 173 transitions. [2022-02-20 23:55:58,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:58,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:58,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:58,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:58,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 84 states have (on average 1.380952380952381) internal successors, (116), 102 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:58,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2022-02-20 23:55:58,738 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 19 [2022-02-20 23:55:58,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:58,738 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2022-02-20 23:55:58,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:58,738 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2022-02-20 23:55:58,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 23:55:58,739 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:58,739 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] [2022-02-20 23:55:58,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2022-02-20 23:55:58,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:55:58,948 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:55:58,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:58,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1741972818, now seen corresponding path program 1 times [2022-02-20 23:55:58,949 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:55:58,949 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [3058047] [2022-02-20 23:55:58,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:58,949 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:55:58,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:55:58,950 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:55:58,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-02-20 23:55:59,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:59,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:55:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:59,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:59,116 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:55:59,122 INFO L290 TraceCheckUtils]: 0: Hoare triple {8218#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); {8218#true} is VALID [2022-02-20 23:55:59,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {8218#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8bv32);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; {8218#true} is VALID [2022-02-20 23:55:59,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {8218#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: L997 {8218#true} is VALID [2022-02-20 23:55:59,122 INFO L290 TraceCheckUtils]: 3: Hoare triple {8218#true} SUMMARY for call write~intINTTYPE4(0bv32, main_~head~0#1.base, ~bvadd32(4bv32, main_~head~0#1.offset), 4bv32); srcloc: L997-1 {8218#true} is VALID [2022-02-20 23:55:59,122 INFO L290 TraceCheckUtils]: 4: Hoare triple {8218#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; {8218#true} is VALID [2022-02-20 23:55:59,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {8218#true} assume !(0bv32 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {8218#true} is VALID [2022-02-20 23:55:59,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {8218#true} SUMMARY for call write~intINTTYPE4(main_~state~0#1, main_~x~0#1.base, ~bvadd32(4bv32, main_~x~0#1.offset), 4bv32); srcloc: L1004-2 {8218#true} is VALID [2022-02-20 23:55:59,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {8218#true} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4bv32); srcloc: L1025 {8218#true} is VALID [2022-02-20 23:55:59,123 INFO L290 TraceCheckUtils]: 8: Hoare triple {8218#true} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {8218#true} is VALID [2022-02-20 23:55:59,123 INFO L290 TraceCheckUtils]: 9: Hoare triple {8218#true} assume !!(0bv32 != main_~x~0#1.base || 0bv32 != main_~x~0#1.offset); {8218#true} is VALID [2022-02-20 23:55:59,123 INFO L290 TraceCheckUtils]: 10: Hoare triple {8218#true} goto; {8218#true} is VALID [2022-02-20 23:55:59,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {8218#true} SUMMARY for call main_#t~mem7#1 := read~intINTTYPE4(main_~x~0#1.base, ~bvadd32(4bv32, main_~x~0#1.offset), 4bv32); srcloc: L1030-2 {8218#true} is VALID [2022-02-20 23:55:59,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {8218#true} assume !!(0bv32 != main_#t~mem7#1);havoc main_#t~mem7#1; {8218#true} is VALID [2022-02-20 23:55:59,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {8218#true} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4bv32); srcloc: L1032-13 {8262#(= |ULTIMATE.start_main_#t~mem8#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:55:59,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {8262#(= |ULTIMATE.start_main_#t~mem8#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 := read~intINTTYPE4(main_#t~mem8#1.base, ~bvadd32(4bv32, main_#t~mem8#1.offset), 4bv32); srcloc: L1032-1 {8266#(= (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:55:59,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {8266#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (_ bv1 1))} main_#t~short13#1 := 0bv32 == main_#t~mem9#1; {8266#(= (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:55:59,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {8266#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (_ bv1 1))} assume !main_#t~short13#1; {8266#(= (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:55:59,126 INFO L290 TraceCheckUtils]: 17: Hoare triple {8266#(= (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~mem11#1 := read~intINTTYPE4(main_~x~0#1.base, ~bvadd32(4bv32, main_~x~0#1.offset), 4bv32); srcloc: L1032-5 {8266#(= (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:55:59,126 INFO L290 TraceCheckUtils]: 18: Hoare triple {8266#(= (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~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4bv32); srcloc: L1032-6 {8279#(= (select |#valid| |ULTIMATE.start_main_#t~mem10#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:55:59,126 INFO L290 TraceCheckUtils]: 19: Hoare triple {8279#(= (select |#valid| |ULTIMATE.start_main_#t~mem10#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_#t~mem10#1.base]); {8219#false} is VALID [2022-02-20 23:55:59,127 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:55:59,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:55:59,127 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:55:59,127 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [3058047] [2022-02-20 23:55:59,127 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [3058047] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:59,127 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:59,127 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:55:59,129 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210153910] [2022-02-20 23:55:59,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:59,129 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 23:55:59,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:59,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:59,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:59,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:55:59,157 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:55:59,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:55:59,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:55:59,158 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:59,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:59,700 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2022-02-20 23:55:59,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:55:59,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 23:55:59,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:59,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:59,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2022-02-20 23:55:59,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:59,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2022-02-20 23:55:59,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 77 transitions. [2022-02-20 23:55:59,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:59,788 INFO L225 Difference]: With dead ends: 102 [2022-02-20 23:55:59,788 INFO L226 Difference]: Without dead ends: 102 [2022-02-20 23:55:59,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 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:55:59,789 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 27 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:59,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 149 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:55:59,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-02-20 23:55:59,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-02-20 23:55:59,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:59,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 102 states, 84 states have (on average 1.3571428571428572) internal successors, (114), 101 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:59,791 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 102 states, 84 states have (on average 1.3571428571428572) internal successors, (114), 101 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:59,791 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 102 states, 84 states have (on average 1.3571428571428572) internal successors, (114), 101 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:59,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:59,792 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2022-02-20 23:55:59,792 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2022-02-20 23:55:59,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:59,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:59,792 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 84 states have (on average 1.3571428571428572) internal successors, (114), 101 states have internal predecessors, (114), 0 states have call successors, (0), 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 102 states. [2022-02-20 23:55:59,793 INFO L87 Difference]: Start difference. First operand has 102 states, 84 states have (on average 1.3571428571428572) internal successors, (114), 101 states have internal predecessors, (114), 0 states have call successors, (0), 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 102 states. [2022-02-20 23:55:59,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:59,794 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2022-02-20 23:55:59,794 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2022-02-20 23:55:59,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:59,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:59,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:59,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:59,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 84 states have (on average 1.3571428571428572) internal successors, (114), 101 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:59,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2022-02-20 23:55:59,796 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 20 [2022-02-20 23:55:59,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:59,796 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2022-02-20 23:55:59,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:59,796 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2022-02-20 23:55:59,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 23:55:59,796 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:59,797 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] [2022-02-20 23:55:59,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-02-20 23:56:00,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:56:00,006 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:56:00,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:56:00,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1741972817, now seen corresponding path program 1 times [2022-02-20 23:56:00,007 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:56:00,007 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [793914774] [2022-02-20 23:56:00,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:56:00,007 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:56:00,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:56:00,009 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:56:00,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-02-20 23:56:00,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:56:00,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:56:00,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:56:00,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:56:00,322 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:56:00,324 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 34 treesize of output 18 [2022-02-20 23:56:00,360 INFO L290 TraceCheckUtils]: 0: Hoare triple {8694#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); {8694#true} is VALID [2022-02-20 23:56:00,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {8694#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8bv32);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; {8694#true} is VALID [2022-02-20 23:56:00,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {8694#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: L997 {8694#true} is VALID [2022-02-20 23:56:00,361 INFO L290 TraceCheckUtils]: 3: Hoare triple {8694#true} SUMMARY for call write~intINTTYPE4(0bv32, main_~head~0#1.base, ~bvadd32(4bv32, main_~head~0#1.offset), 4bv32); srcloc: L997-1 {8694#true} is VALID [2022-02-20 23:56:00,361 INFO L290 TraceCheckUtils]: 4: Hoare triple {8694#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; {8694#true} is VALID [2022-02-20 23:56:00,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {8694#true} assume !(0bv32 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {8694#true} is VALID [2022-02-20 23:56:00,361 INFO L290 TraceCheckUtils]: 6: Hoare triple {8694#true} SUMMARY for call write~intINTTYPE4(main_~state~0#1, main_~x~0#1.base, ~bvadd32(4bv32, main_~x~0#1.offset), 4bv32); srcloc: L1004-2 {8694#true} is VALID [2022-02-20 23:56:00,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {8694#true} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4bv32); srcloc: L1025 {8694#true} is VALID [2022-02-20 23:56:00,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {8694#true} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {8694#true} is VALID [2022-02-20 23:56:00,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {8694#true} assume !!(0bv32 != main_~x~0#1.base || 0bv32 != main_~x~0#1.offset); {8694#true} is VALID [2022-02-20 23:56:00,366 INFO L290 TraceCheckUtils]: 10: Hoare triple {8694#true} goto; {8694#true} is VALID [2022-02-20 23:56:00,367 INFO L290 TraceCheckUtils]: 11: Hoare triple {8694#true} SUMMARY for call main_#t~mem7#1 := read~intINTTYPE4(main_~x~0#1.base, ~bvadd32(4bv32, main_~x~0#1.offset), 4bv32); srcloc: L1030-2 {8694#true} is VALID [2022-02-20 23:56:00,367 INFO L290 TraceCheckUtils]: 12: Hoare triple {8694#true} assume !!(0bv32 != main_#t~mem7#1);havoc main_#t~mem7#1; {8694#true} is VALID [2022-02-20 23:56:00,370 INFO L290 TraceCheckUtils]: 13: Hoare triple {8694#true} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4bv32); srcloc: L1032-13 {8738#(and (= |ULTIMATE.start_main_#t~mem8#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|) |ULTIMATE.start_main_#t~mem8#1.offset|))} is VALID [2022-02-20 23:56:00,373 INFO L290 TraceCheckUtils]: 14: Hoare triple {8738#(and (= |ULTIMATE.start_main_#t~mem8#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|) |ULTIMATE.start_main_#t~mem8#1.offset|))} SUMMARY for call main_#t~mem9#1 := read~intINTTYPE4(main_#t~mem8#1.base, ~bvadd32(4bv32, main_#t~mem8#1.offset), 4bv32); srcloc: L1032-1 {8742#(and (bvule (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (bvadd (_ bv8 32) (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:56:00,374 INFO L290 TraceCheckUtils]: 15: Hoare triple {8742#(and (bvule (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} main_#t~short13#1 := 0bv32 == main_#t~mem9#1; {8742#(and (bvule (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (bvadd (_ bv8 32) (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:56:00,374 INFO L290 TraceCheckUtils]: 16: Hoare triple {8742#(and (bvule (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} assume !main_#t~short13#1; {8742#(and (bvule (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (bvadd (_ bv8 32) (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:56:00,375 INFO L290 TraceCheckUtils]: 17: Hoare triple {8742#(and (bvule (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} SUMMARY for call main_#t~mem11#1 := read~intINTTYPE4(main_~x~0#1.base, ~bvadd32(4bv32, main_~x~0#1.offset), 4bv32); srcloc: L1032-5 {8742#(and (bvule (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (bvadd (_ bv8 32) (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:56:00,375 INFO L290 TraceCheckUtils]: 18: Hoare triple {8742#(and (bvule (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} SUMMARY for call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4bv32); srcloc: L1032-6 {8755#(and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_#t~mem10#1.offset|) (select |#length| |ULTIMATE.start_main_#t~mem10#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_main_#t~mem10#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_main_#t~mem10#1.offset|)))} is VALID [2022-02-20 23:56:00,376 INFO L290 TraceCheckUtils]: 19: Hoare triple {8755#(and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_#t~mem10#1.offset|) (select |#length| |ULTIMATE.start_main_#t~mem10#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_main_#t~mem10#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_main_#t~mem10#1.offset|)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, main_#t~mem10#1.offset)), #length[main_#t~mem10#1.base]) && ~bvule32(~bvadd32(4bv32, main_#t~mem10#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, main_#t~mem10#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, main_#t~mem10#1.offset))); {8695#false} is VALID [2022-02-20 23:56:00,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:56:00,377 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:56:00,377 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:56:00,377 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [793914774] [2022-02-20 23:56:00,377 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [793914774] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:56:00,378 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:56:00,378 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:56:00,378 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049474722] [2022-02-20 23:56:00,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:56:00,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 23:56:00,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:56:00,379 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:00,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:56:00,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:56:00,410 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:56:00,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:56:00,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:56:00,411 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:01,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:56:01,408 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2022-02-20 23:56:01,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:56:01,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 23:56:01,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:56:01,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:01,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2022-02-20 23:56:01,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:01,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2022-02-20 23:56:01,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 76 transitions. [2022-02-20 23:56:01,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:56:01,484 INFO L225 Difference]: With dead ends: 101 [2022-02-20 23:56:01,484 INFO L226 Difference]: Without dead ends: 101 [2022-02-20 23:56:01,484 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:56:01,484 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 24 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:56:01,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 152 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:56:01,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-02-20 23:56:01,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-02-20 23:56:01,486 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:56:01,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 101 states, 84 states have (on average 1.3333333333333333) internal successors, (112), 100 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:56:01,486 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 101 states, 84 states have (on average 1.3333333333333333) internal successors, (112), 100 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:56:01,487 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 101 states, 84 states have (on average 1.3333333333333333) internal successors, (112), 100 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:56:01,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:56:01,488 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2022-02-20 23:56:01,488 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2022-02-20 23:56:01,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:56:01,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:56:01,489 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 84 states have (on average 1.3333333333333333) internal successors, (112), 100 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 101 states. [2022-02-20 23:56:01,489 INFO L87 Difference]: Start difference. First operand has 101 states, 84 states have (on average 1.3333333333333333) internal successors, (112), 100 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 101 states. [2022-02-20 23:56:01,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:56:01,490 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2022-02-20 23:56:01,490 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2022-02-20 23:56:01,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:56:01,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:56:01,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:56:01,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:56:01,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.3333333333333333) internal successors, (112), 100 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:56:01,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2022-02-20 23:56:01,491 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 20 [2022-02-20 23:56:01,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:56:01,491 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2022-02-20 23:56:01,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:01,491 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2022-02-20 23:56:01,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 23:56:01,492 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:56:01,492 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:56:01,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-02-20 23:56:01,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:56:01,699 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:56:01,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:56:01,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1226162375, now seen corresponding path program 1 times [2022-02-20 23:56:01,699 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:56:01,699 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1280777914] [2022-02-20 23:56:01,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:56:01,700 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:56:01,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:56:01,701 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:56:01,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-02-20 23:56:01,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:56:01,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-20 23:56:01,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:56:01,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:56:01,835 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:56:01,887 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:56:01,888 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:56:01,939 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:56:02,031 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:56:02,032 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:56:02,064 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:56:02,064 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:56:02,118 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:56:02,118 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:56:02,140 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:56:02,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {9166#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); {9166#true} is VALID [2022-02-20 23:56:02,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {9166#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8bv32);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; {9174#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:56:02,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {9174#(= (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: L997 {9174#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:56:02,176 INFO L290 TraceCheckUtils]: 3: Hoare triple {9174#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} SUMMARY for call write~intINTTYPE4(0bv32, main_~head~0#1.base, ~bvadd32(4bv32, main_~head~0#1.offset), 4bv32); srcloc: L997-1 {9174#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:56:02,177 INFO L290 TraceCheckUtils]: 4: Hoare triple {9174#(= (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; {9184#(and (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:56:02,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {9184#(and (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~head~0#1.offset|))} assume !!(0bv32 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32); {9188#(and (not (= |ULTIMATE.start_main_~head~0#1.base| |ULTIMATE.start_main_#t~malloc3#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~head~0#1.offset|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:56:02,179 INFO L290 TraceCheckUtils]: 6: Hoare triple {9188#(and (not (= |ULTIMATE.start_main_~head~0#1.base| |ULTIMATE.start_main_#t~malloc3#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~head~0#1.offset|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| (_ 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: L1007 {9192#(and (not (= |ULTIMATE.start_main_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~head~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))))} is VALID [2022-02-20 23:56:02,180 INFO L290 TraceCheckUtils]: 7: Hoare triple {9192#(and (not (= |ULTIMATE.start_main_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~head~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |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; {9192#(and (not (= |ULTIMATE.start_main_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~head~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))))} is VALID [2022-02-20 23:56:02,181 INFO L290 TraceCheckUtils]: 8: Hoare triple {9192#(and (not (= |ULTIMATE.start_main_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~head~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |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: L1008 {9199#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_#t~mem4#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) (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|)))} is VALID [2022-02-20 23:56:02,181 INFO L290 TraceCheckUtils]: 9: Hoare triple {9199#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_#t~mem4#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) (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|)))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem4#1.base, main_#t~mem4#1.offset;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {9203#(and (= |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|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) (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|)))} is VALID [2022-02-20 23:56:02,183 INFO L290 TraceCheckUtils]: 10: Hoare triple {9203#(and (= |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|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) (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|)))} 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, 4bv32); srcloc: L1009 {9203#(and (= |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|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) (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|)))} is VALID [2022-02-20 23:56:02,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {9203#(and (= |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|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) (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|)))} assume !(0bv32 != main_#t~nondet5#1);havoc main_#t~nondet5#1; {9203#(and (= |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|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) (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|)))} is VALID [2022-02-20 23:56:02,186 INFO L290 TraceCheckUtils]: 12: Hoare triple {9203#(and (= |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|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) (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|)))} SUMMARY for call write~intINTTYPE4(main_~state~0#1, main_~x~0#1.base, ~bvadd32(4bv32, main_~x~0#1.offset), 4bv32); srcloc: L1011 {9203#(and (= |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|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) (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|)))} is VALID [2022-02-20 23:56:02,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {9203#(and (= |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|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) (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|)))} assume !!(0bv32 != main_~x~0#1.base || 0bv32 != main_~x~0#1.offset); {9203#(and (= |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|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) (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|)))} is VALID [2022-02-20 23:56:02,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {9203#(and (= |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|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) (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|)))} goto; {9203#(and (= |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|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) (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|)))} is VALID [2022-02-20 23:56:02,188 INFO L290 TraceCheckUtils]: 15: Hoare triple {9203#(and (= |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|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) (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|)))} assume !(0bv32 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {9203#(and (= |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|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) (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|)))} is VALID [2022-02-20 23:56:02,189 INFO L290 TraceCheckUtils]: 16: Hoare triple {9203#(and (= |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|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) (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|)))} SUMMARY for call write~intINTTYPE4(main_~state~0#1, main_~x~0#1.base, ~bvadd32(4bv32, main_~x~0#1.offset), 4bv32); srcloc: L1004-2 {9225#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) (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|)))} is VALID [2022-02-20 23:56:02,190 INFO L290 TraceCheckUtils]: 17: Hoare triple {9225#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) (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|)))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4bv32); srcloc: L1025 {9229#(not (= |ULTIMATE.start_main_#t~mem6#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:56:02,190 INFO L290 TraceCheckUtils]: 18: Hoare triple {9229#(not (= |ULTIMATE.start_main_#t~mem6#1.base| (_ bv0 32)))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {9233#(not (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:56:02,191 INFO L290 TraceCheckUtils]: 19: Hoare triple {9233#(not (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32)))} assume !(0bv32 != main_~x~0#1.base || 0bv32 != main_~x~0#1.offset); {9167#false} is VALID [2022-02-20 23:56:02,191 INFO L290 TraceCheckUtils]: 20: Hoare triple {9167#false} assume !false; {9167#false} is VALID [2022-02-20 23:56:02,191 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:56:02,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:56:02,228 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_479) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2022-02-20 23:56:02,265 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_479) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2022-02-20 23:56:02,273 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (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_479) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2022-02-20 23:56:02,296 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:56:02,296 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 19 treesize of output 20 [2022-02-20 23:56:02,307 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:56:02,308 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 33 treesize of output 36 [2022-02-20 23:56:02,318 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 20 treesize of output 18 [2022-02-20 23:56:02,471 INFO L290 TraceCheckUtils]: 20: Hoare triple {9167#false} assume !false; {9167#false} is VALID [2022-02-20 23:56:02,471 INFO L290 TraceCheckUtils]: 19: Hoare triple {9233#(not (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32)))} assume !(0bv32 != main_~x~0#1.base || 0bv32 != main_~x~0#1.offset); {9167#false} is VALID [2022-02-20 23:56:02,473 INFO L290 TraceCheckUtils]: 18: Hoare triple {9229#(not (= |ULTIMATE.start_main_#t~mem6#1.base| (_ bv0 32)))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {9233#(not (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:56:02,473 INFO L290 TraceCheckUtils]: 17: Hoare triple {9249#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4bv32); srcloc: L1025 {9229#(not (= |ULTIMATE.start_main_#t~mem6#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:56:02,476 INFO L290 TraceCheckUtils]: 16: Hoare triple {9253#(forall ((v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_479) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))))} SUMMARY for call write~intINTTYPE4(main_~state~0#1, main_~x~0#1.base, ~bvadd32(4bv32, main_~x~0#1.offset), 4bv32); srcloc: L1004-2 {9249#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:56:02,476 INFO L290 TraceCheckUtils]: 15: Hoare triple {9253#(forall ((v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_479) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))))} assume !(0bv32 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {9253#(forall ((v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_479) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))))} is VALID [2022-02-20 23:56:02,477 INFO L290 TraceCheckUtils]: 14: Hoare triple {9253#(forall ((v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_479) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))))} goto; {9253#(forall ((v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_479) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))))} is VALID [2022-02-20 23:56:02,478 INFO L290 TraceCheckUtils]: 13: Hoare triple {9253#(forall ((v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_479) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))))} assume !!(0bv32 != main_~x~0#1.base || 0bv32 != main_~x~0#1.offset); {9253#(forall ((v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_479) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))))} is VALID [2022-02-20 23:56:02,493 WARN L290 TraceCheckUtils]: 12: Hoare triple {9253#(forall ((v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_479) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))))} SUMMARY for call write~intINTTYPE4(main_~state~0#1, main_~x~0#1.base, ~bvadd32(4bv32, main_~x~0#1.offset), 4bv32); srcloc: L1011 {9253#(forall ((v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_479) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))))} is UNKNOWN [2022-02-20 23:56:02,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {9253#(forall ((v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_479) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))))} assume !(0bv32 != main_#t~nondet5#1);havoc main_#t~nondet5#1; {9253#(forall ((v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_479) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))))} is VALID [2022-02-20 23:56:02,510 WARN L290 TraceCheckUtils]: 10: Hoare triple {9253#(forall ((v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_479) |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, 4bv32); srcloc: L1009 {9253#(forall ((v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_479) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))))} is UNKNOWN [2022-02-20 23:56:02,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {9275#(forall ((v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_479) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem4#1.base, main_#t~mem4#1.offset;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {9253#(forall ((v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_479) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))))} is VALID [2022-02-20 23:56:02,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {9279#(forall ((v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (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_479) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~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: L1008 {9275#(forall ((v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_479) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))))} is VALID [2022-02-20 23:56:02,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {9279#(forall ((v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (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_479) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {9279#(forall ((v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (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_479) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))))} is VALID [2022-02-20 23:56:02,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {9188#(and (not (= |ULTIMATE.start_main_~head~0#1.base| |ULTIMATE.start_main_#t~malloc3#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~head~0#1.offset|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| (_ 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: L1007 {9279#(forall ((v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (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_479) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))))} is VALID [2022-02-20 23:56:02,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {9289#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_6| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| (_ bv0 32)) (and (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6|) (_ bv0 1)))))} assume !!(0bv32 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32); {9188#(and (not (= |ULTIMATE.start_main_~head~0#1.base| |ULTIMATE.start_main_#t~malloc3#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~head~0#1.offset|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:56:02,517 INFO L290 TraceCheckUtils]: 4: Hoare triple {9293#(or (not (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 1))) (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} 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; {9289#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_6| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| (_ bv0 32)) (and (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6|) (_ bv0 1)))))} is VALID [2022-02-20 23:56:02,518 INFO L290 TraceCheckUtils]: 3: Hoare triple {9293#(or (not (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 1))) (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(0bv32, main_~head~0#1.base, ~bvadd32(4bv32, main_~head~0#1.offset), 4bv32); srcloc: L997-1 {9293#(or (not (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 1))) (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:56:02,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {9293#(or (not (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 1))) (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} 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: L997 {9293#(or (not (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 1))) (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:56:02,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {9166#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8bv32);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; {9293#(or (not (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv0 1))) (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:56:02,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {9166#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); {9166#true} is VALID [2022-02-20 23:56:02,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-02-20 23:56:02,520 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:56:02,520 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1280777914] [2022-02-20 23:56:02,520 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1280777914] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:56:02,520 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:56:02,520 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2022-02-20 23:56:02,520 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725088796] [2022-02-20 23:56:02,520 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:56:02,521 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 23:56:02,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:56:02,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:02,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 36 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-02-20 23:56:02,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-20 23:56:02,586 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:56:02,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-20 23:56:02,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=147, Unknown=3, NotChecked=78, Total=272 [2022-02-20 23:56:02,586 INFO L87 Difference]: Start difference. First operand 101 states and 112 transitions. Second operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:04,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:56:04,777 INFO L93 Difference]: Finished difference Result 198 states and 217 transitions. [2022-02-20 23:56:04,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 23:56:04,778 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 23:56:04,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:56:04,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:04,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 174 transitions. [2022-02-20 23:56:04,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:04,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 174 transitions. [2022-02-20 23:56:04,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 174 transitions. [2022-02-20 23:56:04,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:56:04,978 INFO L225 Difference]: With dead ends: 198 [2022-02-20 23:56:04,978 INFO L226 Difference]: Without dead ends: 198 [2022-02-20 23:56:04,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=290, Unknown=3, NotChecked=114, Total=506 [2022-02-20 23:56:04,979 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 244 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 370 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 23:56:04,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [244 Valid, 512 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 504 Invalid, 0 Unknown, 370 Unchecked, 0.8s Time] [2022-02-20 23:56:04,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-02-20 23:56:04,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 120. [2022-02-20 23:56:04,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:56:04,982 INFO L82 GeneralOperation]: Start isEquivalent. First operand 198 states. Second operand has 120 states, 103 states have (on average 1.3009708737864079) internal successors, (134), 119 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:04,982 INFO L74 IsIncluded]: Start isIncluded. First operand 198 states. Second operand has 120 states, 103 states have (on average 1.3009708737864079) internal successors, (134), 119 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:04,982 INFO L87 Difference]: Start difference. First operand 198 states. Second operand has 120 states, 103 states have (on average 1.3009708737864079) internal successors, (134), 119 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:04,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:56:04,989 INFO L93 Difference]: Finished difference Result 198 states and 217 transitions. [2022-02-20 23:56:04,989 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 217 transitions. [2022-02-20 23:56:04,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:56:04,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:56:04,990 INFO L74 IsIncluded]: Start isIncluded. First operand has 120 states, 103 states have (on average 1.3009708737864079) internal successors, (134), 119 states have internal predecessors, (134), 0 states have call successors, (0), 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 198 states. [2022-02-20 23:56:04,990 INFO L87 Difference]: Start difference. First operand has 120 states, 103 states have (on average 1.3009708737864079) internal successors, (134), 119 states have internal predecessors, (134), 0 states have call successors, (0), 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 198 states. [2022-02-20 23:56:04,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:56:04,992 INFO L93 Difference]: Finished difference Result 198 states and 217 transitions. [2022-02-20 23:56:04,993 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 217 transitions. [2022-02-20 23:56:04,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:56:04,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:56:04,993 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:56:04,993 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:56:04,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 103 states have (on average 1.3009708737864079) internal successors, (134), 119 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:04,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 134 transitions. [2022-02-20 23:56:04,996 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 134 transitions. Word has length 21 [2022-02-20 23:56:04,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:56:04,997 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 134 transitions. [2022-02-20 23:56:04,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:04,997 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 134 transitions. [2022-02-20 23:56:04,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:56:04,997 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:56:04,997 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:56:05,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Ended with exit code 0 [2022-02-20 23:56:05,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:56:05,205 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:56:05,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:56:05,206 INFO L85 PathProgramCache]: Analyzing trace with hash 960368175, now seen corresponding path program 1 times [2022-02-20 23:56:05,206 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:56:05,207 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [124315054] [2022-02-20 23:56:05,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:56:05,208 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:56:05,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:56:05,211 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:56:05,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-02-20 23:56:05,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:56:05,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:56:05,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:56:05,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:56:05,354 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:56:05,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {10033#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); {10033#true} is VALID [2022-02-20 23:56:05,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {10033#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~nondet2#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~mem11#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem12#1, main_#t~short13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem7#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem16#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(8bv32);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; {10033#true} is VALID [2022-02-20 23:56:05,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {10033#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: L997 {10033#true} is VALID [2022-02-20 23:56:05,369 INFO L290 TraceCheckUtils]: 3: Hoare triple {10033#true} SUMMARY for call write~intINTTYPE4(0bv32, main_~head~0#1.base, ~bvadd32(4bv32, main_~head~0#1.offset), 4bv32); srcloc: L997-1 {10033#true} is VALID [2022-02-20 23:56:05,369 INFO L290 TraceCheckUtils]: 4: Hoare triple {10033#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; {10033#true} is VALID [2022-02-20 23:56:05,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {10033#true} assume !(0bv32 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {10033#true} is VALID [2022-02-20 23:56:05,370 INFO L290 TraceCheckUtils]: 6: Hoare triple {10033#true} SUMMARY for call write~intINTTYPE4(main_~state~0#1, main_~x~0#1.base, ~bvadd32(4bv32, main_~x~0#1.offset), 4bv32); srcloc: L1004-2 {10033#true} is VALID [2022-02-20 23:56:05,370 INFO L290 TraceCheckUtils]: 7: Hoare triple {10033#true} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4bv32); srcloc: L1025 {10033#true} is VALID [2022-02-20 23:56:05,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {10033#true} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {10033#true} is VALID [2022-02-20 23:56:05,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {10033#true} assume !!(0bv32 != main_~x~0#1.base || 0bv32 != main_~x~0#1.offset); {10033#true} is VALID [2022-02-20 23:56:05,370 INFO L290 TraceCheckUtils]: 10: Hoare triple {10033#true} goto; {10033#true} is VALID [2022-02-20 23:56:05,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {10033#true} SUMMARY for call main_#t~mem7#1 := read~intINTTYPE4(main_~x~0#1.base, ~bvadd32(4bv32, main_~x~0#1.offset), 4bv32); srcloc: L1030-2 {10033#true} is VALID [2022-02-20 23:56:05,370 INFO L290 TraceCheckUtils]: 12: Hoare triple {10033#true} assume !!(0bv32 != main_#t~mem7#1);havoc main_#t~mem7#1; {10033#true} is VALID [2022-02-20 23:56:05,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {10033#true} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4bv32); srcloc: L1032-13 {10077#(= |ULTIMATE.start_main_#t~mem8#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:56:05,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {10077#(= |ULTIMATE.start_main_#t~mem8#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 := read~intINTTYPE4(main_#t~mem8#1.base, ~bvadd32(4bv32, main_#t~mem8#1.offset), 4bv32); srcloc: L1032-1 {10081#(= (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:56:05,372 INFO L290 TraceCheckUtils]: 15: Hoare triple {10081#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (_ bv1 1))} main_#t~short13#1 := 0bv32 == main_#t~mem9#1; {10081#(= (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:56:05,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {10081#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (_ bv1 1))} assume main_#t~short13#1; {10081#(= (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:56:05,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {10081#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (_ bv1 1))} assume !!main_#t~short13#1;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem9#1;havoc main_#t~mem11#1;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem12#1;havoc main_#t~short13#1; {10081#(= (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:56:05,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {10081#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (_ bv1 1))} goto; {10081#(= (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:56:05,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {10081#(= (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~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4bv32); srcloc: L1032-14 {10097#(= (select |#valid| |ULTIMATE.start_main_#t~mem14#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:56:05,374 INFO L290 TraceCheckUtils]: 20: Hoare triple {10097#(= (select |#valid| |ULTIMATE.start_main_#t~mem14#1.base|) (_ bv1 1))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem14#1.base, main_#t~mem14#1.offset;havoc main_#t~mem14#1.base, main_#t~mem14#1.offset; {10101#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:56:05,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {10101#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~x~0#1.base]); {10034#false} is VALID [2022-02-20 23:56:05,375 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:56:05,375 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:56:05,375 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:56:05,375 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [124315054] [2022-02-20 23:56:05,375 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [124315054] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:56:05,375 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:56:05,375 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:56:05,376 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850504631] [2022-02-20 23:56:05,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:56:05,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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:56:05,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:56:05,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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:56:05,395 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:56:05,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:56:05,396 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:56:05,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:56:05,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:56:05,396 INFO L87 Difference]: Start difference. First operand 120 states and 134 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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:56:06,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:56:06,122 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2022-02-20 23:56:06,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:56:06,122 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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:56:06,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:56:06,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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:56:06,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2022-02-20 23:56:06,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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:56:06,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2022-02-20 23:56:06,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 81 transitions. [2022-02-20 23:56:06,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:56:06,201 INFO L225 Difference]: With dead ends: 122 [2022-02-20 23:56:06,201 INFO L226 Difference]: Without dead ends: 122 [2022-02-20 23:56:06,201 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 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:56:06,201 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 65 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:56:06,202 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 139 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:56:06,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-02-20 23:56:06,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-02-20 23:56:06,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:56:06,203 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand has 121 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 120 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:06,203 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand has 121 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 120 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:06,203 INFO L87 Difference]: Start difference. First operand 122 states. Second operand has 121 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 120 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:06,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:56:06,205 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2022-02-20 23:56:06,205 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2022-02-20 23:56:06,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:56:06,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:56:06,205 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 120 states have internal predecessors, (136), 0 states have call successors, (0), 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:56:06,206 INFO L87 Difference]: Start difference. First operand has 121 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 120 states have internal predecessors, (136), 0 states have call successors, (0), 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:56:06,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:56:06,208 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2022-02-20 23:56:06,209 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2022-02-20 23:56:06,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:56:06,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:56:06,209 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:56:06,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:56:06,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 120 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:06,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 136 transitions. [2022-02-20 23:56:06,211 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 136 transitions. Word has length 22 [2022-02-20 23:56:06,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:56:06,212 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 136 transitions. [2022-02-20 23:56:06,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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:56:06,212 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 136 transitions. [2022-02-20 23:56:06,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:56:06,212 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:56:06,212 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:56:06,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-02-20 23:56:06,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:56:06,422 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:56:06,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:56:06,422 INFO L85 PathProgramCache]: Analyzing trace with hash 960368176, now seen corresponding path program 1 times [2022-02-20 23:56:06,423 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:56:06,423 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [848238357] [2022-02-20 23:56:06,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:56:06,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:56:06,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:56:06,424 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:56:06,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-02-20 23:56:06,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:56:06,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:56:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:56:06,541 INFO L286 TraceCheckSpWp]: Computing forward predicates...