./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bec73cbd355af8995620266d1bb50e13212a1740ed8bd583620b6985b8fd569c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:37:22,647 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:37:22,649 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:37:22,683 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:37:22,683 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:37:22,686 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:37:22,687 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:37:22,689 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:37:22,690 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:37:22,693 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:37:22,693 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:37:22,694 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:37:22,695 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:37:22,696 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:37:22,697 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:37:22,699 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:37:22,700 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:37:22,701 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:37:22,703 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:37:22,712 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:37:22,713 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:37:22,713 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:37:22,715 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:37:22,716 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:37:22,721 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:37:22,722 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:37:22,722 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:37:22,723 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:37:22,724 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:37:22,724 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:37:22,724 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:37:22,725 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:37:22,726 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:37:22,727 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:37:22,728 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:37:22,728 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:37:22,729 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:37:22,729 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:37:22,729 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:37:22,730 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:37:22,730 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:37:22,732 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 14:37:22,755 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:37:22,755 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:37:22,756 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:37:22,756 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:37:22,757 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:37:22,757 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:37:22,757 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:37:22,757 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:37:22,757 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:37:22,758 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:37:22,758 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:37:22,759 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:37:22,759 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:37:22,759 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:37:22,759 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:37:22,759 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:37:22,759 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:37:22,760 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:37:22,760 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:37:22,760 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:37:22,760 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:37:22,760 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:37:22,760 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:37:22,761 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:37:22,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:37:22,761 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:37:22,761 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:37:22,761 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:37:22,761 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:37:22,762 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:37:22,762 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:37:22,762 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:37:22,762 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:37:22,762 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bec73cbd355af8995620266d1bb50e13212a1740ed8bd583620b6985b8fd569c [2022-02-20 14:37:22,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:37:22,994 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:37:22,996 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:37:22,996 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:37:22,997 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:37:22,998 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2022-02-20 14:37:23,057 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b72865b14/b711ed730d7f4cafa04d50c3beeab6ca/FLAGa99e17b0e [2022-02-20 14:37:23,447 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:37:23,448 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2022-02-20 14:37:23,455 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b72865b14/b711ed730d7f4cafa04d50c3beeab6ca/FLAGa99e17b0e [2022-02-20 14:37:23,466 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b72865b14/b711ed730d7f4cafa04d50c3beeab6ca [2022-02-20 14:37:23,468 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:37:23,470 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:37:23,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:37:23,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:37:23,474 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:37:23,475 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:37:23" (1/1) ... [2022-02-20 14:37:23,476 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@120e86e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:37:23, skipping insertion in model container [2022-02-20 14:37:23,476 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:37:23" (1/1) ... [2022-02-20 14:37:23,481 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:37:23,490 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:37:23,635 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/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c[387,400] [2022-02-20 14:37:23,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:37:23,669 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:37:23,680 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/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c[387,400] [2022-02-20 14:37:23,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:37:23,705 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:37:23,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:37:23 WrapperNode [2022-02-20 14:37:23,706 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:37:23,707 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:37:23,707 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:37:23,707 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:37:23,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:37:23" (1/1) ... [2022-02-20 14:37:23,717 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:37:23" (1/1) ... [2022-02-20 14:37:23,736 INFO L137 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 59 [2022-02-20 14:37:23,737 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:37:23,737 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:37:23,737 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:37:23,737 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:37:23,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:37:23" (1/1) ... [2022-02-20 14:37:23,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:37:23" (1/1) ... [2022-02-20 14:37:23,753 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:37:23" (1/1) ... [2022-02-20 14:37:23,753 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:37:23" (1/1) ... [2022-02-20 14:37:23,761 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:37:23" (1/1) ... [2022-02-20 14:37:23,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:37:23" (1/1) ... [2022-02-20 14:37:23,767 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:37:23" (1/1) ... [2022-02-20 14:37:23,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:37:23,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:37:23,769 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:37:23,769 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:37:23,770 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:37:23" (1/1) ... [2022-02-20 14:37:23,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:37:23,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:37:23,796 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 14:37:23,802 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 14:37:23,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:37:23,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:37:23,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:37:23,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:37:23,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:37:23,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:37:23,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:37:23,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:37:23,878 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:37:23,879 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:37:24,030 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:37:24,034 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:37:24,034 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 14:37:24,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:37:24 BoogieIcfgContainer [2022-02-20 14:37:24,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:37:24,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:37:24,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:37:24,045 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:37:24,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:37:23" (1/3) ... [2022-02-20 14:37:24,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fab31f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:37:24, skipping insertion in model container [2022-02-20 14:37:24,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:37:23" (2/3) ... [2022-02-20 14:37:24,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fab31f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:37:24, skipping insertion in model container [2022-02-20 14:37:24,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:37:24" (3/3) ... [2022-02-20 14:37:24,047 INFO L111 eAbstractionObserver]: Analyzing ICFG verisec_sendmail_tTflag_arr_one_loop.c [2022-02-20 14:37:24,063 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:37:24,063 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:37:24,106 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:37:24,114 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 14:37:24,114 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:37:24,125 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.5) internal successors, (18), 13 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 14:37:24,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 14:37:24,128 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:37:24,129 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:37:24,129 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:37:24,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:37:24,134 INFO L85 PathProgramCache]: Analyzing trace with hash 212076531, now seen corresponding path program 1 times [2022-02-20 14:37:24,140 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:37:24,140 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584755531] [2022-02-20 14:37:24,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:37:24,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:37:24,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:37:24,297 INFO L290 TraceCheckUtils]: 0: Hoare triple {17#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(39, 2);call #Ultimate.allocInit(12, 3); {17#true} is VALID [2022-02-20 14:37:24,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {17#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0; {19#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:37:24,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {19#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < 11); {18#false} is VALID [2022-02-20 14:37:24,303 INFO L290 TraceCheckUtils]: 3: Hoare triple {18#false} call write~int(0, main_~#in~0#1.base, 10 + main_~#in~0#1.offset, 1);main_~idx_in~0#1 := 0;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0;call main_#t~mem6#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; {18#false} is VALID [2022-02-20 14:37:24,304 INFO L290 TraceCheckUtils]: 4: Hoare triple {18#false} assume !(48 <= main_~c~0#1 % 256 && main_~c~0#1 % 256 <= 57); {18#false} is VALID [2022-02-20 14:37:24,304 INFO L290 TraceCheckUtils]: 5: Hoare triple {18#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {18#false} is VALID [2022-02-20 14:37:24,304 INFO L290 TraceCheckUtils]: 6: Hoare triple {18#false} assume 0 == __VERIFIER_assert_~cond#1; {18#false} is VALID [2022-02-20 14:37:24,304 INFO L290 TraceCheckUtils]: 7: Hoare triple {18#false} assume !false; {18#false} is VALID [2022-02-20 14:37:24,305 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 14:37:24,306 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:37:24,306 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584755531] [2022-02-20 14:37:24,307 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584755531] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:37:24,307 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:37:24,307 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:37:24,309 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254538758] [2022-02-20 14:37:24,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:37:24,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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 14:37:24,314 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:37:24,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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 14:37:24,335 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 14:37:24,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:37:24,336 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:37:24,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:37:24,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:37:24,353 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.5) internal successors, (18), 13 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) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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 14:37:24,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:37:24,415 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2022-02-20 14:37:24,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:37:24,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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 14:37:24,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:37:24,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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 14:37:24,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-02-20 14:37:24,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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 14:37:24,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-02-20 14:37:24,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2022-02-20 14:37:24,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:37:24,485 INFO L225 Difference]: With dead ends: 35 [2022-02-20 14:37:24,486 INFO L226 Difference]: Without dead ends: 17 [2022-02-20 14:37:24,488 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 14:37:24,491 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:37:24,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 19 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:37:24,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-02-20 14:37:24,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 11. [2022-02-20 14:37:24,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:37:24,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 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 14:37:24,514 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 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 14:37:24,514 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 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 14:37:24,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:37:24,517 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-02-20 14:37:24,517 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-02-20 14:37:24,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:37:24,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:37:24,518 INFO L74 IsIncluded]: Start isIncluded. First operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 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) Second operand 17 states. [2022-02-20 14:37:24,518 INFO L87 Difference]: Start difference. First operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 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) Second operand 17 states. [2022-02-20 14:37:24,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:37:24,519 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-02-20 14:37:24,519 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-02-20 14:37:24,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:37:24,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:37:24,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:37:24,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:37:24,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 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 14:37:24,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2022-02-20 14:37:24,521 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2022-02-20 14:37:24,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:37:24,521 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2022-02-20 14:37:24,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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 14:37:24,522 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2022-02-20 14:37:24,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 14:37:24,522 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:37:24,522 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:37:24,522 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:37:24,522 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:37:24,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:37:24,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1435974389, now seen corresponding path program 1 times [2022-02-20 14:37:24,523 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:37:24,523 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33186820] [2022-02-20 14:37:24,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:37:24,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:37:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:37:24,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {116#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(39, 2);call #Ultimate.allocInit(12, 3); {116#true} is VALID [2022-02-20 14:37:24,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {116#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0; {118#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:37:24,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {118#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {118#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:37:24,578 INFO L290 TraceCheckUtils]: 3: Hoare triple {118#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {119#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:37:24,579 INFO L290 TraceCheckUtils]: 4: Hoare triple {119#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 11); {117#false} is VALID [2022-02-20 14:37:24,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {117#false} call write~int(0, main_~#in~0#1.base, 10 + main_~#in~0#1.offset, 1);main_~idx_in~0#1 := 0;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0;call main_#t~mem6#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; {117#false} is VALID [2022-02-20 14:37:24,583 INFO L290 TraceCheckUtils]: 6: Hoare triple {117#false} assume !(48 <= main_~c~0#1 % 256 && main_~c~0#1 % 256 <= 57); {117#false} is VALID [2022-02-20 14:37:24,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {117#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {117#false} is VALID [2022-02-20 14:37:24,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {117#false} assume 0 == __VERIFIER_assert_~cond#1; {117#false} is VALID [2022-02-20 14:37:24,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {117#false} assume !false; {117#false} is VALID [2022-02-20 14:37:24,584 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 14:37:24,584 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:37:24,585 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33186820] [2022-02-20 14:37:24,585 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33186820] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:37:24,585 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005056421] [2022-02-20 14:37:24,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:37:24,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:37:24,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:37:24,601 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 14:37:24,602 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 14:37:24,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:37:24,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 14:37:24,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:37:24,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:37:24,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {116#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(39, 2);call #Ultimate.allocInit(12, 3); {116#true} is VALID [2022-02-20 14:37:24,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {116#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0; {126#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:37:24,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {126#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {126#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:37:24,739 INFO L290 TraceCheckUtils]: 3: Hoare triple {126#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {119#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:37:24,740 INFO L290 TraceCheckUtils]: 4: Hoare triple {119#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 11); {117#false} is VALID [2022-02-20 14:37:24,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {117#false} call write~int(0, main_~#in~0#1.base, 10 + main_~#in~0#1.offset, 1);main_~idx_in~0#1 := 0;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0;call main_#t~mem6#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; {117#false} is VALID [2022-02-20 14:37:24,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {117#false} assume !(48 <= main_~c~0#1 % 256 && main_~c~0#1 % 256 <= 57); {117#false} is VALID [2022-02-20 14:37:24,740 INFO L290 TraceCheckUtils]: 7: Hoare triple {117#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {117#false} is VALID [2022-02-20 14:37:24,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {117#false} assume 0 == __VERIFIER_assert_~cond#1; {117#false} is VALID [2022-02-20 14:37:24,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {117#false} assume !false; {117#false} is VALID [2022-02-20 14:37:24,740 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 14:37:24,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:37:24,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {117#false} assume !false; {117#false} is VALID [2022-02-20 14:37:24,797 INFO L290 TraceCheckUtils]: 8: Hoare triple {117#false} assume 0 == __VERIFIER_assert_~cond#1; {117#false} is VALID [2022-02-20 14:37:24,797 INFO L290 TraceCheckUtils]: 7: Hoare triple {117#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {117#false} is VALID [2022-02-20 14:37:24,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {117#false} assume !(48 <= main_~c~0#1 % 256 && main_~c~0#1 % 256 <= 57); {117#false} is VALID [2022-02-20 14:37:24,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {117#false} call write~int(0, main_~#in~0#1.base, 10 + main_~#in~0#1.offset, 1);main_~idx_in~0#1 := 0;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0;call main_#t~mem6#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; {117#false} is VALID [2022-02-20 14:37:24,798 INFO L290 TraceCheckUtils]: 4: Hoare triple {166#(< |ULTIMATE.start_main_~i~0#1| 11)} assume !(main_~i~0#1 < 11); {117#false} is VALID [2022-02-20 14:37:24,798 INFO L290 TraceCheckUtils]: 3: Hoare triple {170#(< |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {166#(< |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:37:24,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {170#(< |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {170#(< |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:37:24,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {116#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0; {170#(< |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:37:24,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {116#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(39, 2);call #Ultimate.allocInit(12, 3); {116#true} is VALID [2022-02-20 14:37:24,800 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 14:37:24,801 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005056421] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:37:24,803 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:37:24,803 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-20 14:37:24,804 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175354212] [2022-02-20 14:37:24,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:37:24,805 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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 10 [2022-02-20 14:37:24,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:37:24,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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 14:37:24,819 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 14:37:24,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 14:37:24,820 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:37:24,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 14:37:24,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:37:24,821 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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 14:37:24,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:37:24,926 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-02-20 14:37:24,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:37:24,927 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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 10 [2022-02-20 14:37:24,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:37:24,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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 14:37:24,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-02-20 14:37:24,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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 14:37:24,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-02-20 14:37:24,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 37 transitions. [2022-02-20 14:37:24,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:37:24,956 INFO L225 Difference]: With dead ends: 33 [2022-02-20 14:37:24,956 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 14:37:24,956 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:37:24,957 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 18 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:37:24,957 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 24 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:37:24,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 14:37:24,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2022-02-20 14:37:24,962 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:37:24,962 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 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 14:37:24,962 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 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 14:37:24,962 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 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 14:37:24,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:37:24,963 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-02-20 14:37:24,964 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-02-20 14:37:24,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:37:24,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:37:24,964 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 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) Second operand 27 states. [2022-02-20 14:37:24,964 INFO L87 Difference]: Start difference. First operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 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) Second operand 27 states. [2022-02-20 14:37:24,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:37:24,965 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-02-20 14:37:24,966 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-02-20 14:37:24,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:37:24,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:37:24,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:37:24,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:37:24,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 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 14:37:24,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-02-20 14:37:24,967 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 10 [2022-02-20 14:37:24,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:37:24,967 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-02-20 14:37:24,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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 14:37:24,968 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-02-20 14:37:24,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 14:37:24,968 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:37:24,968 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:37:24,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 14:37:25,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:37:25,178 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:37:25,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:37:25,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1662320891, now seen corresponding path program 2 times [2022-02-20 14:37:25,181 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:37:25,181 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805485494] [2022-02-20 14:37:25,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:37:25,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:37:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:37:25,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {298#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(39, 2);call #Ultimate.allocInit(12, 3); {298#true} is VALID [2022-02-20 14:37:25,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {298#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0; {298#true} is VALID [2022-02-20 14:37:25,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {298#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {298#true} is VALID [2022-02-20 14:37:25,260 INFO L290 TraceCheckUtils]: 3: Hoare triple {298#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {298#true} is VALID [2022-02-20 14:37:25,260 INFO L290 TraceCheckUtils]: 4: Hoare triple {298#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {298#true} is VALID [2022-02-20 14:37:25,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {298#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {298#true} is VALID [2022-02-20 14:37:25,261 INFO L290 TraceCheckUtils]: 6: Hoare triple {298#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {298#true} is VALID [2022-02-20 14:37:25,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {298#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {298#true} is VALID [2022-02-20 14:37:25,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {298#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {298#true} is VALID [2022-02-20 14:37:25,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {298#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {298#true} is VALID [2022-02-20 14:37:25,264 INFO L290 TraceCheckUtils]: 10: Hoare triple {298#true} assume !(main_~i~0#1 < 11); {298#true} is VALID [2022-02-20 14:37:25,279 INFO L290 TraceCheckUtils]: 11: Hoare triple {298#true} call write~int(0, main_~#in~0#1.base, 10 + main_~#in~0#1.offset, 1);main_~idx_in~0#1 := 0;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0;call main_#t~mem6#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; {300#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:37:25,280 INFO L290 TraceCheckUtils]: 12: Hoare triple {300#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(48 <= main_~c~0#1 % 256 && main_~c~0#1 % 256 <= 57); {300#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:37:25,280 INFO L290 TraceCheckUtils]: 13: Hoare triple {300#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {301#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 14:37:25,280 INFO L290 TraceCheckUtils]: 14: Hoare triple {301#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {299#false} is VALID [2022-02-20 14:37:25,281 INFO L290 TraceCheckUtils]: 15: Hoare triple {299#false} assume !false; {299#false} is VALID [2022-02-20 14:37:25,281 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 14:37:25,281 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:37:25,281 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805485494] [2022-02-20 14:37:25,281 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805485494] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:37:25,281 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:37:25,281 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:37:25,281 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287465] [2022-02-20 14:37:25,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:37:25,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 14:37:25,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:37:25,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:37:25,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:37:25,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:37:25,289 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:37:25,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:37:25,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:37:25,290 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:37:25,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:37:25,357 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-02-20 14:37:25,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:37:25,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 14:37:25,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:37:25,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:37:25,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2022-02-20 14:37:25,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:37:25,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2022-02-20 14:37:25,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 16 transitions. [2022-02-20 14:37:25,374 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 14:37:25,375 INFO L225 Difference]: With dead ends: 22 [2022-02-20 14:37:25,375 INFO L226 Difference]: Without dead ends: 18 [2022-02-20 14:37:25,375 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:37:25,376 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 3 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:37:25,376 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 15 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:37:25,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-20 14:37:25,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-20 14:37:25,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:37:25,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 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 14:37:25,382 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 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 14:37:25,382 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 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 14:37:25,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:37:25,383 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-02-20 14:37:25,383 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-02-20 14:37:25,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:37:25,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:37:25,383 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 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) Second operand 18 states. [2022-02-20 14:37:25,384 INFO L87 Difference]: Start difference. First operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 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) Second operand 18 states. [2022-02-20 14:37:25,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:37:25,384 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-02-20 14:37:25,384 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-02-20 14:37:25,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:37:25,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:37:25,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:37:25,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:37:25,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 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 14:37:25,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-02-20 14:37:25,385 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2022-02-20 14:37:25,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:37:25,385 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-02-20 14:37:25,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:37:25,385 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-02-20 14:37:25,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 14:37:25,386 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:37:25,386 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:37:25,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 14:37:25,386 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:37:25,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:37:25,386 INFO L85 PathProgramCache]: Analyzing trace with hash -5994546, now seen corresponding path program 1 times [2022-02-20 14:37:25,386 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:37:25,386 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593457505] [2022-02-20 14:37:25,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:37:25,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:37:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:37:25,468 INFO L290 TraceCheckUtils]: 0: Hoare triple {396#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(39, 2);call #Ultimate.allocInit(12, 3); {396#true} is VALID [2022-02-20 14:37:25,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {396#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0; {398#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:37:25,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {398#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {398#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:37:25,471 INFO L290 TraceCheckUtils]: 3: Hoare triple {398#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {399#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:37:25,472 INFO L290 TraceCheckUtils]: 4: Hoare triple {399#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {399#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:37:25,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {399#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {400#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:37:25,473 INFO L290 TraceCheckUtils]: 6: Hoare triple {400#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {400#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:37:25,476 INFO L290 TraceCheckUtils]: 7: Hoare triple {400#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {401#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:37:25,477 INFO L290 TraceCheckUtils]: 8: Hoare triple {401#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {401#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:37:25,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {401#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {402#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:37:25,478 INFO L290 TraceCheckUtils]: 10: Hoare triple {402#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 < 11); {397#false} is VALID [2022-02-20 14:37:25,478 INFO L290 TraceCheckUtils]: 11: Hoare triple {397#false} call write~int(0, main_~#in~0#1.base, 10 + main_~#in~0#1.offset, 1);main_~idx_in~0#1 := 0;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0;call main_#t~mem6#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; {397#false} is VALID [2022-02-20 14:37:25,478 INFO L290 TraceCheckUtils]: 12: Hoare triple {397#false} assume !!(48 <= main_~c~0#1 % 256 && main_~c~0#1 % 256 <= 57);main_~j~0#1 := main_~c~0#1 % 256 - 48;main_~i~0#1 := (if (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 else (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 - 4294967296);main_#t~post7#1 := main_~idx_in~0#1;main_~idx_in~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;call main_#t~mem8#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1; {397#false} is VALID [2022-02-20 14:37:25,478 INFO L290 TraceCheckUtils]: 13: Hoare triple {397#false} assume !(48 <= main_~c~0#1 % 256 && main_~c~0#1 % 256 <= 57); {397#false} is VALID [2022-02-20 14:37:25,479 INFO L290 TraceCheckUtils]: 14: Hoare triple {397#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {397#false} is VALID [2022-02-20 14:37:25,479 INFO L290 TraceCheckUtils]: 15: Hoare triple {397#false} assume 0 == __VERIFIER_assert_~cond#1; {397#false} is VALID [2022-02-20 14:37:25,479 INFO L290 TraceCheckUtils]: 16: Hoare triple {397#false} assume !false; {397#false} is VALID [2022-02-20 14:37:25,479 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:37:25,479 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:37:25,479 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593457505] [2022-02-20 14:37:25,480 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593457505] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:37:25,480 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672068351] [2022-02-20 14:37:25,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:37:25,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:37:25,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:37:25,482 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 14:37:25,503 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 14:37:25,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:37:25,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:37:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:37:25,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:37:25,649 INFO L290 TraceCheckUtils]: 0: Hoare triple {396#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(39, 2);call #Ultimate.allocInit(12, 3); {396#true} is VALID [2022-02-20 14:37:25,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {396#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0; {409#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:37:25,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {409#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {409#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:37:25,651 INFO L290 TraceCheckUtils]: 3: Hoare triple {409#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {399#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:37:25,651 INFO L290 TraceCheckUtils]: 4: Hoare triple {399#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {399#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:37:25,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {399#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {400#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:37:25,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {400#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {400#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:37:25,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {400#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {401#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:37:25,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {401#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {401#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:37:25,653 INFO L290 TraceCheckUtils]: 9: Hoare triple {401#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {402#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:37:25,653 INFO L290 TraceCheckUtils]: 10: Hoare triple {402#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 < 11); {397#false} is VALID [2022-02-20 14:37:25,653 INFO L290 TraceCheckUtils]: 11: Hoare triple {397#false} call write~int(0, main_~#in~0#1.base, 10 + main_~#in~0#1.offset, 1);main_~idx_in~0#1 := 0;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0;call main_#t~mem6#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; {397#false} is VALID [2022-02-20 14:37:25,654 INFO L290 TraceCheckUtils]: 12: Hoare triple {397#false} assume !!(48 <= main_~c~0#1 % 256 && main_~c~0#1 % 256 <= 57);main_~j~0#1 := main_~c~0#1 % 256 - 48;main_~i~0#1 := (if (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 else (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 - 4294967296);main_#t~post7#1 := main_~idx_in~0#1;main_~idx_in~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;call main_#t~mem8#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1; {397#false} is VALID [2022-02-20 14:37:25,654 INFO L290 TraceCheckUtils]: 13: Hoare triple {397#false} assume !(48 <= main_~c~0#1 % 256 && main_~c~0#1 % 256 <= 57); {397#false} is VALID [2022-02-20 14:37:25,654 INFO L290 TraceCheckUtils]: 14: Hoare triple {397#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {397#false} is VALID [2022-02-20 14:37:25,654 INFO L290 TraceCheckUtils]: 15: Hoare triple {397#false} assume 0 == __VERIFIER_assert_~cond#1; {397#false} is VALID [2022-02-20 14:37:25,654 INFO L290 TraceCheckUtils]: 16: Hoare triple {397#false} assume !false; {397#false} is VALID [2022-02-20 14:37:25,654 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:37:25,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:37:25,784 INFO L290 TraceCheckUtils]: 16: Hoare triple {397#false} assume !false; {397#false} is VALID [2022-02-20 14:37:25,785 INFO L290 TraceCheckUtils]: 15: Hoare triple {397#false} assume 0 == __VERIFIER_assert_~cond#1; {397#false} is VALID [2022-02-20 14:37:25,785 INFO L290 TraceCheckUtils]: 14: Hoare triple {397#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {397#false} is VALID [2022-02-20 14:37:25,785 INFO L290 TraceCheckUtils]: 13: Hoare triple {397#false} assume !(48 <= main_~c~0#1 % 256 && main_~c~0#1 % 256 <= 57); {397#false} is VALID [2022-02-20 14:37:25,785 INFO L290 TraceCheckUtils]: 12: Hoare triple {397#false} assume !!(48 <= main_~c~0#1 % 256 && main_~c~0#1 % 256 <= 57);main_~j~0#1 := main_~c~0#1 % 256 - 48;main_~i~0#1 := (if (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 else (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 - 4294967296);main_#t~post7#1 := main_~idx_in~0#1;main_~idx_in~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;call main_#t~mem8#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1; {397#false} is VALID [2022-02-20 14:37:25,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {397#false} call write~int(0, main_~#in~0#1.base, 10 + main_~#in~0#1.offset, 1);main_~idx_in~0#1 := 0;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0;call main_#t~mem6#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; {397#false} is VALID [2022-02-20 14:37:25,785 INFO L290 TraceCheckUtils]: 10: Hoare triple {473#(< |ULTIMATE.start_main_~i~0#1| 11)} assume !(main_~i~0#1 < 11); {397#false} is VALID [2022-02-20 14:37:25,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {477#(< |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {473#(< |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:37:25,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {477#(< |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {477#(< |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:37:25,787 INFO L290 TraceCheckUtils]: 7: Hoare triple {484#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {477#(< |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:37:25,787 INFO L290 TraceCheckUtils]: 6: Hoare triple {484#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {484#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:37:25,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {491#(< |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {484#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:37:25,788 INFO L290 TraceCheckUtils]: 4: Hoare triple {491#(< |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {491#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:37:25,788 INFO L290 TraceCheckUtils]: 3: Hoare triple {498#(< |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {491#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:37:25,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {498#(< |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {498#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:37:25,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {396#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0; {498#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:37:25,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {396#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(39, 2);call #Ultimate.allocInit(12, 3); {396#true} is VALID [2022-02-20 14:37:25,789 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:37:25,789 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672068351] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:37:25,789 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:37:25,789 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-02-20 14:37:25,789 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949742374] [2022-02-20 14:37:25,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:37:25,790 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 14:37:25,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:37:25,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:37:25,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:37:25,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 14:37:25,822 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:37:25,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 14:37:25,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-20 14:37:25,823 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:37:25,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:37:25,935 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-02-20 14:37:25,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 14:37:25,935 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 14:37:25,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:37:25,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:37:25,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 48 transitions. [2022-02-20 14:37:25,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:37:25,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 48 transitions. [2022-02-20 14:37:25,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 48 transitions. [2022-02-20 14:37:25,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:37:25,980 INFO L225 Difference]: With dead ends: 42 [2022-02-20 14:37:25,980 INFO L226 Difference]: Without dead ends: 35 [2022-02-20 14:37:25,980 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-20 14:37:25,981 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 14 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:37:25,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:37:25,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-02-20 14:37:25,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2022-02-20 14:37:25,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:37:25,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 30 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:37:25,998 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 30 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:37:25,999 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 30 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:37:26,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:37:26,000 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2022-02-20 14:37:26,000 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2022-02-20 14:37:26,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:37:26,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:37:26,001 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 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 35 states. [2022-02-20 14:37:26,001 INFO L87 Difference]: Start difference. First operand has 30 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 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 35 states. [2022-02-20 14:37:26,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:37:26,002 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2022-02-20 14:37:26,002 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2022-02-20 14:37:26,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:37:26,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:37:26,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:37:26,003 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:37:26,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:37:26,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2022-02-20 14:37:26,004 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 17 [2022-02-20 14:37:26,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:37:26,004 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2022-02-20 14:37:26,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:37:26,004 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-02-20 14:37:26,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 14:37:26,005 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:37:26,005 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:37:26,024 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 14:37:26,219 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,SelfDestructingSolverStorable3 [2022-02-20 14:37:26,219 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:37:26,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:37:26,220 INFO L85 PathProgramCache]: Analyzing trace with hash 776585922, now seen corresponding path program 2 times [2022-02-20 14:37:26,220 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:37:26,220 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233969542] [2022-02-20 14:37:26,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:37:26,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:37:26,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:37:26,358 INFO L290 TraceCheckUtils]: 0: Hoare triple {678#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(39, 2);call #Ultimate.allocInit(12, 3); {678#true} is VALID [2022-02-20 14:37:26,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {678#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0; {680#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:37:26,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {680#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {680#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:37:26,361 INFO L290 TraceCheckUtils]: 3: Hoare triple {680#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {681#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:37:26,361 INFO L290 TraceCheckUtils]: 4: Hoare triple {681#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {681#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:37:26,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {681#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {682#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:37:26,362 INFO L290 TraceCheckUtils]: 6: Hoare triple {682#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {682#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:37:26,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {682#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {683#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:37:26,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {683#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {683#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:37:26,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {683#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {684#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:37:26,364 INFO L290 TraceCheckUtils]: 10: Hoare triple {684#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {684#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:37:26,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {684#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {685#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:37:26,365 INFO L290 TraceCheckUtils]: 12: Hoare triple {685#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {685#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:37:26,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {685#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {686#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:37:26,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {686#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {686#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:37:26,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {686#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {687#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:37:26,386 INFO L290 TraceCheckUtils]: 16: Hoare triple {687#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {687#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:37:26,386 INFO L290 TraceCheckUtils]: 17: Hoare triple {687#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {688#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:37:26,387 INFO L290 TraceCheckUtils]: 18: Hoare triple {688#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {688#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:37:26,387 INFO L290 TraceCheckUtils]: 19: Hoare triple {688#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {689#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:37:26,388 INFO L290 TraceCheckUtils]: 20: Hoare triple {689#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {689#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:37:26,388 INFO L290 TraceCheckUtils]: 21: Hoare triple {689#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {690#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:37:26,389 INFO L290 TraceCheckUtils]: 22: Hoare triple {690#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 11); {679#false} is VALID [2022-02-20 14:37:26,389 INFO L290 TraceCheckUtils]: 23: Hoare triple {679#false} call write~int(0, main_~#in~0#1.base, 10 + main_~#in~0#1.offset, 1);main_~idx_in~0#1 := 0;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0;call main_#t~mem6#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; {679#false} is VALID [2022-02-20 14:37:26,389 INFO L290 TraceCheckUtils]: 24: Hoare triple {679#false} assume !!(48 <= main_~c~0#1 % 256 && main_~c~0#1 % 256 <= 57);main_~j~0#1 := main_~c~0#1 % 256 - 48;main_~i~0#1 := (if (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 else (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 - 4294967296);main_#t~post7#1 := main_~idx_in~0#1;main_~idx_in~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;call main_#t~mem8#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1; {679#false} is VALID [2022-02-20 14:37:26,389 INFO L290 TraceCheckUtils]: 25: Hoare triple {679#false} assume !(48 <= main_~c~0#1 % 256 && main_~c~0#1 % 256 <= 57); {679#false} is VALID [2022-02-20 14:37:26,390 INFO L290 TraceCheckUtils]: 26: Hoare triple {679#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {679#false} is VALID [2022-02-20 14:37:26,390 INFO L290 TraceCheckUtils]: 27: Hoare triple {679#false} assume 0 == __VERIFIER_assert_~cond#1; {679#false} is VALID [2022-02-20 14:37:26,390 INFO L290 TraceCheckUtils]: 28: Hoare triple {679#false} assume !false; {679#false} is VALID [2022-02-20 14:37:26,390 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:37:26,390 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:37:26,390 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233969542] [2022-02-20 14:37:26,391 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233969542] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:37:26,391 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298130699] [2022-02-20 14:37:26,391 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:37:26,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:37:26,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:37:26,392 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 14:37:26,409 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 14:37:26,463 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:37:26,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:37:26,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 14:37:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:37:26,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:37:26,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {678#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(39, 2);call #Ultimate.allocInit(12, 3); {678#true} is VALID [2022-02-20 14:37:26,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {678#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0; {697#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:37:26,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {697#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {697#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:37:26,676 INFO L290 TraceCheckUtils]: 3: Hoare triple {697#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {681#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:37:26,676 INFO L290 TraceCheckUtils]: 4: Hoare triple {681#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {681#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:37:26,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {681#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {682#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:37:26,677 INFO L290 TraceCheckUtils]: 6: Hoare triple {682#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {682#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:37:26,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {682#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {683#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:37:26,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {683#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {683#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:37:26,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {683#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {684#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:37:26,679 INFO L290 TraceCheckUtils]: 10: Hoare triple {684#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {684#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:37:26,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {684#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {685#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:37:26,680 INFO L290 TraceCheckUtils]: 12: Hoare triple {685#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {685#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:37:26,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {685#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {686#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:37:26,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {686#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {686#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:37:26,683 INFO L290 TraceCheckUtils]: 15: Hoare triple {686#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {687#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:37:26,683 INFO L290 TraceCheckUtils]: 16: Hoare triple {687#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {687#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:37:26,683 INFO L290 TraceCheckUtils]: 17: Hoare triple {687#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {688#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:37:26,684 INFO L290 TraceCheckUtils]: 18: Hoare triple {688#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {688#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:37:26,684 INFO L290 TraceCheckUtils]: 19: Hoare triple {688#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {689#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:37:26,685 INFO L290 TraceCheckUtils]: 20: Hoare triple {689#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {689#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:37:26,685 INFO L290 TraceCheckUtils]: 21: Hoare triple {689#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {690#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:37:26,685 INFO L290 TraceCheckUtils]: 22: Hoare triple {690#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 11); {679#false} is VALID [2022-02-20 14:37:26,685 INFO L290 TraceCheckUtils]: 23: Hoare triple {679#false} call write~int(0, main_~#in~0#1.base, 10 + main_~#in~0#1.offset, 1);main_~idx_in~0#1 := 0;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0;call main_#t~mem6#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; {679#false} is VALID [2022-02-20 14:37:26,686 INFO L290 TraceCheckUtils]: 24: Hoare triple {679#false} assume !!(48 <= main_~c~0#1 % 256 && main_~c~0#1 % 256 <= 57);main_~j~0#1 := main_~c~0#1 % 256 - 48;main_~i~0#1 := (if (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 else (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 - 4294967296);main_#t~post7#1 := main_~idx_in~0#1;main_~idx_in~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;call main_#t~mem8#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1; {679#false} is VALID [2022-02-20 14:37:26,686 INFO L290 TraceCheckUtils]: 25: Hoare triple {679#false} assume !(48 <= main_~c~0#1 % 256 && main_~c~0#1 % 256 <= 57); {679#false} is VALID [2022-02-20 14:37:26,686 INFO L290 TraceCheckUtils]: 26: Hoare triple {679#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {679#false} is VALID [2022-02-20 14:37:26,686 INFO L290 TraceCheckUtils]: 27: Hoare triple {679#false} assume 0 == __VERIFIER_assert_~cond#1; {679#false} is VALID [2022-02-20 14:37:26,686 INFO L290 TraceCheckUtils]: 28: Hoare triple {679#false} assume !false; {679#false} is VALID [2022-02-20 14:37:26,686 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:37:26,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:37:26,883 INFO L290 TraceCheckUtils]: 28: Hoare triple {679#false} assume !false; {679#false} is VALID [2022-02-20 14:37:26,884 INFO L290 TraceCheckUtils]: 27: Hoare triple {679#false} assume 0 == __VERIFIER_assert_~cond#1; {679#false} is VALID [2022-02-20 14:37:26,884 INFO L290 TraceCheckUtils]: 26: Hoare triple {679#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {679#false} is VALID [2022-02-20 14:37:26,884 INFO L290 TraceCheckUtils]: 25: Hoare triple {679#false} assume !(48 <= main_~c~0#1 % 256 && main_~c~0#1 % 256 <= 57); {679#false} is VALID [2022-02-20 14:37:26,884 INFO L290 TraceCheckUtils]: 24: Hoare triple {679#false} assume !!(48 <= main_~c~0#1 % 256 && main_~c~0#1 % 256 <= 57);main_~j~0#1 := main_~c~0#1 % 256 - 48;main_~i~0#1 := (if (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 else (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 - 4294967296);main_#t~post7#1 := main_~idx_in~0#1;main_~idx_in~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;call main_#t~mem8#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1; {679#false} is VALID [2022-02-20 14:37:26,884 INFO L290 TraceCheckUtils]: 23: Hoare triple {679#false} call write~int(0, main_~#in~0#1.base, 10 + main_~#in~0#1.offset, 1);main_~idx_in~0#1 := 0;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0;call main_#t~mem6#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; {679#false} is VALID [2022-02-20 14:37:26,884 INFO L290 TraceCheckUtils]: 22: Hoare triple {690#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 11); {679#false} is VALID [2022-02-20 14:37:26,885 INFO L290 TraceCheckUtils]: 21: Hoare triple {689#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {690#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:37:26,885 INFO L290 TraceCheckUtils]: 20: Hoare triple {689#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {689#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:37:26,885 INFO L290 TraceCheckUtils]: 19: Hoare triple {688#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {689#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:37:26,886 INFO L290 TraceCheckUtils]: 18: Hoare triple {688#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {688#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:37:26,886 INFO L290 TraceCheckUtils]: 17: Hoare triple {687#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {688#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:37:26,887 INFO L290 TraceCheckUtils]: 16: Hoare triple {687#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {687#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:37:26,887 INFO L290 TraceCheckUtils]: 15: Hoare triple {686#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {687#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:37:26,888 INFO L290 TraceCheckUtils]: 14: Hoare triple {686#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {686#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:37:26,888 INFO L290 TraceCheckUtils]: 13: Hoare triple {685#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {686#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:37:26,888 INFO L290 TraceCheckUtils]: 12: Hoare triple {685#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {685#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:37:26,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {684#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {685#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:37:26,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {684#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {684#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:37:26,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {683#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {684#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:37:26,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {683#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {683#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:37:26,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {682#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {683#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:37:26,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {682#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {682#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:37:26,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {681#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {682#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:37:26,891 INFO L290 TraceCheckUtils]: 4: Hoare triple {681#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {681#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:37:26,891 INFO L290 TraceCheckUtils]: 3: Hoare triple {697#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {681#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:37:26,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {697#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {697#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:37:26,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {678#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0; {697#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:37:26,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {678#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(39, 2);call #Ultimate.allocInit(12, 3); {678#true} is VALID [2022-02-20 14:37:26,892 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:37:26,892 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298130699] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:37:26,892 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:37:26,893 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 14 [2022-02-20 14:37:26,893 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071754661] [2022-02-20 14:37:26,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:37:26,893 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 14:37:26,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:37:26,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:37:26,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:37:26,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 14:37:26,914 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:37:26,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 14:37:26,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2022-02-20 14:37:26,915 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:37:27,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:37:27,027 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-02-20 14:37:27,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 14:37:27,027 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 14:37:27,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:37:27,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:37:27,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 45 transitions. [2022-02-20 14:37:27,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:37:27,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 45 transitions. [2022-02-20 14:37:27,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 45 transitions. [2022-02-20 14:37:27,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:37:27,077 INFO L225 Difference]: With dead ends: 44 [2022-02-20 14:37:27,077 INFO L226 Difference]: Without dead ends: 37 [2022-02-20 14:37:27,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2022-02-20 14:37:27,078 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 19 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:37:27,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 28 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:37:27,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-20 14:37:27,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2022-02-20 14:37:27,105 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:37:27,105 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:37:27,105 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:37:27,105 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:37:27,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:37:27,107 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2022-02-20 14:37:27,107 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-02-20 14:37:27,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:37:27,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:37:27,107 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 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 37 states. [2022-02-20 14:37:27,107 INFO L87 Difference]: Start difference. First operand has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 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 37 states. [2022-02-20 14:37:27,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:37:27,108 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2022-02-20 14:37:27,108 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-02-20 14:37:27,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:37:27,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:37:27,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:37:27,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:37:27,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:37:27,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2022-02-20 14:37:27,115 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 29 [2022-02-20 14:37:27,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:37:27,117 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2022-02-20 14:37:27,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:37:27,117 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-02-20 14:37:27,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 14:37:27,118 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:37:27,118 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:37:27,141 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 14:37:27,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:37:27,331 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:37:27,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:37:27,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1133517568, now seen corresponding path program 3 times [2022-02-20 14:37:27,332 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:37:27,332 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837452298] [2022-02-20 14:37:27,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:37:27,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:37:27,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:37:27,437 INFO L290 TraceCheckUtils]: 0: Hoare triple {1043#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(39, 2);call #Ultimate.allocInit(12, 3); {1043#true} is VALID [2022-02-20 14:37:27,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {1043#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0; {1043#true} is VALID [2022-02-20 14:37:27,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {1043#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1043#true} is VALID [2022-02-20 14:37:27,437 INFO L290 TraceCheckUtils]: 3: Hoare triple {1043#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1043#true} is VALID [2022-02-20 14:37:27,437 INFO L290 TraceCheckUtils]: 4: Hoare triple {1043#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1043#true} is VALID [2022-02-20 14:37:27,437 INFO L290 TraceCheckUtils]: 5: Hoare triple {1043#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1043#true} is VALID [2022-02-20 14:37:27,437 INFO L290 TraceCheckUtils]: 6: Hoare triple {1043#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1043#true} is VALID [2022-02-20 14:37:27,437 INFO L290 TraceCheckUtils]: 7: Hoare triple {1043#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1043#true} is VALID [2022-02-20 14:37:27,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {1043#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1043#true} is VALID [2022-02-20 14:37:27,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {1043#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1043#true} is VALID [2022-02-20 14:37:27,438 INFO L290 TraceCheckUtils]: 10: Hoare triple {1043#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1043#true} is VALID [2022-02-20 14:37:27,438 INFO L290 TraceCheckUtils]: 11: Hoare triple {1043#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1043#true} is VALID [2022-02-20 14:37:27,440 INFO L290 TraceCheckUtils]: 12: Hoare triple {1043#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1043#true} is VALID [2022-02-20 14:37:27,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {1043#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1043#true} is VALID [2022-02-20 14:37:27,440 INFO L290 TraceCheckUtils]: 14: Hoare triple {1043#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1043#true} is VALID [2022-02-20 14:37:27,440 INFO L290 TraceCheckUtils]: 15: Hoare triple {1043#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1043#true} is VALID [2022-02-20 14:37:27,440 INFO L290 TraceCheckUtils]: 16: Hoare triple {1043#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1043#true} is VALID [2022-02-20 14:37:27,440 INFO L290 TraceCheckUtils]: 17: Hoare triple {1043#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1043#true} is VALID [2022-02-20 14:37:27,440 INFO L290 TraceCheckUtils]: 18: Hoare triple {1043#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1043#true} is VALID [2022-02-20 14:37:27,441 INFO L290 TraceCheckUtils]: 19: Hoare triple {1043#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1043#true} is VALID [2022-02-20 14:37:27,441 INFO L290 TraceCheckUtils]: 20: Hoare triple {1043#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1043#true} is VALID [2022-02-20 14:37:27,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {1043#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1043#true} is VALID [2022-02-20 14:37:27,441 INFO L290 TraceCheckUtils]: 22: Hoare triple {1043#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1043#true} is VALID [2022-02-20 14:37:27,441 INFO L290 TraceCheckUtils]: 23: Hoare triple {1043#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1043#true} is VALID [2022-02-20 14:37:27,441 INFO L290 TraceCheckUtils]: 24: Hoare triple {1043#true} assume !(main_~i~0#1 < 11); {1043#true} is VALID [2022-02-20 14:37:27,443 INFO L290 TraceCheckUtils]: 25: Hoare triple {1043#true} call write~int(0, main_~#in~0#1.base, 10 + main_~#in~0#1.offset, 1);main_~idx_in~0#1 := 0;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0;call main_#t~mem6#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; {1045#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:37:27,444 INFO L290 TraceCheckUtils]: 26: Hoare triple {1045#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(48 <= main_~c~0#1 % 256 && main_~c~0#1 % 256 <= 57);main_~j~0#1 := main_~c~0#1 % 256 - 48;main_~i~0#1 := (if (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 else (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 - 4294967296);main_#t~post7#1 := main_~idx_in~0#1;main_~idx_in~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;call main_#t~mem8#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1; {1046#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:37:27,444 INFO L290 TraceCheckUtils]: 27: Hoare triple {1046#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(48 <= main_~c~0#1 % 256 && main_~c~0#1 % 256 <= 57); {1046#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:37:27,444 INFO L290 TraceCheckUtils]: 28: Hoare triple {1046#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1047#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 14:37:27,445 INFO L290 TraceCheckUtils]: 29: Hoare triple {1047#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {1044#false} is VALID [2022-02-20 14:37:27,445 INFO L290 TraceCheckUtils]: 30: Hoare triple {1044#false} assume !false; {1044#false} is VALID [2022-02-20 14:37:27,445 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-02-20 14:37:27,445 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:37:27,445 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837452298] [2022-02-20 14:37:27,445 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837452298] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:37:27,445 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348804878] [2022-02-20 14:37:27,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:37:27,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:37:27,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:37:27,446 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 14:37:27,447 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 14:37:27,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-20 14:37:27,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:37:27,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 14:37:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:37:27,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:37:31,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {1043#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(39, 2);call #Ultimate.allocInit(12, 3); {1043#true} is VALID [2022-02-20 14:37:31,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {1043#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0; {1043#true} is VALID [2022-02-20 14:37:31,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {1043#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1043#true} is VALID [2022-02-20 14:37:31,053 INFO L290 TraceCheckUtils]: 3: Hoare triple {1043#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1043#true} is VALID [2022-02-20 14:37:31,053 INFO L290 TraceCheckUtils]: 4: Hoare triple {1043#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1043#true} is VALID [2022-02-20 14:37:31,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {1043#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1043#true} is VALID [2022-02-20 14:37:31,053 INFO L290 TraceCheckUtils]: 6: Hoare triple {1043#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1043#true} is VALID [2022-02-20 14:37:31,053 INFO L290 TraceCheckUtils]: 7: Hoare triple {1043#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1043#true} is VALID [2022-02-20 14:37:31,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {1043#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1043#true} is VALID [2022-02-20 14:37:31,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {1043#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1043#true} is VALID [2022-02-20 14:37:31,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {1043#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1043#true} is VALID [2022-02-20 14:37:31,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {1043#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1043#true} is VALID [2022-02-20 14:37:31,054 INFO L290 TraceCheckUtils]: 12: Hoare triple {1043#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1043#true} is VALID [2022-02-20 14:37:31,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {1043#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1043#true} is VALID [2022-02-20 14:37:31,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {1043#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1043#true} is VALID [2022-02-20 14:37:31,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {1043#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1043#true} is VALID [2022-02-20 14:37:31,054 INFO L290 TraceCheckUtils]: 16: Hoare triple {1043#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1043#true} is VALID [2022-02-20 14:37:31,054 INFO L290 TraceCheckUtils]: 17: Hoare triple {1043#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1043#true} is VALID [2022-02-20 14:37:31,054 INFO L290 TraceCheckUtils]: 18: Hoare triple {1043#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1043#true} is VALID [2022-02-20 14:37:31,054 INFO L290 TraceCheckUtils]: 19: Hoare triple {1043#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1043#true} is VALID [2022-02-20 14:37:31,054 INFO L290 TraceCheckUtils]: 20: Hoare triple {1043#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1043#true} is VALID [2022-02-20 14:37:31,054 INFO L290 TraceCheckUtils]: 21: Hoare triple {1043#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1043#true} is VALID [2022-02-20 14:37:31,054 INFO L290 TraceCheckUtils]: 22: Hoare triple {1043#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1043#true} is VALID [2022-02-20 14:37:31,054 INFO L290 TraceCheckUtils]: 23: Hoare triple {1043#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1043#true} is VALID [2022-02-20 14:37:31,055 INFO L290 TraceCheckUtils]: 24: Hoare triple {1043#true} assume !(main_~i~0#1 < 11); {1043#true} is VALID [2022-02-20 14:37:31,059 INFO L290 TraceCheckUtils]: 25: Hoare triple {1043#true} call write~int(0, main_~#in~0#1.base, 10 + main_~#in~0#1.offset, 1);main_~idx_in~0#1 := 0;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0;call main_#t~mem6#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; {1045#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:37:31,060 INFO L290 TraceCheckUtils]: 26: Hoare triple {1045#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(48 <= main_~c~0#1 % 256 && main_~c~0#1 % 256 <= 57);main_~j~0#1 := main_~c~0#1 % 256 - 48;main_~i~0#1 := (if (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 else (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 - 4294967296);main_#t~post7#1 := main_~idx_in~0#1;main_~idx_in~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;call main_#t~mem8#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1; {1046#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:37:31,060 INFO L290 TraceCheckUtils]: 27: Hoare triple {1046#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(48 <= main_~c~0#1 % 256 && main_~c~0#1 % 256 <= 57); {1046#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:37:31,061 INFO L290 TraceCheckUtils]: 28: Hoare triple {1046#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1135#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:37:31,061 INFO L290 TraceCheckUtils]: 29: Hoare triple {1135#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {1044#false} is VALID [2022-02-20 14:37:31,061 INFO L290 TraceCheckUtils]: 30: Hoare triple {1044#false} assume !false; {1044#false} is VALID [2022-02-20 14:37:31,061 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-02-20 14:37:31,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:37:36,146 INFO L290 TraceCheckUtils]: 30: Hoare triple {1044#false} assume !false; {1044#false} is VALID [2022-02-20 14:37:36,149 INFO L290 TraceCheckUtils]: 29: Hoare triple {1135#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {1044#false} is VALID [2022-02-20 14:37:36,150 INFO L290 TraceCheckUtils]: 28: Hoare triple {1046#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1135#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:37:36,150 INFO L290 TraceCheckUtils]: 27: Hoare triple {1046#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(48 <= main_~c~0#1 % 256 && main_~c~0#1 % 256 <= 57); {1046#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:37:38,155 WARN L290 TraceCheckUtils]: 26: Hoare triple {1154#(or (<= (div (* (- 1) (div (+ (* |ULTIMATE.start_main_~i~0#1| (- 10)) (- 2147483658)) (- 256))) (- 16777216)) (+ (div (+ (- 48) (* |ULTIMATE.start_main_~i~0#1| 10)) 4294967296) 1)) (<= (div (* (- 1) (div (+ (- 2147483856) (* |ULTIMATE.start_main_~i~0#1| (- 10))) (- 256))) (- 16777216)) (+ (div (div (* |ULTIMATE.start_main_~i~0#1| 10) 256) 16777216) 1)))} assume !!(48 <= main_~c~0#1 % 256 && main_~c~0#1 % 256 <= 57);main_~j~0#1 := main_~c~0#1 % 256 - 48;main_~i~0#1 := (if (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 else (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 - 4294967296);main_#t~post7#1 := main_~idx_in~0#1;main_~idx_in~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;call main_#t~mem8#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1; {1046#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is UNKNOWN [2022-02-20 14:37:38,156 INFO L290 TraceCheckUtils]: 25: Hoare triple {1043#true} call write~int(0, main_~#in~0#1.base, 10 + main_~#in~0#1.offset, 1);main_~idx_in~0#1 := 0;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0;call main_#t~mem6#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; {1154#(or (<= (div (* (- 1) (div (+ (* |ULTIMATE.start_main_~i~0#1| (- 10)) (- 2147483658)) (- 256))) (- 16777216)) (+ (div (+ (- 48) (* |ULTIMATE.start_main_~i~0#1| 10)) 4294967296) 1)) (<= (div (* (- 1) (div (+ (- 2147483856) (* |ULTIMATE.start_main_~i~0#1| (- 10))) (- 256))) (- 16777216)) (+ (div (div (* |ULTIMATE.start_main_~i~0#1| 10) 256) 16777216) 1)))} is VALID [2022-02-20 14:37:38,156 INFO L290 TraceCheckUtils]: 24: Hoare triple {1043#true} assume !(main_~i~0#1 < 11); {1043#true} is VALID [2022-02-20 14:37:38,156 INFO L290 TraceCheckUtils]: 23: Hoare triple {1043#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1043#true} is VALID [2022-02-20 14:37:38,156 INFO L290 TraceCheckUtils]: 22: Hoare triple {1043#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1043#true} is VALID [2022-02-20 14:37:38,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {1043#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1043#true} is VALID [2022-02-20 14:37:38,156 INFO L290 TraceCheckUtils]: 20: Hoare triple {1043#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1043#true} is VALID [2022-02-20 14:37:38,156 INFO L290 TraceCheckUtils]: 19: Hoare triple {1043#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1043#true} is VALID [2022-02-20 14:37:38,156 INFO L290 TraceCheckUtils]: 18: Hoare triple {1043#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1043#true} is VALID [2022-02-20 14:37:38,156 INFO L290 TraceCheckUtils]: 17: Hoare triple {1043#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1043#true} is VALID [2022-02-20 14:37:38,156 INFO L290 TraceCheckUtils]: 16: Hoare triple {1043#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1043#true} is VALID [2022-02-20 14:37:38,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {1043#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1043#true} is VALID [2022-02-20 14:37:38,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {1043#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1043#true} is VALID [2022-02-20 14:37:38,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {1043#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1043#true} is VALID [2022-02-20 14:37:38,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {1043#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1043#true} is VALID [2022-02-20 14:37:38,157 INFO L290 TraceCheckUtils]: 11: Hoare triple {1043#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1043#true} is VALID [2022-02-20 14:37:38,157 INFO L290 TraceCheckUtils]: 10: Hoare triple {1043#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1043#true} is VALID [2022-02-20 14:37:38,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {1043#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1043#true} is VALID [2022-02-20 14:37:38,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {1043#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1043#true} is VALID [2022-02-20 14:37:38,157 INFO L290 TraceCheckUtils]: 7: Hoare triple {1043#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1043#true} is VALID [2022-02-20 14:37:38,157 INFO L290 TraceCheckUtils]: 6: Hoare triple {1043#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1043#true} is VALID [2022-02-20 14:37:38,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {1043#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1043#true} is VALID [2022-02-20 14:37:38,157 INFO L290 TraceCheckUtils]: 4: Hoare triple {1043#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1043#true} is VALID [2022-02-20 14:37:38,157 INFO L290 TraceCheckUtils]: 3: Hoare triple {1043#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1043#true} is VALID [2022-02-20 14:37:38,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {1043#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1043#true} is VALID [2022-02-20 14:37:38,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {1043#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0; {1043#true} is VALID [2022-02-20 14:37:38,158 INFO L290 TraceCheckUtils]: 0: Hoare triple {1043#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(39, 2);call #Ultimate.allocInit(12, 3); {1043#true} is VALID [2022-02-20 14:37:38,158 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-02-20 14:37:38,158 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348804878] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:37:38,158 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:37:38,159 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-02-20 14:37:38,159 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089161516] [2022-02-20 14:37:38,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:37:38,159 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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 31 [2022-02-20 14:37:38,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:37:38,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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 14:37:40,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 14 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 14:37:40,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 14:37:40,190 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:37:40,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 14:37:40,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:37:40,191 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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 14:37:42,781 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 14:37:42,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:37:42,998 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-02-20 14:37:42,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 14:37:42,999 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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 31 [2022-02-20 14:37:42,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:37:42,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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 14:37:43,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2022-02-20 14:37:43,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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 14:37:43,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2022-02-20 14:37:43,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 24 transitions. [2022-02-20 14:37:45,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 23 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 14:37:45,068 INFO L225 Difference]: With dead ends: 40 [2022-02-20 14:37:45,068 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 14:37:45,068 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-02-20 14:37:45,069 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 9 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-20 14:37:45,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 23 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-02-20 14:37:45,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 14:37:45,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-02-20 14:37:45,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:37:45,090 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:37:45,090 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:37:45,090 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:37:45,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:37:45,091 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-02-20 14:37:45,091 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-02-20 14:37:45,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:37:45,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:37:45,092 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 0 states have call successors, (0), 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 34 states. [2022-02-20 14:37:45,092 INFO L87 Difference]: Start difference. First operand has 34 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 0 states have call successors, (0), 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 34 states. [2022-02-20 14:37:45,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:37:45,092 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-02-20 14:37:45,092 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-02-20 14:37:45,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:37:45,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:37:45,093 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:37:45,093 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:37:45,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:37:45,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2022-02-20 14:37:45,094 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 31 [2022-02-20 14:37:45,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:37:45,094 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-02-20 14:37:45,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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 14:37:45,094 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-02-20 14:37:45,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 14:37:45,094 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:37:45,094 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:37:45,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-02-20 14:37:45,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:37:45,310 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:37:45,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:37:45,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1664602656, now seen corresponding path program 4 times [2022-02-20 14:37:45,311 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:37:45,311 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885857218] [2022-02-20 14:37:45,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:37:45,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:37:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:38:12,191 INFO L290 TraceCheckUtils]: 0: Hoare triple {1413#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(39, 2);call #Ultimate.allocInit(12, 3); {1413#true} is VALID [2022-02-20 14:38:12,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {1413#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0; {1413#true} is VALID [2022-02-20 14:38:12,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {1413#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1413#true} is VALID [2022-02-20 14:38:12,191 INFO L290 TraceCheckUtils]: 3: Hoare triple {1413#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1413#true} is VALID [2022-02-20 14:38:12,191 INFO L290 TraceCheckUtils]: 4: Hoare triple {1413#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1413#true} is VALID [2022-02-20 14:38:12,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {1413#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1413#true} is VALID [2022-02-20 14:38:12,191 INFO L290 TraceCheckUtils]: 6: Hoare triple {1413#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1413#true} is VALID [2022-02-20 14:38:12,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {1413#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1413#true} is VALID [2022-02-20 14:38:12,192 INFO L290 TraceCheckUtils]: 8: Hoare triple {1413#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1413#true} is VALID [2022-02-20 14:38:12,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {1413#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1413#true} is VALID [2022-02-20 14:38:12,192 INFO L290 TraceCheckUtils]: 10: Hoare triple {1413#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1413#true} is VALID [2022-02-20 14:38:12,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {1413#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1413#true} is VALID [2022-02-20 14:38:12,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {1413#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1413#true} is VALID [2022-02-20 14:38:12,192 INFO L290 TraceCheckUtils]: 13: Hoare triple {1413#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1413#true} is VALID [2022-02-20 14:38:12,192 INFO L290 TraceCheckUtils]: 14: Hoare triple {1413#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1413#true} is VALID [2022-02-20 14:38:12,193 INFO L290 TraceCheckUtils]: 15: Hoare triple {1413#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1413#true} is VALID [2022-02-20 14:38:12,193 INFO L290 TraceCheckUtils]: 16: Hoare triple {1413#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1413#true} is VALID [2022-02-20 14:38:12,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {1413#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1413#true} is VALID [2022-02-20 14:38:12,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {1413#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1413#true} is VALID [2022-02-20 14:38:12,193 INFO L290 TraceCheckUtils]: 19: Hoare triple {1413#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1413#true} is VALID [2022-02-20 14:38:12,193 INFO L290 TraceCheckUtils]: 20: Hoare triple {1413#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1413#true} is VALID [2022-02-20 14:38:12,193 INFO L290 TraceCheckUtils]: 21: Hoare triple {1413#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1413#true} is VALID [2022-02-20 14:38:12,194 INFO L290 TraceCheckUtils]: 22: Hoare triple {1413#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1413#true} is VALID [2022-02-20 14:38:12,194 INFO L290 TraceCheckUtils]: 23: Hoare triple {1413#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1413#true} is VALID [2022-02-20 14:38:12,195 INFO L290 TraceCheckUtils]: 24: Hoare triple {1413#true} assume !(main_~i~0#1 < 11); {1413#true} is VALID [2022-02-20 14:38:12,207 INFO L290 TraceCheckUtils]: 25: Hoare triple {1413#true} call write~int(0, main_~#in~0#1.base, 10 + main_~#in~0#1.offset, 1);main_~idx_in~0#1 := 0;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0;call main_#t~mem6#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; {1415#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:38:12,209 INFO L290 TraceCheckUtils]: 26: Hoare triple {1415#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(48 <= main_~c~0#1 % 256 && main_~c~0#1 % 256 <= 57);main_~j~0#1 := main_~c~0#1 % 256 - 48;main_~i~0#1 := (if (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 else (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 - 4294967296);main_#t~post7#1 := main_~idx_in~0#1;main_~idx_in~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;call main_#t~mem8#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1; {1416#(<= 0 (+ (* (div (+ 45 (* |ULTIMATE.start_main_~i~0#1| (- 5))) 2147483648) 2147483648) (* 5 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-20 14:38:12,265 INFO L290 TraceCheckUtils]: 27: Hoare triple {1416#(<= 0 (+ (* (div (+ 45 (* |ULTIMATE.start_main_~i~0#1| (- 5))) 2147483648) 2147483648) (* 5 |ULTIMATE.start_main_~i~0#1|)))} assume !!(48 <= main_~c~0#1 % 256 && main_~c~0#1 % 256 <= 57);main_~j~0#1 := main_~c~0#1 % 256 - 48;main_~i~0#1 := (if (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 else (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 - 4294967296);main_#t~post7#1 := main_~idx_in~0#1;main_~idx_in~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;call main_#t~mem8#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1; {1417#(<= 0 (+ (* (div (+ 495 (* |ULTIMATE.start_main_~i~0#1| (- 5))) 2147483648) 2147483648) (* 5 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-20 14:38:12,361 INFO L290 TraceCheckUtils]: 28: Hoare triple {1417#(<= 0 (+ (* (div (+ 495 (* |ULTIMATE.start_main_~i~0#1| (- 5))) 2147483648) 2147483648) (* 5 |ULTIMATE.start_main_~i~0#1|)))} assume !!(48 <= main_~c~0#1 % 256 && main_~c~0#1 % 256 <= 57);main_~j~0#1 := main_~c~0#1 % 256 - 48;main_~i~0#1 := (if (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 else (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 - 4294967296);main_#t~post7#1 := main_~idx_in~0#1;main_~idx_in~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;call main_#t~mem8#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1; {1418#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:38:12,362 INFO L290 TraceCheckUtils]: 29: Hoare triple {1418#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(48 <= main_~c~0#1 % 256 && main_~c~0#1 % 256 <= 57); {1418#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:38:12,362 INFO L290 TraceCheckUtils]: 30: Hoare triple {1418#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1419#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 14:38:12,363 INFO L290 TraceCheckUtils]: 31: Hoare triple {1419#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {1414#false} is VALID [2022-02-20 14:38:12,363 INFO L290 TraceCheckUtils]: 32: Hoare triple {1414#false} assume !false; {1414#false} is VALID [2022-02-20 14:38:12,363 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-02-20 14:38:12,363 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:38:12,363 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885857218] [2022-02-20 14:38:12,363 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885857218] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:38:12,363 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352519619] [2022-02-20 14:38:12,363 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:38:12,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:38:12,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:38:12,365 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:38:12,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 14:38:12,537 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:38:12,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:38:12,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-20 14:38:12,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:38:12,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:38:18,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {1413#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(39, 2);call #Ultimate.allocInit(12, 3); {1413#true} is VALID [2022-02-20 14:38:18,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {1413#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0; {1413#true} is VALID [2022-02-20 14:38:18,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {1413#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1413#true} is VALID [2022-02-20 14:38:18,204 INFO L290 TraceCheckUtils]: 3: Hoare triple {1413#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1413#true} is VALID [2022-02-20 14:38:18,204 INFO L290 TraceCheckUtils]: 4: Hoare triple {1413#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1413#true} is VALID [2022-02-20 14:38:18,204 INFO L290 TraceCheckUtils]: 5: Hoare triple {1413#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1413#true} is VALID [2022-02-20 14:38:18,204 INFO L290 TraceCheckUtils]: 6: Hoare triple {1413#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1413#true} is VALID [2022-02-20 14:38:18,205 INFO L290 TraceCheckUtils]: 7: Hoare triple {1413#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1413#true} is VALID [2022-02-20 14:38:18,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {1413#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1413#true} is VALID [2022-02-20 14:38:18,205 INFO L290 TraceCheckUtils]: 9: Hoare triple {1413#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1413#true} is VALID [2022-02-20 14:38:18,205 INFO L290 TraceCheckUtils]: 10: Hoare triple {1413#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1413#true} is VALID [2022-02-20 14:38:18,205 INFO L290 TraceCheckUtils]: 11: Hoare triple {1413#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1413#true} is VALID [2022-02-20 14:38:18,205 INFO L290 TraceCheckUtils]: 12: Hoare triple {1413#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1413#true} is VALID [2022-02-20 14:38:18,205 INFO L290 TraceCheckUtils]: 13: Hoare triple {1413#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1413#true} is VALID [2022-02-20 14:38:18,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {1413#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1413#true} is VALID [2022-02-20 14:38:18,205 INFO L290 TraceCheckUtils]: 15: Hoare triple {1413#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1413#true} is VALID [2022-02-20 14:38:18,205 INFO L290 TraceCheckUtils]: 16: Hoare triple {1413#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1413#true} is VALID [2022-02-20 14:38:18,205 INFO L290 TraceCheckUtils]: 17: Hoare triple {1413#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1413#true} is VALID [2022-02-20 14:38:18,205 INFO L290 TraceCheckUtils]: 18: Hoare triple {1413#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1413#true} is VALID [2022-02-20 14:38:18,206 INFO L290 TraceCheckUtils]: 19: Hoare triple {1413#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1413#true} is VALID [2022-02-20 14:38:18,206 INFO L290 TraceCheckUtils]: 20: Hoare triple {1413#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1413#true} is VALID [2022-02-20 14:38:18,206 INFO L290 TraceCheckUtils]: 21: Hoare triple {1413#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1413#true} is VALID [2022-02-20 14:38:18,206 INFO L290 TraceCheckUtils]: 22: Hoare triple {1413#true} assume !!(main_~i~0#1 < 11);assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {1413#true} is VALID [2022-02-20 14:38:18,206 INFO L290 TraceCheckUtils]: 23: Hoare triple {1413#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1413#true} is VALID [2022-02-20 14:38:18,206 INFO L290 TraceCheckUtils]: 24: Hoare triple {1413#true} assume !(main_~i~0#1 < 11); {1413#true} is VALID [2022-02-20 14:38:18,206 INFO L290 TraceCheckUtils]: 25: Hoare triple {1413#true} call write~int(0, main_~#in~0#1.base, 10 + main_~#in~0#1.offset, 1);main_~idx_in~0#1 := 0;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0;call main_#t~mem6#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; {1415#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:38:18,209 INFO L290 TraceCheckUtils]: 26: Hoare triple {1415#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(48 <= main_~c~0#1 % 256 && main_~c~0#1 % 256 <= 57);main_~j~0#1 := main_~c~0#1 % 256 - 48;main_~i~0#1 := (if (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 else (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 - 4294967296);main_#t~post7#1 := main_~idx_in~0#1;main_~idx_in~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;call main_#t~mem8#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1; {1501#(exists ((|aux_div_ULTIMATE.start_main_~j~0#1_45| Int) (|aux_mod_ULTIMATE.start_main_~j~0#1_45| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~c~0#1_18_43_54| Int)) (and (= (mod (+ (* 256 |aux_div_ULTIMATE.start_main_~j~0#1_45|) |aux_mod_ULTIMATE.start_main_~j~0#1_45| 4294967248) 4294967296) |ULTIMATE.start_main_~i~0#1|) (<= 48 (+ (* 256 |aux_div_ULTIMATE.start_main_~j~0#1_45|) |aux_mod_ULTIMATE.start_main_~j~0#1_45| (* 256 |aux_div_aux_mod_v_ULTIMATE.start_main_~c~0#1_18_43_54|))) (<= 0 |aux_mod_ULTIMATE.start_main_~j~0#1_45|) (<= |aux_mod_ULTIMATE.start_main_~j~0#1_45| 57) (< (+ (* 256 |aux_div_ULTIMATE.start_main_~j~0#1_45|) |aux_mod_ULTIMATE.start_main_~j~0#1_45| (* 256 |aux_div_aux_mod_v_ULTIMATE.start_main_~c~0#1_18_43_54|)) 256) (< (+ (* 256 |aux_div_ULTIMATE.start_main_~j~0#1_45|) |aux_mod_ULTIMATE.start_main_~j~0#1_45|) 256) (<= 0 (+ (* 256 |aux_div_ULTIMATE.start_main_~j~0#1_45|) |aux_mod_ULTIMATE.start_main_~j~0#1_45|))))} is VALID [2022-02-20 14:38:18,249 ERROR L290 TraceCheckUtils]: 27: Hoare triple {1501#(exists ((|aux_div_ULTIMATE.start_main_~j~0#1_45| Int) (|aux_mod_ULTIMATE.start_main_~j~0#1_45| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~c~0#1_18_43_54| Int)) (and (= (mod (+ (* 256 |aux_div_ULTIMATE.start_main_~j~0#1_45|) |aux_mod_ULTIMATE.start_main_~j~0#1_45| 4294967248) 4294967296) |ULTIMATE.start_main_~i~0#1|) (<= 48 (+ (* 256 |aux_div_ULTIMATE.start_main_~j~0#1_45|) |aux_mod_ULTIMATE.start_main_~j~0#1_45| (* 256 |aux_div_aux_mod_v_ULTIMATE.start_main_~c~0#1_18_43_54|))) (<= 0 |aux_mod_ULTIMATE.start_main_~j~0#1_45|) (<= |aux_mod_ULTIMATE.start_main_~j~0#1_45| 57) (< (+ (* 256 |aux_div_ULTIMATE.start_main_~j~0#1_45|) |aux_mod_ULTIMATE.start_main_~j~0#1_45| (* 256 |aux_div_aux_mod_v_ULTIMATE.start_main_~c~0#1_18_43_54|)) 256) (< (+ (* 256 |aux_div_ULTIMATE.start_main_~j~0#1_45|) |aux_mod_ULTIMATE.start_main_~j~0#1_45|) 256) (<= 0 (+ (* 256 |aux_div_ULTIMATE.start_main_~j~0#1_45|) |aux_mod_ULTIMATE.start_main_~j~0#1_45|))))} assume !!(48 <= main_~c~0#1 % 256 && main_~c~0#1 % 256 <= 57);main_~j~0#1 := main_~c~0#1 % 256 - 48;main_~i~0#1 := (if (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 else (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 - 4294967296);main_#t~post7#1 := main_~idx_in~0#1;main_~idx_in~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;call main_#t~mem8#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1; {1505#(exists ((|aux_mod_aux_mod_ULTIMATE.start_main_~j~0#1_45_49| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~j~0#1_45_49| Int) (|aux_div_ULTIMATE.start_main_~j~0#1_45| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~c~0#1_18_43_54| Int)) (and (<= 48 (+ (* 256 |aux_div_ULTIMATE.start_main_~j~0#1_45|) |aux_mod_aux_mod_ULTIMATE.start_main_~j~0#1_45_49| (* 256 |aux_div_aux_mod_ULTIMATE.start_main_~j~0#1_45_49|) (* 256 |aux_div_aux_mod_v_ULTIMATE.start_main_~c~0#1_18_43_54|))) (< (+ (* 256 |aux_div_ULTIMATE.start_main_~j~0#1_45|) |aux_mod_aux_mod_ULTIMATE.start_main_~j~0#1_45_49| (* 256 |aux_div_aux_mod_ULTIMATE.start_main_~j~0#1_45_49|)) 256) (< |aux_mod_aux_mod_ULTIMATE.start_main_~j~0#1_45_49| 256) (< (+ (* 256 |aux_div_ULTIMATE.start_main_~j~0#1_45|) |aux_mod_aux_mod_ULTIMATE.start_main_~j~0#1_45_49| (* 256 |aux_div_aux_mod_ULTIMATE.start_main_~j~0#1_45_49|) (* 256 |aux_div_aux_mod_v_ULTIMATE.start_main_~c~0#1_18_43_54|)) 256) (= |ULTIMATE.start_main_~i~0#1| (mod (+ (* 256 |aux_div_ULTIMATE.start_main_~j~0#1_45|) |aux_mod_aux_mod_ULTIMATE.start_main_~j~0#1_45_49| (* (mod (+ (* 256 |aux_div_ULTIMATE.start_main_~j~0#1_45|) |aux_mod_aux_mod_ULTIMATE.start_main_~j~0#1_45_49| (* 256 |aux_div_aux_mod_ULTIMATE.start_main_~j~0#1_45_49|) 4294967248) 4294967296) 10) (* 256 |aux_div_aux_mod_ULTIMATE.start_main_~j~0#1_45_49|) 4294967248) 4294967296)) (<= 0 (+ (* 256 |aux_div_ULTIMATE.start_main_~j~0#1_45|) |aux_mod_aux_mod_ULTIMATE.start_main_~j~0#1_45_49| (* 256 |aux_div_aux_mod_ULTIMATE.start_main_~j~0#1_45_49|))) (<= (+ |aux_mod_aux_mod_ULTIMATE.start_main_~j~0#1_45_49| (* 256 |aux_div_aux_mod_ULTIMATE.start_main_~j~0#1_45_49|)) 57) (<= 0 (+ |aux_mod_aux_mod_ULTIMATE.start_main_~j~0#1_45_49| (* 256 |aux_div_aux_mod_ULTIMATE.start_main_~j~0#1_45_49|))) (<= 48 |aux_mod_aux_mod_ULTIMATE.start_main_~j~0#1_45_49|)))} is INVALID [2022-02-20 14:38:18,249 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-02-20 14:38:18,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 14:38:18,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:38:18,450 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: invalid Hoare triple in FP at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckUtils.checkInterpolantsInductivityForward(TraceCheckUtils.java:213) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.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.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:145) 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 14:38:18,453 INFO L158 Benchmark]: Toolchain (without parser) took 54982.92ms. Allocated memory was 90.2MB in the beginning and 509.6MB in the end (delta: 419.4MB). Free memory was 55.8MB in the beginning and 243.0MB in the end (delta: -187.2MB). Peak memory consumption was 231.0MB. Max. memory is 16.1GB. [2022-02-20 14:38:18,453 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 90.2MB. Free memory was 60.5MB in the beginning and 60.4MB in the end (delta: 25.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 14:38:18,453 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.27ms. Allocated memory is still 90.2MB. Free memory was 55.5MB in the beginning and 65.6MB in the end (delta: -10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 14:38:18,453 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.07ms. Allocated memory is still 90.2MB. Free memory was 65.6MB in the beginning and 63.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 14:38:18,454 INFO L158 Benchmark]: Boogie Preprocessor took 31.51ms. Allocated memory is still 90.2MB. Free memory was 63.9MB in the beginning and 62.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 14:38:18,454 INFO L158 Benchmark]: RCFGBuilder took 266.22ms. Allocated memory is still 90.2MB. Free memory was 62.6MB in the beginning and 51.7MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 14:38:18,454 INFO L158 Benchmark]: TraceAbstraction took 54415.72ms. Allocated memory was 90.2MB in the beginning and 509.6MB in the end (delta: 419.4MB). Free memory was 51.3MB in the beginning and 243.0MB in the end (delta: -191.7MB). Peak memory consumption was 229.7MB. Max. memory is 16.1GB. [2022-02-20 14:38:18,455 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 90.2MB. Free memory was 60.5MB in the beginning and 60.4MB in the end (delta: 25.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.27ms. Allocated memory is still 90.2MB. Free memory was 55.5MB in the beginning and 65.6MB in the end (delta: -10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.07ms. Allocated memory is still 90.2MB. Free memory was 65.6MB in the beginning and 63.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.51ms. Allocated memory is still 90.2MB. Free memory was 63.9MB in the beginning and 62.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 266.22ms. Allocated memory is still 90.2MB. Free memory was 62.6MB in the beginning and 51.7MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 54415.72ms. Allocated memory was 90.2MB in the beginning and 509.6MB in the end (delta: 419.4MB). Free memory was 51.3MB in the beginning and 243.0MB in the end (delta: -191.7MB). Peak memory consumption was 229.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: invalid Hoare triple in FP de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: invalid Hoare triple in FP: de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckUtils.checkInterpolantsInductivityForward(TraceCheckUtils.java:213) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 14:38:18,472 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/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bec73cbd355af8995620266d1bb50e13212a1740ed8bd583620b6985b8fd569c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:38:20,272 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:38:20,273 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:38:20,298 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:38:20,299 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:38:20,301 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:38:20,303 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:38:20,307 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:38:20,309 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:38:20,316 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:38:20,316 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:38:20,317 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:38:20,317 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:38:20,319 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:38:20,320 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:38:20,323 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:38:20,324 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:38:20,324 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:38:20,327 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:38:20,331 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:38:20,332 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:38:20,333 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:38:20,333 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:38:20,335 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:38:20,340 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:38:20,340 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:38:20,340 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:38:20,341 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:38:20,342 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:38:20,342 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:38:20,343 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:38:20,343 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:38:20,344 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:38:20,345 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:38:20,346 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:38:20,346 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:38:20,346 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:38:20,347 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:38:20,347 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:38:20,348 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:38:20,348 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:38:20,349 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 14:38:20,382 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:38:20,383 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:38:20,383 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:38:20,384 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:38:20,384 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:38:20,385 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:38:20,385 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:38:20,386 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:38:20,386 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:38:20,386 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:38:20,387 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:38:20,387 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:38:20,387 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:38:20,387 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:38:20,387 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:38:20,388 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:38:20,388 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 14:38:20,388 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 14:38:20,388 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 14:38:20,388 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:38:20,393 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:38:20,393 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:38:20,393 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:38:20,393 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:38:20,393 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:38:20,393 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:38:20,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:38:20,394 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:38:20,394 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:38:20,394 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:38:20,394 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 14:38:20,395 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 14:38:20,395 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:38:20,395 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:38:20,395 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:38:20,395 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 14:38:20,396 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bec73cbd355af8995620266d1bb50e13212a1740ed8bd583620b6985b8fd569c [2022-02-20 14:38:20,650 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:38:20,672 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:38:20,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:38:20,675 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:38:20,675 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:38:20,677 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2022-02-20 14:38:20,725 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff0b56ebb/b637aac8b52246b49145c745545a69ab/FLAGbf9faa916 [2022-02-20 14:38:21,110 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:38:21,111 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2022-02-20 14:38:21,115 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff0b56ebb/b637aac8b52246b49145c745545a69ab/FLAGbf9faa916 [2022-02-20 14:38:21,130 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff0b56ebb/b637aac8b52246b49145c745545a69ab [2022-02-20 14:38:21,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:38:21,133 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:38:21,135 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:38:21,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:38:21,138 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:38:21,139 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:38:21" (1/1) ... [2022-02-20 14:38:21,140 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6641b9c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:38:21, skipping insertion in model container [2022-02-20 14:38:21,140 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:38:21" (1/1) ... [2022-02-20 14:38:21,145 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:38:21,154 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:38:21,269 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/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c[387,400] [2022-02-20 14:38:21,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:38:21,311 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:38:21,327 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/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c[387,400] [2022-02-20 14:38:21,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:38:21,373 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:38:21,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:38:21 WrapperNode [2022-02-20 14:38:21,374 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:38:21,375 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:38:21,375 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:38:21,375 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:38:21,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:38:21" (1/1) ... [2022-02-20 14:38:21,386 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:38:21" (1/1) ... [2022-02-20 14:38:21,410 INFO L137 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2022-02-20 14:38:21,411 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:38:21,412 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:38:21,412 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:38:21,412 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:38:21,418 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:38:21" (1/1) ... [2022-02-20 14:38:21,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:38:21" (1/1) ... [2022-02-20 14:38:21,425 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:38:21" (1/1) ... [2022-02-20 14:38:21,425 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:38:21" (1/1) ... [2022-02-20 14:38:21,439 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:38:21" (1/1) ... [2022-02-20 14:38:21,441 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:38:21" (1/1) ... [2022-02-20 14:38:21,442 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:38:21" (1/1) ... [2022-02-20 14:38:21,444 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:38:21,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:38:21,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:38:21,445 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:38:21,445 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:38:21" (1/1) ... [2022-02-20 14:38:21,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:38:21,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:38:21,468 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 14:38:21,492 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 14:38:21,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:38:21,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-02-20 14:38:21,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 14:38:21,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:38:21,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:38:21,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:38:21,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-02-20 14:38:21,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:38:21,571 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:38:21,572 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:38:21,727 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:38:21,737 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:38:21,746 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 14:38:21,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:38:21 BoogieIcfgContainer [2022-02-20 14:38:21,748 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:38:21,749 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:38:21,763 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:38:21,765 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:38:21,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:38:21" (1/3) ... [2022-02-20 14:38:21,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72336c17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:38:21, skipping insertion in model container [2022-02-20 14:38:21,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:38:21" (2/3) ... [2022-02-20 14:38:21,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72336c17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:38:21, skipping insertion in model container [2022-02-20 14:38:21,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:38:21" (3/3) ... [2022-02-20 14:38:21,767 INFO L111 eAbstractionObserver]: Analyzing ICFG verisec_sendmail_tTflag_arr_one_loop.c [2022-02-20 14:38:21,778 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:38:21,778 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:38:21,805 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:38:21,809 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 14:38:21,809 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:38:21,822 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.5) internal successors, (18), 13 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 14:38:21,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 14:38:21,836 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:38:21,836 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:38:21,837 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:38:21,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:38:21,840 INFO L85 PathProgramCache]: Analyzing trace with hash 212076531, now seen corresponding path program 1 times [2022-02-20 14:38:21,850 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 14:38:21,850 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1596809291] [2022-02-20 14:38:21,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:38:21,851 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 14:38:21,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 14:38:21,853 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 14:38:21,854 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 14:38:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:38:21,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 14:38:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:38:21,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:38:21,986 INFO L290 TraceCheckUtils]: 0: Hoare triple {17#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(39bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {17#true} is VALID [2022-02-20 14:38:21,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {17#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11bv32);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0bv32; {25#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} is VALID [2022-02-20 14:38:21,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} assume !~bvslt32(main_~i~0#1, 11bv32); {18#false} is VALID [2022-02-20 14:38:21,988 INFO L290 TraceCheckUtils]: 3: Hoare triple {18#false} call write~intINTTYPE1(0bv8, main_~#in~0#1.base, ~bvadd32(10bv32, main_~#in~0#1.offset), 1bv32);main_~idx_in~0#1 := 0bv32;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0bv32;call main_#t~mem6#1 := read~intINTTYPE1(main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~idx_in~0#1), 1bv32);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; {18#false} is VALID [2022-02-20 14:38:21,989 INFO L290 TraceCheckUtils]: 4: Hoare triple {18#false} assume !(~bvsle32(48bv32, ~zero_extendFrom8To32(main_~c~0#1)) && ~bvsle32(~zero_extendFrom8To32(main_~c~0#1), 57bv32)); {18#false} is VALID [2022-02-20 14:38:21,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {18#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~bvsge32(main_~i~0#1, 0bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {18#false} is VALID [2022-02-20 14:38:21,990 INFO L290 TraceCheckUtils]: 6: Hoare triple {18#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {18#false} is VALID [2022-02-20 14:38:21,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {18#false} assume !false; {18#false} is VALID [2022-02-20 14:38:21,991 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 14:38:21,991 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:38:21,992 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 14:38:21,992 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1596809291] [2022-02-20 14:38:21,992 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1596809291] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:38:21,993 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:38:21,995 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:38:21,996 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198168360] [2022-02-20 14:38:21,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:38:22,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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 14:38:22,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:38:22,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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 14:38:22,034 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 14:38:22,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:38:22,035 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 14:38:22,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:38:22,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:38:22,058 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.5) internal successors, (18), 13 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) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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 14:38:22,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:38:22,136 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2022-02-20 14:38:22,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:38:22,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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 14:38:22,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:38:22,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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 14:38:22,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-02-20 14:38:22,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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 14:38:22,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-02-20 14:38:22,144 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2022-02-20 14:38:22,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:38:22,206 INFO L225 Difference]: With dead ends: 35 [2022-02-20 14:38:22,206 INFO L226 Difference]: Without dead ends: 17 [2022-02-20 14:38:22,209 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 14:38:22,213 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:38:22,214 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 19 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:38:22,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-02-20 14:38:22,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 11. [2022-02-20 14:38:22,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:38:22,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 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 14:38:22,237 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 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 14:38:22,237 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 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 14:38:22,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:38:22,241 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-02-20 14:38:22,242 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-02-20 14:38:22,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:38:22,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:38:22,243 INFO L74 IsIncluded]: Start isIncluded. First operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 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) Second operand 17 states. [2022-02-20 14:38:22,244 INFO L87 Difference]: Start difference. First operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 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) Second operand 17 states. [2022-02-20 14:38:22,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:38:22,246 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-02-20 14:38:22,246 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-02-20 14:38:22,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:38:22,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:38:22,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:38:22,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:38:22,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 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 14:38:22,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2022-02-20 14:38:22,249 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2022-02-20 14:38:22,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:38:22,250 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2022-02-20 14:38:22,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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 14:38:22,253 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2022-02-20 14:38:22,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 14:38:22,253 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:38:22,254 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:38:22,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 14:38:22,461 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 14:38:22,461 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:38:22,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:38:22,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1435974389, now seen corresponding path program 1 times [2022-02-20 14:38:22,462 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 14:38:22,463 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1600383071] [2022-02-20 14:38:22,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:38:22,463 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 14:38:22,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 14:38:22,464 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 14:38:22,466 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 14:38:22,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:38:22,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 14:38:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:38:22,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:38:22,550 INFO L290 TraceCheckUtils]: 0: Hoare triple {137#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(39bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {137#true} is VALID [2022-02-20 14:38:22,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {137#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11bv32);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0bv32; {145#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} is VALID [2022-02-20 14:38:22,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {145#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {145#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} is VALID [2022-02-20 14:38:22,552 INFO L290 TraceCheckUtils]: 3: Hoare triple {145#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {152#(= |ULTIMATE.start_main_~i~0#1| (_ bv1 32))} is VALID [2022-02-20 14:38:22,553 INFO L290 TraceCheckUtils]: 4: Hoare triple {152#(= |ULTIMATE.start_main_~i~0#1| (_ bv1 32))} assume !~bvslt32(main_~i~0#1, 11bv32); {138#false} is VALID [2022-02-20 14:38:22,553 INFO L290 TraceCheckUtils]: 5: Hoare triple {138#false} call write~intINTTYPE1(0bv8, main_~#in~0#1.base, ~bvadd32(10bv32, main_~#in~0#1.offset), 1bv32);main_~idx_in~0#1 := 0bv32;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0bv32;call main_#t~mem6#1 := read~intINTTYPE1(main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~idx_in~0#1), 1bv32);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; {138#false} is VALID [2022-02-20 14:38:22,553 INFO L290 TraceCheckUtils]: 6: Hoare triple {138#false} assume !(~bvsle32(48bv32, ~zero_extendFrom8To32(main_~c~0#1)) && ~bvsle32(~zero_extendFrom8To32(main_~c~0#1), 57bv32)); {138#false} is VALID [2022-02-20 14:38:22,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {138#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~bvsge32(main_~i~0#1, 0bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {138#false} is VALID [2022-02-20 14:38:22,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {138#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {138#false} is VALID [2022-02-20 14:38:22,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {138#false} assume !false; {138#false} is VALID [2022-02-20 14:38:22,554 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 14:38:22,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:38:22,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {138#false} assume !false; {138#false} is VALID [2022-02-20 14:38:22,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {138#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {138#false} is VALID [2022-02-20 14:38:22,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {138#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~bvsge32(main_~i~0#1, 0bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {138#false} is VALID [2022-02-20 14:38:22,612 INFO L290 TraceCheckUtils]: 6: Hoare triple {138#false} assume !(~bvsle32(48bv32, ~zero_extendFrom8To32(main_~c~0#1)) && ~bvsle32(~zero_extendFrom8To32(main_~c~0#1), 57bv32)); {138#false} is VALID [2022-02-20 14:38:22,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {138#false} call write~intINTTYPE1(0bv8, main_~#in~0#1.base, ~bvadd32(10bv32, main_~#in~0#1.offset), 1bv32);main_~idx_in~0#1 := 0bv32;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0bv32;call main_#t~mem6#1 := read~intINTTYPE1(main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~idx_in~0#1), 1bv32);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; {138#false} is VALID [2022-02-20 14:38:22,613 INFO L290 TraceCheckUtils]: 4: Hoare triple {186#(bvslt |ULTIMATE.start_main_~i~0#1| (_ bv11 32))} assume !~bvslt32(main_~i~0#1, 11bv32); {138#false} is VALID [2022-02-20 14:38:22,615 INFO L290 TraceCheckUtils]: 3: Hoare triple {190#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv11 32))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {186#(bvslt |ULTIMATE.start_main_~i~0#1| (_ bv11 32))} is VALID [2022-02-20 14:38:22,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {190#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv11 32))} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {190#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv11 32))} is VALID [2022-02-20 14:38:22,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {137#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11bv32);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0bv32; {190#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv11 32))} is VALID [2022-02-20 14:38:22,617 INFO L290 TraceCheckUtils]: 0: Hoare triple {137#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(39bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {137#true} is VALID [2022-02-20 14:38:22,617 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 14:38:22,617 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 14:38:22,617 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1600383071] [2022-02-20 14:38:22,617 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1600383071] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:38:22,617 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:38:22,617 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-02-20 14:38:22,617 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483136007] [2022-02-20 14:38:22,618 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:38:22,618 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 14:38:22,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:38:22,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:22,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:38:22,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 14:38:22,634 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 14:38:22,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 14:38:22,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-02-20 14:38:22,635 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:22,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:38:22,758 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-02-20 14:38:22,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:38:22,758 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 14:38:22,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:38:22,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:22,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-02-20 14:38:22,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:22,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-02-20 14:38:22,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 37 transitions. [2022-02-20 14:38:22,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:38:22,808 INFO L225 Difference]: With dead ends: 33 [2022-02-20 14:38:22,809 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 14:38:22,809 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:38:22,810 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 17 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:38:22,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 22 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:38:22,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 14:38:22,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2022-02-20 14:38:22,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:38:22,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 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 14:38:22,813 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 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 14:38:22,813 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 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 14:38:22,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:38:22,814 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-02-20 14:38:22,814 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-02-20 14:38:22,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:38:22,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:38:22,815 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 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) Second operand 27 states. [2022-02-20 14:38:22,815 INFO L87 Difference]: Start difference. First operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 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) Second operand 27 states. [2022-02-20 14:38:22,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:38:22,816 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-02-20 14:38:22,816 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-02-20 14:38:22,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:38:22,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:38:22,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:38:22,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:38:22,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 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 14:38:22,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-02-20 14:38:22,818 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 10 [2022-02-20 14:38:22,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:38:22,818 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-02-20 14:38:22,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:22,818 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-02-20 14:38:22,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 14:38:22,819 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:38:22,821 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:38:22,828 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 14:38:23,022 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 14:38:23,022 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:38:23,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:38:23,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1662320891, now seen corresponding path program 2 times [2022-02-20 14:38:23,025 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 14:38:23,026 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [515928213] [2022-02-20 14:38:23,026 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:38:23,026 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 14:38:23,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 14:38:23,027 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 14:38:23,028 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 14:38:23,114 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-20 14:38:23,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:38:23,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:38:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:38:23,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:38:23,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {320#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(39bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {320#true} is VALID [2022-02-20 14:38:23,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {320#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11bv32);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0bv32; {320#true} is VALID [2022-02-20 14:38:23,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {320#true} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {320#true} is VALID [2022-02-20 14:38:23,196 INFO L290 TraceCheckUtils]: 3: Hoare triple {320#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {320#true} is VALID [2022-02-20 14:38:23,196 INFO L290 TraceCheckUtils]: 4: Hoare triple {320#true} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {320#true} is VALID [2022-02-20 14:38:23,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {320#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {320#true} is VALID [2022-02-20 14:38:23,196 INFO L290 TraceCheckUtils]: 6: Hoare triple {320#true} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {320#true} is VALID [2022-02-20 14:38:23,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {320#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {320#true} is VALID [2022-02-20 14:38:23,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {320#true} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {320#true} is VALID [2022-02-20 14:38:23,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {320#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {320#true} is VALID [2022-02-20 14:38:23,197 INFO L290 TraceCheckUtils]: 10: Hoare triple {320#true} assume !~bvslt32(main_~i~0#1, 11bv32); {320#true} is VALID [2022-02-20 14:38:23,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {320#true} call write~intINTTYPE1(0bv8, main_~#in~0#1.base, ~bvadd32(10bv32, main_~#in~0#1.offset), 1bv32);main_~idx_in~0#1 := 0bv32;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0bv32;call main_#t~mem6#1 := read~intINTTYPE1(main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~idx_in~0#1), 1bv32);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; {358#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} is VALID [2022-02-20 14:38:23,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {358#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} assume !(~bvsle32(48bv32, ~zero_extendFrom8To32(main_~c~0#1)) && ~bvsle32(~zero_extendFrom8To32(main_~c~0#1), 57bv32)); {358#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} is VALID [2022-02-20 14:38:23,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {358#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~bvsge32(main_~i~0#1, 0bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {365#(= |ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))} is VALID [2022-02-20 14:38:23,199 INFO L290 TraceCheckUtils]: 14: Hoare triple {365#(= |ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond#1; {321#false} is VALID [2022-02-20 14:38:23,199 INFO L290 TraceCheckUtils]: 15: Hoare triple {321#false} assume !false; {321#false} is VALID [2022-02-20 14:38:23,199 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 14:38:23,199 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:38:23,199 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 14:38:23,200 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [515928213] [2022-02-20 14:38:23,200 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [515928213] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:38:23,203 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:38:23,203 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:38:23,203 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822661992] [2022-02-20 14:38:23,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:38:23,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 14:38:23,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:38:23,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:23,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:38:23,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:38:23,215 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 14:38:23,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:38:23,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:38:23,216 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:23,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:38:23,270 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-02-20 14:38:23,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:38:23,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 14:38:23,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:38:23,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:23,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-02-20 14:38:23,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:23,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-02-20 14:38:23,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2022-02-20 14:38:23,289 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 14:38:23,290 INFO L225 Difference]: With dead ends: 22 [2022-02-20 14:38:23,290 INFO L226 Difference]: Without dead ends: 18 [2022-02-20 14:38:23,290 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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 14:38:23,291 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:38:23,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 17 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:38:23,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-20 14:38:23,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-20 14:38:23,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:38:23,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 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 14:38:23,296 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 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 14:38:23,296 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 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 14:38:23,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:38:23,297 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-02-20 14:38:23,297 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-02-20 14:38:23,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:38:23,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:38:23,297 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 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) Second operand 18 states. [2022-02-20 14:38:23,297 INFO L87 Difference]: Start difference. First operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 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) Second operand 18 states. [2022-02-20 14:38:23,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:38:23,298 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-02-20 14:38:23,298 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-02-20 14:38:23,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:38:23,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:38:23,298 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:38:23,298 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:38:23,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 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 14:38:23,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-02-20 14:38:23,299 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2022-02-20 14:38:23,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:38:23,299 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-02-20 14:38:23,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:23,300 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-02-20 14:38:23,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 14:38:23,302 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:38:23,302 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:38:23,310 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 14:38:23,503 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 14:38:23,504 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:38:23,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:38:23,504 INFO L85 PathProgramCache]: Analyzing trace with hash -5994546, now seen corresponding path program 1 times [2022-02-20 14:38:23,504 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 14:38:23,505 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1848790290] [2022-02-20 14:38:23,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:38:23,505 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 14:38:23,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 14:38:23,506 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 14:38:23,507 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 14:38:23,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:38:23,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:38:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:38:23,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:38:23,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {463#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(39bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {463#true} is VALID [2022-02-20 14:38:23,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {463#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11bv32);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0bv32; {471#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} is VALID [2022-02-20 14:38:23,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {471#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {471#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} is VALID [2022-02-20 14:38:23,675 INFO L290 TraceCheckUtils]: 3: Hoare triple {471#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {478#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|) (_ bv0 32))} is VALID [2022-02-20 14:38:23,676 INFO L290 TraceCheckUtils]: 4: Hoare triple {478#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|) (_ bv0 32))} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {478#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|) (_ bv0 32))} is VALID [2022-02-20 14:38:23,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {478#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|) (_ bv0 32))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {485#(= (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv4294967294 32)) (_ bv0 32))} is VALID [2022-02-20 14:38:23,680 INFO L290 TraceCheckUtils]: 6: Hoare triple {485#(= (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {485#(= (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv4294967294 32)) (_ bv0 32))} is VALID [2022-02-20 14:38:23,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {485#(= (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv4294967294 32)) (_ bv0 32))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {492#(= (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv4294967293 32)) (_ bv0 32))} is VALID [2022-02-20 14:38:23,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {492#(= (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {492#(= (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv4294967293 32)) (_ bv0 32))} is VALID [2022-02-20 14:38:23,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {492#(= (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv4294967293 32)) (_ bv0 32))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {499#(= (_ bv4 32) |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:38:23,683 INFO L290 TraceCheckUtils]: 10: Hoare triple {499#(= (_ bv4 32) |ULTIMATE.start_main_~i~0#1|)} assume !~bvslt32(main_~i~0#1, 11bv32); {464#false} is VALID [2022-02-20 14:38:23,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {464#false} call write~intINTTYPE1(0bv8, main_~#in~0#1.base, ~bvadd32(10bv32, main_~#in~0#1.offset), 1bv32);main_~idx_in~0#1 := 0bv32;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0bv32;call main_#t~mem6#1 := read~intINTTYPE1(main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~idx_in~0#1), 1bv32);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; {464#false} is VALID [2022-02-20 14:38:23,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {464#false} assume !!(~bvsle32(48bv32, ~zero_extendFrom8To32(main_~c~0#1)) && ~bvsle32(~zero_extendFrom8To32(main_~c~0#1), 57bv32));main_~j~0#1 := ~bvsub32(~zero_extendFrom8To32(main_~c~0#1), 48bv32);main_~i~0#1 := ~bvadd32(~bvmul32(10bv32, main_~i~0#1), main_~j~0#1);main_#t~post7#1 := main_~idx_in~0#1;main_~idx_in~0#1 := ~bvadd32(1bv32, main_#t~post7#1);havoc main_#t~post7#1;call main_#t~mem8#1 := read~intINTTYPE1(main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~idx_in~0#1), 1bv32);main_~c~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1; {464#false} is VALID [2022-02-20 14:38:23,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {464#false} assume !(~bvsle32(48bv32, ~zero_extendFrom8To32(main_~c~0#1)) && ~bvsle32(~zero_extendFrom8To32(main_~c~0#1), 57bv32)); {464#false} is VALID [2022-02-20 14:38:23,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {464#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~bvsge32(main_~i~0#1, 0bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {464#false} is VALID [2022-02-20 14:38:23,684 INFO L290 TraceCheckUtils]: 15: Hoare triple {464#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {464#false} is VALID [2022-02-20 14:38:23,684 INFO L290 TraceCheckUtils]: 16: Hoare triple {464#false} assume !false; {464#false} is VALID [2022-02-20 14:38:23,684 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:38:23,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:38:23,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {464#false} assume !false; {464#false} is VALID [2022-02-20 14:38:23,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {464#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {464#false} is VALID [2022-02-20 14:38:23,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {464#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~bvsge32(main_~i~0#1, 0bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {464#false} is VALID [2022-02-20 14:38:23,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {464#false} assume !(~bvsle32(48bv32, ~zero_extendFrom8To32(main_~c~0#1)) && ~bvsle32(~zero_extendFrom8To32(main_~c~0#1), 57bv32)); {464#false} is VALID [2022-02-20 14:38:23,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {464#false} assume !!(~bvsle32(48bv32, ~zero_extendFrom8To32(main_~c~0#1)) && ~bvsle32(~zero_extendFrom8To32(main_~c~0#1), 57bv32));main_~j~0#1 := ~bvsub32(~zero_extendFrom8To32(main_~c~0#1), 48bv32);main_~i~0#1 := ~bvadd32(~bvmul32(10bv32, main_~i~0#1), main_~j~0#1);main_#t~post7#1 := main_~idx_in~0#1;main_~idx_in~0#1 := ~bvadd32(1bv32, main_#t~post7#1);havoc main_#t~post7#1;call main_#t~mem8#1 := read~intINTTYPE1(main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~idx_in~0#1), 1bv32);main_~c~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1; {464#false} is VALID [2022-02-20 14:38:23,806 INFO L290 TraceCheckUtils]: 11: Hoare triple {464#false} call write~intINTTYPE1(0bv8, main_~#in~0#1.base, ~bvadd32(10bv32, main_~#in~0#1.offset), 1bv32);main_~idx_in~0#1 := 0bv32;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0bv32;call main_#t~mem6#1 := read~intINTTYPE1(main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~idx_in~0#1), 1bv32);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; {464#false} is VALID [2022-02-20 14:38:23,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {539#(bvslt |ULTIMATE.start_main_~i~0#1| (_ bv11 32))} assume !~bvslt32(main_~i~0#1, 11bv32); {464#false} is VALID [2022-02-20 14:38:23,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {543#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv11 32))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {539#(bvslt |ULTIMATE.start_main_~i~0#1| (_ bv11 32))} is VALID [2022-02-20 14:38:23,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {543#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv11 32))} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {543#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv11 32))} is VALID [2022-02-20 14:38:23,811 INFO L290 TraceCheckUtils]: 7: Hoare triple {550#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32)) (_ bv11 32))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {543#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv11 32))} is VALID [2022-02-20 14:38:23,811 INFO L290 TraceCheckUtils]: 6: Hoare triple {550#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32)) (_ bv11 32))} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {550#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32)) (_ bv11 32))} is VALID [2022-02-20 14:38:23,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {557#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv3 32)) (_ bv11 32))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {550#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32)) (_ bv11 32))} is VALID [2022-02-20 14:38:23,813 INFO L290 TraceCheckUtils]: 4: Hoare triple {557#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv3 32)) (_ bv11 32))} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {557#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv3 32)) (_ bv11 32))} is VALID [2022-02-20 14:38:23,816 INFO L290 TraceCheckUtils]: 3: Hoare triple {564#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_main_~i~0#1|) (_ bv11 32))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {557#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv3 32)) (_ bv11 32))} is VALID [2022-02-20 14:38:23,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {564#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_main_~i~0#1|) (_ bv11 32))} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {564#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_main_~i~0#1|) (_ bv11 32))} is VALID [2022-02-20 14:38:23,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {463#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11bv32);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0bv32; {564#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_main_~i~0#1|) (_ bv11 32))} is VALID [2022-02-20 14:38:23,817 INFO L290 TraceCheckUtils]: 0: Hoare triple {463#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(39bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {463#true} is VALID [2022-02-20 14:38:23,817 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:38:23,817 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 14:38:23,817 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1848790290] [2022-02-20 14:38:23,817 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1848790290] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:38:23,817 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:38:23,817 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-02-20 14:38:23,817 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434586233] [2022-02-20 14:38:23,817 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:38:23,818 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 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 14:38:23,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:38:23,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:23,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:38:23,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 14:38:23,857 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 14:38:23,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 14:38:23,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-02-20 14:38:23,858 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:24,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:38:24,254 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-02-20 14:38:24,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 14:38:24,254 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 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 14:38:24,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:38:24,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:24,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 48 transitions. [2022-02-20 14:38:24,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:24,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 48 transitions. [2022-02-20 14:38:24,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 48 transitions. [2022-02-20 14:38:24,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:38:24,322 INFO L225 Difference]: With dead ends: 42 [2022-02-20 14:38:24,322 INFO L226 Difference]: Without dead ends: 35 [2022-02-20 14:38:24,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2022-02-20 14:38:24,323 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 19 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:38:24,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 39 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:38:24,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-02-20 14:38:24,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2022-02-20 14:38:24,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:38:24,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 30 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:24,327 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 30 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:24,327 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 30 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:24,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:38:24,328 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2022-02-20 14:38:24,328 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2022-02-20 14:38:24,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:38:24,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:38:24,329 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 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 35 states. [2022-02-20 14:38:24,329 INFO L87 Difference]: Start difference. First operand has 30 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 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 35 states. [2022-02-20 14:38:24,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:38:24,330 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2022-02-20 14:38:24,330 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2022-02-20 14:38:24,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:38:24,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:38:24,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:38:24,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:38:24,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:24,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2022-02-20 14:38:24,332 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 17 [2022-02-20 14:38:24,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:38:24,332 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2022-02-20 14:38:24,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:24,332 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-02-20 14:38:24,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 14:38:24,332 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:38:24,333 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:38:24,344 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 14:38:24,533 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 14:38:24,533 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:38:24,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:38:24,534 INFO L85 PathProgramCache]: Analyzing trace with hash 776585922, now seen corresponding path program 2 times [2022-02-20 14:38:24,534 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 14:38:24,534 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1342572514] [2022-02-20 14:38:24,534 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:38:24,534 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 14:38:24,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 14:38:24,536 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 14:38:24,537 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 14:38:24,580 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:38:24,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:38:24,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 14:38:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:38:24,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:38:24,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {752#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(39bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {752#true} is VALID [2022-02-20 14:38:24,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {752#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11bv32);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0bv32; {760#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} is VALID [2022-02-20 14:38:24,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {760#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {760#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} is VALID [2022-02-20 14:38:24,777 INFO L290 TraceCheckUtils]: 3: Hoare triple {760#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {767#(= |ULTIMATE.start_main_~i~0#1| (_ bv1 32))} is VALID [2022-02-20 14:38:24,778 INFO L290 TraceCheckUtils]: 4: Hoare triple {767#(= |ULTIMATE.start_main_~i~0#1| (_ bv1 32))} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {767#(= |ULTIMATE.start_main_~i~0#1| (_ bv1 32))} is VALID [2022-02-20 14:38:24,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {767#(= |ULTIMATE.start_main_~i~0#1| (_ bv1 32))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {774#(= |ULTIMATE.start_main_~i~0#1| (_ bv2 32))} is VALID [2022-02-20 14:38:24,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {774#(= |ULTIMATE.start_main_~i~0#1| (_ bv2 32))} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {774#(= |ULTIMATE.start_main_~i~0#1| (_ bv2 32))} is VALID [2022-02-20 14:38:24,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {774#(= |ULTIMATE.start_main_~i~0#1| (_ bv2 32))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {781#(= |ULTIMATE.start_main_~i~0#1| (_ bv3 32))} is VALID [2022-02-20 14:38:24,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {781#(= |ULTIMATE.start_main_~i~0#1| (_ bv3 32))} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {781#(= |ULTIMATE.start_main_~i~0#1| (_ bv3 32))} is VALID [2022-02-20 14:38:24,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {781#(= |ULTIMATE.start_main_~i~0#1| (_ bv3 32))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {788#(= (_ bv4 32) |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:38:24,780 INFO L290 TraceCheckUtils]: 10: Hoare triple {788#(= (_ bv4 32) |ULTIMATE.start_main_~i~0#1|)} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {788#(= (_ bv4 32) |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:38:24,780 INFO L290 TraceCheckUtils]: 11: Hoare triple {788#(= (_ bv4 32) |ULTIMATE.start_main_~i~0#1|)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {795#(= (_ bv4 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:38:24,781 INFO L290 TraceCheckUtils]: 12: Hoare triple {795#(= (_ bv4 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|))} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {795#(= (_ bv4 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:38:24,781 INFO L290 TraceCheckUtils]: 13: Hoare triple {795#(= (_ bv4 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {802#(= |ULTIMATE.start_main_~i~0#1| (_ bv6 32))} is VALID [2022-02-20 14:38:24,781 INFO L290 TraceCheckUtils]: 14: Hoare triple {802#(= |ULTIMATE.start_main_~i~0#1| (_ bv6 32))} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {802#(= |ULTIMATE.start_main_~i~0#1| (_ bv6 32))} is VALID [2022-02-20 14:38:24,782 INFO L290 TraceCheckUtils]: 15: Hoare triple {802#(= |ULTIMATE.start_main_~i~0#1| (_ bv6 32))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {809#(= |ULTIMATE.start_main_~i~0#1| (_ bv7 32))} is VALID [2022-02-20 14:38:24,782 INFO L290 TraceCheckUtils]: 16: Hoare triple {809#(= |ULTIMATE.start_main_~i~0#1| (_ bv7 32))} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {809#(= |ULTIMATE.start_main_~i~0#1| (_ bv7 32))} is VALID [2022-02-20 14:38:24,783 INFO L290 TraceCheckUtils]: 17: Hoare triple {809#(= |ULTIMATE.start_main_~i~0#1| (_ bv7 32))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {816#(= |ULTIMATE.start_main_~i~0#1| (_ bv8 32))} is VALID [2022-02-20 14:38:24,783 INFO L290 TraceCheckUtils]: 18: Hoare triple {816#(= |ULTIMATE.start_main_~i~0#1| (_ bv8 32))} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {816#(= |ULTIMATE.start_main_~i~0#1| (_ bv8 32))} is VALID [2022-02-20 14:38:24,783 INFO L290 TraceCheckUtils]: 19: Hoare triple {816#(= |ULTIMATE.start_main_~i~0#1| (_ bv8 32))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {823#(= (_ bv8 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:38:24,784 INFO L290 TraceCheckUtils]: 20: Hoare triple {823#(= (_ bv8 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|))} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {823#(= (_ bv8 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:38:24,784 INFO L290 TraceCheckUtils]: 21: Hoare triple {823#(= (_ bv8 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {830#(= (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv4294967294 32)) (_ bv8 32))} is VALID [2022-02-20 14:38:24,785 INFO L290 TraceCheckUtils]: 22: Hoare triple {830#(= (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv4294967294 32)) (_ bv8 32))} assume !~bvslt32(main_~i~0#1, 11bv32); {753#false} is VALID [2022-02-20 14:38:24,785 INFO L290 TraceCheckUtils]: 23: Hoare triple {753#false} call write~intINTTYPE1(0bv8, main_~#in~0#1.base, ~bvadd32(10bv32, main_~#in~0#1.offset), 1bv32);main_~idx_in~0#1 := 0bv32;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0bv32;call main_#t~mem6#1 := read~intINTTYPE1(main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~idx_in~0#1), 1bv32);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; {753#false} is VALID [2022-02-20 14:38:24,785 INFO L290 TraceCheckUtils]: 24: Hoare triple {753#false} assume !!(~bvsle32(48bv32, ~zero_extendFrom8To32(main_~c~0#1)) && ~bvsle32(~zero_extendFrom8To32(main_~c~0#1), 57bv32));main_~j~0#1 := ~bvsub32(~zero_extendFrom8To32(main_~c~0#1), 48bv32);main_~i~0#1 := ~bvadd32(~bvmul32(10bv32, main_~i~0#1), main_~j~0#1);main_#t~post7#1 := main_~idx_in~0#1;main_~idx_in~0#1 := ~bvadd32(1bv32, main_#t~post7#1);havoc main_#t~post7#1;call main_#t~mem8#1 := read~intINTTYPE1(main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~idx_in~0#1), 1bv32);main_~c~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1; {753#false} is VALID [2022-02-20 14:38:24,785 INFO L290 TraceCheckUtils]: 25: Hoare triple {753#false} assume !(~bvsle32(48bv32, ~zero_extendFrom8To32(main_~c~0#1)) && ~bvsle32(~zero_extendFrom8To32(main_~c~0#1), 57bv32)); {753#false} is VALID [2022-02-20 14:38:24,785 INFO L290 TraceCheckUtils]: 26: Hoare triple {753#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~bvsge32(main_~i~0#1, 0bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {753#false} is VALID [2022-02-20 14:38:24,786 INFO L290 TraceCheckUtils]: 27: Hoare triple {753#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {753#false} is VALID [2022-02-20 14:38:24,786 INFO L290 TraceCheckUtils]: 28: Hoare triple {753#false} assume !false; {753#false} is VALID [2022-02-20 14:38:24,786 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:38:24,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:38:25,097 INFO L290 TraceCheckUtils]: 28: Hoare triple {753#false} assume !false; {753#false} is VALID [2022-02-20 14:38:25,097 INFO L290 TraceCheckUtils]: 27: Hoare triple {753#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {753#false} is VALID [2022-02-20 14:38:25,097 INFO L290 TraceCheckUtils]: 26: Hoare triple {753#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~bvsge32(main_~i~0#1, 0bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {753#false} is VALID [2022-02-20 14:38:25,097 INFO L290 TraceCheckUtils]: 25: Hoare triple {753#false} assume !(~bvsle32(48bv32, ~zero_extendFrom8To32(main_~c~0#1)) && ~bvsle32(~zero_extendFrom8To32(main_~c~0#1), 57bv32)); {753#false} is VALID [2022-02-20 14:38:25,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {753#false} assume !!(~bvsle32(48bv32, ~zero_extendFrom8To32(main_~c~0#1)) && ~bvsle32(~zero_extendFrom8To32(main_~c~0#1), 57bv32));main_~j~0#1 := ~bvsub32(~zero_extendFrom8To32(main_~c~0#1), 48bv32);main_~i~0#1 := ~bvadd32(~bvmul32(10bv32, main_~i~0#1), main_~j~0#1);main_#t~post7#1 := main_~idx_in~0#1;main_~idx_in~0#1 := ~bvadd32(1bv32, main_#t~post7#1);havoc main_#t~post7#1;call main_#t~mem8#1 := read~intINTTYPE1(main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~idx_in~0#1), 1bv32);main_~c~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1; {753#false} is VALID [2022-02-20 14:38:25,098 INFO L290 TraceCheckUtils]: 23: Hoare triple {753#false} call write~intINTTYPE1(0bv8, main_~#in~0#1.base, ~bvadd32(10bv32, main_~#in~0#1.offset), 1bv32);main_~idx_in~0#1 := 0bv32;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0bv32;call main_#t~mem6#1 := read~intINTTYPE1(main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~idx_in~0#1), 1bv32);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; {753#false} is VALID [2022-02-20 14:38:25,102 INFO L290 TraceCheckUtils]: 22: Hoare triple {870#(bvslt |ULTIMATE.start_main_~i~0#1| (_ bv11 32))} assume !~bvslt32(main_~i~0#1, 11bv32); {753#false} is VALID [2022-02-20 14:38:25,104 INFO L290 TraceCheckUtils]: 21: Hoare triple {874#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv11 32))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {870#(bvslt |ULTIMATE.start_main_~i~0#1| (_ bv11 32))} is VALID [2022-02-20 14:38:25,105 INFO L290 TraceCheckUtils]: 20: Hoare triple {874#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv11 32))} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {874#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv11 32))} is VALID [2022-02-20 14:38:25,107 INFO L290 TraceCheckUtils]: 19: Hoare triple {881#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32)) (_ bv11 32))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {874#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv11 32))} is VALID [2022-02-20 14:38:25,111 INFO L290 TraceCheckUtils]: 18: Hoare triple {881#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32)) (_ bv11 32))} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {881#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32)) (_ bv11 32))} is VALID [2022-02-20 14:38:25,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {888#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv3 32)) (_ bv11 32))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {881#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32)) (_ bv11 32))} is VALID [2022-02-20 14:38:25,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {888#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv3 32)) (_ bv11 32))} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {888#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv3 32)) (_ bv11 32))} is VALID [2022-02-20 14:38:25,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {895#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_main_~i~0#1|) (_ bv11 32))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {888#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv3 32)) (_ bv11 32))} is VALID [2022-02-20 14:38:25,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {895#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_main_~i~0#1|) (_ bv11 32))} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {895#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_main_~i~0#1|) (_ bv11 32))} is VALID [2022-02-20 14:38:25,125 INFO L290 TraceCheckUtils]: 13: Hoare triple {902#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv5 32)) (_ bv11 32))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {895#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_main_~i~0#1|) (_ bv11 32))} is VALID [2022-02-20 14:38:25,126 INFO L290 TraceCheckUtils]: 12: Hoare triple {902#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv5 32)) (_ bv11 32))} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {902#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv5 32)) (_ bv11 32))} is VALID [2022-02-20 14:38:25,128 INFO L290 TraceCheckUtils]: 11: Hoare triple {909#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv6 32)) (_ bv11 32))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {902#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv5 32)) (_ bv11 32))} is VALID [2022-02-20 14:38:25,128 INFO L290 TraceCheckUtils]: 10: Hoare triple {909#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv6 32)) (_ bv11 32))} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {909#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv6 32)) (_ bv11 32))} is VALID [2022-02-20 14:38:25,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {916#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv7 32)) (_ bv11 32))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {909#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv6 32)) (_ bv11 32))} is VALID [2022-02-20 14:38:25,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {916#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv7 32)) (_ bv11 32))} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {916#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv7 32)) (_ bv11 32))} is VALID [2022-02-20 14:38:25,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {923#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv8 32)) (_ bv11 32))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {916#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv7 32)) (_ bv11 32))} is VALID [2022-02-20 14:38:25,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {923#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv8 32)) (_ bv11 32))} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {923#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv8 32)) (_ bv11 32))} is VALID [2022-02-20 14:38:25,135 INFO L290 TraceCheckUtils]: 5: Hoare triple {930#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv9 32)) (_ bv11 32))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {923#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv8 32)) (_ bv11 32))} is VALID [2022-02-20 14:38:25,135 INFO L290 TraceCheckUtils]: 4: Hoare triple {930#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv9 32)) (_ bv11 32))} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {930#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv9 32)) (_ bv11 32))} is VALID [2022-02-20 14:38:25,137 INFO L290 TraceCheckUtils]: 3: Hoare triple {937#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv10 32)) (_ bv11 32))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {930#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv9 32)) (_ bv11 32))} is VALID [2022-02-20 14:38:25,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {937#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv10 32)) (_ bv11 32))} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {937#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv10 32)) (_ bv11 32))} is VALID [2022-02-20 14:38:25,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {752#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11bv32);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0bv32; {937#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv10 32)) (_ bv11 32))} is VALID [2022-02-20 14:38:25,143 INFO L290 TraceCheckUtils]: 0: Hoare triple {752#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(39bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {752#true} is VALID [2022-02-20 14:38:25,143 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:38:25,143 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 14:38:25,143 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1342572514] [2022-02-20 14:38:25,143 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1342572514] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:38:25,143 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:38:25,143 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-02-20 14:38:25,143 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870733780] [2022-02-20 14:38:25,143 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:38:25,144 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 14:38:25,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:38:25,144 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:25,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:38:25,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-20 14:38:25,231 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 14:38:25,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-20 14:38:25,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2022-02-20 14:38:25,232 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 24 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:26,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:38:26,017 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2022-02-20 14:38:26,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 14:38:26,018 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 14:38:26,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:38:26,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:26,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 46 transitions. [2022-02-20 14:38:26,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:26,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 46 transitions. [2022-02-20 14:38:26,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 46 transitions. [2022-02-20 14:38:26,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:38:26,079 INFO L225 Difference]: With dead ends: 45 [2022-02-20 14:38:26,079 INFO L226 Difference]: Without dead ends: 38 [2022-02-20 14:38:26,080 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2022-02-20 14:38:26,080 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 19 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 14:38:26,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 63 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 14:38:26,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-02-20 14:38:26,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2022-02-20 14:38:26,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:38:26,083 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:26,084 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:26,084 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:26,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:38:26,085 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2022-02-20 14:38:26,085 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2022-02-20 14:38:26,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:38:26,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:38:26,085 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 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 38 states. [2022-02-20 14:38:26,085 INFO L87 Difference]: Start difference. First operand has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 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 38 states. [2022-02-20 14:38:26,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:38:26,086 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2022-02-20 14:38:26,086 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2022-02-20 14:38:26,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:38:26,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:38:26,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:38:26,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:38:26,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:26,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2022-02-20 14:38:26,087 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 29 [2022-02-20 14:38:26,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:38:26,088 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2022-02-20 14:38:26,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:26,088 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-02-20 14:38:26,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 14:38:26,088 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:38:26,088 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:38:26,099 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 14:38:26,295 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 14:38:26,296 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:38:26,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:38:26,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1133517568, now seen corresponding path program 3 times [2022-02-20 14:38:26,296 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 14:38:26,296 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [433837471] [2022-02-20 14:38:26,296 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:38:26,296 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 14:38:26,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 14:38:26,297 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 14:38:26,299 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 14:38:26,366 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-20 14:38:26,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:38:26,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 14:38:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:38:26,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:38:26,504 INFO L290 TraceCheckUtils]: 0: Hoare triple {1132#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(39bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {1132#true} is VALID [2022-02-20 14:38:26,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {1132#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11bv32);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0bv32; {1132#true} is VALID [2022-02-20 14:38:26,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {1132#true} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {1132#true} is VALID [2022-02-20 14:38:26,504 INFO L290 TraceCheckUtils]: 3: Hoare triple {1132#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {1132#true} is VALID [2022-02-20 14:38:26,504 INFO L290 TraceCheckUtils]: 4: Hoare triple {1132#true} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {1132#true} is VALID [2022-02-20 14:38:26,504 INFO L290 TraceCheckUtils]: 5: Hoare triple {1132#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {1132#true} is VALID [2022-02-20 14:38:26,504 INFO L290 TraceCheckUtils]: 6: Hoare triple {1132#true} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {1132#true} is VALID [2022-02-20 14:38:26,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {1132#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {1132#true} is VALID [2022-02-20 14:38:26,504 INFO L290 TraceCheckUtils]: 8: Hoare triple {1132#true} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {1132#true} is VALID [2022-02-20 14:38:26,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {1132#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {1132#true} is VALID [2022-02-20 14:38:26,505 INFO L290 TraceCheckUtils]: 10: Hoare triple {1132#true} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {1132#true} is VALID [2022-02-20 14:38:26,505 INFO L290 TraceCheckUtils]: 11: Hoare triple {1132#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {1132#true} is VALID [2022-02-20 14:38:26,505 INFO L290 TraceCheckUtils]: 12: Hoare triple {1132#true} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {1132#true} is VALID [2022-02-20 14:38:26,505 INFO L290 TraceCheckUtils]: 13: Hoare triple {1132#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {1132#true} is VALID [2022-02-20 14:38:26,505 INFO L290 TraceCheckUtils]: 14: Hoare triple {1132#true} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {1132#true} is VALID [2022-02-20 14:38:26,505 INFO L290 TraceCheckUtils]: 15: Hoare triple {1132#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {1132#true} is VALID [2022-02-20 14:38:26,505 INFO L290 TraceCheckUtils]: 16: Hoare triple {1132#true} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {1132#true} is VALID [2022-02-20 14:38:26,505 INFO L290 TraceCheckUtils]: 17: Hoare triple {1132#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {1132#true} is VALID [2022-02-20 14:38:26,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {1132#true} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {1132#true} is VALID [2022-02-20 14:38:26,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {1132#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {1132#true} is VALID [2022-02-20 14:38:26,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {1132#true} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {1132#true} is VALID [2022-02-20 14:38:26,506 INFO L290 TraceCheckUtils]: 21: Hoare triple {1132#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {1132#true} is VALID [2022-02-20 14:38:26,506 INFO L290 TraceCheckUtils]: 22: Hoare triple {1132#true} assume !!~bvslt32(main_~i~0#1, 11bv32);call write~intINTTYPE1(main_#t~nondet5#1, main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~i~0#1), 1bv32);havoc main_#t~nondet5#1; {1132#true} is VALID [2022-02-20 14:38:26,506 INFO L290 TraceCheckUtils]: 23: Hoare triple {1132#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {1132#true} is VALID [2022-02-20 14:38:26,506 INFO L290 TraceCheckUtils]: 24: Hoare triple {1132#true} assume !~bvslt32(main_~i~0#1, 11bv32); {1132#true} is VALID [2022-02-20 14:38:26,506 INFO L290 TraceCheckUtils]: 25: Hoare triple {1132#true} call write~intINTTYPE1(0bv8, main_~#in~0#1.base, ~bvadd32(10bv32, main_~#in~0#1.offset), 1bv32);main_~idx_in~0#1 := 0bv32;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0bv32;call main_#t~mem6#1 := read~intINTTYPE1(main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~idx_in~0#1), 1bv32);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; {1212#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} is VALID [2022-02-20 14:38:26,509 INFO L290 TraceCheckUtils]: 26: Hoare triple {1212#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} assume !!(~bvsle32(48bv32, ~zero_extendFrom8To32(main_~c~0#1)) && ~bvsle32(~zero_extendFrom8To32(main_~c~0#1), 57bv32));main_~j~0#1 := ~bvsub32(~zero_extendFrom8To32(main_~c~0#1), 48bv32);main_~i~0#1 := ~bvadd32(~bvmul32(10bv32, main_~i~0#1), main_~j~0#1);main_#t~post7#1 := main_~idx_in~0#1;main_~idx_in~0#1 := ~bvadd32(1bv32, main_#t~post7#1);havoc main_#t~post7#1;call main_#t~mem8#1 := read~intINTTYPE1(main_~#in~0#1.base, ~bvadd32(main_~#in~0#1.offset, main_~idx_in~0#1), 1bv32);main_~c~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1; {1216#(exists ((|v_ULTIMATE.start_main_~c~0#1_15| (_ BitVec 8))) (and (bvsle (_ bv48 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_15|)) (= |ULTIMATE.start_main_~i~0#1| (bvadd (_ bv4294967248 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_15|)))))} is VALID [2022-02-20 14:38:26,511 INFO L290 TraceCheckUtils]: 27: Hoare triple {1216#(exists ((|v_ULTIMATE.start_main_~c~0#1_15| (_ BitVec 8))) (and (bvsle (_ bv48 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_15|)) (= |ULTIMATE.start_main_~i~0#1| (bvadd (_ bv4294967248 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_15|)))))} assume !(~bvsle32(48bv32, ~zero_extendFrom8To32(main_~c~0#1)) && ~bvsle32(~zero_extendFrom8To32(main_~c~0#1), 57bv32)); {1216#(exists ((|v_ULTIMATE.start_main_~c~0#1_15| (_ BitVec 8))) (and (bvsle (_ bv48 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_15|)) (= |ULTIMATE.start_main_~i~0#1| (bvadd (_ bv4294967248 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_15|)))))} is VALID [2022-02-20 14:38:26,511 INFO L290 TraceCheckUtils]: 28: Hoare triple {1216#(exists ((|v_ULTIMATE.start_main_~c~0#1_15| (_ BitVec 8))) (and (bvsle (_ bv48 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_15|)) (= |ULTIMATE.start_main_~i~0#1| (bvadd (_ bv4294967248 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_15|)))))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~bvsge32(main_~i~0#1, 0bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1223#(= |ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))} is VALID [2022-02-20 14:38:26,512 INFO L290 TraceCheckUtils]: 29: Hoare triple {1223#(= |ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond#1; {1133#false} is VALID [2022-02-20 14:38:26,512 INFO L290 TraceCheckUtils]: 30: Hoare triple {1133#false} assume !false; {1133#false} is VALID [2022-02-20 14:38:26,512 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-02-20 14:38:26,512 INFO L328 TraceCheckSpWp]: Computing backward predicates...