./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.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/seq-mthreaded/pals_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.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 1f7b08d697525a6b6e4b6c32e081a52208b7f6ea0ef3da259b2ed32d3a516e9b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:32:10,667 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:32:10,669 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:32:10,695 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:32:10,699 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:32:10,703 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:32:10,704 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:32:10,707 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:32:10,708 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:32:10,712 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:32:10,713 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:32:10,714 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:32:10,714 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:32:10,716 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:32:10,717 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:32:10,718 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:32:10,719 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:32:10,720 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:32:10,723 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:32:10,724 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:32:10,727 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:32:10,728 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:32:10,728 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:32:10,729 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:32:10,732 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:32:10,733 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:32:10,733 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:32:10,734 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:32:10,734 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:32:10,735 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:32:10,735 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:32:10,736 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:32:10,737 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:32:10,738 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:32:10,738 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:32:10,739 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:32:10,739 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:32:10,739 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:32:10,739 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:32:10,740 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:32:10,740 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:32:10,741 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:32:10,764 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:32:10,764 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:32:10,765 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:32:10,765 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:32:10,766 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:32:10,766 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:32:10,766 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:32:10,766 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:32:10,766 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:32:10,767 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:32:10,767 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:32:10,767 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:32:10,768 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:32:10,768 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:32:10,768 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:32:10,768 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:32:10,768 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:32:10,768 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:32:10,768 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:32:10,769 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:32:10,769 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:32:10,769 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:32:10,769 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:32:10,769 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:32:10,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:32:10,769 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:32:10,770 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:32:10,770 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:32:10,771 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:32:10,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:32:10,771 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:32:10,771 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:32:10,771 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:32:10,771 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 -> 1f7b08d697525a6b6e4b6c32e081a52208b7f6ea0ef3da259b2ed32d3a516e9b [2022-02-20 18:32:10,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:32:10,993 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:32:10,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:32:10,997 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:32:10,998 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:32:10,998 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.c [2022-02-20 18:32:11,046 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9c5959e4/aaaaeee04d6143d984a856ded71e0bf8/FLAG2c5711837 [2022-02-20 18:32:11,394 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:32:11,396 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.c [2022-02-20 18:32:11,403 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9c5959e4/aaaaeee04d6143d984a856ded71e0bf8/FLAG2c5711837 [2022-02-20 18:32:11,786 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9c5959e4/aaaaeee04d6143d984a856ded71e0bf8 [2022-02-20 18:32:11,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:32:11,788 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:32:11,789 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:32:11,790 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:32:11,795 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:32:11,796 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:32:11" (1/1) ... [2022-02-20 18:32:11,797 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b46acb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:32:11, skipping insertion in model container [2022-02-20 18:32:11,797 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:32:11" (1/1) ... [2022-02-20 18:32:11,815 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:32:11,844 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:32:12,064 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/seq-mthreaded/pals_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.c[14467,14480] [2022-02-20 18:32:12,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:32:12,079 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:32:12,142 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/seq-mthreaded/pals_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.c[14467,14480] [2022-02-20 18:32:12,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:32:12,160 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:32:12,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:32:12 WrapperNode [2022-02-20 18:32:12,161 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:32:12,162 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:32:12,162 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:32:12,163 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:32:12,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:32:12" (1/1) ... [2022-02-20 18:32:12,189 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:32:12" (1/1) ... [2022-02-20 18:32:12,228 INFO L137 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 473 [2022-02-20 18:32:12,229 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:32:12,229 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:32:12,229 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:32:12,229 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:32:12,239 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:32:12" (1/1) ... [2022-02-20 18:32:12,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:32:12" (1/1) ... [2022-02-20 18:32:12,243 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:32:12" (1/1) ... [2022-02-20 18:32:12,246 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:32:12" (1/1) ... [2022-02-20 18:32:12,252 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:32:12" (1/1) ... [2022-02-20 18:32:12,266 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:32:12" (1/1) ... [2022-02-20 18:32:12,270 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:32:12" (1/1) ... [2022-02-20 18:32:12,276 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:32:12,278 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:32:12,278 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:32:12,279 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:32:12,279 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:32:12" (1/1) ... [2022-02-20 18:32:12,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:32:12,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:32:12,312 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 18:32:12,332 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 18:32:12,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:32:12,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:32:12,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:32:12,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:32:12,405 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:32:12,406 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:32:12,956 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:32:12,963 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:32:12,964 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 18:32:12,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:32:12 BoogieIcfgContainer [2022-02-20 18:32:12,965 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:32:12,966 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:32:12,967 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:32:12,969 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:32:12,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:32:11" (1/3) ... [2022-02-20 18:32:12,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ae644ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:32:12, skipping insertion in model container [2022-02-20 18:32:12,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:32:12" (2/3) ... [2022-02-20 18:32:12,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ae644ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:32:12, skipping insertion in model container [2022-02-20 18:32:12,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:32:12" (3/3) ... [2022-02-20 18:32:12,971 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.c [2022-02-20 18:32:12,974 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:32:12,975 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:32:13,005 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:32:13,021 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 18:32:13,021 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:32:13,039 INFO L276 IsEmpty]: Start isEmpty. Operand has 143 states, 141 states have (on average 1.7588652482269505) internal successors, (248), 142 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:13,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:32:13,049 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:13,050 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:32:13,050 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:13,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:13,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1418405445, now seen corresponding path program 1 times [2022-02-20 18:32:13,060 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:13,060 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391952054] [2022-02-20 18:32:13,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:13,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:13,314 INFO L290 TraceCheckUtils]: 0: Hoare triple {146#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(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {146#true} is VALID [2022-02-20 18:32:13,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {146#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {146#true} is VALID [2022-02-20 18:32:13,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {146#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {146#true} is VALID [2022-02-20 18:32:13,315 INFO L290 TraceCheckUtils]: 3: Hoare triple {146#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {146#true} is VALID [2022-02-20 18:32:13,315 INFO L290 TraceCheckUtils]: 4: Hoare triple {146#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {146#true} is VALID [2022-02-20 18:32:13,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {146#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {146#true} is VALID [2022-02-20 18:32:13,316 INFO L290 TraceCheckUtils]: 6: Hoare triple {146#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {146#true} is VALID [2022-02-20 18:32:13,316 INFO L290 TraceCheckUtils]: 7: Hoare triple {146#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {146#true} is VALID [2022-02-20 18:32:13,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {146#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {146#true} is VALID [2022-02-20 18:32:13,320 INFO L290 TraceCheckUtils]: 9: Hoare triple {146#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {146#true} is VALID [2022-02-20 18:32:13,321 INFO L290 TraceCheckUtils]: 10: Hoare triple {146#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {146#true} is VALID [2022-02-20 18:32:13,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {146#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {146#true} is VALID [2022-02-20 18:32:13,321 INFO L290 TraceCheckUtils]: 12: Hoare triple {146#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {146#true} is VALID [2022-02-20 18:32:13,321 INFO L290 TraceCheckUtils]: 13: Hoare triple {146#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {146#true} is VALID [2022-02-20 18:32:13,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {146#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; {146#true} is VALID [2022-02-20 18:32:13,322 INFO L290 TraceCheckUtils]: 15: Hoare triple {146#true} init_#res#1 := init_~tmp___5~0#1; {146#true} is VALID [2022-02-20 18:32:13,322 INFO L290 TraceCheckUtils]: 16: Hoare triple {146#true} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {146#true} is VALID [2022-02-20 18:32:13,323 INFO L290 TraceCheckUtils]: 17: Hoare triple {146#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {147#false} is VALID [2022-02-20 18:32:13,323 INFO L290 TraceCheckUtils]: 18: Hoare triple {147#false} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {147#false} is VALID [2022-02-20 18:32:13,323 INFO L290 TraceCheckUtils]: 19: Hoare triple {147#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {147#false} is VALID [2022-02-20 18:32:13,324 INFO L290 TraceCheckUtils]: 20: Hoare triple {147#false} assume !(0 != ~mode1~0 % 256); {147#false} is VALID [2022-02-20 18:32:13,324 INFO L290 TraceCheckUtils]: 21: Hoare triple {147#false} assume !(~r1~0 % 256 < 2); {147#false} is VALID [2022-02-20 18:32:13,324 INFO L290 TraceCheckUtils]: 22: Hoare triple {147#false} ~mode1~0 := 1; {147#false} is VALID [2022-02-20 18:32:13,325 INFO L290 TraceCheckUtils]: 23: Hoare triple {147#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {147#false} is VALID [2022-02-20 18:32:13,325 INFO L290 TraceCheckUtils]: 24: Hoare triple {147#false} assume !(0 != ~mode2~0 % 256); {147#false} is VALID [2022-02-20 18:32:13,326 INFO L290 TraceCheckUtils]: 25: Hoare triple {147#false} assume !(~r2~0 % 256 < 2); {147#false} is VALID [2022-02-20 18:32:13,326 INFO L290 TraceCheckUtils]: 26: Hoare triple {147#false} ~mode2~0 := 1; {147#false} is VALID [2022-02-20 18:32:13,326 INFO L290 TraceCheckUtils]: 27: Hoare triple {147#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {147#false} is VALID [2022-02-20 18:32:13,326 INFO L290 TraceCheckUtils]: 28: Hoare triple {147#false} assume !(0 != ~mode3~0 % 256); {147#false} is VALID [2022-02-20 18:32:13,326 INFO L290 TraceCheckUtils]: 29: Hoare triple {147#false} assume !(~r3~0 % 256 < 2); {147#false} is VALID [2022-02-20 18:32:13,327 INFO L290 TraceCheckUtils]: 30: Hoare triple {147#false} ~mode3~0 := 1; {147#false} is VALID [2022-02-20 18:32:13,327 INFO L290 TraceCheckUtils]: 31: Hoare triple {147#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {147#false} is VALID [2022-02-20 18:32:13,328 INFO L290 TraceCheckUtils]: 32: Hoare triple {147#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {147#false} is VALID [2022-02-20 18:32:13,328 INFO L290 TraceCheckUtils]: 33: Hoare triple {147#false} check_#res#1 := check_~tmp~1#1; {147#false} is VALID [2022-02-20 18:32:13,328 INFO L290 TraceCheckUtils]: 34: Hoare triple {147#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {147#false} is VALID [2022-02-20 18:32:13,328 INFO L290 TraceCheckUtils]: 35: Hoare triple {147#false} assume 0 == assert_~arg#1 % 256; {147#false} is VALID [2022-02-20 18:32:13,329 INFO L290 TraceCheckUtils]: 36: Hoare triple {147#false} assume !false; {147#false} is VALID [2022-02-20 18:32:13,330 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 18:32:13,330 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:13,331 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391952054] [2022-02-20 18:32:13,331 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391952054] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:13,331 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:13,331 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:32:13,332 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607265711] [2022-02-20 18:32:13,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:13,339 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-02-20 18:32:13,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:13,343 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:13,380 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 18:32:13,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:32:13,381 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:13,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:32:13,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:32:13,404 INFO L87 Difference]: Start difference. First operand has 143 states, 141 states have (on average 1.7588652482269505) internal successors, (248), 142 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:13,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:13,536 INFO L93 Difference]: Finished difference Result 223 states and 385 transitions. [2022-02-20 18:32:13,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:32:13,537 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-02-20 18:32:13,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:32:13,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:13,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 385 transitions. [2022-02-20 18:32:13,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:13,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 385 transitions. [2022-02-20 18:32:13,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 385 transitions. [2022-02-20 18:32:13,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 385 edges. 385 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:13,840 INFO L225 Difference]: With dead ends: 223 [2022-02-20 18:32:13,840 INFO L226 Difference]: Without dead ends: 139 [2022-02-20 18:32:13,843 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:32:13,845 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:32:13,846 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:32:13,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-02-20 18:32:13,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-02-20 18:32:13,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:13,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 139 states, 138 states have (on average 1.7463768115942029) internal successors, (241), 138 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:13,879 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 139 states, 138 states have (on average 1.7463768115942029) internal successors, (241), 138 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:13,880 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 139 states, 138 states have (on average 1.7463768115942029) internal successors, (241), 138 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:13,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:13,888 INFO L93 Difference]: Finished difference Result 139 states and 241 transitions. [2022-02-20 18:32:13,888 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 241 transitions. [2022-02-20 18:32:13,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:13,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:13,889 INFO L74 IsIncluded]: Start isIncluded. First operand has 139 states, 138 states have (on average 1.7463768115942029) internal successors, (241), 138 states have internal predecessors, (241), 0 states have call successors, (0), 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 139 states. [2022-02-20 18:32:13,890 INFO L87 Difference]: Start difference. First operand has 139 states, 138 states have (on average 1.7463768115942029) internal successors, (241), 138 states have internal predecessors, (241), 0 states have call successors, (0), 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 139 states. [2022-02-20 18:32:13,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:13,894 INFO L93 Difference]: Finished difference Result 139 states and 241 transitions. [2022-02-20 18:32:13,895 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 241 transitions. [2022-02-20 18:32:13,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:13,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:13,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:13,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:13,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.7463768115942029) internal successors, (241), 138 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:13,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 241 transitions. [2022-02-20 18:32:13,903 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 241 transitions. Word has length 37 [2022-02-20 18:32:13,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:13,904 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 241 transitions. [2022-02-20 18:32:13,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:13,904 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 241 transitions. [2022-02-20 18:32:13,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:32:13,907 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:13,907 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:32:13,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:32:13,909 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:13,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:13,911 INFO L85 PathProgramCache]: Analyzing trace with hash 2058913401, now seen corresponding path program 1 times [2022-02-20 18:32:13,911 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:13,911 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756749382] [2022-02-20 18:32:13,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:13,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:13,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:14,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {817#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(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {817#true} is VALID [2022-02-20 18:32:14,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {817#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {817#true} is VALID [2022-02-20 18:32:14,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {817#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {817#true} is VALID [2022-02-20 18:32:14,016 INFO L290 TraceCheckUtils]: 3: Hoare triple {817#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {817#true} is VALID [2022-02-20 18:32:14,016 INFO L290 TraceCheckUtils]: 4: Hoare triple {817#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {817#true} is VALID [2022-02-20 18:32:14,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {817#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {817#true} is VALID [2022-02-20 18:32:14,016 INFO L290 TraceCheckUtils]: 6: Hoare triple {817#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {817#true} is VALID [2022-02-20 18:32:14,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {817#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {817#true} is VALID [2022-02-20 18:32:14,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {817#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {817#true} is VALID [2022-02-20 18:32:14,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {817#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {817#true} is VALID [2022-02-20 18:32:14,017 INFO L290 TraceCheckUtils]: 10: Hoare triple {817#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {817#true} is VALID [2022-02-20 18:32:14,017 INFO L290 TraceCheckUtils]: 11: Hoare triple {817#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {817#true} is VALID [2022-02-20 18:32:14,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {817#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {817#true} is VALID [2022-02-20 18:32:14,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {817#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {817#true} is VALID [2022-02-20 18:32:14,024 INFO L290 TraceCheckUtils]: 14: Hoare triple {817#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; {819#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} is VALID [2022-02-20 18:32:14,024 INFO L290 TraceCheckUtils]: 15: Hoare triple {819#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} init_#res#1 := init_~tmp___5~0#1; {820#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 18:32:14,025 INFO L290 TraceCheckUtils]: 16: Hoare triple {820#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {821#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 18:32:14,025 INFO L290 TraceCheckUtils]: 17: Hoare triple {821#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {818#false} is VALID [2022-02-20 18:32:14,026 INFO L290 TraceCheckUtils]: 18: Hoare triple {818#false} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {818#false} is VALID [2022-02-20 18:32:14,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {818#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {818#false} is VALID [2022-02-20 18:32:14,027 INFO L290 TraceCheckUtils]: 20: Hoare triple {818#false} assume !(0 != ~mode1~0 % 256); {818#false} is VALID [2022-02-20 18:32:14,028 INFO L290 TraceCheckUtils]: 21: Hoare triple {818#false} assume !(~r1~0 % 256 < 2); {818#false} is VALID [2022-02-20 18:32:14,028 INFO L290 TraceCheckUtils]: 22: Hoare triple {818#false} ~mode1~0 := 1; {818#false} is VALID [2022-02-20 18:32:14,028 INFO L290 TraceCheckUtils]: 23: Hoare triple {818#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {818#false} is VALID [2022-02-20 18:32:14,028 INFO L290 TraceCheckUtils]: 24: Hoare triple {818#false} assume !(0 != ~mode2~0 % 256); {818#false} is VALID [2022-02-20 18:32:14,028 INFO L290 TraceCheckUtils]: 25: Hoare triple {818#false} assume !(~r2~0 % 256 < 2); {818#false} is VALID [2022-02-20 18:32:14,029 INFO L290 TraceCheckUtils]: 26: Hoare triple {818#false} ~mode2~0 := 1; {818#false} is VALID [2022-02-20 18:32:14,029 INFO L290 TraceCheckUtils]: 27: Hoare triple {818#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {818#false} is VALID [2022-02-20 18:32:14,029 INFO L290 TraceCheckUtils]: 28: Hoare triple {818#false} assume !(0 != ~mode3~0 % 256); {818#false} is VALID [2022-02-20 18:32:14,029 INFO L290 TraceCheckUtils]: 29: Hoare triple {818#false} assume !(~r3~0 % 256 < 2); {818#false} is VALID [2022-02-20 18:32:14,029 INFO L290 TraceCheckUtils]: 30: Hoare triple {818#false} ~mode3~0 := 1; {818#false} is VALID [2022-02-20 18:32:14,029 INFO L290 TraceCheckUtils]: 31: Hoare triple {818#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {818#false} is VALID [2022-02-20 18:32:14,030 INFO L290 TraceCheckUtils]: 32: Hoare triple {818#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {818#false} is VALID [2022-02-20 18:32:14,030 INFO L290 TraceCheckUtils]: 33: Hoare triple {818#false} check_#res#1 := check_~tmp~1#1; {818#false} is VALID [2022-02-20 18:32:14,030 INFO L290 TraceCheckUtils]: 34: Hoare triple {818#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {818#false} is VALID [2022-02-20 18:32:14,030 INFO L290 TraceCheckUtils]: 35: Hoare triple {818#false} assume 0 == assert_~arg#1 % 256; {818#false} is VALID [2022-02-20 18:32:14,031 INFO L290 TraceCheckUtils]: 36: Hoare triple {818#false} assume !false; {818#false} is VALID [2022-02-20 18:32:14,031 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 18:32:14,031 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:14,031 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756749382] [2022-02-20 18:32:14,032 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756749382] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:14,032 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:14,032 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:32:14,032 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203684479] [2022-02-20 18:32:14,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:14,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-02-20 18:32:14,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:14,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:14,057 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 18:32:14,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:32:14,059 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:14,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:32:14,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:32:14,060 INFO L87 Difference]: Start difference. First operand 139 states and 241 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:14,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:14,495 INFO L93 Difference]: Finished difference Result 222 states and 378 transitions. [2022-02-20 18:32:14,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:32:14,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-02-20 18:32:14,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:32:14,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:14,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 378 transitions. [2022-02-20 18:32:14,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:14,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 378 transitions. [2022-02-20 18:32:14,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 378 transitions. [2022-02-20 18:32:14,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 378 edges. 378 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:14,751 INFO L225 Difference]: With dead ends: 222 [2022-02-20 18:32:14,752 INFO L226 Difference]: Without dead ends: 139 [2022-02-20 18:32:14,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:32:14,753 INFO L933 BasicCegarLoop]: 239 mSDtfsCounter, 3 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:32:14,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 923 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:32:14,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-02-20 18:32:14,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-02-20 18:32:14,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:14,759 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 139 states, 138 states have (on average 1.5289855072463767) internal successors, (211), 138 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:14,760 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 139 states, 138 states have (on average 1.5289855072463767) internal successors, (211), 138 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:14,760 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 139 states, 138 states have (on average 1.5289855072463767) internal successors, (211), 138 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:14,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:14,763 INFO L93 Difference]: Finished difference Result 139 states and 211 transitions. [2022-02-20 18:32:14,764 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 211 transitions. [2022-02-20 18:32:14,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:14,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:14,765 INFO L74 IsIncluded]: Start isIncluded. First operand has 139 states, 138 states have (on average 1.5289855072463767) internal successors, (211), 138 states have internal predecessors, (211), 0 states have call successors, (0), 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 139 states. [2022-02-20 18:32:14,765 INFO L87 Difference]: Start difference. First operand has 139 states, 138 states have (on average 1.5289855072463767) internal successors, (211), 138 states have internal predecessors, (211), 0 states have call successors, (0), 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 139 states. [2022-02-20 18:32:14,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:14,768 INFO L93 Difference]: Finished difference Result 139 states and 211 transitions. [2022-02-20 18:32:14,769 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 211 transitions. [2022-02-20 18:32:14,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:14,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:14,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:14,770 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:14,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.5289855072463767) internal successors, (211), 138 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:14,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 211 transitions. [2022-02-20 18:32:14,773 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 211 transitions. Word has length 37 [2022-02-20 18:32:14,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:14,773 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 211 transitions. [2022-02-20 18:32:14,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:14,774 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 211 transitions. [2022-02-20 18:32:14,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:32:14,775 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:14,775 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:32:14,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:32:14,775 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:14,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:14,776 INFO L85 PathProgramCache]: Analyzing trace with hash -415118785, now seen corresponding path program 1 times [2022-02-20 18:32:14,776 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:14,776 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711904379] [2022-02-20 18:32:14,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:14,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:14,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {1494#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(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {1494#true} is VALID [2022-02-20 18:32:14,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {1494#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {1494#true} is VALID [2022-02-20 18:32:14,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {1494#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {1494#true} is VALID [2022-02-20 18:32:14,875 INFO L290 TraceCheckUtils]: 3: Hoare triple {1494#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {1494#true} is VALID [2022-02-20 18:32:14,876 INFO L290 TraceCheckUtils]: 4: Hoare triple {1494#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {1494#true} is VALID [2022-02-20 18:32:14,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {1494#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {1494#true} is VALID [2022-02-20 18:32:14,876 INFO L290 TraceCheckUtils]: 6: Hoare triple {1494#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {1494#true} is VALID [2022-02-20 18:32:14,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {1494#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {1494#true} is VALID [2022-02-20 18:32:14,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {1494#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {1494#true} is VALID [2022-02-20 18:32:14,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {1494#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {1494#true} is VALID [2022-02-20 18:32:14,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {1494#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {1494#true} is VALID [2022-02-20 18:32:14,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {1494#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {1494#true} is VALID [2022-02-20 18:32:14,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {1494#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {1494#true} is VALID [2022-02-20 18:32:14,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {1494#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {1494#true} is VALID [2022-02-20 18:32:14,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {1494#true} assume ~id1~0 != ~id2~0; {1494#true} is VALID [2022-02-20 18:32:14,878 INFO L290 TraceCheckUtils]: 15: Hoare triple {1494#true} assume ~id1~0 != ~id3~0; {1494#true} is VALID [2022-02-20 18:32:14,878 INFO L290 TraceCheckUtils]: 16: Hoare triple {1494#true} assume ~id2~0 != ~id3~0; {1494#true} is VALID [2022-02-20 18:32:14,878 INFO L290 TraceCheckUtils]: 17: Hoare triple {1494#true} assume ~id1~0 >= 0; {1494#true} is VALID [2022-02-20 18:32:14,878 INFO L290 TraceCheckUtils]: 18: Hoare triple {1494#true} assume ~id2~0 >= 0; {1494#true} is VALID [2022-02-20 18:32:14,878 INFO L290 TraceCheckUtils]: 19: Hoare triple {1494#true} assume ~id3~0 >= 0; {1494#true} is VALID [2022-02-20 18:32:14,879 INFO L290 TraceCheckUtils]: 20: Hoare triple {1494#true} assume 0 == ~r1~0 % 256; {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:14,879 INFO L290 TraceCheckUtils]: 21: Hoare triple {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~r2~0 % 256; {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:14,880 INFO L290 TraceCheckUtils]: 22: Hoare triple {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~r3~0 % 256; {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:14,880 INFO L290 TraceCheckUtils]: 23: Hoare triple {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r122~0#1 % 256; {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:14,880 INFO L290 TraceCheckUtils]: 24: Hoare triple {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r132~0#1 % 256; {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:14,881 INFO L290 TraceCheckUtils]: 25: Hoare triple {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r212~0#1 % 256; {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:14,881 INFO L290 TraceCheckUtils]: 26: Hoare triple {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r232~0#1 % 256; {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:14,881 INFO L290 TraceCheckUtils]: 27: Hoare triple {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r312~0#1 % 256; {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:14,882 INFO L290 TraceCheckUtils]: 28: Hoare triple {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r322~0#1 % 256; {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:14,882 INFO L290 TraceCheckUtils]: 29: Hoare triple {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max1~0 == ~id1~0; {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:14,882 INFO L290 TraceCheckUtils]: 30: Hoare triple {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max2~0 == ~id2~0; {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:14,883 INFO L290 TraceCheckUtils]: 31: Hoare triple {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max3~0 == ~id3~0; {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:14,883 INFO L290 TraceCheckUtils]: 32: Hoare triple {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:14,883 INFO L290 TraceCheckUtils]: 33: Hoare triple {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:14,884 INFO L290 TraceCheckUtils]: 34: Hoare triple {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:14,884 INFO L290 TraceCheckUtils]: 35: Hoare triple {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl1~0; {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:14,884 INFO L290 TraceCheckUtils]: 36: Hoare triple {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl2~0; {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:14,885 INFO L290 TraceCheckUtils]: 37: Hoare triple {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl3~0; {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:14,885 INFO L290 TraceCheckUtils]: 38: Hoare triple {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:14,885 INFO L290 TraceCheckUtils]: 39: Hoare triple {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:14,886 INFO L290 TraceCheckUtils]: 40: Hoare triple {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:14,886 INFO L290 TraceCheckUtils]: 41: Hoare triple {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != ~newmax1~0 % 256; {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:14,886 INFO L290 TraceCheckUtils]: 42: Hoare triple {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != ~newmax2~0 % 256; {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:14,887 INFO L290 TraceCheckUtils]: 43: Hoare triple {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:14,887 INFO L290 TraceCheckUtils]: 44: Hoare triple {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} init_#res#1 := init_~tmp___5~0#1; {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:14,887 INFO L290 TraceCheckUtils]: 45: Hoare triple {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:14,888 INFO L290 TraceCheckUtils]: 46: Hoare triple {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == assume_abort_if_not_~cond#1); {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:14,888 INFO L290 TraceCheckUtils]: 47: Hoare triple {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:14,888 INFO L290 TraceCheckUtils]: 48: Hoare triple {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:14,889 INFO L290 TraceCheckUtils]: 49: Hoare triple {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode1~0 % 256); {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:32:14,889 INFO L290 TraceCheckUtils]: 50: Hoare triple {1496#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~r1~0 % 256 < 2); {1495#false} is VALID [2022-02-20 18:32:14,890 INFO L290 TraceCheckUtils]: 51: Hoare triple {1495#false} ~mode1~0 := 1; {1495#false} is VALID [2022-02-20 18:32:14,890 INFO L290 TraceCheckUtils]: 52: Hoare triple {1495#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {1495#false} is VALID [2022-02-20 18:32:14,890 INFO L290 TraceCheckUtils]: 53: Hoare triple {1495#false} assume !(0 != ~mode2~0 % 256); {1495#false} is VALID [2022-02-20 18:32:14,890 INFO L290 TraceCheckUtils]: 54: Hoare triple {1495#false} assume !(~r2~0 % 256 < 2); {1495#false} is VALID [2022-02-20 18:32:14,890 INFO L290 TraceCheckUtils]: 55: Hoare triple {1495#false} ~mode2~0 := 1; {1495#false} is VALID [2022-02-20 18:32:14,890 INFO L290 TraceCheckUtils]: 56: Hoare triple {1495#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {1495#false} is VALID [2022-02-20 18:32:14,891 INFO L290 TraceCheckUtils]: 57: Hoare triple {1495#false} assume !(0 != ~mode3~0 % 256); {1495#false} is VALID [2022-02-20 18:32:14,891 INFO L290 TraceCheckUtils]: 58: Hoare triple {1495#false} assume !(~r3~0 % 256 < 2); {1495#false} is VALID [2022-02-20 18:32:14,891 INFO L290 TraceCheckUtils]: 59: Hoare triple {1495#false} ~mode3~0 := 1; {1495#false} is VALID [2022-02-20 18:32:14,891 INFO L290 TraceCheckUtils]: 60: Hoare triple {1495#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1495#false} is VALID [2022-02-20 18:32:14,891 INFO L290 TraceCheckUtils]: 61: Hoare triple {1495#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {1495#false} is VALID [2022-02-20 18:32:14,891 INFO L290 TraceCheckUtils]: 62: Hoare triple {1495#false} check_#res#1 := check_~tmp~1#1; {1495#false} is VALID [2022-02-20 18:32:14,892 INFO L290 TraceCheckUtils]: 63: Hoare triple {1495#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1495#false} is VALID [2022-02-20 18:32:14,892 INFO L290 TraceCheckUtils]: 64: Hoare triple {1495#false} assume 0 == assert_~arg#1 % 256; {1495#false} is VALID [2022-02-20 18:32:14,892 INFO L290 TraceCheckUtils]: 65: Hoare triple {1495#false} assume !false; {1495#false} is VALID [2022-02-20 18:32:14,892 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 18:32:14,893 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:14,893 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711904379] [2022-02-20 18:32:14,893 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711904379] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:14,893 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:14,893 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:32:14,893 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246086809] [2022-02-20 18:32:14,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:14,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-02-20 18:32:14,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:14,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:14,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:14,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:32:14,935 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:14,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:32:14,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:32:14,935 INFO L87 Difference]: Start difference. First operand 139 states and 211 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:15,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:15,181 INFO L93 Difference]: Finished difference Result 287 states and 459 transitions. [2022-02-20 18:32:15,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:32:15,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-02-20 18:32:15,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:32:15,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:15,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 459 transitions. [2022-02-20 18:32:15,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:15,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 459 transitions. [2022-02-20 18:32:15,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 459 transitions. [2022-02-20 18:32:15,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 459 edges. 459 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:15,452 INFO L225 Difference]: With dead ends: 287 [2022-02-20 18:32:15,452 INFO L226 Difference]: Without dead ends: 208 [2022-02-20 18:32:15,452 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 18:32:15,453 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 107 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:32:15,454 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 374 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:32:15,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-02-20 18:32:15,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2022-02-20 18:32:15,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:15,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 208 states. Second operand has 206 states, 205 states have (on average 1.5609756097560976) internal successors, (320), 205 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:15,474 INFO L74 IsIncluded]: Start isIncluded. First operand 208 states. Second operand has 206 states, 205 states have (on average 1.5609756097560976) internal successors, (320), 205 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:15,475 INFO L87 Difference]: Start difference. First operand 208 states. Second operand has 206 states, 205 states have (on average 1.5609756097560976) internal successors, (320), 205 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:15,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:15,479 INFO L93 Difference]: Finished difference Result 208 states and 321 transitions. [2022-02-20 18:32:15,479 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 321 transitions. [2022-02-20 18:32:15,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:15,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:15,480 INFO L74 IsIncluded]: Start isIncluded. First operand has 206 states, 205 states have (on average 1.5609756097560976) internal successors, (320), 205 states have internal predecessors, (320), 0 states have call successors, (0), 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 208 states. [2022-02-20 18:32:15,481 INFO L87 Difference]: Start difference. First operand has 206 states, 205 states have (on average 1.5609756097560976) internal successors, (320), 205 states have internal predecessors, (320), 0 states have call successors, (0), 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 208 states. [2022-02-20 18:32:15,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:15,485 INFO L93 Difference]: Finished difference Result 208 states and 321 transitions. [2022-02-20 18:32:15,485 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 321 transitions. [2022-02-20 18:32:15,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:15,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:15,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:15,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:15,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.5609756097560976) internal successors, (320), 205 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:15,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 320 transitions. [2022-02-20 18:32:15,491 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 320 transitions. Word has length 66 [2022-02-20 18:32:15,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:15,491 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 320 transitions. [2022-02-20 18:32:15,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:15,492 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 320 transitions. [2022-02-20 18:32:15,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 18:32:15,493 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:15,493 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:32:15,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:32:15,493 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:15,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:15,494 INFO L85 PathProgramCache]: Analyzing trace with hash 928134868, now seen corresponding path program 1 times [2022-02-20 18:32:15,494 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:15,494 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343286686] [2022-02-20 18:32:15,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:15,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:15,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {2450#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(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {2450#true} is VALID [2022-02-20 18:32:15,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {2450#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {2450#true} is VALID [2022-02-20 18:32:15,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {2450#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {2450#true} is VALID [2022-02-20 18:32:15,591 INFO L290 TraceCheckUtils]: 3: Hoare triple {2450#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {2450#true} is VALID [2022-02-20 18:32:15,591 INFO L290 TraceCheckUtils]: 4: Hoare triple {2450#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {2450#true} is VALID [2022-02-20 18:32:15,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {2450#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {2450#true} is VALID [2022-02-20 18:32:15,591 INFO L290 TraceCheckUtils]: 6: Hoare triple {2450#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {2450#true} is VALID [2022-02-20 18:32:15,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {2450#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {2450#true} is VALID [2022-02-20 18:32:15,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {2450#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {2450#true} is VALID [2022-02-20 18:32:15,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {2450#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {2450#true} is VALID [2022-02-20 18:32:15,592 INFO L290 TraceCheckUtils]: 10: Hoare triple {2450#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {2450#true} is VALID [2022-02-20 18:32:15,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {2450#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {2450#true} is VALID [2022-02-20 18:32:15,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {2450#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {2450#true} is VALID [2022-02-20 18:32:15,592 INFO L290 TraceCheckUtils]: 13: Hoare triple {2450#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {2450#true} is VALID [2022-02-20 18:32:15,592 INFO L290 TraceCheckUtils]: 14: Hoare triple {2450#true} assume ~id1~0 != ~id2~0; {2450#true} is VALID [2022-02-20 18:32:15,592 INFO L290 TraceCheckUtils]: 15: Hoare triple {2450#true} assume ~id1~0 != ~id3~0; {2450#true} is VALID [2022-02-20 18:32:15,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {2450#true} assume ~id2~0 != ~id3~0; {2450#true} is VALID [2022-02-20 18:32:15,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {2450#true} assume ~id1~0 >= 0; {2450#true} is VALID [2022-02-20 18:32:15,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {2450#true} assume ~id2~0 >= 0; {2450#true} is VALID [2022-02-20 18:32:15,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {2450#true} assume ~id3~0 >= 0; {2450#true} is VALID [2022-02-20 18:32:15,593 INFO L290 TraceCheckUtils]: 20: Hoare triple {2450#true} assume 0 == ~r1~0 % 256; {2450#true} is VALID [2022-02-20 18:32:15,593 INFO L290 TraceCheckUtils]: 21: Hoare triple {2450#true} assume 0 == ~r2~0 % 256; {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:15,593 INFO L290 TraceCheckUtils]: 22: Hoare triple {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~r3~0 % 256; {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:15,594 INFO L290 TraceCheckUtils]: 23: Hoare triple {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r122~0#1 % 256; {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:15,594 INFO L290 TraceCheckUtils]: 24: Hoare triple {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r132~0#1 % 256; {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:15,594 INFO L290 TraceCheckUtils]: 25: Hoare triple {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r212~0#1 % 256; {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:15,594 INFO L290 TraceCheckUtils]: 26: Hoare triple {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r232~0#1 % 256; {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:15,595 INFO L290 TraceCheckUtils]: 27: Hoare triple {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r312~0#1 % 256; {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:15,595 INFO L290 TraceCheckUtils]: 28: Hoare triple {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r322~0#1 % 256; {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:15,595 INFO L290 TraceCheckUtils]: 29: Hoare triple {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max1~0 == ~id1~0; {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:15,596 INFO L290 TraceCheckUtils]: 30: Hoare triple {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max2~0 == ~id2~0; {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:15,596 INFO L290 TraceCheckUtils]: 31: Hoare triple {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max3~0 == ~id3~0; {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:15,596 INFO L290 TraceCheckUtils]: 32: Hoare triple {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st1~0; {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:15,596 INFO L290 TraceCheckUtils]: 33: Hoare triple {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st2~0; {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:15,597 INFO L290 TraceCheckUtils]: 34: Hoare triple {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st3~0; {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:15,597 INFO L290 TraceCheckUtils]: 35: Hoare triple {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl1~0; {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:15,597 INFO L290 TraceCheckUtils]: 36: Hoare triple {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl2~0; {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:15,598 INFO L290 TraceCheckUtils]: 37: Hoare triple {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl3~0; {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:15,598 INFO L290 TraceCheckUtils]: 38: Hoare triple {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode1~0 % 256; {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:15,598 INFO L290 TraceCheckUtils]: 39: Hoare triple {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode2~0 % 256; {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:15,598 INFO L290 TraceCheckUtils]: 40: Hoare triple {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode3~0 % 256; {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:15,599 INFO L290 TraceCheckUtils]: 41: Hoare triple {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != ~newmax1~0 % 256; {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:15,599 INFO L290 TraceCheckUtils]: 42: Hoare triple {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != ~newmax2~0 % 256; {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:15,599 INFO L290 TraceCheckUtils]: 43: Hoare triple {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:15,600 INFO L290 TraceCheckUtils]: 44: Hoare triple {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} init_#res#1 := init_~tmp___5~0#1; {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:15,600 INFO L290 TraceCheckUtils]: 45: Hoare triple {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:15,600 INFO L290 TraceCheckUtils]: 46: Hoare triple {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == assume_abort_if_not_~cond#1); {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:15,600 INFO L290 TraceCheckUtils]: 47: Hoare triple {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:15,601 INFO L290 TraceCheckUtils]: 48: Hoare triple {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:15,601 INFO L290 TraceCheckUtils]: 49: Hoare triple {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~mode1~0 % 256); {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:15,601 INFO L290 TraceCheckUtils]: 50: Hoare triple {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~r1~0 % 256 < 2; {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:15,602 INFO L290 TraceCheckUtils]: 51: Hoare triple {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~ep12~0 % 256); {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:15,602 INFO L290 TraceCheckUtils]: 52: Hoare triple {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~ep13~0 % 256); {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:15,602 INFO L290 TraceCheckUtils]: 53: Hoare triple {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} ~mode1~0 := 1; {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:15,602 INFO L290 TraceCheckUtils]: 54: Hoare triple {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:15,603 INFO L290 TraceCheckUtils]: 55: Hoare triple {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~mode2~0 % 256); {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:32:15,603 INFO L290 TraceCheckUtils]: 56: Hoare triple {2452#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(~r2~0 % 256 < 2); {2451#false} is VALID [2022-02-20 18:32:15,603 INFO L290 TraceCheckUtils]: 57: Hoare triple {2451#false} ~mode2~0 := 1; {2451#false} is VALID [2022-02-20 18:32:15,603 INFO L290 TraceCheckUtils]: 58: Hoare triple {2451#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {2451#false} is VALID [2022-02-20 18:32:15,604 INFO L290 TraceCheckUtils]: 59: Hoare triple {2451#false} assume !(0 != ~mode3~0 % 256); {2451#false} is VALID [2022-02-20 18:32:15,604 INFO L290 TraceCheckUtils]: 60: Hoare triple {2451#false} assume !(~r3~0 % 256 < 2); {2451#false} is VALID [2022-02-20 18:32:15,604 INFO L290 TraceCheckUtils]: 61: Hoare triple {2451#false} ~mode3~0 := 1; {2451#false} is VALID [2022-02-20 18:32:15,604 INFO L290 TraceCheckUtils]: 62: Hoare triple {2451#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {2451#false} is VALID [2022-02-20 18:32:15,604 INFO L290 TraceCheckUtils]: 63: Hoare triple {2451#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {2451#false} is VALID [2022-02-20 18:32:15,604 INFO L290 TraceCheckUtils]: 64: Hoare triple {2451#false} check_#res#1 := check_~tmp~1#1; {2451#false} is VALID [2022-02-20 18:32:15,604 INFO L290 TraceCheckUtils]: 65: Hoare triple {2451#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {2451#false} is VALID [2022-02-20 18:32:15,604 INFO L290 TraceCheckUtils]: 66: Hoare triple {2451#false} assume 0 == assert_~arg#1 % 256; {2451#false} is VALID [2022-02-20 18:32:15,604 INFO L290 TraceCheckUtils]: 67: Hoare triple {2451#false} assume !false; {2451#false} is VALID [2022-02-20 18:32:15,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:32:15,605 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:15,605 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343286686] [2022-02-20 18:32:15,605 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343286686] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:15,605 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:15,605 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:32:15,605 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591834162] [2022-02-20 18:32:15,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:15,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-02-20 18:32:15,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:15,606 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:15,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:15,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:32:15,645 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:15,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:32:15,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:32:15,646 INFO L87 Difference]: Start difference. First operand 206 states and 320 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:15,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:15,919 INFO L93 Difference]: Finished difference Result 482 states and 776 transitions. [2022-02-20 18:32:15,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:32:15,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-02-20 18:32:15,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:32:15,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:15,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 463 transitions. [2022-02-20 18:32:15,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:15,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 463 transitions. [2022-02-20 18:32:15,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 463 transitions. [2022-02-20 18:32:16,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 463 edges. 463 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:16,220 INFO L225 Difference]: With dead ends: 482 [2022-02-20 18:32:16,220 INFO L226 Difference]: Without dead ends: 336 [2022-02-20 18:32:16,220 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 18:32:16,221 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 109 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:32:16,222 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 386 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:32:16,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-02-20 18:32:16,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2022-02-20 18:32:16,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:16,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 336 states. Second operand has 334 states, 333 states have (on average 1.5945945945945945) internal successors, (531), 333 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:16,254 INFO L74 IsIncluded]: Start isIncluded. First operand 336 states. Second operand has 334 states, 333 states have (on average 1.5945945945945945) internal successors, (531), 333 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:16,254 INFO L87 Difference]: Start difference. First operand 336 states. Second operand has 334 states, 333 states have (on average 1.5945945945945945) internal successors, (531), 333 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:16,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:16,261 INFO L93 Difference]: Finished difference Result 336 states and 532 transitions. [2022-02-20 18:32:16,261 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 532 transitions. [2022-02-20 18:32:16,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:16,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:16,263 INFO L74 IsIncluded]: Start isIncluded. First operand has 334 states, 333 states have (on average 1.5945945945945945) internal successors, (531), 333 states have internal predecessors, (531), 0 states have call successors, (0), 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 336 states. [2022-02-20 18:32:16,263 INFO L87 Difference]: Start difference. First operand has 334 states, 333 states have (on average 1.5945945945945945) internal successors, (531), 333 states have internal predecessors, (531), 0 states have call successors, (0), 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 336 states. [2022-02-20 18:32:16,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:16,269 INFO L93 Difference]: Finished difference Result 336 states and 532 transitions. [2022-02-20 18:32:16,270 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 532 transitions. [2022-02-20 18:32:16,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:16,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:16,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:16,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:16,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 1.5945945945945945) internal successors, (531), 333 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:16,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 531 transitions. [2022-02-20 18:32:16,277 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 531 transitions. Word has length 68 [2022-02-20 18:32:16,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:16,277 INFO L470 AbstractCegarLoop]: Abstraction has 334 states and 531 transitions. [2022-02-20 18:32:16,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:16,278 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 531 transitions. [2022-02-20 18:32:16,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-20 18:32:16,278 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:16,279 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:32:16,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:32:16,279 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:16,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:16,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1295175881, now seen corresponding path program 1 times [2022-02-20 18:32:16,280 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:16,280 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706055099] [2022-02-20 18:32:16,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:16,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:16,350 INFO L290 TraceCheckUtils]: 0: Hoare triple {4025#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(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {4025#true} is VALID [2022-02-20 18:32:16,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {4025#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {4025#true} is VALID [2022-02-20 18:32:16,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {4025#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {4025#true} is VALID [2022-02-20 18:32:16,350 INFO L290 TraceCheckUtils]: 3: Hoare triple {4025#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {4025#true} is VALID [2022-02-20 18:32:16,351 INFO L290 TraceCheckUtils]: 4: Hoare triple {4025#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {4025#true} is VALID [2022-02-20 18:32:16,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {4025#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {4025#true} is VALID [2022-02-20 18:32:16,351 INFO L290 TraceCheckUtils]: 6: Hoare triple {4025#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {4025#true} is VALID [2022-02-20 18:32:16,351 INFO L290 TraceCheckUtils]: 7: Hoare triple {4025#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {4025#true} is VALID [2022-02-20 18:32:16,351 INFO L290 TraceCheckUtils]: 8: Hoare triple {4025#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {4025#true} is VALID [2022-02-20 18:32:16,351 INFO L290 TraceCheckUtils]: 9: Hoare triple {4025#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {4025#true} is VALID [2022-02-20 18:32:16,351 INFO L290 TraceCheckUtils]: 10: Hoare triple {4025#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {4025#true} is VALID [2022-02-20 18:32:16,352 INFO L290 TraceCheckUtils]: 11: Hoare triple {4025#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {4025#true} is VALID [2022-02-20 18:32:16,352 INFO L290 TraceCheckUtils]: 12: Hoare triple {4025#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {4025#true} is VALID [2022-02-20 18:32:16,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {4025#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {4025#true} is VALID [2022-02-20 18:32:16,352 INFO L290 TraceCheckUtils]: 14: Hoare triple {4025#true} assume ~id1~0 != ~id2~0; {4025#true} is VALID [2022-02-20 18:32:16,352 INFO L290 TraceCheckUtils]: 15: Hoare triple {4025#true} assume ~id1~0 != ~id3~0; {4025#true} is VALID [2022-02-20 18:32:16,352 INFO L290 TraceCheckUtils]: 16: Hoare triple {4025#true} assume ~id2~0 != ~id3~0; {4025#true} is VALID [2022-02-20 18:32:16,352 INFO L290 TraceCheckUtils]: 17: Hoare triple {4025#true} assume ~id1~0 >= 0; {4025#true} is VALID [2022-02-20 18:32:16,353 INFO L290 TraceCheckUtils]: 18: Hoare triple {4025#true} assume ~id2~0 >= 0; {4025#true} is VALID [2022-02-20 18:32:16,353 INFO L290 TraceCheckUtils]: 19: Hoare triple {4025#true} assume ~id3~0 >= 0; {4025#true} is VALID [2022-02-20 18:32:16,353 INFO L290 TraceCheckUtils]: 20: Hoare triple {4025#true} assume 0 == ~r1~0 % 256; {4025#true} is VALID [2022-02-20 18:32:16,353 INFO L290 TraceCheckUtils]: 21: Hoare triple {4025#true} assume 0 == ~r2~0 % 256; {4025#true} is VALID [2022-02-20 18:32:16,353 INFO L290 TraceCheckUtils]: 22: Hoare triple {4025#true} assume 0 == ~r3~0 % 256; {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:16,354 INFO L290 TraceCheckUtils]: 23: Hoare triple {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r122~0#1 % 256; {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:16,354 INFO L290 TraceCheckUtils]: 24: Hoare triple {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r132~0#1 % 256; {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:16,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r212~0#1 % 256; {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:16,355 INFO L290 TraceCheckUtils]: 26: Hoare triple {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r232~0#1 % 256; {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:16,355 INFO L290 TraceCheckUtils]: 27: Hoare triple {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r312~0#1 % 256; {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:16,355 INFO L290 TraceCheckUtils]: 28: Hoare triple {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r322~0#1 % 256; {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:16,356 INFO L290 TraceCheckUtils]: 29: Hoare triple {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max1~0 == ~id1~0; {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:16,356 INFO L290 TraceCheckUtils]: 30: Hoare triple {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max2~0 == ~id2~0; {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:16,356 INFO L290 TraceCheckUtils]: 31: Hoare triple {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max3~0 == ~id3~0; {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:16,356 INFO L290 TraceCheckUtils]: 32: Hoare triple {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st1~0; {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:16,357 INFO L290 TraceCheckUtils]: 33: Hoare triple {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st2~0; {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:16,357 INFO L290 TraceCheckUtils]: 34: Hoare triple {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st3~0; {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:16,357 INFO L290 TraceCheckUtils]: 35: Hoare triple {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl1~0; {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:16,358 INFO L290 TraceCheckUtils]: 36: Hoare triple {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl2~0; {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:16,358 INFO L290 TraceCheckUtils]: 37: Hoare triple {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl3~0; {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:16,358 INFO L290 TraceCheckUtils]: 38: Hoare triple {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode1~0 % 256; {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:16,359 INFO L290 TraceCheckUtils]: 39: Hoare triple {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode2~0 % 256; {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:16,359 INFO L290 TraceCheckUtils]: 40: Hoare triple {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode3~0 % 256; {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:16,359 INFO L290 TraceCheckUtils]: 41: Hoare triple {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != ~newmax1~0 % 256; {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:16,359 INFO L290 TraceCheckUtils]: 42: Hoare triple {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != ~newmax2~0 % 256; {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:16,360 INFO L290 TraceCheckUtils]: 43: Hoare triple {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:16,360 INFO L290 TraceCheckUtils]: 44: Hoare triple {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} init_#res#1 := init_~tmp___5~0#1; {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:16,360 INFO L290 TraceCheckUtils]: 45: Hoare triple {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:16,361 INFO L290 TraceCheckUtils]: 46: Hoare triple {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == assume_abort_if_not_~cond#1); {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:16,361 INFO L290 TraceCheckUtils]: 47: Hoare triple {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:16,361 INFO L290 TraceCheckUtils]: 48: Hoare triple {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:16,361 INFO L290 TraceCheckUtils]: 49: Hoare triple {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~mode1~0 % 256); {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:16,362 INFO L290 TraceCheckUtils]: 50: Hoare triple {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~r1~0 % 256 < 2; {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:16,362 INFO L290 TraceCheckUtils]: 51: Hoare triple {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep12~0 % 256); {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:16,362 INFO L290 TraceCheckUtils]: 52: Hoare triple {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep13~0 % 256); {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:16,363 INFO L290 TraceCheckUtils]: 53: Hoare triple {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} ~mode1~0 := 1; {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:16,363 INFO L290 TraceCheckUtils]: 54: Hoare triple {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:16,363 INFO L290 TraceCheckUtils]: 55: Hoare triple {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~mode2~0 % 256); {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:16,364 INFO L290 TraceCheckUtils]: 56: Hoare triple {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~r2~0 % 256 < 2; {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:16,364 INFO L290 TraceCheckUtils]: 57: Hoare triple {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep21~0 % 256); {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:16,364 INFO L290 TraceCheckUtils]: 58: Hoare triple {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep23~0 % 256); {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:16,364 INFO L290 TraceCheckUtils]: 59: Hoare triple {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} ~mode2~0 := 1; {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:16,365 INFO L290 TraceCheckUtils]: 60: Hoare triple {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:16,365 INFO L290 TraceCheckUtils]: 61: Hoare triple {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~mode3~0 % 256); {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:32:16,365 INFO L290 TraceCheckUtils]: 62: Hoare triple {4027#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(~r3~0 % 256 < 2); {4026#false} is VALID [2022-02-20 18:32:16,366 INFO L290 TraceCheckUtils]: 63: Hoare triple {4026#false} ~mode3~0 := 1; {4026#false} is VALID [2022-02-20 18:32:16,366 INFO L290 TraceCheckUtils]: 64: Hoare triple {4026#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {4026#false} is VALID [2022-02-20 18:32:16,366 INFO L290 TraceCheckUtils]: 65: Hoare triple {4026#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {4026#false} is VALID [2022-02-20 18:32:16,366 INFO L290 TraceCheckUtils]: 66: Hoare triple {4026#false} check_#res#1 := check_~tmp~1#1; {4026#false} is VALID [2022-02-20 18:32:16,366 INFO L290 TraceCheckUtils]: 67: Hoare triple {4026#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {4026#false} is VALID [2022-02-20 18:32:16,366 INFO L290 TraceCheckUtils]: 68: Hoare triple {4026#false} assume 0 == assert_~arg#1 % 256; {4026#false} is VALID [2022-02-20 18:32:16,366 INFO L290 TraceCheckUtils]: 69: Hoare triple {4026#false} assume !false; {4026#false} is VALID [2022-02-20 18:32:16,367 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 18:32:16,367 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:16,367 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706055099] [2022-02-20 18:32:16,367 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706055099] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:16,367 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:16,368 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:32:16,368 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771142517] [2022-02-20 18:32:16,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:16,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2022-02-20 18:32:16,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:16,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:16,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:16,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:32:16,416 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:16,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:32:16,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:32:16,417 INFO L87 Difference]: Start difference. First operand 334 states and 531 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:16,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:16,683 INFO L93 Difference]: Finished difference Result 850 states and 1381 transitions. [2022-02-20 18:32:16,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:32:16,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2022-02-20 18:32:16,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:32:16,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:16,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 463 transitions. [2022-02-20 18:32:16,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:16,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 463 transitions. [2022-02-20 18:32:16,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 463 transitions. [2022-02-20 18:32:16,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 463 edges. 463 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:16,979 INFO L225 Difference]: With dead ends: 850 [2022-02-20 18:32:16,979 INFO L226 Difference]: Without dead ends: 576 [2022-02-20 18:32:16,981 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 18:32:16,989 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 103 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:32:16,990 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 387 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:32:16,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2022-02-20 18:32:17,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 574. [2022-02-20 18:32:17,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:17,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 576 states. Second operand has 574 states, 573 states have (on average 1.6108202443280977) internal successors, (923), 573 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:17,054 INFO L74 IsIncluded]: Start isIncluded. First operand 576 states. Second operand has 574 states, 573 states have (on average 1.6108202443280977) internal successors, (923), 573 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:17,055 INFO L87 Difference]: Start difference. First operand 576 states. Second operand has 574 states, 573 states have (on average 1.6108202443280977) internal successors, (923), 573 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:17,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:17,071 INFO L93 Difference]: Finished difference Result 576 states and 924 transitions. [2022-02-20 18:32:17,071 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 924 transitions. [2022-02-20 18:32:17,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:17,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:17,072 INFO L74 IsIncluded]: Start isIncluded. First operand has 574 states, 573 states have (on average 1.6108202443280977) internal successors, (923), 573 states have internal predecessors, (923), 0 states have call successors, (0), 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 576 states. [2022-02-20 18:32:17,073 INFO L87 Difference]: Start difference. First operand has 574 states, 573 states have (on average 1.6108202443280977) internal successors, (923), 573 states have internal predecessors, (923), 0 states have call successors, (0), 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 576 states. [2022-02-20 18:32:17,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:17,085 INFO L93 Difference]: Finished difference Result 576 states and 924 transitions. [2022-02-20 18:32:17,085 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 924 transitions. [2022-02-20 18:32:17,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:17,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:17,086 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:17,086 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:17,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 573 states have (on average 1.6108202443280977) internal successors, (923), 573 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:17,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 923 transitions. [2022-02-20 18:32:17,099 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 923 transitions. Word has length 70 [2022-02-20 18:32:17,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:17,099 INFO L470 AbstractCegarLoop]: Abstraction has 574 states and 923 transitions. [2022-02-20 18:32:17,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:17,100 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 923 transitions. [2022-02-20 18:32:17,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 18:32:17,100 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:17,100 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:32:17,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:32:17,100 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:17,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:17,101 INFO L85 PathProgramCache]: Analyzing trace with hash -367652834, now seen corresponding path program 1 times [2022-02-20 18:32:17,101 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:17,101 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385093863] [2022-02-20 18:32:17,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:17,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:17,159 INFO L290 TraceCheckUtils]: 0: Hoare triple {6768#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(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {6768#true} is VALID [2022-02-20 18:32:17,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {6768#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {6768#true} is VALID [2022-02-20 18:32:17,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {6768#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {6768#true} is VALID [2022-02-20 18:32:17,159 INFO L290 TraceCheckUtils]: 3: Hoare triple {6768#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {6768#true} is VALID [2022-02-20 18:32:17,159 INFO L290 TraceCheckUtils]: 4: Hoare triple {6768#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {6768#true} is VALID [2022-02-20 18:32:17,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {6768#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {6768#true} is VALID [2022-02-20 18:32:17,159 INFO L290 TraceCheckUtils]: 6: Hoare triple {6768#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {6768#true} is VALID [2022-02-20 18:32:17,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {6768#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {6768#true} is VALID [2022-02-20 18:32:17,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {6768#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {6768#true} is VALID [2022-02-20 18:32:17,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {6768#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {6768#true} is VALID [2022-02-20 18:32:17,160 INFO L290 TraceCheckUtils]: 10: Hoare triple {6768#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {6768#true} is VALID [2022-02-20 18:32:17,160 INFO L290 TraceCheckUtils]: 11: Hoare triple {6768#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {6768#true} is VALID [2022-02-20 18:32:17,160 INFO L290 TraceCheckUtils]: 12: Hoare triple {6768#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {6768#true} is VALID [2022-02-20 18:32:17,160 INFO L290 TraceCheckUtils]: 13: Hoare triple {6768#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {6768#true} is VALID [2022-02-20 18:32:17,160 INFO L290 TraceCheckUtils]: 14: Hoare triple {6768#true} assume ~id1~0 != ~id2~0; {6768#true} is VALID [2022-02-20 18:32:17,160 INFO L290 TraceCheckUtils]: 15: Hoare triple {6768#true} assume ~id1~0 != ~id3~0; {6768#true} is VALID [2022-02-20 18:32:17,160 INFO L290 TraceCheckUtils]: 16: Hoare triple {6768#true} assume ~id2~0 != ~id3~0; {6768#true} is VALID [2022-02-20 18:32:17,160 INFO L290 TraceCheckUtils]: 17: Hoare triple {6768#true} assume ~id1~0 >= 0; {6768#true} is VALID [2022-02-20 18:32:17,160 INFO L290 TraceCheckUtils]: 18: Hoare triple {6768#true} assume ~id2~0 >= 0; {6768#true} is VALID [2022-02-20 18:32:17,160 INFO L290 TraceCheckUtils]: 19: Hoare triple {6768#true} assume ~id3~0 >= 0; {6768#true} is VALID [2022-02-20 18:32:17,160 INFO L290 TraceCheckUtils]: 20: Hoare triple {6768#true} assume 0 == ~r1~0 % 256; {6768#true} is VALID [2022-02-20 18:32:17,160 INFO L290 TraceCheckUtils]: 21: Hoare triple {6768#true} assume 0 == ~r2~0 % 256; {6768#true} is VALID [2022-02-20 18:32:17,161 INFO L290 TraceCheckUtils]: 22: Hoare triple {6768#true} assume 0 == ~r3~0 % 256; {6768#true} is VALID [2022-02-20 18:32:17,161 INFO L290 TraceCheckUtils]: 23: Hoare triple {6768#true} assume 0 != init_~r122~0#1 % 256; {6768#true} is VALID [2022-02-20 18:32:17,161 INFO L290 TraceCheckUtils]: 24: Hoare triple {6768#true} assume 0 != init_~r132~0#1 % 256; {6768#true} is VALID [2022-02-20 18:32:17,161 INFO L290 TraceCheckUtils]: 25: Hoare triple {6768#true} assume 0 != init_~r212~0#1 % 256; {6768#true} is VALID [2022-02-20 18:32:17,161 INFO L290 TraceCheckUtils]: 26: Hoare triple {6768#true} assume 0 != init_~r232~0#1 % 256; {6768#true} is VALID [2022-02-20 18:32:17,161 INFO L290 TraceCheckUtils]: 27: Hoare triple {6768#true} assume 0 != init_~r312~0#1 % 256; {6768#true} is VALID [2022-02-20 18:32:17,161 INFO L290 TraceCheckUtils]: 28: Hoare triple {6768#true} assume 0 != init_~r322~0#1 % 256; {6768#true} is VALID [2022-02-20 18:32:17,161 INFO L290 TraceCheckUtils]: 29: Hoare triple {6768#true} assume ~max1~0 == ~id1~0; {6768#true} is VALID [2022-02-20 18:32:17,161 INFO L290 TraceCheckUtils]: 30: Hoare triple {6768#true} assume ~max2~0 == ~id2~0; {6768#true} is VALID [2022-02-20 18:32:17,161 INFO L290 TraceCheckUtils]: 31: Hoare triple {6768#true} assume ~max3~0 == ~id3~0; {6768#true} is VALID [2022-02-20 18:32:17,162 INFO L290 TraceCheckUtils]: 32: Hoare triple {6768#true} assume 0 == ~st1~0; {6770#(<= ~st1~0 0)} is VALID [2022-02-20 18:32:17,162 INFO L290 TraceCheckUtils]: 33: Hoare triple {6770#(<= ~st1~0 0)} assume 0 == ~st2~0; {6771#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:17,162 INFO L290 TraceCheckUtils]: 34: Hoare triple {6771#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:17,163 INFO L290 TraceCheckUtils]: 35: Hoare triple {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl1~0; {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:17,163 INFO L290 TraceCheckUtils]: 36: Hoare triple {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl2~0; {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:17,163 INFO L290 TraceCheckUtils]: 37: Hoare triple {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl3~0; {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:17,163 INFO L290 TraceCheckUtils]: 38: Hoare triple {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:17,164 INFO L290 TraceCheckUtils]: 39: Hoare triple {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:17,164 INFO L290 TraceCheckUtils]: 40: Hoare triple {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:17,164 INFO L290 TraceCheckUtils]: 41: Hoare triple {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~newmax1~0 % 256; {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:17,164 INFO L290 TraceCheckUtils]: 42: Hoare triple {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~newmax2~0 % 256; {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:17,165 INFO L290 TraceCheckUtils]: 43: Hoare triple {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:17,165 INFO L290 TraceCheckUtils]: 44: Hoare triple {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:17,165 INFO L290 TraceCheckUtils]: 45: Hoare triple {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:17,166 INFO L290 TraceCheckUtils]: 46: Hoare triple {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:17,166 INFO L290 TraceCheckUtils]: 47: Hoare triple {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:17,166 INFO L290 TraceCheckUtils]: 48: Hoare triple {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:17,166 INFO L290 TraceCheckUtils]: 49: Hoare triple {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:17,167 INFO L290 TraceCheckUtils]: 50: Hoare triple {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 2; {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:17,167 INFO L290 TraceCheckUtils]: 51: Hoare triple {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep12~0 % 256); {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:17,167 INFO L290 TraceCheckUtils]: 52: Hoare triple {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep13~0 % 256); {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:17,167 INFO L290 TraceCheckUtils]: 53: Hoare triple {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:17,168 INFO L290 TraceCheckUtils]: 54: Hoare triple {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:17,168 INFO L290 TraceCheckUtils]: 55: Hoare triple {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:17,168 INFO L290 TraceCheckUtils]: 56: Hoare triple {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r2~0 % 256 < 2; {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:17,168 INFO L290 TraceCheckUtils]: 57: Hoare triple {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep21~0 % 256); {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:17,169 INFO L290 TraceCheckUtils]: 58: Hoare triple {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep23~0 % 256); {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:17,169 INFO L290 TraceCheckUtils]: 59: Hoare triple {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:17,169 INFO L290 TraceCheckUtils]: 60: Hoare triple {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:17,169 INFO L290 TraceCheckUtils]: 61: Hoare triple {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:17,170 INFO L290 TraceCheckUtils]: 62: Hoare triple {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r3~0 % 256 < 2; {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:17,170 INFO L290 TraceCheckUtils]: 63: Hoare triple {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep31~0 % 256); {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:17,170 INFO L290 TraceCheckUtils]: 64: Hoare triple {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep32~0 % 256); {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:17,171 INFO L290 TraceCheckUtils]: 65: Hoare triple {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:17,171 INFO L290 TraceCheckUtils]: 66: Hoare triple {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:17,171 INFO L290 TraceCheckUtils]: 67: Hoare triple {6772#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {6769#false} is VALID [2022-02-20 18:32:17,171 INFO L290 TraceCheckUtils]: 68: Hoare triple {6769#false} check_#res#1 := check_~tmp~1#1; {6769#false} is VALID [2022-02-20 18:32:17,171 INFO L290 TraceCheckUtils]: 69: Hoare triple {6769#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {6769#false} is VALID [2022-02-20 18:32:17,171 INFO L290 TraceCheckUtils]: 70: Hoare triple {6769#false} assume 0 == assert_~arg#1 % 256; {6769#false} is VALID [2022-02-20 18:32:17,172 INFO L290 TraceCheckUtils]: 71: Hoare triple {6769#false} assume !false; {6769#false} is VALID [2022-02-20 18:32:17,172 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 18:32:17,172 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:17,172 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385093863] [2022-02-20 18:32:17,172 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385093863] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:17,172 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:17,172 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:32:17,172 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012398489] [2022-02-20 18:32:17,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:17,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2022-02-20 18:32:17,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:17,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:17,211 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:17,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:32:17,211 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:17,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:32:17,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:32:17,212 INFO L87 Difference]: Start difference. First operand 574 states and 923 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:18,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:18,397 INFO L93 Difference]: Finished difference Result 2450 states and 4045 transitions. [2022-02-20 18:32:18,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:32:18,397 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2022-02-20 18:32:18,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:32:18,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:18,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1009 transitions. [2022-02-20 18:32:18,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:18,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1009 transitions. [2022-02-20 18:32:18,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1009 transitions. [2022-02-20 18:32:18,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1009 edges. 1009 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:19,111 INFO L225 Difference]: With dead ends: 2450 [2022-02-20 18:32:19,112 INFO L226 Difference]: Without dead ends: 1936 [2022-02-20 18:32:19,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:32:19,113 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 778 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:32:19,113 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [778 Valid, 1306 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:32:19,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936 states. [2022-02-20 18:32:19,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936 to 1023. [2022-02-20 18:32:19,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:19,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1936 states. Second operand has 1023 states, 1022 states have (on average 1.6252446183953033) internal successors, (1661), 1022 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:19,294 INFO L74 IsIncluded]: Start isIncluded. First operand 1936 states. Second operand has 1023 states, 1022 states have (on average 1.6252446183953033) internal successors, (1661), 1022 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:19,295 INFO L87 Difference]: Start difference. First operand 1936 states. Second operand has 1023 states, 1022 states have (on average 1.6252446183953033) internal successors, (1661), 1022 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:19,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:19,416 INFO L93 Difference]: Finished difference Result 1936 states and 3174 transitions. [2022-02-20 18:32:19,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 3174 transitions. [2022-02-20 18:32:19,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:19,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:19,421 INFO L74 IsIncluded]: Start isIncluded. First operand has 1023 states, 1022 states have (on average 1.6252446183953033) internal successors, (1661), 1022 states have internal predecessors, (1661), 0 states have call successors, (0), 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 1936 states. [2022-02-20 18:32:19,422 INFO L87 Difference]: Start difference. First operand has 1023 states, 1022 states have (on average 1.6252446183953033) internal successors, (1661), 1022 states have internal predecessors, (1661), 0 states have call successors, (0), 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 1936 states. [2022-02-20 18:32:19,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:19,528 INFO L93 Difference]: Finished difference Result 1936 states and 3174 transitions. [2022-02-20 18:32:19,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 3174 transitions. [2022-02-20 18:32:19,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:19,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:19,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:19,531 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:19,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1022 states have (on average 1.6252446183953033) internal successors, (1661), 1022 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:19,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1661 transitions. [2022-02-20 18:32:19,567 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1661 transitions. Word has length 72 [2022-02-20 18:32:19,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:19,568 INFO L470 AbstractCegarLoop]: Abstraction has 1023 states and 1661 transitions. [2022-02-20 18:32:19,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:19,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1661 transitions. [2022-02-20 18:32:19,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 18:32:19,569 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:19,569 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:32:19,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:32:19,569 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:19,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:19,570 INFO L85 PathProgramCache]: Analyzing trace with hash -435168554, now seen corresponding path program 1 times [2022-02-20 18:32:19,570 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:19,570 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002817533] [2022-02-20 18:32:19,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:19,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:19,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:19,632 INFO L290 TraceCheckUtils]: 0: Hoare triple {14516#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(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {14516#true} is VALID [2022-02-20 18:32:19,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {14516#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {14516#true} is VALID [2022-02-20 18:32:19,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {14516#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {14516#true} is VALID [2022-02-20 18:32:19,633 INFO L290 TraceCheckUtils]: 3: Hoare triple {14516#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {14516#true} is VALID [2022-02-20 18:32:19,633 INFO L290 TraceCheckUtils]: 4: Hoare triple {14516#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {14516#true} is VALID [2022-02-20 18:32:19,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {14516#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {14516#true} is VALID [2022-02-20 18:32:19,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {14516#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {14516#true} is VALID [2022-02-20 18:32:19,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {14516#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {14516#true} is VALID [2022-02-20 18:32:19,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {14516#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {14516#true} is VALID [2022-02-20 18:32:19,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {14516#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {14516#true} is VALID [2022-02-20 18:32:19,634 INFO L290 TraceCheckUtils]: 10: Hoare triple {14516#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {14516#true} is VALID [2022-02-20 18:32:19,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {14516#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {14516#true} is VALID [2022-02-20 18:32:19,634 INFO L290 TraceCheckUtils]: 12: Hoare triple {14516#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {14516#true} is VALID [2022-02-20 18:32:19,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {14516#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {14516#true} is VALID [2022-02-20 18:32:19,635 INFO L290 TraceCheckUtils]: 14: Hoare triple {14516#true} assume ~id1~0 != ~id2~0; {14516#true} is VALID [2022-02-20 18:32:19,635 INFO L290 TraceCheckUtils]: 15: Hoare triple {14516#true} assume ~id1~0 != ~id3~0; {14516#true} is VALID [2022-02-20 18:32:19,635 INFO L290 TraceCheckUtils]: 16: Hoare triple {14516#true} assume ~id2~0 != ~id3~0; {14516#true} is VALID [2022-02-20 18:32:19,635 INFO L290 TraceCheckUtils]: 17: Hoare triple {14516#true} assume ~id1~0 >= 0; {14516#true} is VALID [2022-02-20 18:32:19,635 INFO L290 TraceCheckUtils]: 18: Hoare triple {14516#true} assume ~id2~0 >= 0; {14516#true} is VALID [2022-02-20 18:32:19,635 INFO L290 TraceCheckUtils]: 19: Hoare triple {14516#true} assume ~id3~0 >= 0; {14516#true} is VALID [2022-02-20 18:32:19,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {14516#true} assume 0 == ~r1~0 % 256; {14516#true} is VALID [2022-02-20 18:32:19,636 INFO L290 TraceCheckUtils]: 21: Hoare triple {14516#true} assume 0 == ~r2~0 % 256; {14516#true} is VALID [2022-02-20 18:32:19,636 INFO L290 TraceCheckUtils]: 22: Hoare triple {14516#true} assume 0 == ~r3~0 % 256; {14516#true} is VALID [2022-02-20 18:32:19,636 INFO L290 TraceCheckUtils]: 23: Hoare triple {14516#true} assume 0 != init_~r122~0#1 % 256; {14516#true} is VALID [2022-02-20 18:32:19,638 INFO L290 TraceCheckUtils]: 24: Hoare triple {14516#true} assume 0 != init_~r132~0#1 % 256; {14516#true} is VALID [2022-02-20 18:32:19,639 INFO L290 TraceCheckUtils]: 25: Hoare triple {14516#true} assume 0 != init_~r212~0#1 % 256; {14516#true} is VALID [2022-02-20 18:32:19,644 INFO L290 TraceCheckUtils]: 26: Hoare triple {14516#true} assume 0 != init_~r232~0#1 % 256; {14516#true} is VALID [2022-02-20 18:32:19,645 INFO L290 TraceCheckUtils]: 27: Hoare triple {14516#true} assume 0 != init_~r312~0#1 % 256; {14516#true} is VALID [2022-02-20 18:32:19,645 INFO L290 TraceCheckUtils]: 28: Hoare triple {14516#true} assume 0 != init_~r322~0#1 % 256; {14516#true} is VALID [2022-02-20 18:32:19,645 INFO L290 TraceCheckUtils]: 29: Hoare triple {14516#true} assume ~max1~0 == ~id1~0; {14516#true} is VALID [2022-02-20 18:32:19,646 INFO L290 TraceCheckUtils]: 30: Hoare triple {14516#true} assume ~max2~0 == ~id2~0; {14516#true} is VALID [2022-02-20 18:32:19,648 INFO L290 TraceCheckUtils]: 31: Hoare triple {14516#true} assume ~max3~0 == ~id3~0; {14516#true} is VALID [2022-02-20 18:32:19,649 INFO L290 TraceCheckUtils]: 32: Hoare triple {14516#true} assume 0 == ~st1~0; {14518#(<= ~st1~0 0)} is VALID [2022-02-20 18:32:19,651 INFO L290 TraceCheckUtils]: 33: Hoare triple {14518#(<= ~st1~0 0)} assume 0 == ~st2~0; {14518#(<= ~st1~0 0)} is VALID [2022-02-20 18:32:19,653 INFO L290 TraceCheckUtils]: 34: Hoare triple {14518#(<= ~st1~0 0)} assume 0 == ~st3~0; {14518#(<= ~st1~0 0)} is VALID [2022-02-20 18:32:19,653 INFO L290 TraceCheckUtils]: 35: Hoare triple {14518#(<= ~st1~0 0)} assume 0 == ~nl1~0; {14519#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:19,654 INFO L290 TraceCheckUtils]: 36: Hoare triple {14519#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl2~0; {14519#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:19,654 INFO L290 TraceCheckUtils]: 37: Hoare triple {14519#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl3~0; {14519#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:19,654 INFO L290 TraceCheckUtils]: 38: Hoare triple {14519#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {14519#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:19,654 INFO L290 TraceCheckUtils]: 39: Hoare triple {14519#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {14519#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:19,655 INFO L290 TraceCheckUtils]: 40: Hoare triple {14519#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {14519#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:19,655 INFO L290 TraceCheckUtils]: 41: Hoare triple {14519#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 != ~newmax1~0 % 256; {14519#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:19,655 INFO L290 TraceCheckUtils]: 42: Hoare triple {14519#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 != ~newmax2~0 % 256; {14519#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:19,656 INFO L290 TraceCheckUtils]: 43: Hoare triple {14519#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {14519#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:19,656 INFO L290 TraceCheckUtils]: 44: Hoare triple {14519#(<= (+ ~nl1~0 ~st1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {14519#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:19,656 INFO L290 TraceCheckUtils]: 45: Hoare triple {14519#(<= (+ ~nl1~0 ~st1~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {14519#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:19,656 INFO L290 TraceCheckUtils]: 46: Hoare triple {14519#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {14519#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:19,657 INFO L290 TraceCheckUtils]: 47: Hoare triple {14519#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {14519#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:19,657 INFO L290 TraceCheckUtils]: 48: Hoare triple {14519#(<= (+ ~nl1~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {14519#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:19,657 INFO L290 TraceCheckUtils]: 49: Hoare triple {14519#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {14519#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:19,657 INFO L290 TraceCheckUtils]: 50: Hoare triple {14519#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r1~0 % 256 < 2; {14519#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:19,658 INFO L290 TraceCheckUtils]: 51: Hoare triple {14519#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep12~0 % 256); {14519#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:19,658 INFO L290 TraceCheckUtils]: 52: Hoare triple {14519#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep13~0 % 256); {14519#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:19,658 INFO L290 TraceCheckUtils]: 53: Hoare triple {14519#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode1~0 := 1; {14519#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:19,658 INFO L290 TraceCheckUtils]: 54: Hoare triple {14519#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {14519#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:19,659 INFO L290 TraceCheckUtils]: 55: Hoare triple {14519#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {14519#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:19,659 INFO L290 TraceCheckUtils]: 56: Hoare triple {14519#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r2~0 % 256 < 2; {14519#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:19,659 INFO L290 TraceCheckUtils]: 57: Hoare triple {14519#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep21~0 % 256); {14519#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:19,660 INFO L290 TraceCheckUtils]: 58: Hoare triple {14519#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep23~0 % 256); {14519#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:19,660 INFO L290 TraceCheckUtils]: 59: Hoare triple {14519#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode2~0 := 1; {14519#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:19,660 INFO L290 TraceCheckUtils]: 60: Hoare triple {14519#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {14519#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:19,660 INFO L290 TraceCheckUtils]: 61: Hoare triple {14519#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {14519#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:19,661 INFO L290 TraceCheckUtils]: 62: Hoare triple {14519#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r3~0 % 256 < 2; {14519#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:19,661 INFO L290 TraceCheckUtils]: 63: Hoare triple {14519#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep31~0 % 256); {14519#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:19,661 INFO L290 TraceCheckUtils]: 64: Hoare triple {14519#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep32~0 % 256); {14519#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:19,661 INFO L290 TraceCheckUtils]: 65: Hoare triple {14519#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode3~0 := 1; {14519#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:19,662 INFO L290 TraceCheckUtils]: 66: Hoare triple {14519#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {14519#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:19,662 INFO L290 TraceCheckUtils]: 67: Hoare triple {14519#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {14519#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:32:19,662 INFO L290 TraceCheckUtils]: 68: Hoare triple {14519#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(~st1~0 + ~nl1~0 <= 1);check_~tmp~1#1 := 0; {14517#false} is VALID [2022-02-20 18:32:19,663 INFO L290 TraceCheckUtils]: 69: Hoare triple {14517#false} check_#res#1 := check_~tmp~1#1; {14517#false} is VALID [2022-02-20 18:32:19,663 INFO L290 TraceCheckUtils]: 70: Hoare triple {14517#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {14517#false} is VALID [2022-02-20 18:32:19,663 INFO L290 TraceCheckUtils]: 71: Hoare triple {14517#false} assume 0 == assert_~arg#1 % 256; {14517#false} is VALID [2022-02-20 18:32:19,663 INFO L290 TraceCheckUtils]: 72: Hoare triple {14517#false} assume !false; {14517#false} is VALID [2022-02-20 18:32:19,665 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 18:32:19,665 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:19,665 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002817533] [2022-02-20 18:32:19,666 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002817533] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:19,666 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:19,666 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:32:19,666 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836471105] [2022-02-20 18:32:19,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:19,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2022-02-20 18:32:19,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:19,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:19,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:19,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:32:19,705 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:19,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:32:19,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:32:19,706 INFO L87 Difference]: Start difference. First operand 1023 states and 1661 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:20,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:20,772 INFO L93 Difference]: Finished difference Result 2972 states and 4898 transitions. [2022-02-20 18:32:20,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:32:20,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2022-02-20 18:32:20,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:32:20,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:20,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 610 transitions. [2022-02-20 18:32:20,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:20,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 610 transitions. [2022-02-20 18:32:20,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 610 transitions. [2022-02-20 18:32:21,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 610 edges. 610 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:21,215 INFO L225 Difference]: With dead ends: 2972 [2022-02-20 18:32:21,216 INFO L226 Difference]: Without dead ends: 2009 [2022-02-20 18:32:21,217 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 18:32:21,217 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 385 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:32:21,217 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [385 Valid, 689 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:32:21,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2009 states. [2022-02-20 18:32:21,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2009 to 1507. [2022-02-20 18:32:21,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:21,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2009 states. Second operand has 1507 states, 1506 states have (on average 1.6328021248339974) internal successors, (2459), 1506 states have internal predecessors, (2459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:21,501 INFO L74 IsIncluded]: Start isIncluded. First operand 2009 states. Second operand has 1507 states, 1506 states have (on average 1.6328021248339974) internal successors, (2459), 1506 states have internal predecessors, (2459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:21,503 INFO L87 Difference]: Start difference. First operand 2009 states. Second operand has 1507 states, 1506 states have (on average 1.6328021248339974) internal successors, (2459), 1506 states have internal predecessors, (2459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:21,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:21,614 INFO L93 Difference]: Finished difference Result 2009 states and 3301 transitions. [2022-02-20 18:32:21,614 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 3301 transitions. [2022-02-20 18:32:21,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:21,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:21,620 INFO L74 IsIncluded]: Start isIncluded. First operand has 1507 states, 1506 states have (on average 1.6328021248339974) internal successors, (2459), 1506 states have internal predecessors, (2459), 0 states have call successors, (0), 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 2009 states. [2022-02-20 18:32:21,633 INFO L87 Difference]: Start difference. First operand has 1507 states, 1506 states have (on average 1.6328021248339974) internal successors, (2459), 1506 states have internal predecessors, (2459), 0 states have call successors, (0), 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 2009 states. [2022-02-20 18:32:21,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:21,748 INFO L93 Difference]: Finished difference Result 2009 states and 3301 transitions. [2022-02-20 18:32:21,748 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 3301 transitions. [2022-02-20 18:32:21,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:21,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:21,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:21,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:21,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1507 states, 1506 states have (on average 1.6328021248339974) internal successors, (2459), 1506 states have internal predecessors, (2459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:21,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 2459 transitions. [2022-02-20 18:32:21,816 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 2459 transitions. Word has length 73 [2022-02-20 18:32:21,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:21,816 INFO L470 AbstractCegarLoop]: Abstraction has 1507 states and 2459 transitions. [2022-02-20 18:32:21,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:21,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 2459 transitions. [2022-02-20 18:32:21,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 18:32:21,818 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:21,818 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:32:21,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:32:21,818 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:21,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:21,819 INFO L85 PathProgramCache]: Analyzing trace with hash 152415701, now seen corresponding path program 1 times [2022-02-20 18:32:21,819 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:21,819 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858705496] [2022-02-20 18:32:21,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:21,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:21,867 INFO L290 TraceCheckUtils]: 0: Hoare triple {23525#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(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {23525#true} is VALID [2022-02-20 18:32:21,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {23525#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {23525#true} is VALID [2022-02-20 18:32:21,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {23525#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {23525#true} is VALID [2022-02-20 18:32:21,868 INFO L290 TraceCheckUtils]: 3: Hoare triple {23525#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {23525#true} is VALID [2022-02-20 18:32:21,868 INFO L290 TraceCheckUtils]: 4: Hoare triple {23525#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {23525#true} is VALID [2022-02-20 18:32:21,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {23525#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {23525#true} is VALID [2022-02-20 18:32:21,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {23525#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {23525#true} is VALID [2022-02-20 18:32:21,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {23525#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {23525#true} is VALID [2022-02-20 18:32:21,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {23525#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {23525#true} is VALID [2022-02-20 18:32:21,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {23525#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {23525#true} is VALID [2022-02-20 18:32:21,869 INFO L290 TraceCheckUtils]: 10: Hoare triple {23525#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {23525#true} is VALID [2022-02-20 18:32:21,870 INFO L290 TraceCheckUtils]: 11: Hoare triple {23525#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {23525#true} is VALID [2022-02-20 18:32:21,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {23525#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {23525#true} is VALID [2022-02-20 18:32:21,870 INFO L290 TraceCheckUtils]: 13: Hoare triple {23525#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {23525#true} is VALID [2022-02-20 18:32:21,870 INFO L290 TraceCheckUtils]: 14: Hoare triple {23525#true} assume ~id1~0 != ~id2~0; {23525#true} is VALID [2022-02-20 18:32:21,871 INFO L290 TraceCheckUtils]: 15: Hoare triple {23525#true} assume ~id1~0 != ~id3~0; {23525#true} is VALID [2022-02-20 18:32:21,871 INFO L290 TraceCheckUtils]: 16: Hoare triple {23525#true} assume ~id2~0 != ~id3~0; {23525#true} is VALID [2022-02-20 18:32:21,871 INFO L290 TraceCheckUtils]: 17: Hoare triple {23525#true} assume ~id1~0 >= 0; {23525#true} is VALID [2022-02-20 18:32:21,871 INFO L290 TraceCheckUtils]: 18: Hoare triple {23525#true} assume ~id2~0 >= 0; {23525#true} is VALID [2022-02-20 18:32:21,871 INFO L290 TraceCheckUtils]: 19: Hoare triple {23525#true} assume ~id3~0 >= 0; {23525#true} is VALID [2022-02-20 18:32:21,871 INFO L290 TraceCheckUtils]: 20: Hoare triple {23525#true} assume 0 == ~r1~0 % 256; {23525#true} is VALID [2022-02-20 18:32:21,871 INFO L290 TraceCheckUtils]: 21: Hoare triple {23525#true} assume 0 == ~r2~0 % 256; {23525#true} is VALID [2022-02-20 18:32:21,872 INFO L290 TraceCheckUtils]: 22: Hoare triple {23525#true} assume 0 == ~r3~0 % 256; {23525#true} is VALID [2022-02-20 18:32:21,872 INFO L290 TraceCheckUtils]: 23: Hoare triple {23525#true} assume 0 != init_~r122~0#1 % 256; {23525#true} is VALID [2022-02-20 18:32:21,872 INFO L290 TraceCheckUtils]: 24: Hoare triple {23525#true} assume 0 != init_~r132~0#1 % 256; {23525#true} is VALID [2022-02-20 18:32:21,872 INFO L290 TraceCheckUtils]: 25: Hoare triple {23525#true} assume 0 != init_~r212~0#1 % 256; {23525#true} is VALID [2022-02-20 18:32:21,872 INFO L290 TraceCheckUtils]: 26: Hoare triple {23525#true} assume 0 != init_~r232~0#1 % 256; {23525#true} is VALID [2022-02-20 18:32:21,872 INFO L290 TraceCheckUtils]: 27: Hoare triple {23525#true} assume 0 != init_~r312~0#1 % 256; {23525#true} is VALID [2022-02-20 18:32:21,872 INFO L290 TraceCheckUtils]: 28: Hoare triple {23525#true} assume 0 != init_~r322~0#1 % 256; {23525#true} is VALID [2022-02-20 18:32:21,872 INFO L290 TraceCheckUtils]: 29: Hoare triple {23525#true} assume ~max1~0 == ~id1~0; {23525#true} is VALID [2022-02-20 18:32:21,873 INFO L290 TraceCheckUtils]: 30: Hoare triple {23525#true} assume ~max2~0 == ~id2~0; {23525#true} is VALID [2022-02-20 18:32:21,873 INFO L290 TraceCheckUtils]: 31: Hoare triple {23525#true} assume ~max3~0 == ~id3~0; {23525#true} is VALID [2022-02-20 18:32:21,873 INFO L290 TraceCheckUtils]: 32: Hoare triple {23525#true} assume 0 == ~st1~0; {23525#true} is VALID [2022-02-20 18:32:21,873 INFO L290 TraceCheckUtils]: 33: Hoare triple {23525#true} assume 0 == ~st2~0; {23525#true} is VALID [2022-02-20 18:32:21,873 INFO L290 TraceCheckUtils]: 34: Hoare triple {23525#true} assume 0 == ~st3~0; {23525#true} is VALID [2022-02-20 18:32:21,873 INFO L290 TraceCheckUtils]: 35: Hoare triple {23525#true} assume 0 == ~nl1~0; {23525#true} is VALID [2022-02-20 18:32:21,873 INFO L290 TraceCheckUtils]: 36: Hoare triple {23525#true} assume 0 == ~nl2~0; {23525#true} is VALID [2022-02-20 18:32:21,873 INFO L290 TraceCheckUtils]: 37: Hoare triple {23525#true} assume 0 == ~nl3~0; {23525#true} is VALID [2022-02-20 18:32:21,874 INFO L290 TraceCheckUtils]: 38: Hoare triple {23525#true} assume 0 == ~mode1~0 % 256; {23525#true} is VALID [2022-02-20 18:32:21,874 INFO L290 TraceCheckUtils]: 39: Hoare triple {23525#true} assume 0 == ~mode2~0 % 256; {23527#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:21,875 INFO L290 TraceCheckUtils]: 40: Hoare triple {23527#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {23527#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:21,875 INFO L290 TraceCheckUtils]: 41: Hoare triple {23527#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~newmax1~0 % 256; {23527#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:21,875 INFO L290 TraceCheckUtils]: 42: Hoare triple {23527#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~newmax2~0 % 256; {23527#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:21,876 INFO L290 TraceCheckUtils]: 43: Hoare triple {23527#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {23527#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:21,876 INFO L290 TraceCheckUtils]: 44: Hoare triple {23527#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp___5~0#1; {23527#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:21,876 INFO L290 TraceCheckUtils]: 45: Hoare triple {23527#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {23527#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:21,877 INFO L290 TraceCheckUtils]: 46: Hoare triple {23527#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {23527#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:21,877 INFO L290 TraceCheckUtils]: 47: Hoare triple {23527#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {23527#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:21,877 INFO L290 TraceCheckUtils]: 48: Hoare triple {23527#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {23527#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:21,878 INFO L290 TraceCheckUtils]: 49: Hoare triple {23527#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {23527#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:21,878 INFO L290 TraceCheckUtils]: 50: Hoare triple {23527#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~r1~0 % 256 < 2; {23527#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:21,878 INFO L290 TraceCheckUtils]: 51: Hoare triple {23527#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~ep12~0 % 256); {23527#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:21,879 INFO L290 TraceCheckUtils]: 52: Hoare triple {23527#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~ep13~0 % 256); {23527#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:21,879 INFO L290 TraceCheckUtils]: 53: Hoare triple {23527#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {23527#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:21,879 INFO L290 TraceCheckUtils]: 54: Hoare triple {23527#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {23527#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:21,880 INFO L290 TraceCheckUtils]: 55: Hoare triple {23527#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~mode2~0 % 256;~r2~0 := 1 + ~r2~0 % 256; {23526#false} is VALID [2022-02-20 18:32:21,880 INFO L290 TraceCheckUtils]: 56: Hoare triple {23526#false} assume !(0 != ~ep12~0 % 256); {23526#false} is VALID [2022-02-20 18:32:21,880 INFO L290 TraceCheckUtils]: 57: Hoare triple {23526#false} assume !(0 != ~ep32~0 % 256); {23526#false} is VALID [2022-02-20 18:32:21,880 INFO L290 TraceCheckUtils]: 58: Hoare triple {23526#false} ~newmax2~0 := node2_~newmax~1#1; {23526#false} is VALID [2022-02-20 18:32:21,880 INFO L290 TraceCheckUtils]: 59: Hoare triple {23526#false} assume 2 == ~r2~0 % 256; {23526#false} is VALID [2022-02-20 18:32:21,880 INFO L290 TraceCheckUtils]: 60: Hoare triple {23526#false} assume ~max2~0 == ~id2~0;~st2~0 := 1; {23526#false} is VALID [2022-02-20 18:32:21,881 INFO L290 TraceCheckUtils]: 61: Hoare triple {23526#false} ~mode2~0 := 0; {23526#false} is VALID [2022-02-20 18:32:21,881 INFO L290 TraceCheckUtils]: 62: Hoare triple {23526#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {23526#false} is VALID [2022-02-20 18:32:21,881 INFO L290 TraceCheckUtils]: 63: Hoare triple {23526#false} assume !(0 != ~mode3~0 % 256); {23526#false} is VALID [2022-02-20 18:32:21,881 INFO L290 TraceCheckUtils]: 64: Hoare triple {23526#false} assume ~r3~0 % 256 < 2; {23526#false} is VALID [2022-02-20 18:32:21,881 INFO L290 TraceCheckUtils]: 65: Hoare triple {23526#false} assume !(0 != ~ep31~0 % 256); {23526#false} is VALID [2022-02-20 18:32:21,881 INFO L290 TraceCheckUtils]: 66: Hoare triple {23526#false} assume !(0 != ~ep32~0 % 256); {23526#false} is VALID [2022-02-20 18:32:21,881 INFO L290 TraceCheckUtils]: 67: Hoare triple {23526#false} ~mode3~0 := 1; {23526#false} is VALID [2022-02-20 18:32:21,882 INFO L290 TraceCheckUtils]: 68: Hoare triple {23526#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {23526#false} is VALID [2022-02-20 18:32:21,882 INFO L290 TraceCheckUtils]: 69: Hoare triple {23526#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {23526#false} is VALID [2022-02-20 18:32:21,882 INFO L290 TraceCheckUtils]: 70: Hoare triple {23526#false} check_#res#1 := check_~tmp~1#1; {23526#false} is VALID [2022-02-20 18:32:21,882 INFO L290 TraceCheckUtils]: 71: Hoare triple {23526#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {23526#false} is VALID [2022-02-20 18:32:21,882 INFO L290 TraceCheckUtils]: 72: Hoare triple {23526#false} assume 0 == assert_~arg#1 % 256; {23526#false} is VALID [2022-02-20 18:32:21,882 INFO L290 TraceCheckUtils]: 73: Hoare triple {23526#false} assume !false; {23526#false} is VALID [2022-02-20 18:32:21,883 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 18:32:21,883 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:21,883 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858705496] [2022-02-20 18:32:21,883 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858705496] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:21,883 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:21,883 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:32:21,884 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453545654] [2022-02-20 18:32:21,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:21,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2022-02-20 18:32:21,884 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:21,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:21,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:21,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:32:21,922 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:21,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:32:21,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:32:21,922 INFO L87 Difference]: Start difference. First operand 1507 states and 2459 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:22,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:22,808 INFO L93 Difference]: Finished difference Result 2973 states and 4868 transitions. [2022-02-20 18:32:22,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:32:22,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2022-02-20 18:32:22,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:32:22,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:22,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2022-02-20 18:32:22,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:22,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2022-02-20 18:32:22,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 446 transitions. [2022-02-20 18:32:23,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 446 edges. 446 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:23,202 INFO L225 Difference]: With dead ends: 2973 [2022-02-20 18:32:23,202 INFO L226 Difference]: Without dead ends: 2147 [2022-02-20 18:32:23,203 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 18:32:23,203 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 110 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:32:23,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 456 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:32:23,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2147 states. [2022-02-20 18:32:23,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2147 to 2145. [2022-02-20 18:32:23,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:23,670 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2147 states. Second operand has 2145 states, 2144 states have (on average 1.625) internal successors, (3484), 2144 states have internal predecessors, (3484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:23,672 INFO L74 IsIncluded]: Start isIncluded. First operand 2147 states. Second operand has 2145 states, 2144 states have (on average 1.625) internal successors, (3484), 2144 states have internal predecessors, (3484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:23,674 INFO L87 Difference]: Start difference. First operand 2147 states. Second operand has 2145 states, 2144 states have (on average 1.625) internal successors, (3484), 2144 states have internal predecessors, (3484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:23,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:23,794 INFO L93 Difference]: Finished difference Result 2147 states and 3485 transitions. [2022-02-20 18:32:23,794 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 3485 transitions. [2022-02-20 18:32:23,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:23,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:23,800 INFO L74 IsIncluded]: Start isIncluded. First operand has 2145 states, 2144 states have (on average 1.625) internal successors, (3484), 2144 states have internal predecessors, (3484), 0 states have call successors, (0), 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 2147 states. [2022-02-20 18:32:23,802 INFO L87 Difference]: Start difference. First operand has 2145 states, 2144 states have (on average 1.625) internal successors, (3484), 2144 states have internal predecessors, (3484), 0 states have call successors, (0), 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 2147 states. [2022-02-20 18:32:23,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:23,925 INFO L93 Difference]: Finished difference Result 2147 states and 3485 transitions. [2022-02-20 18:32:23,925 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 3485 transitions. [2022-02-20 18:32:23,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:23,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:23,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:23,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:23,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2145 states, 2144 states have (on average 1.625) internal successors, (3484), 2144 states have internal predecessors, (3484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:24,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 3484 transitions. [2022-02-20 18:32:24,071 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 3484 transitions. Word has length 74 [2022-02-20 18:32:24,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:24,071 INFO L470 AbstractCegarLoop]: Abstraction has 2145 states and 3484 transitions. [2022-02-20 18:32:24,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:24,072 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 3484 transitions. [2022-02-20 18:32:24,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 18:32:24,072 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:24,073 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:32:24,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:32:24,073 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:24,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:24,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1935815765, now seen corresponding path program 1 times [2022-02-20 18:32:24,074 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:24,074 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112647837] [2022-02-20 18:32:24,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:24,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:24,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {33558#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(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {33558#true} is VALID [2022-02-20 18:32:24,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {33558#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {33558#true} is VALID [2022-02-20 18:32:24,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {33558#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {33558#true} is VALID [2022-02-20 18:32:24,118 INFO L290 TraceCheckUtils]: 3: Hoare triple {33558#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {33558#true} is VALID [2022-02-20 18:32:24,118 INFO L290 TraceCheckUtils]: 4: Hoare triple {33558#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {33558#true} is VALID [2022-02-20 18:32:24,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {33558#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {33558#true} is VALID [2022-02-20 18:32:24,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {33558#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {33558#true} is VALID [2022-02-20 18:32:24,122 INFO L290 TraceCheckUtils]: 7: Hoare triple {33558#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {33558#true} is VALID [2022-02-20 18:32:24,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {33558#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {33558#true} is VALID [2022-02-20 18:32:24,123 INFO L290 TraceCheckUtils]: 9: Hoare triple {33558#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {33558#true} is VALID [2022-02-20 18:32:24,123 INFO L290 TraceCheckUtils]: 10: Hoare triple {33558#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {33558#true} is VALID [2022-02-20 18:32:24,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {33558#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {33558#true} is VALID [2022-02-20 18:32:24,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {33558#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {33558#true} is VALID [2022-02-20 18:32:24,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {33558#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {33558#true} is VALID [2022-02-20 18:32:24,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {33558#true} assume ~id1~0 != ~id2~0; {33558#true} is VALID [2022-02-20 18:32:24,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {33558#true} assume ~id1~0 != ~id3~0; {33558#true} is VALID [2022-02-20 18:32:24,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {33558#true} assume ~id2~0 != ~id3~0; {33558#true} is VALID [2022-02-20 18:32:24,124 INFO L290 TraceCheckUtils]: 17: Hoare triple {33558#true} assume ~id1~0 >= 0; {33558#true} is VALID [2022-02-20 18:32:24,124 INFO L290 TraceCheckUtils]: 18: Hoare triple {33558#true} assume ~id2~0 >= 0; {33558#true} is VALID [2022-02-20 18:32:24,124 INFO L290 TraceCheckUtils]: 19: Hoare triple {33558#true} assume ~id3~0 >= 0; {33558#true} is VALID [2022-02-20 18:32:24,124 INFO L290 TraceCheckUtils]: 20: Hoare triple {33558#true} assume 0 == ~r1~0 % 256; {33558#true} is VALID [2022-02-20 18:32:24,124 INFO L290 TraceCheckUtils]: 21: Hoare triple {33558#true} assume 0 == ~r2~0 % 256; {33558#true} is VALID [2022-02-20 18:32:24,124 INFO L290 TraceCheckUtils]: 22: Hoare triple {33558#true} assume 0 == ~r3~0 % 256; {33558#true} is VALID [2022-02-20 18:32:24,124 INFO L290 TraceCheckUtils]: 23: Hoare triple {33558#true} assume 0 != init_~r122~0#1 % 256; {33558#true} is VALID [2022-02-20 18:32:24,124 INFO L290 TraceCheckUtils]: 24: Hoare triple {33558#true} assume 0 != init_~r132~0#1 % 256; {33558#true} is VALID [2022-02-20 18:32:24,125 INFO L290 TraceCheckUtils]: 25: Hoare triple {33558#true} assume 0 != init_~r212~0#1 % 256; {33558#true} is VALID [2022-02-20 18:32:24,125 INFO L290 TraceCheckUtils]: 26: Hoare triple {33558#true} assume 0 != init_~r232~0#1 % 256; {33558#true} is VALID [2022-02-20 18:32:24,125 INFO L290 TraceCheckUtils]: 27: Hoare triple {33558#true} assume 0 != init_~r312~0#1 % 256; {33558#true} is VALID [2022-02-20 18:32:24,125 INFO L290 TraceCheckUtils]: 28: Hoare triple {33558#true} assume 0 != init_~r322~0#1 % 256; {33558#true} is VALID [2022-02-20 18:32:24,125 INFO L290 TraceCheckUtils]: 29: Hoare triple {33558#true} assume ~max1~0 == ~id1~0; {33558#true} is VALID [2022-02-20 18:32:24,125 INFO L290 TraceCheckUtils]: 30: Hoare triple {33558#true} assume ~max2~0 == ~id2~0; {33558#true} is VALID [2022-02-20 18:32:24,125 INFO L290 TraceCheckUtils]: 31: Hoare triple {33558#true} assume ~max3~0 == ~id3~0; {33558#true} is VALID [2022-02-20 18:32:24,125 INFO L290 TraceCheckUtils]: 32: Hoare triple {33558#true} assume 0 == ~st1~0; {33558#true} is VALID [2022-02-20 18:32:24,126 INFO L290 TraceCheckUtils]: 33: Hoare triple {33558#true} assume 0 == ~st2~0; {33560#(<= ~st2~0 0)} is VALID [2022-02-20 18:32:24,126 INFO L290 TraceCheckUtils]: 34: Hoare triple {33560#(<= ~st2~0 0)} assume 0 == ~st3~0; {33560#(<= ~st2~0 0)} is VALID [2022-02-20 18:32:24,126 INFO L290 TraceCheckUtils]: 35: Hoare triple {33560#(<= ~st2~0 0)} assume 0 == ~nl1~0; {33560#(<= ~st2~0 0)} is VALID [2022-02-20 18:32:24,127 INFO L290 TraceCheckUtils]: 36: Hoare triple {33560#(<= ~st2~0 0)} assume 0 == ~nl2~0; {33561#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:24,127 INFO L290 TraceCheckUtils]: 37: Hoare triple {33561#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~nl3~0; {33561#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:24,127 INFO L290 TraceCheckUtils]: 38: Hoare triple {33561#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode1~0 % 256; {33561#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:24,128 INFO L290 TraceCheckUtils]: 39: Hoare triple {33561#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode2~0 % 256; {33561#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:24,128 INFO L290 TraceCheckUtils]: 40: Hoare triple {33561#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256; {33561#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:24,128 INFO L290 TraceCheckUtils]: 41: Hoare triple {33561#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 != ~newmax1~0 % 256; {33561#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:24,130 INFO L290 TraceCheckUtils]: 42: Hoare triple {33561#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 != ~newmax2~0 % 256; {33561#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:24,131 INFO L290 TraceCheckUtils]: 43: Hoare triple {33561#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {33561#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:24,131 INFO L290 TraceCheckUtils]: 44: Hoare triple {33561#(<= (+ ~nl2~0 ~st2~0) 0)} init_#res#1 := init_~tmp___5~0#1; {33561#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:24,131 INFO L290 TraceCheckUtils]: 45: Hoare triple {33561#(<= (+ ~nl2~0 ~st2~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {33561#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:24,132 INFO L290 TraceCheckUtils]: 46: Hoare triple {33561#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {33561#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:24,132 INFO L290 TraceCheckUtils]: 47: Hoare triple {33561#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {33561#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:24,132 INFO L290 TraceCheckUtils]: 48: Hoare triple {33561#(<= (+ ~nl2~0 ~st2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {33561#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:24,133 INFO L290 TraceCheckUtils]: 49: Hoare triple {33561#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode1~0 % 256); {33561#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:24,133 INFO L290 TraceCheckUtils]: 50: Hoare triple {33561#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r1~0 % 256 < 2; {33561#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:24,133 INFO L290 TraceCheckUtils]: 51: Hoare triple {33561#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep12~0 % 256); {33561#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:24,134 INFO L290 TraceCheckUtils]: 52: Hoare triple {33561#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep13~0 % 256); {33561#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:24,134 INFO L290 TraceCheckUtils]: 53: Hoare triple {33561#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode1~0 := 1; {33561#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:24,134 INFO L290 TraceCheckUtils]: 54: Hoare triple {33561#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {33561#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:24,134 INFO L290 TraceCheckUtils]: 55: Hoare triple {33561#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode2~0 % 256); {33561#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:24,135 INFO L290 TraceCheckUtils]: 56: Hoare triple {33561#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r2~0 % 256 < 2; {33561#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:24,135 INFO L290 TraceCheckUtils]: 57: Hoare triple {33561#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep21~0 % 256); {33561#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:24,135 INFO L290 TraceCheckUtils]: 58: Hoare triple {33561#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep23~0 % 256); {33561#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:24,136 INFO L290 TraceCheckUtils]: 59: Hoare triple {33561#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode2~0 := 1; {33561#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:24,136 INFO L290 TraceCheckUtils]: 60: Hoare triple {33561#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {33561#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:24,136 INFO L290 TraceCheckUtils]: 61: Hoare triple {33561#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode3~0 % 256); {33561#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:24,137 INFO L290 TraceCheckUtils]: 62: Hoare triple {33561#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r3~0 % 256 < 2; {33561#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:24,137 INFO L290 TraceCheckUtils]: 63: Hoare triple {33561#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep31~0 % 256); {33561#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:24,137 INFO L290 TraceCheckUtils]: 64: Hoare triple {33561#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep32~0 % 256); {33561#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:24,138 INFO L290 TraceCheckUtils]: 65: Hoare triple {33561#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode3~0 := 1; {33561#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:24,138 INFO L290 TraceCheckUtils]: 66: Hoare triple {33561#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {33561#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:24,138 INFO L290 TraceCheckUtils]: 67: Hoare triple {33561#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {33561#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:24,139 INFO L290 TraceCheckUtils]: 68: Hoare triple {33561#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {33561#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:24,139 INFO L290 TraceCheckUtils]: 69: Hoare triple {33561#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(~st2~0 + ~nl2~0 <= 1);check_~tmp~1#1 := 0; {33559#false} is VALID [2022-02-20 18:32:24,139 INFO L290 TraceCheckUtils]: 70: Hoare triple {33559#false} check_#res#1 := check_~tmp~1#1; {33559#false} is VALID [2022-02-20 18:32:24,139 INFO L290 TraceCheckUtils]: 71: Hoare triple {33559#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {33559#false} is VALID [2022-02-20 18:32:24,139 INFO L290 TraceCheckUtils]: 72: Hoare triple {33559#false} assume 0 == assert_~arg#1 % 256; {33559#false} is VALID [2022-02-20 18:32:24,139 INFO L290 TraceCheckUtils]: 73: Hoare triple {33559#false} assume !false; {33559#false} is VALID [2022-02-20 18:32:24,140 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 18:32:24,140 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:24,140 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112647837] [2022-02-20 18:32:24,141 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112647837] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:24,141 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:24,141 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:32:24,141 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347732451] [2022-02-20 18:32:24,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:24,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2022-02-20 18:32:24,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:24,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:24,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:24,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:32:24,182 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:24,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:32:24,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:32:24,183 INFO L87 Difference]: Start difference. First operand 2145 states and 3484 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:27,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:27,068 INFO L93 Difference]: Finished difference Result 6648 states and 10865 transitions. [2022-02-20 18:32:27,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:32:27,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2022-02-20 18:32:27,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:32:27,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:27,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 610 transitions. [2022-02-20 18:32:27,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:27,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 610 transitions. [2022-02-20 18:32:27,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 610 transitions. [2022-02-20 18:32:27,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 610 edges. 610 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:28,106 INFO L225 Difference]: With dead ends: 6648 [2022-02-20 18:32:28,106 INFO L226 Difference]: Without dead ends: 4593 [2022-02-20 18:32:28,113 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 18:32:28,115 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 384 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:32:28,115 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [384 Valid, 686 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:32:28,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4593 states. [2022-02-20 18:32:29,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4593 to 3357. [2022-02-20 18:32:29,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:29,089 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4593 states. Second operand has 3357 states, 3356 states have (on average 1.6215733015494636) internal successors, (5442), 3356 states have internal predecessors, (5442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:29,093 INFO L74 IsIncluded]: Start isIncluded. First operand 4593 states. Second operand has 3357 states, 3356 states have (on average 1.6215733015494636) internal successors, (5442), 3356 states have internal predecessors, (5442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:29,097 INFO L87 Difference]: Start difference. First operand 4593 states. Second operand has 3357 states, 3356 states have (on average 1.6215733015494636) internal successors, (5442), 3356 states have internal predecessors, (5442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:29,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:29,685 INFO L93 Difference]: Finished difference Result 4593 states and 7472 transitions. [2022-02-20 18:32:29,685 INFO L276 IsEmpty]: Start isEmpty. Operand 4593 states and 7472 transitions. [2022-02-20 18:32:29,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:29,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:29,694 INFO L74 IsIncluded]: Start isIncluded. First operand has 3357 states, 3356 states have (on average 1.6215733015494636) internal successors, (5442), 3356 states have internal predecessors, (5442), 0 states have call successors, (0), 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 4593 states. [2022-02-20 18:32:29,697 INFO L87 Difference]: Start difference. First operand has 3357 states, 3356 states have (on average 1.6215733015494636) internal successors, (5442), 3356 states have internal predecessors, (5442), 0 states have call successors, (0), 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 4593 states. [2022-02-20 18:32:30,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:30,270 INFO L93 Difference]: Finished difference Result 4593 states and 7472 transitions. [2022-02-20 18:32:30,270 INFO L276 IsEmpty]: Start isEmpty. Operand 4593 states and 7472 transitions. [2022-02-20 18:32:30,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:30,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:30,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:30,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:30,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3357 states, 3356 states have (on average 1.6215733015494636) internal successors, (5442), 3356 states have internal predecessors, (5442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:30,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3357 states to 3357 states and 5442 transitions. [2022-02-20 18:32:30,634 INFO L78 Accepts]: Start accepts. Automaton has 3357 states and 5442 transitions. Word has length 74 [2022-02-20 18:32:30,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:30,634 INFO L470 AbstractCegarLoop]: Abstraction has 3357 states and 5442 transitions. [2022-02-20 18:32:30,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:30,634 INFO L276 IsEmpty]: Start isEmpty. Operand 3357 states and 5442 transitions. [2022-02-20 18:32:30,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 18:32:30,634 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:30,635 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:32:30,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:32:30,635 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:30,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:30,635 INFO L85 PathProgramCache]: Analyzing trace with hash -2130170379, now seen corresponding path program 1 times [2022-02-20 18:32:30,635 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:30,635 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59725380] [2022-02-20 18:32:30,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:30,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:30,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {54003#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(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {54003#true} is VALID [2022-02-20 18:32:30,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {54003#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {54003#true} is VALID [2022-02-20 18:32:30,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {54003#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {54003#true} is VALID [2022-02-20 18:32:30,671 INFO L290 TraceCheckUtils]: 3: Hoare triple {54003#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {54003#true} is VALID [2022-02-20 18:32:30,671 INFO L290 TraceCheckUtils]: 4: Hoare triple {54003#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {54003#true} is VALID [2022-02-20 18:32:30,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {54003#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {54003#true} is VALID [2022-02-20 18:32:30,672 INFO L290 TraceCheckUtils]: 6: Hoare triple {54003#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {54003#true} is VALID [2022-02-20 18:32:30,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {54003#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {54003#true} is VALID [2022-02-20 18:32:30,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {54003#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {54003#true} is VALID [2022-02-20 18:32:30,672 INFO L290 TraceCheckUtils]: 9: Hoare triple {54003#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {54003#true} is VALID [2022-02-20 18:32:30,672 INFO L290 TraceCheckUtils]: 10: Hoare triple {54003#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {54003#true} is VALID [2022-02-20 18:32:30,672 INFO L290 TraceCheckUtils]: 11: Hoare triple {54003#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {54003#true} is VALID [2022-02-20 18:32:30,672 INFO L290 TraceCheckUtils]: 12: Hoare triple {54003#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {54003#true} is VALID [2022-02-20 18:32:30,672 INFO L290 TraceCheckUtils]: 13: Hoare triple {54003#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {54003#true} is VALID [2022-02-20 18:32:30,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {54003#true} assume ~id1~0 != ~id2~0; {54003#true} is VALID [2022-02-20 18:32:30,673 INFO L290 TraceCheckUtils]: 15: Hoare triple {54003#true} assume ~id1~0 != ~id3~0; {54003#true} is VALID [2022-02-20 18:32:30,673 INFO L290 TraceCheckUtils]: 16: Hoare triple {54003#true} assume ~id2~0 != ~id3~0; {54003#true} is VALID [2022-02-20 18:32:30,673 INFO L290 TraceCheckUtils]: 17: Hoare triple {54003#true} assume ~id1~0 >= 0; {54003#true} is VALID [2022-02-20 18:32:30,673 INFO L290 TraceCheckUtils]: 18: Hoare triple {54003#true} assume ~id2~0 >= 0; {54003#true} is VALID [2022-02-20 18:32:30,673 INFO L290 TraceCheckUtils]: 19: Hoare triple {54003#true} assume ~id3~0 >= 0; {54003#true} is VALID [2022-02-20 18:32:30,673 INFO L290 TraceCheckUtils]: 20: Hoare triple {54003#true} assume 0 == ~r1~0 % 256; {54003#true} is VALID [2022-02-20 18:32:30,673 INFO L290 TraceCheckUtils]: 21: Hoare triple {54003#true} assume 0 == ~r2~0 % 256; {54003#true} is VALID [2022-02-20 18:32:30,673 INFO L290 TraceCheckUtils]: 22: Hoare triple {54003#true} assume 0 == ~r3~0 % 256; {54003#true} is VALID [2022-02-20 18:32:30,674 INFO L290 TraceCheckUtils]: 23: Hoare triple {54003#true} assume 0 != init_~r122~0#1 % 256; {54003#true} is VALID [2022-02-20 18:32:30,674 INFO L290 TraceCheckUtils]: 24: Hoare triple {54003#true} assume 0 != init_~r132~0#1 % 256; {54003#true} is VALID [2022-02-20 18:32:30,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {54003#true} assume 0 != init_~r212~0#1 % 256; {54003#true} is VALID [2022-02-20 18:32:30,674 INFO L290 TraceCheckUtils]: 26: Hoare triple {54003#true} assume 0 != init_~r232~0#1 % 256; {54003#true} is VALID [2022-02-20 18:32:30,674 INFO L290 TraceCheckUtils]: 27: Hoare triple {54003#true} assume 0 != init_~r312~0#1 % 256; {54003#true} is VALID [2022-02-20 18:32:30,674 INFO L290 TraceCheckUtils]: 28: Hoare triple {54003#true} assume 0 != init_~r322~0#1 % 256; {54003#true} is VALID [2022-02-20 18:32:30,674 INFO L290 TraceCheckUtils]: 29: Hoare triple {54003#true} assume ~max1~0 == ~id1~0; {54003#true} is VALID [2022-02-20 18:32:30,674 INFO L290 TraceCheckUtils]: 30: Hoare triple {54003#true} assume ~max2~0 == ~id2~0; {54003#true} is VALID [2022-02-20 18:32:30,674 INFO L290 TraceCheckUtils]: 31: Hoare triple {54003#true} assume ~max3~0 == ~id3~0; {54003#true} is VALID [2022-02-20 18:32:30,675 INFO L290 TraceCheckUtils]: 32: Hoare triple {54003#true} assume 0 == ~st1~0; {54003#true} is VALID [2022-02-20 18:32:30,675 INFO L290 TraceCheckUtils]: 33: Hoare triple {54003#true} assume 0 == ~st2~0; {54003#true} is VALID [2022-02-20 18:32:30,675 INFO L290 TraceCheckUtils]: 34: Hoare triple {54003#true} assume 0 == ~st3~0; {54003#true} is VALID [2022-02-20 18:32:30,675 INFO L290 TraceCheckUtils]: 35: Hoare triple {54003#true} assume 0 == ~nl1~0; {54003#true} is VALID [2022-02-20 18:32:30,675 INFO L290 TraceCheckUtils]: 36: Hoare triple {54003#true} assume 0 == ~nl2~0; {54003#true} is VALID [2022-02-20 18:32:30,675 INFO L290 TraceCheckUtils]: 37: Hoare triple {54003#true} assume 0 == ~nl3~0; {54003#true} is VALID [2022-02-20 18:32:30,675 INFO L290 TraceCheckUtils]: 38: Hoare triple {54003#true} assume 0 == ~mode1~0 % 256; {54003#true} is VALID [2022-02-20 18:32:30,675 INFO L290 TraceCheckUtils]: 39: Hoare triple {54003#true} assume 0 == ~mode2~0 % 256; {54003#true} is VALID [2022-02-20 18:32:30,676 INFO L290 TraceCheckUtils]: 40: Hoare triple {54003#true} assume 0 == ~mode3~0 % 256; {54005#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:30,676 INFO L290 TraceCheckUtils]: 41: Hoare triple {54005#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~newmax1~0 % 256; {54005#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:30,677 INFO L290 TraceCheckUtils]: 42: Hoare triple {54005#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~newmax2~0 % 256; {54005#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:30,677 INFO L290 TraceCheckUtils]: 43: Hoare triple {54005#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {54005#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:30,677 INFO L290 TraceCheckUtils]: 44: Hoare triple {54005#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp___5~0#1; {54005#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:30,678 INFO L290 TraceCheckUtils]: 45: Hoare triple {54005#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {54005#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:30,678 INFO L290 TraceCheckUtils]: 46: Hoare triple {54005#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {54005#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:30,678 INFO L290 TraceCheckUtils]: 47: Hoare triple {54005#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {54005#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:30,679 INFO L290 TraceCheckUtils]: 48: Hoare triple {54005#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {54005#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:30,679 INFO L290 TraceCheckUtils]: 49: Hoare triple {54005#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {54005#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:30,679 INFO L290 TraceCheckUtils]: 50: Hoare triple {54005#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r1~0 % 256 < 2; {54005#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:30,680 INFO L290 TraceCheckUtils]: 51: Hoare triple {54005#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep12~0 % 256); {54005#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:30,680 INFO L290 TraceCheckUtils]: 52: Hoare triple {54005#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep13~0 % 256); {54005#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:30,680 INFO L290 TraceCheckUtils]: 53: Hoare triple {54005#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {54005#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:30,681 INFO L290 TraceCheckUtils]: 54: Hoare triple {54005#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {54005#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:30,681 INFO L290 TraceCheckUtils]: 55: Hoare triple {54005#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {54005#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:30,681 INFO L290 TraceCheckUtils]: 56: Hoare triple {54005#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r2~0 % 256 < 2; {54005#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:30,682 INFO L290 TraceCheckUtils]: 57: Hoare triple {54005#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep21~0 % 256); {54005#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:30,682 INFO L290 TraceCheckUtils]: 58: Hoare triple {54005#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep23~0 % 256); {54005#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:30,684 INFO L290 TraceCheckUtils]: 59: Hoare triple {54005#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {54005#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:30,684 INFO L290 TraceCheckUtils]: 60: Hoare triple {54005#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {54005#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:30,684 INFO L290 TraceCheckUtils]: 61: Hoare triple {54005#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~mode3~0 % 256;~r3~0 := 1 + ~r3~0 % 256; {54004#false} is VALID [2022-02-20 18:32:30,684 INFO L290 TraceCheckUtils]: 62: Hoare triple {54004#false} assume !(0 != ~ep13~0 % 256); {54004#false} is VALID [2022-02-20 18:32:30,685 INFO L290 TraceCheckUtils]: 63: Hoare triple {54004#false} assume !(0 != ~ep23~0 % 256); {54004#false} is VALID [2022-02-20 18:32:30,685 INFO L290 TraceCheckUtils]: 64: Hoare triple {54004#false} ~newmax3~0 := node3_~newmax~2#1; {54004#false} is VALID [2022-02-20 18:32:30,685 INFO L290 TraceCheckUtils]: 65: Hoare triple {54004#false} assume 2 == ~r3~0 % 256; {54004#false} is VALID [2022-02-20 18:32:30,685 INFO L290 TraceCheckUtils]: 66: Hoare triple {54004#false} assume ~max3~0 == ~id3~0;~st3~0 := 1; {54004#false} is VALID [2022-02-20 18:32:30,685 INFO L290 TraceCheckUtils]: 67: Hoare triple {54004#false} ~mode3~0 := 0; {54004#false} is VALID [2022-02-20 18:32:30,685 INFO L290 TraceCheckUtils]: 68: Hoare triple {54004#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {54004#false} is VALID [2022-02-20 18:32:30,685 INFO L290 TraceCheckUtils]: 69: Hoare triple {54004#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {54004#false} is VALID [2022-02-20 18:32:30,685 INFO L290 TraceCheckUtils]: 70: Hoare triple {54004#false} check_#res#1 := check_~tmp~1#1; {54004#false} is VALID [2022-02-20 18:32:30,686 INFO L290 TraceCheckUtils]: 71: Hoare triple {54004#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {54004#false} is VALID [2022-02-20 18:32:30,686 INFO L290 TraceCheckUtils]: 72: Hoare triple {54004#false} assume 0 == assert_~arg#1 % 256; {54004#false} is VALID [2022-02-20 18:32:30,686 INFO L290 TraceCheckUtils]: 73: Hoare triple {54004#false} assume !false; {54004#false} is VALID [2022-02-20 18:32:30,686 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 18:32:30,686 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:30,686 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59725380] [2022-02-20 18:32:30,686 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59725380] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:30,687 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:30,687 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:32:30,687 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697232871] [2022-02-20 18:32:30,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:30,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2022-02-20 18:32:30,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:30,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:30,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:30,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:32:30,757 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:30,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:32:30,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:32:30,758 INFO L87 Difference]: Start difference. First operand 3357 states and 5442 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:33,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:33,656 INFO L93 Difference]: Finished difference Result 6689 states and 10862 transitions. [2022-02-20 18:32:33,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:32:33,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2022-02-20 18:32:33,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:32:33,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:33,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2022-02-20 18:32:33,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:33,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2022-02-20 18:32:33,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 446 transitions. [2022-02-20 18:32:33,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 446 edges. 446 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:34,572 INFO L225 Difference]: With dead ends: 6689 [2022-02-20 18:32:34,572 INFO L226 Difference]: Without dead ends: 4777 [2022-02-20 18:32:34,574 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 18:32:34,574 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 104 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:32:34,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 439 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:32:34,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4777 states. [2022-02-20 18:32:35,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4777 to 4775. [2022-02-20 18:32:35,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:35,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4777 states. Second operand has 4775 states, 4774 states have (on average 1.6108085462924173) internal successors, (7690), 4774 states have internal predecessors, (7690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:35,903 INFO L74 IsIncluded]: Start isIncluded. First operand 4777 states. Second operand has 4775 states, 4774 states have (on average 1.6108085462924173) internal successors, (7690), 4774 states have internal predecessors, (7690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:35,907 INFO L87 Difference]: Start difference. First operand 4777 states. Second operand has 4775 states, 4774 states have (on average 1.6108085462924173) internal successors, (7690), 4774 states have internal predecessors, (7690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:36,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:36,493 INFO L93 Difference]: Finished difference Result 4777 states and 7691 transitions. [2022-02-20 18:32:36,493 INFO L276 IsEmpty]: Start isEmpty. Operand 4777 states and 7691 transitions. [2022-02-20 18:32:36,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:36,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:36,501 INFO L74 IsIncluded]: Start isIncluded. First operand has 4775 states, 4774 states have (on average 1.6108085462924173) internal successors, (7690), 4774 states have internal predecessors, (7690), 0 states have call successors, (0), 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 4777 states. [2022-02-20 18:32:36,504 INFO L87 Difference]: Start difference. First operand has 4775 states, 4774 states have (on average 1.6108085462924173) internal successors, (7690), 4774 states have internal predecessors, (7690), 0 states have call successors, (0), 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 4777 states. [2022-02-20 18:32:37,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:37,101 INFO L93 Difference]: Finished difference Result 4777 states and 7691 transitions. [2022-02-20 18:32:37,101 INFO L276 IsEmpty]: Start isEmpty. Operand 4777 states and 7691 transitions. [2022-02-20 18:32:37,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:37,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:37,106 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:37,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:37,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4775 states, 4774 states have (on average 1.6108085462924173) internal successors, (7690), 4774 states have internal predecessors, (7690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:37,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4775 states to 4775 states and 7690 transitions. [2022-02-20 18:32:37,764 INFO L78 Accepts]: Start accepts. Automaton has 4775 states and 7690 transitions. Word has length 74 [2022-02-20 18:32:37,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:37,765 INFO L470 AbstractCegarLoop]: Abstraction has 4775 states and 7690 transitions. [2022-02-20 18:32:37,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:37,765 INFO L276 IsEmpty]: Start isEmpty. Operand 4775 states and 7690 transitions. [2022-02-20 18:32:37,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 18:32:37,765 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:37,765 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:32:37,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:32:37,765 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:37,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:37,766 INFO L85 PathProgramCache]: Analyzing trace with hash 339461557, now seen corresponding path program 1 times [2022-02-20 18:32:37,766 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:37,766 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12690209] [2022-02-20 18:32:37,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:37,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:37,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:37,795 INFO L290 TraceCheckUtils]: 0: Hoare triple {76543#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(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {76543#true} is VALID [2022-02-20 18:32:37,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {76543#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {76543#true} is VALID [2022-02-20 18:32:37,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {76543#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {76543#true} is VALID [2022-02-20 18:32:37,796 INFO L290 TraceCheckUtils]: 3: Hoare triple {76543#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {76543#true} is VALID [2022-02-20 18:32:37,796 INFO L290 TraceCheckUtils]: 4: Hoare triple {76543#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {76543#true} is VALID [2022-02-20 18:32:37,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {76543#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {76543#true} is VALID [2022-02-20 18:32:37,796 INFO L290 TraceCheckUtils]: 6: Hoare triple {76543#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {76543#true} is VALID [2022-02-20 18:32:37,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {76543#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {76543#true} is VALID [2022-02-20 18:32:37,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {76543#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {76543#true} is VALID [2022-02-20 18:32:37,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {76543#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {76543#true} is VALID [2022-02-20 18:32:37,797 INFO L290 TraceCheckUtils]: 10: Hoare triple {76543#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {76543#true} is VALID [2022-02-20 18:32:37,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {76543#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {76543#true} is VALID [2022-02-20 18:32:37,797 INFO L290 TraceCheckUtils]: 12: Hoare triple {76543#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {76543#true} is VALID [2022-02-20 18:32:37,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {76543#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {76543#true} is VALID [2022-02-20 18:32:37,797 INFO L290 TraceCheckUtils]: 14: Hoare triple {76543#true} assume ~id1~0 != ~id2~0; {76543#true} is VALID [2022-02-20 18:32:37,797 INFO L290 TraceCheckUtils]: 15: Hoare triple {76543#true} assume ~id1~0 != ~id3~0; {76543#true} is VALID [2022-02-20 18:32:37,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {76543#true} assume ~id2~0 != ~id3~0; {76543#true} is VALID [2022-02-20 18:32:37,797 INFO L290 TraceCheckUtils]: 17: Hoare triple {76543#true} assume ~id1~0 >= 0; {76543#true} is VALID [2022-02-20 18:32:37,798 INFO L290 TraceCheckUtils]: 18: Hoare triple {76543#true} assume ~id2~0 >= 0; {76543#true} is VALID [2022-02-20 18:32:37,798 INFO L290 TraceCheckUtils]: 19: Hoare triple {76543#true} assume ~id3~0 >= 0; {76543#true} is VALID [2022-02-20 18:32:37,798 INFO L290 TraceCheckUtils]: 20: Hoare triple {76543#true} assume 0 == ~r1~0 % 256; {76543#true} is VALID [2022-02-20 18:32:37,798 INFO L290 TraceCheckUtils]: 21: Hoare triple {76543#true} assume 0 == ~r2~0 % 256; {76543#true} is VALID [2022-02-20 18:32:37,798 INFO L290 TraceCheckUtils]: 22: Hoare triple {76543#true} assume 0 == ~r3~0 % 256; {76543#true} is VALID [2022-02-20 18:32:37,798 INFO L290 TraceCheckUtils]: 23: Hoare triple {76543#true} assume 0 != init_~r122~0#1 % 256; {76543#true} is VALID [2022-02-20 18:32:37,798 INFO L290 TraceCheckUtils]: 24: Hoare triple {76543#true} assume 0 != init_~r132~0#1 % 256; {76543#true} is VALID [2022-02-20 18:32:37,798 INFO L290 TraceCheckUtils]: 25: Hoare triple {76543#true} assume 0 != init_~r212~0#1 % 256; {76543#true} is VALID [2022-02-20 18:32:37,798 INFO L290 TraceCheckUtils]: 26: Hoare triple {76543#true} assume 0 != init_~r232~0#1 % 256; {76543#true} is VALID [2022-02-20 18:32:37,799 INFO L290 TraceCheckUtils]: 27: Hoare triple {76543#true} assume 0 != init_~r312~0#1 % 256; {76543#true} is VALID [2022-02-20 18:32:37,799 INFO L290 TraceCheckUtils]: 28: Hoare triple {76543#true} assume 0 != init_~r322~0#1 % 256; {76543#true} is VALID [2022-02-20 18:32:37,799 INFO L290 TraceCheckUtils]: 29: Hoare triple {76543#true} assume ~max1~0 == ~id1~0; {76543#true} is VALID [2022-02-20 18:32:37,799 INFO L290 TraceCheckUtils]: 30: Hoare triple {76543#true} assume ~max2~0 == ~id2~0; {76543#true} is VALID [2022-02-20 18:32:37,799 INFO L290 TraceCheckUtils]: 31: Hoare triple {76543#true} assume ~max3~0 == ~id3~0; {76543#true} is VALID [2022-02-20 18:32:37,799 INFO L290 TraceCheckUtils]: 32: Hoare triple {76543#true} assume 0 == ~st1~0; {76543#true} is VALID [2022-02-20 18:32:37,799 INFO L290 TraceCheckUtils]: 33: Hoare triple {76543#true} assume 0 == ~st2~0; {76543#true} is VALID [2022-02-20 18:32:37,799 INFO L290 TraceCheckUtils]: 34: Hoare triple {76543#true} assume 0 == ~st3~0; {76543#true} is VALID [2022-02-20 18:32:37,800 INFO L290 TraceCheckUtils]: 35: Hoare triple {76543#true} assume 0 == ~nl1~0; {76543#true} is VALID [2022-02-20 18:32:37,800 INFO L290 TraceCheckUtils]: 36: Hoare triple {76543#true} assume 0 == ~nl2~0; {76543#true} is VALID [2022-02-20 18:32:37,800 INFO L290 TraceCheckUtils]: 37: Hoare triple {76543#true} assume 0 == ~nl3~0; {76543#true} is VALID [2022-02-20 18:32:37,800 INFO L290 TraceCheckUtils]: 38: Hoare triple {76543#true} assume 0 == ~mode1~0 % 256; {76545#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:37,801 INFO L290 TraceCheckUtils]: 39: Hoare triple {76545#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {76545#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:37,801 INFO L290 TraceCheckUtils]: 40: Hoare triple {76545#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {76545#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:37,801 INFO L290 TraceCheckUtils]: 41: Hoare triple {76545#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~newmax1~0 % 256; {76545#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:37,802 INFO L290 TraceCheckUtils]: 42: Hoare triple {76545#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~newmax2~0 % 256; {76545#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:37,802 INFO L290 TraceCheckUtils]: 43: Hoare triple {76545#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {76545#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:37,802 INFO L290 TraceCheckUtils]: 44: Hoare triple {76545#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {76545#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:37,802 INFO L290 TraceCheckUtils]: 45: Hoare triple {76545#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {76545#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:37,803 INFO L290 TraceCheckUtils]: 46: Hoare triple {76545#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {76545#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:37,803 INFO L290 TraceCheckUtils]: 47: Hoare triple {76545#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {76545#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:37,804 INFO L290 TraceCheckUtils]: 48: Hoare triple {76545#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {76545#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:37,804 INFO L290 TraceCheckUtils]: 49: Hoare triple {76545#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256; {76544#false} is VALID [2022-02-20 18:32:37,804 INFO L290 TraceCheckUtils]: 50: Hoare triple {76544#false} assume !(0 != ~ep21~0 % 256); {76544#false} is VALID [2022-02-20 18:32:37,804 INFO L290 TraceCheckUtils]: 51: Hoare triple {76544#false} assume !(0 != ~ep31~0 % 256); {76544#false} is VALID [2022-02-20 18:32:37,804 INFO L290 TraceCheckUtils]: 52: Hoare triple {76544#false} ~newmax1~0 := node1_~newmax~0#1; {76544#false} is VALID [2022-02-20 18:32:37,804 INFO L290 TraceCheckUtils]: 53: Hoare triple {76544#false} assume 2 == ~r1~0 % 256; {76544#false} is VALID [2022-02-20 18:32:37,805 INFO L290 TraceCheckUtils]: 54: Hoare triple {76544#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {76544#false} is VALID [2022-02-20 18:32:37,805 INFO L290 TraceCheckUtils]: 55: Hoare triple {76544#false} ~mode1~0 := 0; {76544#false} is VALID [2022-02-20 18:32:37,805 INFO L290 TraceCheckUtils]: 56: Hoare triple {76544#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {76544#false} is VALID [2022-02-20 18:32:37,805 INFO L290 TraceCheckUtils]: 57: Hoare triple {76544#false} assume !(0 != ~mode2~0 % 256); {76544#false} is VALID [2022-02-20 18:32:37,805 INFO L290 TraceCheckUtils]: 58: Hoare triple {76544#false} assume ~r2~0 % 256 < 2; {76544#false} is VALID [2022-02-20 18:32:37,805 INFO L290 TraceCheckUtils]: 59: Hoare triple {76544#false} assume !(0 != ~ep21~0 % 256); {76544#false} is VALID [2022-02-20 18:32:37,805 INFO L290 TraceCheckUtils]: 60: Hoare triple {76544#false} assume !(0 != ~ep23~0 % 256); {76544#false} is VALID [2022-02-20 18:32:37,805 INFO L290 TraceCheckUtils]: 61: Hoare triple {76544#false} ~mode2~0 := 1; {76544#false} is VALID [2022-02-20 18:32:37,806 INFO L290 TraceCheckUtils]: 62: Hoare triple {76544#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {76544#false} is VALID [2022-02-20 18:32:37,806 INFO L290 TraceCheckUtils]: 63: Hoare triple {76544#false} assume !(0 != ~mode3~0 % 256); {76544#false} is VALID [2022-02-20 18:32:37,806 INFO L290 TraceCheckUtils]: 64: Hoare triple {76544#false} assume ~r3~0 % 256 < 2; {76544#false} is VALID [2022-02-20 18:32:37,806 INFO L290 TraceCheckUtils]: 65: Hoare triple {76544#false} assume !(0 != ~ep31~0 % 256); {76544#false} is VALID [2022-02-20 18:32:37,806 INFO L290 TraceCheckUtils]: 66: Hoare triple {76544#false} assume !(0 != ~ep32~0 % 256); {76544#false} is VALID [2022-02-20 18:32:37,806 INFO L290 TraceCheckUtils]: 67: Hoare triple {76544#false} ~mode3~0 := 1; {76544#false} is VALID [2022-02-20 18:32:37,806 INFO L290 TraceCheckUtils]: 68: Hoare triple {76544#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {76544#false} is VALID [2022-02-20 18:32:37,806 INFO L290 TraceCheckUtils]: 69: Hoare triple {76544#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {76544#false} is VALID [2022-02-20 18:32:37,806 INFO L290 TraceCheckUtils]: 70: Hoare triple {76544#false} check_#res#1 := check_~tmp~1#1; {76544#false} is VALID [2022-02-20 18:32:37,807 INFO L290 TraceCheckUtils]: 71: Hoare triple {76544#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {76544#false} is VALID [2022-02-20 18:32:37,807 INFO L290 TraceCheckUtils]: 72: Hoare triple {76544#false} assume 0 == assert_~arg#1 % 256; {76544#false} is VALID [2022-02-20 18:32:37,807 INFO L290 TraceCheckUtils]: 73: Hoare triple {76544#false} assume !false; {76544#false} is VALID [2022-02-20 18:32:37,807 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 18:32:37,807 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:37,807 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12690209] [2022-02-20 18:32:37,807 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12690209] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:37,808 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:37,808 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:32:37,808 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728297773] [2022-02-20 18:32:37,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:37,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2022-02-20 18:32:37,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:37,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:37,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:37,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:32:37,847 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:37,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:32:37,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:32:37,848 INFO L87 Difference]: Start difference. First operand 4775 states and 7690 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:43,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:43,412 INFO L93 Difference]: Finished difference Result 10486 states and 17043 transitions. [2022-02-20 18:32:43,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:32:43,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2022-02-20 18:32:43,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:32:43,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:43,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2022-02-20 18:32:43,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:43,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2022-02-20 18:32:43,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 446 transitions. [2022-02-20 18:32:43,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 446 edges. 446 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:45,261 INFO L225 Difference]: With dead ends: 10486 [2022-02-20 18:32:45,261 INFO L226 Difference]: Without dead ends: 7079 [2022-02-20 18:32:45,264 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 18:32:45,265 INFO L933 BasicCegarLoop]: 300 mSDtfsCounter, 116 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:32:45,265 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 479 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:32:45,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7079 states. [2022-02-20 18:32:47,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7079 to 7077. [2022-02-20 18:32:47,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:47,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7079 states. Second operand has 7077 states, 7076 states have (on average 1.6075466365178066) internal successors, (11375), 7076 states have internal predecessors, (11375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:47,406 INFO L74 IsIncluded]: Start isIncluded. First operand 7079 states. Second operand has 7077 states, 7076 states have (on average 1.6075466365178066) internal successors, (11375), 7076 states have internal predecessors, (11375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:47,413 INFO L87 Difference]: Start difference. First operand 7079 states. Second operand has 7077 states, 7076 states have (on average 1.6075466365178066) internal successors, (11375), 7076 states have internal predecessors, (11375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:48,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:48,799 INFO L93 Difference]: Finished difference Result 7079 states and 11376 transitions. [2022-02-20 18:32:48,799 INFO L276 IsEmpty]: Start isEmpty. Operand 7079 states and 11376 transitions. [2022-02-20 18:32:48,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:48,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:48,813 INFO L74 IsIncluded]: Start isIncluded. First operand has 7077 states, 7076 states have (on average 1.6075466365178066) internal successors, (11375), 7076 states have internal predecessors, (11375), 0 states have call successors, (0), 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 7079 states. [2022-02-20 18:32:48,820 INFO L87 Difference]: Start difference. First operand has 7077 states, 7076 states have (on average 1.6075466365178066) internal successors, (11375), 7076 states have internal predecessors, (11375), 0 states have call successors, (0), 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 7079 states. [2022-02-20 18:32:50,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:50,246 INFO L93 Difference]: Finished difference Result 7079 states and 11376 transitions. [2022-02-20 18:32:50,246 INFO L276 IsEmpty]: Start isEmpty. Operand 7079 states and 11376 transitions. [2022-02-20 18:32:50,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:50,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:50,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:50,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:50,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7077 states, 7076 states have (on average 1.6075466365178066) internal successors, (11375), 7076 states have internal predecessors, (11375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:51,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7077 states to 7077 states and 11375 transitions. [2022-02-20 18:32:51,889 INFO L78 Accepts]: Start accepts. Automaton has 7077 states and 11375 transitions. Word has length 74 [2022-02-20 18:32:51,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:51,889 INFO L470 AbstractCegarLoop]: Abstraction has 7077 states and 11375 transitions. [2022-02-20 18:32:51,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:51,889 INFO L276 IsEmpty]: Start isEmpty. Operand 7077 states and 11375 transitions. [2022-02-20 18:32:51,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-20 18:32:51,889 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:51,889 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:32:51,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:32:51,890 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:51,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:51,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1704077331, now seen corresponding path program 1 times [2022-02-20 18:32:51,890 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:51,890 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444512124] [2022-02-20 18:32:51,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:51,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:51,930 INFO L290 TraceCheckUtils]: 0: Hoare triple {110923#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(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {110923#true} is VALID [2022-02-20 18:32:51,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {110923#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {110923#true} is VALID [2022-02-20 18:32:51,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {110923#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {110923#true} is VALID [2022-02-20 18:32:51,931 INFO L290 TraceCheckUtils]: 3: Hoare triple {110923#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {110923#true} is VALID [2022-02-20 18:32:51,931 INFO L290 TraceCheckUtils]: 4: Hoare triple {110923#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {110923#true} is VALID [2022-02-20 18:32:51,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {110923#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {110923#true} is VALID [2022-02-20 18:32:51,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {110923#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {110923#true} is VALID [2022-02-20 18:32:51,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {110923#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {110923#true} is VALID [2022-02-20 18:32:51,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {110923#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {110923#true} is VALID [2022-02-20 18:32:51,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {110923#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {110923#true} is VALID [2022-02-20 18:32:51,932 INFO L290 TraceCheckUtils]: 10: Hoare triple {110923#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {110923#true} is VALID [2022-02-20 18:32:51,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {110923#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {110923#true} is VALID [2022-02-20 18:32:51,932 INFO L290 TraceCheckUtils]: 12: Hoare triple {110923#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {110923#true} is VALID [2022-02-20 18:32:51,932 INFO L290 TraceCheckUtils]: 13: Hoare triple {110923#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {110923#true} is VALID [2022-02-20 18:32:51,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {110923#true} assume ~id1~0 != ~id2~0; {110923#true} is VALID [2022-02-20 18:32:51,932 INFO L290 TraceCheckUtils]: 15: Hoare triple {110923#true} assume ~id1~0 != ~id3~0; {110923#true} is VALID [2022-02-20 18:32:51,932 INFO L290 TraceCheckUtils]: 16: Hoare triple {110923#true} assume ~id2~0 != ~id3~0; {110923#true} is VALID [2022-02-20 18:32:51,932 INFO L290 TraceCheckUtils]: 17: Hoare triple {110923#true} assume ~id1~0 >= 0; {110923#true} is VALID [2022-02-20 18:32:51,933 INFO L290 TraceCheckUtils]: 18: Hoare triple {110923#true} assume ~id2~0 >= 0; {110923#true} is VALID [2022-02-20 18:32:51,933 INFO L290 TraceCheckUtils]: 19: Hoare triple {110923#true} assume ~id3~0 >= 0; {110923#true} is VALID [2022-02-20 18:32:51,933 INFO L290 TraceCheckUtils]: 20: Hoare triple {110923#true} assume 0 == ~r1~0 % 256; {110923#true} is VALID [2022-02-20 18:32:51,933 INFO L290 TraceCheckUtils]: 21: Hoare triple {110923#true} assume 0 == ~r2~0 % 256; {110923#true} is VALID [2022-02-20 18:32:51,933 INFO L290 TraceCheckUtils]: 22: Hoare triple {110923#true} assume 0 == ~r3~0 % 256; {110923#true} is VALID [2022-02-20 18:32:51,933 INFO L290 TraceCheckUtils]: 23: Hoare triple {110923#true} assume 0 != init_~r122~0#1 % 256; {110923#true} is VALID [2022-02-20 18:32:51,933 INFO L290 TraceCheckUtils]: 24: Hoare triple {110923#true} assume 0 != init_~r132~0#1 % 256; {110923#true} is VALID [2022-02-20 18:32:51,933 INFO L290 TraceCheckUtils]: 25: Hoare triple {110923#true} assume 0 != init_~r212~0#1 % 256; {110923#true} is VALID [2022-02-20 18:32:51,933 INFO L290 TraceCheckUtils]: 26: Hoare triple {110923#true} assume 0 != init_~r232~0#1 % 256; {110923#true} is VALID [2022-02-20 18:32:51,934 INFO L290 TraceCheckUtils]: 27: Hoare triple {110923#true} assume 0 != init_~r312~0#1 % 256; {110923#true} is VALID [2022-02-20 18:32:51,934 INFO L290 TraceCheckUtils]: 28: Hoare triple {110923#true} assume 0 != init_~r322~0#1 % 256; {110923#true} is VALID [2022-02-20 18:32:51,934 INFO L290 TraceCheckUtils]: 29: Hoare triple {110923#true} assume ~max1~0 == ~id1~0; {110923#true} is VALID [2022-02-20 18:32:51,934 INFO L290 TraceCheckUtils]: 30: Hoare triple {110923#true} assume ~max2~0 == ~id2~0; {110923#true} is VALID [2022-02-20 18:32:51,934 INFO L290 TraceCheckUtils]: 31: Hoare triple {110923#true} assume ~max3~0 == ~id3~0; {110923#true} is VALID [2022-02-20 18:32:51,934 INFO L290 TraceCheckUtils]: 32: Hoare triple {110923#true} assume 0 == ~st1~0; {110923#true} is VALID [2022-02-20 18:32:51,934 INFO L290 TraceCheckUtils]: 33: Hoare triple {110923#true} assume 0 == ~st2~0; {110923#true} is VALID [2022-02-20 18:32:51,935 INFO L290 TraceCheckUtils]: 34: Hoare triple {110923#true} assume 0 == ~st3~0; {110925#(<= ~st3~0 0)} is VALID [2022-02-20 18:32:51,935 INFO L290 TraceCheckUtils]: 35: Hoare triple {110925#(<= ~st3~0 0)} assume 0 == ~nl1~0; {110925#(<= ~st3~0 0)} is VALID [2022-02-20 18:32:51,935 INFO L290 TraceCheckUtils]: 36: Hoare triple {110925#(<= ~st3~0 0)} assume 0 == ~nl2~0; {110925#(<= ~st3~0 0)} is VALID [2022-02-20 18:32:51,935 INFO L290 TraceCheckUtils]: 37: Hoare triple {110925#(<= ~st3~0 0)} assume 0 == ~nl3~0; {110926#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:51,936 INFO L290 TraceCheckUtils]: 38: Hoare triple {110926#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode1~0 % 256; {110926#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:51,936 INFO L290 TraceCheckUtils]: 39: Hoare triple {110926#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode2~0 % 256; {110926#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:51,936 INFO L290 TraceCheckUtils]: 40: Hoare triple {110926#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode3~0 % 256; {110926#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:51,937 INFO L290 TraceCheckUtils]: 41: Hoare triple {110926#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 != ~newmax1~0 % 256; {110926#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:51,937 INFO L290 TraceCheckUtils]: 42: Hoare triple {110926#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 != ~newmax2~0 % 256; {110926#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:51,937 INFO L290 TraceCheckUtils]: 43: Hoare triple {110926#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {110926#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:51,938 INFO L290 TraceCheckUtils]: 44: Hoare triple {110926#(<= (+ ~nl3~0 ~st3~0) 0)} init_#res#1 := init_~tmp___5~0#1; {110926#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:51,938 INFO L290 TraceCheckUtils]: 45: Hoare triple {110926#(<= (+ ~nl3~0 ~st3~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {110926#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:51,938 INFO L290 TraceCheckUtils]: 46: Hoare triple {110926#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {110926#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:51,939 INFO L290 TraceCheckUtils]: 47: Hoare triple {110926#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {110926#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:51,939 INFO L290 TraceCheckUtils]: 48: Hoare triple {110926#(<= (+ ~nl3~0 ~st3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {110926#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:51,939 INFO L290 TraceCheckUtils]: 49: Hoare triple {110926#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode1~0 % 256); {110926#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:51,940 INFO L290 TraceCheckUtils]: 50: Hoare triple {110926#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r1~0 % 256 < 2; {110926#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:51,940 INFO L290 TraceCheckUtils]: 51: Hoare triple {110926#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep12~0 % 256); {110926#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:51,940 INFO L290 TraceCheckUtils]: 52: Hoare triple {110926#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep13~0 % 256); {110926#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:51,940 INFO L290 TraceCheckUtils]: 53: Hoare triple {110926#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode1~0 := 1; {110926#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:51,941 INFO L290 TraceCheckUtils]: 54: Hoare triple {110926#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {110926#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:51,941 INFO L290 TraceCheckUtils]: 55: Hoare triple {110926#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode2~0 % 256); {110926#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:51,941 INFO L290 TraceCheckUtils]: 56: Hoare triple {110926#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r2~0 % 256 < 2; {110926#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:51,942 INFO L290 TraceCheckUtils]: 57: Hoare triple {110926#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep21~0 % 256); {110926#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:51,942 INFO L290 TraceCheckUtils]: 58: Hoare triple {110926#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep23~0 % 256); {110926#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:51,942 INFO L290 TraceCheckUtils]: 59: Hoare triple {110926#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode2~0 := 1; {110926#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:51,943 INFO L290 TraceCheckUtils]: 60: Hoare triple {110926#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {110926#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:51,943 INFO L290 TraceCheckUtils]: 61: Hoare triple {110926#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode3~0 % 256); {110926#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:51,943 INFO L290 TraceCheckUtils]: 62: Hoare triple {110926#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r3~0 % 256 < 2; {110926#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:51,943 INFO L290 TraceCheckUtils]: 63: Hoare triple {110926#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep31~0 % 256); {110926#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:51,944 INFO L290 TraceCheckUtils]: 64: Hoare triple {110926#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep32~0 % 256); {110926#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:51,944 INFO L290 TraceCheckUtils]: 65: Hoare triple {110926#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode3~0 := 1; {110926#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:51,944 INFO L290 TraceCheckUtils]: 66: Hoare triple {110926#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {110926#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:51,945 INFO L290 TraceCheckUtils]: 67: Hoare triple {110926#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {110926#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:51,945 INFO L290 TraceCheckUtils]: 68: Hoare triple {110926#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {110926#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:51,945 INFO L290 TraceCheckUtils]: 69: Hoare triple {110926#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st2~0 + ~nl2~0 <= 1; {110926#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:51,946 INFO L290 TraceCheckUtils]: 70: Hoare triple {110926#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(~st3~0 + ~nl3~0 <= 1);check_~tmp~1#1 := 0; {110924#false} is VALID [2022-02-20 18:32:51,946 INFO L290 TraceCheckUtils]: 71: Hoare triple {110924#false} check_#res#1 := check_~tmp~1#1; {110924#false} is VALID [2022-02-20 18:32:51,946 INFO L290 TraceCheckUtils]: 72: Hoare triple {110924#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {110924#false} is VALID [2022-02-20 18:32:51,946 INFO L290 TraceCheckUtils]: 73: Hoare triple {110924#false} assume 0 == assert_~arg#1 % 256; {110924#false} is VALID [2022-02-20 18:32:51,946 INFO L290 TraceCheckUtils]: 74: Hoare triple {110924#false} assume !false; {110924#false} is VALID [2022-02-20 18:32:51,946 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 18:32:51,947 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:51,947 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444512124] [2022-02-20 18:32:51,947 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444512124] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:51,947 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:51,947 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:32:51,947 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222935275] [2022-02-20 18:32:51,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:51,948 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2022-02-20 18:32:51,948 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:51,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:32:51,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:51,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:32:51,987 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:51,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:32:51,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:32:51,987 INFO L87 Difference]: Start difference. First operand 7077 states and 11375 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:33:14,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:33:14,159 INFO L93 Difference]: Finished difference Result 22184 states and 35744 transitions. [2022-02-20 18:33:14,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:33:14,159 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2022-02-20 18:33:14,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:33:14,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:33:14,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 610 transitions. [2022-02-20 18:33:14,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:33:14,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 610 transitions. [2022-02-20 18:33:14,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 610 transitions. [2022-02-20 18:33:14,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 610 edges. 610 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.