./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.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.1.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 a2c5c77b8d7714bea640ff99a5b0e1a19cf307340ccbaffec9b7e0efde04f6ec --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:31:18,093 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:31:18,094 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:31:18,122 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:31:18,122 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:31:18,125 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:31:18,126 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:31:18,131 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:31:18,133 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:31:18,137 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:31:18,138 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:31:18,138 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:31:18,139 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:31:18,140 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:31:18,142 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:31:18,143 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:31:18,147 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:31:18,148 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:31:18,149 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:31:18,151 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:31:18,154 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:31:18,155 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:31:18,156 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:31:18,156 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:31:18,158 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:31:18,159 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:31:18,159 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:31:18,160 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:31:18,161 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:31:18,161 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:31:18,162 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:31:18,162 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:31:18,163 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:31:18,164 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:31:18,165 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:31:18,165 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:31:18,166 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:31:18,166 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:31:18,166 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:31:18,167 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:31:18,167 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:31:18,168 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:31:18,183 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:31:18,189 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:31:18,190 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:31:18,190 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:31:18,190 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:31:18,191 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:31:18,191 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:31:18,192 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:31:18,192 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:31:18,192 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:31:18,193 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:31:18,193 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:31:18,193 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:31:18,193 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:31:18,193 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:31:18,193 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:31:18,194 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:31:18,194 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:31:18,194 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:31:18,194 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:31:18,194 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:31:18,194 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:31:18,194 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:31:18,194 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:31:18,195 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:31:18,195 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:31:18,195 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:31:18,195 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:31:18,195 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:31:18,195 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:31:18,196 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:31:18,196 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:31:18,196 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:31:18,196 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 -> a2c5c77b8d7714bea640ff99a5b0e1a19cf307340ccbaffec9b7e0efde04f6ec [2022-02-20 18:31:18,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:31:18,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:31:18,452 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:31:18,453 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:31:18,454 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:31:18,454 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.1.ufo.UNBOUNDED.pals.c [2022-02-20 18:31:18,498 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00c04b41a/271b8bd3e2364b378f217f5d59279c2d/FLAGbdf8fa04a [2022-02-20 18:31:18,947 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:31:18,948 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c [2022-02-20 18:31:18,960 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00c04b41a/271b8bd3e2364b378f217f5d59279c2d/FLAGbdf8fa04a [2022-02-20 18:31:19,308 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00c04b41a/271b8bd3e2364b378f217f5d59279c2d [2022-02-20 18:31:19,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:31:19,314 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:31:19,316 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:31:19,316 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:31:19,319 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:31:19,320 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:31:19" (1/1) ... [2022-02-20 18:31:19,335 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6313fcc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:19, skipping insertion in model container [2022-02-20 18:31:19,336 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:31:19" (1/1) ... [2022-02-20 18:31:19,340 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:31:19,390 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:31:19,595 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.1.ufo.UNBOUNDED.pals.c[12951,12964] [2022-02-20 18:31:19,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:31:19,612 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:31:19,680 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c[12951,12964] [2022-02-20 18:31:19,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:31:19,690 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:31:19,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:19 WrapperNode [2022-02-20 18:31:19,690 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:31:19,696 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:31:19,697 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:31:19,697 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:31:19,702 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:31:19" (1/1) ... [2022-02-20 18:31:19,720 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:31:19" (1/1) ... [2022-02-20 18:31:19,751 INFO L137 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 467 [2022-02-20 18:31:19,752 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:31:19,752 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:31:19,752 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:31:19,752 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:31:19,758 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:19" (1/1) ... [2022-02-20 18:31:19,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:19" (1/1) ... [2022-02-20 18:31:19,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:19" (1/1) ... [2022-02-20 18:31:19,761 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:19" (1/1) ... [2022-02-20 18:31:19,772 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:19" (1/1) ... [2022-02-20 18:31:19,778 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:19" (1/1) ... [2022-02-20 18:31:19,780 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:19" (1/1) ... [2022-02-20 18:31:19,782 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:31:19,783 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:31:19,783 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:31:19,783 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:31:19,784 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:19" (1/1) ... [2022-02-20 18:31:19,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:31:19,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:31:19,817 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:31:19,819 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:31:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:31:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:31:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:31:19,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:31:19,917 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:31:19,919 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:31:20,354 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:31:20,360 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:31:20,360 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 18:31:20,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:31:20 BoogieIcfgContainer [2022-02-20 18:31:20,362 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:31:20,363 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:31:20,363 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:31:20,366 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:31:20,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:31:19" (1/3) ... [2022-02-20 18:31:20,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf3b44f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:31:20, skipping insertion in model container [2022-02-20 18:31:20,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:19" (2/3) ... [2022-02-20 18:31:20,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf3b44f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:31:20, skipping insertion in model container [2022-02-20 18:31:20,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:31:20" (3/3) ... [2022-02-20 18:31:20,368 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c [2022-02-20 18:31:20,371 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:31:20,371 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:31:20,401 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:31:20,406 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:31:20,406 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:31:20,419 INFO L276 IsEmpty]: Start isEmpty. Operand has 143 states, 141 states have (on average 1.7375886524822695) internal successors, (245), 142 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have 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:31:20,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:31:20,424 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:20,425 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:31:20,425 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:20,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:20,469 INFO L85 PathProgramCache]: Analyzing trace with hash 126688108, now seen corresponding path program 1 times [2022-02-20 18:31:20,476 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:20,477 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906020589] [2022-02-20 18:31:20,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:20,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:20,665 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(43, 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:31:20,665 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:31:20,665 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:31:20,666 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:31:20,666 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:31:20,666 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:31:20,666 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:31:20,667 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:31:20,667 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:31:20,667 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:31:20,667 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:31:20,667 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:31:20,668 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:31:20,668 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:31:20,668 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:31:20,668 INFO L290 TraceCheckUtils]: 15: Hoare triple {146#true} init_#res#1 := init_~tmp___5~0#1; {146#true} is VALID [2022-02-20 18:31:20,668 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:31:20,670 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:31:20,671 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:31:20,671 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:31:20,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {147#false} assume !(0 != ~mode1~0 % 256); {147#false} is VALID [2022-02-20 18:31:20,671 INFO L290 TraceCheckUtils]: 21: Hoare triple {147#false} assume !(~r1~0 % 256 < 2); {147#false} is VALID [2022-02-20 18:31:20,671 INFO L290 TraceCheckUtils]: 22: Hoare triple {147#false} ~mode1~0 := 1; {147#false} is VALID [2022-02-20 18:31:20,672 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:31:20,672 INFO L290 TraceCheckUtils]: 24: Hoare triple {147#false} assume !(0 != ~mode2~0 % 256); {147#false} is VALID [2022-02-20 18:31:20,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {147#false} assume !(~r2~0 % 256 < 2); {147#false} is VALID [2022-02-20 18:31:20,672 INFO L290 TraceCheckUtils]: 26: Hoare triple {147#false} ~mode2~0 := 1; {147#false} is VALID [2022-02-20 18:31:20,672 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:31:20,673 INFO L290 TraceCheckUtils]: 28: Hoare triple {147#false} assume !(0 != ~mode3~0 % 256); {147#false} is VALID [2022-02-20 18:31:20,673 INFO L290 TraceCheckUtils]: 29: Hoare triple {147#false} assume !(~r3~0 % 256 < 2); {147#false} is VALID [2022-02-20 18:31:20,673 INFO L290 TraceCheckUtils]: 30: Hoare triple {147#false} ~mode3~0 := 1; {147#false} is VALID [2022-02-20 18:31:20,673 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:31:20,674 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:31:20,674 INFO L290 TraceCheckUtils]: 33: Hoare triple {147#false} check_#res#1 := check_~tmp~1#1; {147#false} is VALID [2022-02-20 18:31:20,674 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:31:20,674 INFO L290 TraceCheckUtils]: 35: Hoare triple {147#false} assume 0 == assert_~arg#1 % 256; {147#false} is VALID [2022-02-20 18:31:20,674 INFO L290 TraceCheckUtils]: 36: Hoare triple {147#false} assume !false; {147#false} is VALID [2022-02-20 18:31:20,675 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:31:20,675 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:20,676 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906020589] [2022-02-20 18:31:20,676 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906020589] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:20,676 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:20,676 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:31:20,677 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298717261] [2022-02-20 18:31:20,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:20,681 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:31:20,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:20,683 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:31:20,713 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:31:20,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:31:20,714 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:20,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:31:20,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:31:20,735 INFO L87 Difference]: Start difference. First operand has 143 states, 141 states have (on average 1.7375886524822695) internal successors, (245), 142 states have internal predecessors, (245), 0 states have call successors, (0), 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:31:20,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:20,869 INFO L93 Difference]: Finished difference Result 229 states and 391 transitions. [2022-02-20 18:31:20,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:31:20,870 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:31:20,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:20,872 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:31:20,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 391 transitions. [2022-02-20 18:31:20,878 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:31:20,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 391 transitions. [2022-02-20 18:31:20,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 391 transitions. [2022-02-20 18:31:21,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 391 edges. 391 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:21,147 INFO L225 Difference]: With dead ends: 229 [2022-02-20 18:31:21,147 INFO L226 Difference]: Without dead ends: 139 [2022-02-20 18:31:21,149 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:31:21,151 INFO L933 BasicCegarLoop]: 238 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, 238 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:31:21,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:31:21,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-02-20 18:31:21,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-02-20 18:31:21,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:21,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 139 states, 138 states have (on average 1.7246376811594204) internal successors, (238), 138 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have 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:31:21,186 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 139 states, 138 states have (on average 1.7246376811594204) internal successors, (238), 138 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have 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:31:21,187 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 139 states, 138 states have (on average 1.7246376811594204) internal successors, (238), 138 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have 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:31:21,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:21,192 INFO L93 Difference]: Finished difference Result 139 states and 238 transitions. [2022-02-20 18:31:21,192 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 238 transitions. [2022-02-20 18:31:21,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:21,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:21,193 INFO L74 IsIncluded]: Start isIncluded. First operand has 139 states, 138 states have (on average 1.7246376811594204) internal successors, (238), 138 states have internal predecessors, (238), 0 states have call successors, (0), 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:31:21,194 INFO L87 Difference]: Start difference. First operand has 139 states, 138 states have (on average 1.7246376811594204) internal successors, (238), 138 states have internal predecessors, (238), 0 states have call successors, (0), 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:31:21,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:21,198 INFO L93 Difference]: Finished difference Result 139 states and 238 transitions. [2022-02-20 18:31:21,198 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 238 transitions. [2022-02-20 18:31:21,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:21,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:21,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:21,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:21,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.7246376811594204) internal successors, (238), 138 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have 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:31:21,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 238 transitions. [2022-02-20 18:31:21,205 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 238 transitions. Word has length 37 [2022-02-20 18:31:21,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:21,205 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 238 transitions. [2022-02-20 18:31:21,205 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:31:21,205 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 238 transitions. [2022-02-20 18:31:21,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:31:21,207 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:21,207 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:31:21,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:31:21,207 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:21,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:21,208 INFO L85 PathProgramCache]: Analyzing trace with hash -690960342, now seen corresponding path program 1 times [2022-02-20 18:31:21,208 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:21,208 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948398457] [2022-02-20 18:31:21,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:21,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:21,287 INFO L290 TraceCheckUtils]: 0: Hoare triple {823#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(43, 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; {823#true} is VALID [2022-02-20 18:31:21,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {823#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; {823#true} is VALID [2022-02-20 18:31:21,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {823#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {823#true} is VALID [2022-02-20 18:31:21,288 INFO L290 TraceCheckUtils]: 3: Hoare triple {823#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {823#true} is VALID [2022-02-20 18:31:21,288 INFO L290 TraceCheckUtils]: 4: Hoare triple {823#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {823#true} is VALID [2022-02-20 18:31:21,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {823#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {823#true} is VALID [2022-02-20 18:31:21,289 INFO L290 TraceCheckUtils]: 6: Hoare triple {823#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {823#true} is VALID [2022-02-20 18:31:21,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {823#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {823#true} is VALID [2022-02-20 18:31:21,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {823#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {823#true} is VALID [2022-02-20 18:31:21,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {823#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {823#true} is VALID [2022-02-20 18:31:21,290 INFO L290 TraceCheckUtils]: 10: Hoare triple {823#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {823#true} is VALID [2022-02-20 18:31:21,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {823#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {823#true} is VALID [2022-02-20 18:31:21,290 INFO L290 TraceCheckUtils]: 12: Hoare triple {823#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {823#true} is VALID [2022-02-20 18:31:21,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {823#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {823#true} is VALID [2022-02-20 18:31:21,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {823#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; {825#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} is VALID [2022-02-20 18:31:21,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {825#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} init_#res#1 := init_~tmp___5~0#1; {826#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 18:31:21,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {826#(= |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; {827#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 18:31:21,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {827#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {824#false} is VALID [2022-02-20 18:31:21,292 INFO L290 TraceCheckUtils]: 18: Hoare triple {824#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; {824#false} is VALID [2022-02-20 18:31:21,293 INFO L290 TraceCheckUtils]: 19: Hoare triple {824#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; {824#false} is VALID [2022-02-20 18:31:21,293 INFO L290 TraceCheckUtils]: 20: Hoare triple {824#false} assume !(0 != ~mode1~0 % 256); {824#false} is VALID [2022-02-20 18:31:21,293 INFO L290 TraceCheckUtils]: 21: Hoare triple {824#false} assume !(~r1~0 % 256 < 2); {824#false} is VALID [2022-02-20 18:31:21,293 INFO L290 TraceCheckUtils]: 22: Hoare triple {824#false} ~mode1~0 := 1; {824#false} is VALID [2022-02-20 18:31:21,293 INFO L290 TraceCheckUtils]: 23: Hoare triple {824#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; {824#false} is VALID [2022-02-20 18:31:21,294 INFO L290 TraceCheckUtils]: 24: Hoare triple {824#false} assume !(0 != ~mode2~0 % 256); {824#false} is VALID [2022-02-20 18:31:21,294 INFO L290 TraceCheckUtils]: 25: Hoare triple {824#false} assume !(~r2~0 % 256 < 2); {824#false} is VALID [2022-02-20 18:31:21,294 INFO L290 TraceCheckUtils]: 26: Hoare triple {824#false} ~mode2~0 := 1; {824#false} is VALID [2022-02-20 18:31:21,294 INFO L290 TraceCheckUtils]: 27: Hoare triple {824#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; {824#false} is VALID [2022-02-20 18:31:21,294 INFO L290 TraceCheckUtils]: 28: Hoare triple {824#false} assume !(0 != ~mode3~0 % 256); {824#false} is VALID [2022-02-20 18:31:21,295 INFO L290 TraceCheckUtils]: 29: Hoare triple {824#false} assume !(~r3~0 % 256 < 2); {824#false} is VALID [2022-02-20 18:31:21,295 INFO L290 TraceCheckUtils]: 30: Hoare triple {824#false} ~mode3~0 := 1; {824#false} is VALID [2022-02-20 18:31:21,295 INFO L290 TraceCheckUtils]: 31: Hoare triple {824#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; {824#false} is VALID [2022-02-20 18:31:21,295 INFO L290 TraceCheckUtils]: 32: Hoare triple {824#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {824#false} is VALID [2022-02-20 18:31:21,295 INFO L290 TraceCheckUtils]: 33: Hoare triple {824#false} check_#res#1 := check_~tmp~1#1; {824#false} is VALID [2022-02-20 18:31:21,296 INFO L290 TraceCheckUtils]: 34: Hoare triple {824#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; {824#false} is VALID [2022-02-20 18:31:21,296 INFO L290 TraceCheckUtils]: 35: Hoare triple {824#false} assume 0 == assert_~arg#1 % 256; {824#false} is VALID [2022-02-20 18:31:21,296 INFO L290 TraceCheckUtils]: 36: Hoare triple {824#false} assume !false; {824#false} is VALID [2022-02-20 18:31:21,296 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:31:21,297 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:21,297 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948398457] [2022-02-20 18:31:21,297 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948398457] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:21,297 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:21,297 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:31:21,297 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203350623] [2022-02-20 18:31:21,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:21,299 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:31:21,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:21,299 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:31:21,320 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:31:21,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:31:21,321 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:21,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:31:21,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:31:21,322 INFO L87 Difference]: Start difference. First operand 139 states and 238 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:31:21,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:21,689 INFO L93 Difference]: Finished difference Result 228 states and 384 transitions. [2022-02-20 18:31:21,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:31:21,690 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:31:21,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:21,690 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:31:21,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 384 transitions. [2022-02-20 18:31:21,693 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:31:21,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 384 transitions. [2022-02-20 18:31:21,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 384 transitions. [2022-02-20 18:31:21,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 384 edges. 384 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:21,936 INFO L225 Difference]: With dead ends: 228 [2022-02-20 18:31:21,936 INFO L226 Difference]: Without dead ends: 139 [2022-02-20 18:31:21,937 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:31:21,938 INFO L933 BasicCegarLoop]: 236 mSDtfsCounter, 3 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:31:21,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 917 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:31:21,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-02-20 18:31:21,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-02-20 18:31:21,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:21,943 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 139 states, 138 states have (on average 1.5507246376811594) internal successors, (214), 138 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have 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:31:21,944 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 139 states, 138 states have (on average 1.5507246376811594) internal successors, (214), 138 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have 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:31:21,944 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 139 states, 138 states have (on average 1.5507246376811594) internal successors, (214), 138 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have 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:31:21,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:21,947 INFO L93 Difference]: Finished difference Result 139 states and 214 transitions. [2022-02-20 18:31:21,947 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 214 transitions. [2022-02-20 18:31:21,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:21,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:21,948 INFO L74 IsIncluded]: Start isIncluded. First operand has 139 states, 138 states have (on average 1.5507246376811594) internal successors, (214), 138 states have internal predecessors, (214), 0 states have call successors, (0), 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:31:21,949 INFO L87 Difference]: Start difference. First operand has 139 states, 138 states have (on average 1.5507246376811594) internal successors, (214), 138 states have internal predecessors, (214), 0 states have call successors, (0), 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:31:21,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:21,952 INFO L93 Difference]: Finished difference Result 139 states and 214 transitions. [2022-02-20 18:31:21,952 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 214 transitions. [2022-02-20 18:31:21,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:21,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:21,953 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:21,953 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:21,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.5507246376811594) internal successors, (214), 138 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have 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:31:21,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 214 transitions. [2022-02-20 18:31:21,956 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 214 transitions. Word has length 37 [2022-02-20 18:31:21,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:21,957 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 214 transitions. [2022-02-20 18:31:21,957 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:31:21,957 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 214 transitions. [2022-02-20 18:31:21,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-20 18:31:21,958 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:21,958 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] [2022-02-20 18:31:21,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:31:21,958 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:21,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:21,959 INFO L85 PathProgramCache]: Analyzing trace with hash 747585835, now seen corresponding path program 1 times [2022-02-20 18:31:21,959 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:21,959 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655364703] [2022-02-20 18:31:21,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:21,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:22,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {1506#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(43, 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; {1506#true} is VALID [2022-02-20 18:31:22,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {1506#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; {1506#true} is VALID [2022-02-20 18:31:22,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {1506#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {1506#true} is VALID [2022-02-20 18:31:22,032 INFO L290 TraceCheckUtils]: 3: Hoare triple {1506#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {1506#true} is VALID [2022-02-20 18:31:22,032 INFO L290 TraceCheckUtils]: 4: Hoare triple {1506#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {1506#true} is VALID [2022-02-20 18:31:22,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {1506#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {1506#true} is VALID [2022-02-20 18:31:22,032 INFO L290 TraceCheckUtils]: 6: Hoare triple {1506#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {1506#true} is VALID [2022-02-20 18:31:22,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {1506#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {1506#true} is VALID [2022-02-20 18:31:22,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {1506#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {1506#true} is VALID [2022-02-20 18:31:22,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {1506#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {1506#true} is VALID [2022-02-20 18:31:22,033 INFO L290 TraceCheckUtils]: 10: Hoare triple {1506#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {1506#true} is VALID [2022-02-20 18:31:22,033 INFO L290 TraceCheckUtils]: 11: Hoare triple {1506#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {1506#true} is VALID [2022-02-20 18:31:22,033 INFO L290 TraceCheckUtils]: 12: Hoare triple {1506#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {1506#true} is VALID [2022-02-20 18:31:22,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {1506#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {1506#true} is VALID [2022-02-20 18:31:22,034 INFO L290 TraceCheckUtils]: 14: Hoare triple {1506#true} assume ~id1~0 != ~id2~0; {1506#true} is VALID [2022-02-20 18:31:22,034 INFO L290 TraceCheckUtils]: 15: Hoare triple {1506#true} assume ~id1~0 != ~id3~0; {1506#true} is VALID [2022-02-20 18:31:22,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {1506#true} assume ~id2~0 != ~id3~0; {1506#true} is VALID [2022-02-20 18:31:22,034 INFO L290 TraceCheckUtils]: 17: Hoare triple {1506#true} assume ~id1~0 >= 0; {1506#true} is VALID [2022-02-20 18:31:22,034 INFO L290 TraceCheckUtils]: 18: Hoare triple {1506#true} assume ~id2~0 >= 0; {1506#true} is VALID [2022-02-20 18:31:22,035 INFO L290 TraceCheckUtils]: 19: Hoare triple {1506#true} assume ~id3~0 >= 0; {1506#true} is VALID [2022-02-20 18:31:22,035 INFO L290 TraceCheckUtils]: 20: Hoare triple {1506#true} assume 0 == ~r1~0 % 256; {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:22,036 INFO L290 TraceCheckUtils]: 21: Hoare triple {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~r2~0 % 256; {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:22,036 INFO L290 TraceCheckUtils]: 22: Hoare triple {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~r3~0 % 256; {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:22,036 INFO L290 TraceCheckUtils]: 23: Hoare triple {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max1~0 == ~id1~0; {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:22,037 INFO L290 TraceCheckUtils]: 24: Hoare triple {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max2~0 == ~id2~0; {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:22,037 INFO L290 TraceCheckUtils]: 25: Hoare triple {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max3~0 == ~id3~0; {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:22,037 INFO L290 TraceCheckUtils]: 26: Hoare triple {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:22,038 INFO L290 TraceCheckUtils]: 27: Hoare triple {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:22,038 INFO L290 TraceCheckUtils]: 28: Hoare triple {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:22,038 INFO L290 TraceCheckUtils]: 29: Hoare triple {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl1~0; {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:22,039 INFO L290 TraceCheckUtils]: 30: Hoare triple {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl2~0; {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:22,039 INFO L290 TraceCheckUtils]: 31: Hoare triple {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl3~0; {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:22,040 INFO L290 TraceCheckUtils]: 32: Hoare triple {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:22,040 INFO L290 TraceCheckUtils]: 33: Hoare triple {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:22,040 INFO L290 TraceCheckUtils]: 34: Hoare triple {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:22,041 INFO L290 TraceCheckUtils]: 35: Hoare triple {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != ~newmax1~0 % 256; {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:22,041 INFO L290 TraceCheckUtils]: 36: Hoare triple {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != ~newmax2~0 % 256; {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:22,041 INFO L290 TraceCheckUtils]: 37: Hoare triple {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:22,042 INFO L290 TraceCheckUtils]: 38: Hoare triple {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} init_#res#1 := init_~tmp___5~0#1; {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:22,042 INFO L290 TraceCheckUtils]: 39: Hoare triple {1508#(<= ~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; {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:22,042 INFO L290 TraceCheckUtils]: 40: Hoare triple {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == assume_abort_if_not_~cond#1); {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:22,043 INFO L290 TraceCheckUtils]: 41: Hoare triple {1508#(<= ~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; {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:22,043 INFO L290 TraceCheckUtils]: 42: Hoare triple {1508#(<= ~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; {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:22,043 INFO L290 TraceCheckUtils]: 43: Hoare triple {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode1~0 % 256); {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:22,044 INFO L290 TraceCheckUtils]: 44: Hoare triple {1508#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~r1~0 % 256 < 2); {1507#false} is VALID [2022-02-20 18:31:22,044 INFO L290 TraceCheckUtils]: 45: Hoare triple {1507#false} ~mode1~0 := 1; {1507#false} is VALID [2022-02-20 18:31:22,044 INFO L290 TraceCheckUtils]: 46: Hoare triple {1507#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; {1507#false} is VALID [2022-02-20 18:31:22,044 INFO L290 TraceCheckUtils]: 47: Hoare triple {1507#false} assume !(0 != ~mode2~0 % 256); {1507#false} is VALID [2022-02-20 18:31:22,045 INFO L290 TraceCheckUtils]: 48: Hoare triple {1507#false} assume !(~r2~0 % 256 < 2); {1507#false} is VALID [2022-02-20 18:31:22,045 INFO L290 TraceCheckUtils]: 49: Hoare triple {1507#false} ~mode2~0 := 1; {1507#false} is VALID [2022-02-20 18:31:22,045 INFO L290 TraceCheckUtils]: 50: Hoare triple {1507#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; {1507#false} is VALID [2022-02-20 18:31:22,045 INFO L290 TraceCheckUtils]: 51: Hoare triple {1507#false} assume !(0 != ~mode3~0 % 256); {1507#false} is VALID [2022-02-20 18:31:22,045 INFO L290 TraceCheckUtils]: 52: Hoare triple {1507#false} assume !(~r3~0 % 256 < 2); {1507#false} is VALID [2022-02-20 18:31:22,045 INFO L290 TraceCheckUtils]: 53: Hoare triple {1507#false} ~mode3~0 := 1; {1507#false} is VALID [2022-02-20 18:31:22,046 INFO L290 TraceCheckUtils]: 54: Hoare triple {1507#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; {1507#false} is VALID [2022-02-20 18:31:22,046 INFO L290 TraceCheckUtils]: 55: Hoare triple {1507#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {1507#false} is VALID [2022-02-20 18:31:22,046 INFO L290 TraceCheckUtils]: 56: Hoare triple {1507#false} check_#res#1 := check_~tmp~1#1; {1507#false} is VALID [2022-02-20 18:31:22,046 INFO L290 TraceCheckUtils]: 57: Hoare triple {1507#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; {1507#false} is VALID [2022-02-20 18:31:22,046 INFO L290 TraceCheckUtils]: 58: Hoare triple {1507#false} assume 0 == assert_~arg#1 % 256; {1507#false} is VALID [2022-02-20 18:31:22,046 INFO L290 TraceCheckUtils]: 59: Hoare triple {1507#false} assume !false; {1507#false} is VALID [2022-02-20 18:31:22,047 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:31:22,047 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:22,047 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655364703] [2022-02-20 18:31:22,047 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655364703] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:22,048 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:22,048 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:31:22,048 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655001304] [2022-02-20 18:31:22,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:22,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-02-20 18:31:22,049 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:22,049 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:22,094 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:22,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:31:22,095 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:22,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:31:22,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:31:22,095 INFO L87 Difference]: Start difference. First operand 139 states and 214 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:22,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:22,266 INFO L93 Difference]: Finished difference Result 299 states and 480 transitions. [2022-02-20 18:31:22,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:31:22,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-02-20 18:31:22,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:22,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:22,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-02-20 18:31:22,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:22,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-02-20 18:31:22,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 480 transitions. [2022-02-20 18:31:22,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:22,591 INFO L225 Difference]: With dead ends: 299 [2022-02-20 18:31:22,591 INFO L226 Difference]: Without dead ends: 214 [2022-02-20 18:31:22,592 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:31:22,593 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 115 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:31:22,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 382 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:31:22,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-02-20 18:31:22,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 211. [2022-02-20 18:31:22,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:22,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 214 states. Second operand has 211 states, 210 states have (on average 1.5714285714285714) internal successors, (330), 210 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have 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:31:22,619 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand has 211 states, 210 states have (on average 1.5714285714285714) internal successors, (330), 210 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have 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:31:22,619 INFO L87 Difference]: Start difference. First operand 214 states. Second operand has 211 states, 210 states have (on average 1.5714285714285714) internal successors, (330), 210 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have 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:31:22,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:22,624 INFO L93 Difference]: Finished difference Result 214 states and 332 transitions. [2022-02-20 18:31:22,624 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 332 transitions. [2022-02-20 18:31:22,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:22,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:22,625 INFO L74 IsIncluded]: Start isIncluded. First operand has 211 states, 210 states have (on average 1.5714285714285714) internal successors, (330), 210 states have internal predecessors, (330), 0 states have call successors, (0), 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 214 states. [2022-02-20 18:31:22,626 INFO L87 Difference]: Start difference. First operand has 211 states, 210 states have (on average 1.5714285714285714) internal successors, (330), 210 states have internal predecessors, (330), 0 states have call successors, (0), 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 214 states. [2022-02-20 18:31:22,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:22,631 INFO L93 Difference]: Finished difference Result 214 states and 332 transitions. [2022-02-20 18:31:22,631 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 332 transitions. [2022-02-20 18:31:22,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:22,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:22,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:22,632 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:22,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.5714285714285714) internal successors, (330), 210 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have 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:31:22,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 330 transitions. [2022-02-20 18:31:22,637 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 330 transitions. Word has length 60 [2022-02-20 18:31:22,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:22,637 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 330 transitions. [2022-02-20 18:31:22,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:22,638 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 330 transitions. [2022-02-20 18:31:22,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 18:31:22,638 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:22,639 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] [2022-02-20 18:31:22,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:31:22,642 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:22,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:22,643 INFO L85 PathProgramCache]: Analyzing trace with hash -53855584, now seen corresponding path program 1 times [2022-02-20 18:31:22,643 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:22,643 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380463492] [2022-02-20 18:31:22,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:22,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:22,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:22,758 INFO L290 TraceCheckUtils]: 0: Hoare triple {2491#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(43, 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; {2491#true} is VALID [2022-02-20 18:31:22,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {2491#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; {2491#true} is VALID [2022-02-20 18:31:22,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {2491#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {2491#true} is VALID [2022-02-20 18:31:22,758 INFO L290 TraceCheckUtils]: 3: Hoare triple {2491#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {2491#true} is VALID [2022-02-20 18:31:22,759 INFO L290 TraceCheckUtils]: 4: Hoare triple {2491#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {2491#true} is VALID [2022-02-20 18:31:22,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {2491#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {2491#true} is VALID [2022-02-20 18:31:22,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {2491#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {2491#true} is VALID [2022-02-20 18:31:22,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {2491#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {2491#true} is VALID [2022-02-20 18:31:22,759 INFO L290 TraceCheckUtils]: 8: Hoare triple {2491#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {2491#true} is VALID [2022-02-20 18:31:22,759 INFO L290 TraceCheckUtils]: 9: Hoare triple {2491#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {2491#true} is VALID [2022-02-20 18:31:22,759 INFO L290 TraceCheckUtils]: 10: Hoare triple {2491#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {2491#true} is VALID [2022-02-20 18:31:22,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {2491#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {2491#true} is VALID [2022-02-20 18:31:22,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {2491#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {2491#true} is VALID [2022-02-20 18:31:22,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {2491#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {2491#true} is VALID [2022-02-20 18:31:22,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {2491#true} assume ~id1~0 != ~id2~0; {2491#true} is VALID [2022-02-20 18:31:22,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {2491#true} assume ~id1~0 != ~id3~0; {2491#true} is VALID [2022-02-20 18:31:22,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {2491#true} assume ~id2~0 != ~id3~0; {2491#true} is VALID [2022-02-20 18:31:22,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {2491#true} assume ~id1~0 >= 0; {2491#true} is VALID [2022-02-20 18:31:22,761 INFO L290 TraceCheckUtils]: 18: Hoare triple {2491#true} assume ~id2~0 >= 0; {2491#true} is VALID [2022-02-20 18:31:22,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {2491#true} assume ~id3~0 >= 0; {2491#true} is VALID [2022-02-20 18:31:22,761 INFO L290 TraceCheckUtils]: 20: Hoare triple {2491#true} assume 0 == ~r1~0 % 256; {2491#true} is VALID [2022-02-20 18:31:22,763 INFO L290 TraceCheckUtils]: 21: Hoare triple {2491#true} assume 0 == ~r2~0 % 256; {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:22,763 INFO L290 TraceCheckUtils]: 22: Hoare triple {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~r3~0 % 256; {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:22,763 INFO L290 TraceCheckUtils]: 23: Hoare triple {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max1~0 == ~id1~0; {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:22,764 INFO L290 TraceCheckUtils]: 24: Hoare triple {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max2~0 == ~id2~0; {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:22,764 INFO L290 TraceCheckUtils]: 25: Hoare triple {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max3~0 == ~id3~0; {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:22,764 INFO L290 TraceCheckUtils]: 26: Hoare triple {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st1~0; {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:22,765 INFO L290 TraceCheckUtils]: 27: Hoare triple {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st2~0; {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:22,765 INFO L290 TraceCheckUtils]: 28: Hoare triple {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st3~0; {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:22,765 INFO L290 TraceCheckUtils]: 29: Hoare triple {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl1~0; {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:22,766 INFO L290 TraceCheckUtils]: 30: Hoare triple {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl2~0; {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:22,766 INFO L290 TraceCheckUtils]: 31: Hoare triple {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl3~0; {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:22,766 INFO L290 TraceCheckUtils]: 32: Hoare triple {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode1~0 % 256; {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:22,766 INFO L290 TraceCheckUtils]: 33: Hoare triple {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode2~0 % 256; {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:22,767 INFO L290 TraceCheckUtils]: 34: Hoare triple {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode3~0 % 256; {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:22,767 INFO L290 TraceCheckUtils]: 35: Hoare triple {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != ~newmax1~0 % 256; {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:22,767 INFO L290 TraceCheckUtils]: 36: Hoare triple {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != ~newmax2~0 % 256; {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:22,768 INFO L290 TraceCheckUtils]: 37: Hoare triple {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:22,768 INFO L290 TraceCheckUtils]: 38: Hoare triple {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} init_#res#1 := init_~tmp___5~0#1; {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:22,768 INFO L290 TraceCheckUtils]: 39: Hoare triple {2493#(<= ~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; {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:22,769 INFO L290 TraceCheckUtils]: 40: Hoare triple {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == assume_abort_if_not_~cond#1); {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:22,769 INFO L290 TraceCheckUtils]: 41: Hoare triple {2493#(<= ~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; {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:22,769 INFO L290 TraceCheckUtils]: 42: Hoare triple {2493#(<= ~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; {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:22,770 INFO L290 TraceCheckUtils]: 43: Hoare triple {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~mode1~0 % 256); {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:22,770 INFO L290 TraceCheckUtils]: 44: Hoare triple {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~r1~0 % 256 < 2; {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:22,771 INFO L290 TraceCheckUtils]: 45: Hoare triple {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~ep12~0 % 256); {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:22,771 INFO L290 TraceCheckUtils]: 46: Hoare triple {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~ep13~0 % 256); {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:22,771 INFO L290 TraceCheckUtils]: 47: Hoare triple {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} ~mode1~0 := 1; {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:22,772 INFO L290 TraceCheckUtils]: 48: Hoare triple {2493#(<= ~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; {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:22,772 INFO L290 TraceCheckUtils]: 49: Hoare triple {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~mode2~0 % 256); {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:22,772 INFO L290 TraceCheckUtils]: 50: Hoare triple {2493#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(~r2~0 % 256 < 2); {2492#false} is VALID [2022-02-20 18:31:22,774 INFO L290 TraceCheckUtils]: 51: Hoare triple {2492#false} ~mode2~0 := 1; {2492#false} is VALID [2022-02-20 18:31:22,774 INFO L290 TraceCheckUtils]: 52: Hoare triple {2492#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; {2492#false} is VALID [2022-02-20 18:31:22,775 INFO L290 TraceCheckUtils]: 53: Hoare triple {2492#false} assume !(0 != ~mode3~0 % 256); {2492#false} is VALID [2022-02-20 18:31:22,775 INFO L290 TraceCheckUtils]: 54: Hoare triple {2492#false} assume !(~r3~0 % 256 < 2); {2492#false} is VALID [2022-02-20 18:31:22,775 INFO L290 TraceCheckUtils]: 55: Hoare triple {2492#false} ~mode3~0 := 1; {2492#false} is VALID [2022-02-20 18:31:22,775 INFO L290 TraceCheckUtils]: 56: Hoare triple {2492#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; {2492#false} is VALID [2022-02-20 18:31:22,775 INFO L290 TraceCheckUtils]: 57: Hoare triple {2492#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {2492#false} is VALID [2022-02-20 18:31:22,775 INFO L290 TraceCheckUtils]: 58: Hoare triple {2492#false} check_#res#1 := check_~tmp~1#1; {2492#false} is VALID [2022-02-20 18:31:22,776 INFO L290 TraceCheckUtils]: 59: Hoare triple {2492#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; {2492#false} is VALID [2022-02-20 18:31:22,776 INFO L290 TraceCheckUtils]: 60: Hoare triple {2492#false} assume 0 == assert_~arg#1 % 256; {2492#false} is VALID [2022-02-20 18:31:22,776 INFO L290 TraceCheckUtils]: 61: Hoare triple {2492#false} assume !false; {2492#false} is VALID [2022-02-20 18:31:22,776 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:31:22,777 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:22,778 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380463492] [2022-02-20 18:31:22,778 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380463492] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:22,778 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:22,778 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:31:22,778 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519886267] [2022-02-20 18:31:22,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:22,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-02-20 18:31:22,779 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:22,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have 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:31:22,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:22,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:31:22,826 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:22,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:31:22,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:31:22,828 INFO L87 Difference]: Start difference. First operand 211 states and 330 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have 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:31:23,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:23,098 INFO L93 Difference]: Finished difference Result 509 states and 818 transitions. [2022-02-20 18:31:23,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:31:23,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-02-20 18:31:23,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:23,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have 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:31:23,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2022-02-20 18:31:23,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have 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:31:23,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2022-02-20 18:31:23,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 484 transitions. [2022-02-20 18:31:23,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 484 edges. 484 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:23,353 INFO L225 Difference]: With dead ends: 509 [2022-02-20 18:31:23,354 INFO L226 Difference]: Without dead ends: 352 [2022-02-20 18:31:23,356 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:31:23,358 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 117 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:31:23,360 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 395 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:31:23,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2022-02-20 18:31:23,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 348. [2022-02-20 18:31:23,404 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:23,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 352 states. Second operand has 348 states, 347 states have (on average 1.5936599423631124) internal successors, (553), 347 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have 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:31:23,405 INFO L74 IsIncluded]: Start isIncluded. First operand 352 states. Second operand has 348 states, 347 states have (on average 1.5936599423631124) internal successors, (553), 347 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have 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:31:23,406 INFO L87 Difference]: Start difference. First operand 352 states. Second operand has 348 states, 347 states have (on average 1.5936599423631124) internal successors, (553), 347 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have 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:31:23,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:23,418 INFO L93 Difference]: Finished difference Result 352 states and 556 transitions. [2022-02-20 18:31:23,418 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 556 transitions. [2022-02-20 18:31:23,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:23,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:23,420 INFO L74 IsIncluded]: Start isIncluded. First operand has 348 states, 347 states have (on average 1.5936599423631124) internal successors, (553), 347 states have internal predecessors, (553), 0 states have call successors, (0), 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 352 states. [2022-02-20 18:31:23,420 INFO L87 Difference]: Start difference. First operand has 348 states, 347 states have (on average 1.5936599423631124) internal successors, (553), 347 states have internal predecessors, (553), 0 states have call successors, (0), 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 352 states. [2022-02-20 18:31:23,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:23,433 INFO L93 Difference]: Finished difference Result 352 states and 556 transitions. [2022-02-20 18:31:23,433 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 556 transitions. [2022-02-20 18:31:23,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:23,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:23,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:23,435 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:23,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 347 states have (on average 1.5936599423631124) internal successors, (553), 347 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have 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:31:23,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 553 transitions. [2022-02-20 18:31:23,442 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 553 transitions. Word has length 62 [2022-02-20 18:31:23,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:23,443 INFO L470 AbstractCegarLoop]: Abstraction has 348 states and 553 transitions. [2022-02-20 18:31:23,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have 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:31:23,444 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 553 transitions. [2022-02-20 18:31:23,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:31:23,447 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:23,449 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] [2022-02-20 18:31:23,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:31:23,449 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:23,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:23,450 INFO L85 PathProgramCache]: Analyzing trace with hash -730458987, now seen corresponding path program 1 times [2022-02-20 18:31:23,450 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:23,450 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459429348] [2022-02-20 18:31:23,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:23,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:23,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:23,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {4139#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(43, 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; {4139#true} is VALID [2022-02-20 18:31:23,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {4139#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; {4139#true} is VALID [2022-02-20 18:31:23,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {4139#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {4139#true} is VALID [2022-02-20 18:31:23,552 INFO L290 TraceCheckUtils]: 3: Hoare triple {4139#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {4139#true} is VALID [2022-02-20 18:31:23,552 INFO L290 TraceCheckUtils]: 4: Hoare triple {4139#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {4139#true} is VALID [2022-02-20 18:31:23,553 INFO L290 TraceCheckUtils]: 5: Hoare triple {4139#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {4139#true} is VALID [2022-02-20 18:31:23,553 INFO L290 TraceCheckUtils]: 6: Hoare triple {4139#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {4139#true} is VALID [2022-02-20 18:31:23,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {4139#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {4139#true} is VALID [2022-02-20 18:31:23,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {4139#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {4139#true} is VALID [2022-02-20 18:31:23,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {4139#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {4139#true} is VALID [2022-02-20 18:31:23,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {4139#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {4139#true} is VALID [2022-02-20 18:31:23,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {4139#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {4139#true} is VALID [2022-02-20 18:31:23,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {4139#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {4139#true} is VALID [2022-02-20 18:31:23,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {4139#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {4139#true} is VALID [2022-02-20 18:31:23,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {4139#true} assume ~id1~0 != ~id2~0; {4139#true} is VALID [2022-02-20 18:31:23,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {4139#true} assume ~id1~0 != ~id3~0; {4139#true} is VALID [2022-02-20 18:31:23,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {4139#true} assume ~id2~0 != ~id3~0; {4139#true} is VALID [2022-02-20 18:31:23,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {4139#true} assume ~id1~0 >= 0; {4139#true} is VALID [2022-02-20 18:31:23,557 INFO L290 TraceCheckUtils]: 18: Hoare triple {4139#true} assume ~id2~0 >= 0; {4139#true} is VALID [2022-02-20 18:31:23,557 INFO L290 TraceCheckUtils]: 19: Hoare triple {4139#true} assume ~id3~0 >= 0; {4139#true} is VALID [2022-02-20 18:31:23,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {4139#true} assume 0 == ~r1~0 % 256; {4139#true} is VALID [2022-02-20 18:31:23,558 INFO L290 TraceCheckUtils]: 21: Hoare triple {4139#true} assume 0 == ~r2~0 % 256; {4139#true} is VALID [2022-02-20 18:31:23,558 INFO L290 TraceCheckUtils]: 22: Hoare triple {4139#true} assume 0 == ~r3~0 % 256; {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:23,559 INFO L290 TraceCheckUtils]: 23: Hoare triple {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max1~0 == ~id1~0; {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:23,559 INFO L290 TraceCheckUtils]: 24: Hoare triple {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max2~0 == ~id2~0; {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:23,559 INFO L290 TraceCheckUtils]: 25: Hoare triple {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max3~0 == ~id3~0; {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:23,559 INFO L290 TraceCheckUtils]: 26: Hoare triple {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st1~0; {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:23,560 INFO L290 TraceCheckUtils]: 27: Hoare triple {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st2~0; {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:23,561 INFO L290 TraceCheckUtils]: 28: Hoare triple {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st3~0; {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:23,561 INFO L290 TraceCheckUtils]: 29: Hoare triple {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl1~0; {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:23,561 INFO L290 TraceCheckUtils]: 30: Hoare triple {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl2~0; {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:23,562 INFO L290 TraceCheckUtils]: 31: Hoare triple {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl3~0; {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:23,562 INFO L290 TraceCheckUtils]: 32: Hoare triple {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode1~0 % 256; {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:23,562 INFO L290 TraceCheckUtils]: 33: Hoare triple {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode2~0 % 256; {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:23,563 INFO L290 TraceCheckUtils]: 34: Hoare triple {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode3~0 % 256; {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:23,563 INFO L290 TraceCheckUtils]: 35: Hoare triple {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != ~newmax1~0 % 256; {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:23,563 INFO L290 TraceCheckUtils]: 36: Hoare triple {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != ~newmax2~0 % 256; {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:23,564 INFO L290 TraceCheckUtils]: 37: Hoare triple {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:23,564 INFO L290 TraceCheckUtils]: 38: Hoare triple {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} init_#res#1 := init_~tmp___5~0#1; {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:23,564 INFO L290 TraceCheckUtils]: 39: Hoare triple {4141#(<= ~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; {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:23,565 INFO L290 TraceCheckUtils]: 40: Hoare triple {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == assume_abort_if_not_~cond#1); {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:23,565 INFO L290 TraceCheckUtils]: 41: Hoare triple {4141#(<= ~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; {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:23,565 INFO L290 TraceCheckUtils]: 42: Hoare triple {4141#(<= ~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; {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:23,566 INFO L290 TraceCheckUtils]: 43: Hoare triple {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~mode1~0 % 256); {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:23,566 INFO L290 TraceCheckUtils]: 44: Hoare triple {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~r1~0 % 256 < 2; {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:23,566 INFO L290 TraceCheckUtils]: 45: Hoare triple {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep12~0 % 256); {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:23,566 INFO L290 TraceCheckUtils]: 46: Hoare triple {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep13~0 % 256); {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:23,567 INFO L290 TraceCheckUtils]: 47: Hoare triple {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} ~mode1~0 := 1; {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:23,567 INFO L290 TraceCheckUtils]: 48: Hoare triple {4141#(<= ~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; {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:23,568 INFO L290 TraceCheckUtils]: 49: Hoare triple {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~mode2~0 % 256); {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:23,568 INFO L290 TraceCheckUtils]: 50: Hoare triple {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~r2~0 % 256 < 2; {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:23,569 INFO L290 TraceCheckUtils]: 51: Hoare triple {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep21~0 % 256); {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:23,570 INFO L290 TraceCheckUtils]: 52: Hoare triple {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep23~0 % 256); {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:23,571 INFO L290 TraceCheckUtils]: 53: Hoare triple {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} ~mode2~0 := 1; {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:23,572 INFO L290 TraceCheckUtils]: 54: Hoare triple {4141#(<= ~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; {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:23,572 INFO L290 TraceCheckUtils]: 55: Hoare triple {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~mode3~0 % 256); {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:23,573 INFO L290 TraceCheckUtils]: 56: Hoare triple {4141#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(~r3~0 % 256 < 2); {4140#false} is VALID [2022-02-20 18:31:23,573 INFO L290 TraceCheckUtils]: 57: Hoare triple {4140#false} ~mode3~0 := 1; {4140#false} is VALID [2022-02-20 18:31:23,573 INFO L290 TraceCheckUtils]: 58: Hoare triple {4140#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; {4140#false} is VALID [2022-02-20 18:31:23,573 INFO L290 TraceCheckUtils]: 59: Hoare triple {4140#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {4140#false} is VALID [2022-02-20 18:31:23,575 INFO L290 TraceCheckUtils]: 60: Hoare triple {4140#false} check_#res#1 := check_~tmp~1#1; {4140#false} is VALID [2022-02-20 18:31:23,576 INFO L290 TraceCheckUtils]: 61: Hoare triple {4140#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; {4140#false} is VALID [2022-02-20 18:31:23,576 INFO L290 TraceCheckUtils]: 62: Hoare triple {4140#false} assume 0 == assert_~arg#1 % 256; {4140#false} is VALID [2022-02-20 18:31:23,577 INFO L290 TraceCheckUtils]: 63: Hoare triple {4140#false} assume !false; {4140#false} is VALID [2022-02-20 18:31:23,577 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:31:23,578 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:23,578 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459429348] [2022-02-20 18:31:23,578 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459429348] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:23,579 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:23,579 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:31:23,579 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508560924] [2022-02-20 18:31:23,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:23,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-02-20 18:31:23,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:23,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:31:23,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:23,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:31:23,635 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:23,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:31:23,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:31:23,636 INFO L87 Difference]: Start difference. First operand 348 states and 553 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:31:23,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:23,900 INFO L93 Difference]: Finished difference Result 904 states and 1459 transitions. [2022-02-20 18:31:23,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:31:23,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-02-20 18:31:23,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:23,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:31:23,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2022-02-20 18:31:23,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:31:23,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2022-02-20 18:31:23,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 484 transitions. [2022-02-20 18:31:24,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 484 edges. 484 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:24,261 INFO L225 Difference]: With dead ends: 904 [2022-02-20 18:31:24,261 INFO L226 Difference]: Without dead ends: 610 [2022-02-20 18:31:24,262 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:31:24,263 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 111 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:31:24,263 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 396 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:31:24,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-02-20 18:31:24,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 604. [2022-02-20 18:31:24,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:24,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 610 states. Second operand has 604 states, 603 states have (on average 1.6003316749585406) internal successors, (965), 603 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have 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:31:24,318 INFO L74 IsIncluded]: Start isIncluded. First operand 610 states. Second operand has 604 states, 603 states have (on average 1.6003316749585406) internal successors, (965), 603 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have 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:31:24,319 INFO L87 Difference]: Start difference. First operand 610 states. Second operand has 604 states, 603 states have (on average 1.6003316749585406) internal successors, (965), 603 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have 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:31:24,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:24,332 INFO L93 Difference]: Finished difference Result 610 states and 970 transitions. [2022-02-20 18:31:24,332 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 970 transitions. [2022-02-20 18:31:24,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:24,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:24,333 INFO L74 IsIncluded]: Start isIncluded. First operand has 604 states, 603 states have (on average 1.6003316749585406) internal successors, (965), 603 states have internal predecessors, (965), 0 states have call successors, (0), 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 610 states. [2022-02-20 18:31:24,334 INFO L87 Difference]: Start difference. First operand has 604 states, 603 states have (on average 1.6003316749585406) internal successors, (965), 603 states have internal predecessors, (965), 0 states have call successors, (0), 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 610 states. [2022-02-20 18:31:24,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:24,347 INFO L93 Difference]: Finished difference Result 610 states and 970 transitions. [2022-02-20 18:31:24,347 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 970 transitions. [2022-02-20 18:31:24,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:24,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:24,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:24,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:24,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 603 states have (on average 1.6003316749585406) internal successors, (965), 603 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have 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:31:24,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 965 transitions. [2022-02-20 18:31:24,362 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 965 transitions. Word has length 64 [2022-02-20 18:31:24,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:24,362 INFO L470 AbstractCegarLoop]: Abstraction has 604 states and 965 transitions. [2022-02-20 18:31:24,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:31:24,362 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 965 transitions. [2022-02-20 18:31:24,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:31:24,363 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:24,363 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:31:24,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:31:24,363 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:24,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:24,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1382576374, now seen corresponding path program 1 times [2022-02-20 18:31:24,364 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:24,364 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498556167] [2022-02-20 18:31:24,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:24,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:24,416 INFO L290 TraceCheckUtils]: 0: Hoare triple {7034#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(43, 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; {7034#true} is VALID [2022-02-20 18:31:24,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {7034#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; {7034#true} is VALID [2022-02-20 18:31:24,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {7034#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {7034#true} is VALID [2022-02-20 18:31:24,416 INFO L290 TraceCheckUtils]: 3: Hoare triple {7034#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {7034#true} is VALID [2022-02-20 18:31:24,416 INFO L290 TraceCheckUtils]: 4: Hoare triple {7034#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {7034#true} is VALID [2022-02-20 18:31:24,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {7034#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {7034#true} is VALID [2022-02-20 18:31:24,417 INFO L290 TraceCheckUtils]: 6: Hoare triple {7034#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {7034#true} is VALID [2022-02-20 18:31:24,417 INFO L290 TraceCheckUtils]: 7: Hoare triple {7034#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {7034#true} is VALID [2022-02-20 18:31:24,417 INFO L290 TraceCheckUtils]: 8: Hoare triple {7034#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {7034#true} is VALID [2022-02-20 18:31:24,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {7034#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {7034#true} is VALID [2022-02-20 18:31:24,417 INFO L290 TraceCheckUtils]: 10: Hoare triple {7034#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {7034#true} is VALID [2022-02-20 18:31:24,417 INFO L290 TraceCheckUtils]: 11: Hoare triple {7034#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {7034#true} is VALID [2022-02-20 18:31:24,417 INFO L290 TraceCheckUtils]: 12: Hoare triple {7034#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {7034#true} is VALID [2022-02-20 18:31:24,417 INFO L290 TraceCheckUtils]: 13: Hoare triple {7034#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {7034#true} is VALID [2022-02-20 18:31:24,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {7034#true} assume ~id1~0 != ~id2~0; {7034#true} is VALID [2022-02-20 18:31:24,418 INFO L290 TraceCheckUtils]: 15: Hoare triple {7034#true} assume ~id1~0 != ~id3~0; {7034#true} is VALID [2022-02-20 18:31:24,418 INFO L290 TraceCheckUtils]: 16: Hoare triple {7034#true} assume ~id2~0 != ~id3~0; {7034#true} is VALID [2022-02-20 18:31:24,418 INFO L290 TraceCheckUtils]: 17: Hoare triple {7034#true} assume ~id1~0 >= 0; {7034#true} is VALID [2022-02-20 18:31:24,418 INFO L290 TraceCheckUtils]: 18: Hoare triple {7034#true} assume ~id2~0 >= 0; {7034#true} is VALID [2022-02-20 18:31:24,418 INFO L290 TraceCheckUtils]: 19: Hoare triple {7034#true} assume ~id3~0 >= 0; {7034#true} is VALID [2022-02-20 18:31:24,418 INFO L290 TraceCheckUtils]: 20: Hoare triple {7034#true} assume 0 == ~r1~0 % 256; {7034#true} is VALID [2022-02-20 18:31:24,419 INFO L290 TraceCheckUtils]: 21: Hoare triple {7034#true} assume 0 == ~r2~0 % 256; {7034#true} is VALID [2022-02-20 18:31:24,419 INFO L290 TraceCheckUtils]: 22: Hoare triple {7034#true} assume 0 == ~r3~0 % 256; {7034#true} is VALID [2022-02-20 18:31:24,419 INFO L290 TraceCheckUtils]: 23: Hoare triple {7034#true} assume ~max1~0 == ~id1~0; {7034#true} is VALID [2022-02-20 18:31:24,419 INFO L290 TraceCheckUtils]: 24: Hoare triple {7034#true} assume ~max2~0 == ~id2~0; {7034#true} is VALID [2022-02-20 18:31:24,419 INFO L290 TraceCheckUtils]: 25: Hoare triple {7034#true} assume ~max3~0 == ~id3~0; {7034#true} is VALID [2022-02-20 18:31:24,419 INFO L290 TraceCheckUtils]: 26: Hoare triple {7034#true} assume 0 == ~st1~0; {7036#(<= ~st1~0 0)} is VALID [2022-02-20 18:31:24,420 INFO L290 TraceCheckUtils]: 27: Hoare triple {7036#(<= ~st1~0 0)} assume 0 == ~st2~0; {7037#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:24,420 INFO L290 TraceCheckUtils]: 28: Hoare triple {7037#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:24,420 INFO L290 TraceCheckUtils]: 29: Hoare triple {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl1~0; {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:24,421 INFO L290 TraceCheckUtils]: 30: Hoare triple {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl2~0; {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:24,421 INFO L290 TraceCheckUtils]: 31: Hoare triple {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl3~0; {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:24,421 INFO L290 TraceCheckUtils]: 32: Hoare triple {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:24,422 INFO L290 TraceCheckUtils]: 33: Hoare triple {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:24,422 INFO L290 TraceCheckUtils]: 34: Hoare triple {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:24,422 INFO L290 TraceCheckUtils]: 35: Hoare triple {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~newmax1~0 % 256; {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:24,422 INFO L290 TraceCheckUtils]: 36: Hoare triple {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~newmax2~0 % 256; {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:24,423 INFO L290 TraceCheckUtils]: 37: Hoare triple {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:24,423 INFO L290 TraceCheckUtils]: 38: Hoare triple {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:24,423 INFO L290 TraceCheckUtils]: 39: Hoare triple {7038#(<= (+ ~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; {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:24,424 INFO L290 TraceCheckUtils]: 40: Hoare triple {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:24,424 INFO L290 TraceCheckUtils]: 41: Hoare triple {7038#(<= (+ ~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; {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:24,424 INFO L290 TraceCheckUtils]: 42: Hoare triple {7038#(<= (+ ~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; {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:24,424 INFO L290 TraceCheckUtils]: 43: Hoare triple {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:24,425 INFO L290 TraceCheckUtils]: 44: Hoare triple {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 2; {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:24,425 INFO L290 TraceCheckUtils]: 45: Hoare triple {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep12~0 % 256); {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:24,425 INFO L290 TraceCheckUtils]: 46: Hoare triple {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep13~0 % 256); {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:24,426 INFO L290 TraceCheckUtils]: 47: Hoare triple {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:24,426 INFO L290 TraceCheckUtils]: 48: Hoare triple {7038#(<= (+ ~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; {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:24,426 INFO L290 TraceCheckUtils]: 49: Hoare triple {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:24,426 INFO L290 TraceCheckUtils]: 50: Hoare triple {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r2~0 % 256 < 2; {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:24,427 INFO L290 TraceCheckUtils]: 51: Hoare triple {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep21~0 % 256); {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:24,427 INFO L290 TraceCheckUtils]: 52: Hoare triple {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep23~0 % 256); {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:24,427 INFO L290 TraceCheckUtils]: 53: Hoare triple {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:24,428 INFO L290 TraceCheckUtils]: 54: Hoare triple {7038#(<= (+ ~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; {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:24,428 INFO L290 TraceCheckUtils]: 55: Hoare triple {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:24,428 INFO L290 TraceCheckUtils]: 56: Hoare triple {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r3~0 % 256 < 2; {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:24,429 INFO L290 TraceCheckUtils]: 57: Hoare triple {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep31~0 % 256); {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:24,429 INFO L290 TraceCheckUtils]: 58: Hoare triple {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep32~0 % 256); {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:24,429 INFO L290 TraceCheckUtils]: 59: Hoare triple {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:24,429 INFO L290 TraceCheckUtils]: 60: Hoare triple {7038#(<= (+ ~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; {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:24,430 INFO L290 TraceCheckUtils]: 61: Hoare triple {7038#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {7035#false} is VALID [2022-02-20 18:31:24,430 INFO L290 TraceCheckUtils]: 62: Hoare triple {7035#false} check_#res#1 := check_~tmp~1#1; {7035#false} is VALID [2022-02-20 18:31:24,430 INFO L290 TraceCheckUtils]: 63: Hoare triple {7035#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; {7035#false} is VALID [2022-02-20 18:31:24,430 INFO L290 TraceCheckUtils]: 64: Hoare triple {7035#false} assume 0 == assert_~arg#1 % 256; {7035#false} is VALID [2022-02-20 18:31:24,430 INFO L290 TraceCheckUtils]: 65: Hoare triple {7035#false} assume !false; {7035#false} is VALID [2022-02-20 18:31:24,431 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:31:24,431 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:24,431 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498556167] [2022-02-20 18:31:24,431 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498556167] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:24,431 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:24,431 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:31:24,431 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447110818] [2022-02-20 18:31:24,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:24,432 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 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:31:24,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:24,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 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:31:24,472 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:31:24,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:31:24,472 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:24,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:31:24,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:31:24,472 INFO L87 Difference]: Start difference. First operand 604 states and 965 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 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:31:25,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:25,735 INFO L93 Difference]: Finished difference Result 2616 states and 4275 transitions. [2022-02-20 18:31:25,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:31:25,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 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:31:25,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:25,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 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:31:25,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1066 transitions. [2022-02-20 18:31:25,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 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:31:25,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1066 transitions. [2022-02-20 18:31:25,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1066 transitions. [2022-02-20 18:31:26,394 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1066 edges. 1066 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:26,527 INFO L225 Difference]: With dead ends: 2616 [2022-02-20 18:31:26,527 INFO L226 Difference]: Without dead ends: 2066 [2022-02-20 18:31:26,528 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:31:26,531 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 936 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:31:26,534 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [936 Valid, 1264 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:31:26,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states. [2022-02-20 18:31:26,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 1086. [2022-02-20 18:31:26,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:26,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2066 states. Second operand has 1086 states, 1085 states have (on average 1.6110599078341015) internal successors, (1748), 1085 states have internal predecessors, (1748), 0 states have call successors, (0), 0 states have 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:31:26,730 INFO L74 IsIncluded]: Start isIncluded. First operand 2066 states. Second operand has 1086 states, 1085 states have (on average 1.6110599078341015) internal successors, (1748), 1085 states have internal predecessors, (1748), 0 states have call successors, (0), 0 states have 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:31:26,731 INFO L87 Difference]: Start difference. First operand 2066 states. Second operand has 1086 states, 1085 states have (on average 1.6110599078341015) internal successors, (1748), 1085 states have internal predecessors, (1748), 0 states have call successors, (0), 0 states have 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:31:26,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:26,848 INFO L93 Difference]: Finished difference Result 2066 states and 3356 transitions. [2022-02-20 18:31:26,848 INFO L276 IsEmpty]: Start isEmpty. Operand 2066 states and 3356 transitions. [2022-02-20 18:31:26,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:26,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:26,852 INFO L74 IsIncluded]: Start isIncluded. First operand has 1086 states, 1085 states have (on average 1.6110599078341015) internal successors, (1748), 1085 states have internal predecessors, (1748), 0 states have call successors, (0), 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 2066 states. [2022-02-20 18:31:26,855 INFO L87 Difference]: Start difference. First operand has 1086 states, 1085 states have (on average 1.6110599078341015) internal successors, (1748), 1085 states have internal predecessors, (1748), 0 states have call successors, (0), 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 2066 states. [2022-02-20 18:31:26,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:26,970 INFO L93 Difference]: Finished difference Result 2066 states and 3356 transitions. [2022-02-20 18:31:26,970 INFO L276 IsEmpty]: Start isEmpty. Operand 2066 states and 3356 transitions. [2022-02-20 18:31:26,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:26,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:26,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:26,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:26,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 1085 states have (on average 1.6110599078341015) internal successors, (1748), 1085 states have internal predecessors, (1748), 0 states have call successors, (0), 0 states have 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:31:27,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1748 transitions. [2022-02-20 18:31:27,010 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1748 transitions. Word has length 66 [2022-02-20 18:31:27,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:27,010 INFO L470 AbstractCegarLoop]: Abstraction has 1086 states and 1748 transitions. [2022-02-20 18:31:27,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 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:31:27,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1748 transitions. [2022-02-20 18:31:27,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 18:31:27,011 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:27,011 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] [2022-02-20 18:31:27,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:31:27,012 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:27,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:27,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1833027237, now seen corresponding path program 1 times [2022-02-20 18:31:27,013 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:27,013 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760680040] [2022-02-20 18:31:27,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:27,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:27,085 INFO L290 TraceCheckUtils]: 0: Hoare triple {15271#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(43, 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; {15271#true} is VALID [2022-02-20 18:31:27,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {15271#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; {15271#true} is VALID [2022-02-20 18:31:27,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {15271#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {15271#true} is VALID [2022-02-20 18:31:27,086 INFO L290 TraceCheckUtils]: 3: Hoare triple {15271#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {15271#true} is VALID [2022-02-20 18:31:27,086 INFO L290 TraceCheckUtils]: 4: Hoare triple {15271#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {15271#true} is VALID [2022-02-20 18:31:27,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {15271#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {15271#true} is VALID [2022-02-20 18:31:27,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {15271#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {15271#true} is VALID [2022-02-20 18:31:27,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {15271#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {15271#true} is VALID [2022-02-20 18:31:27,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {15271#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {15271#true} is VALID [2022-02-20 18:31:27,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {15271#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {15271#true} is VALID [2022-02-20 18:31:27,087 INFO L290 TraceCheckUtils]: 10: Hoare triple {15271#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {15271#true} is VALID [2022-02-20 18:31:27,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {15271#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {15271#true} is VALID [2022-02-20 18:31:27,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {15271#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {15271#true} is VALID [2022-02-20 18:31:27,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {15271#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {15271#true} is VALID [2022-02-20 18:31:27,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {15271#true} assume ~id1~0 != ~id2~0; {15271#true} is VALID [2022-02-20 18:31:27,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {15271#true} assume ~id1~0 != ~id3~0; {15271#true} is VALID [2022-02-20 18:31:27,088 INFO L290 TraceCheckUtils]: 16: Hoare triple {15271#true} assume ~id2~0 != ~id3~0; {15271#true} is VALID [2022-02-20 18:31:27,088 INFO L290 TraceCheckUtils]: 17: Hoare triple {15271#true} assume ~id1~0 >= 0; {15271#true} is VALID [2022-02-20 18:31:27,088 INFO L290 TraceCheckUtils]: 18: Hoare triple {15271#true} assume ~id2~0 >= 0; {15271#true} is VALID [2022-02-20 18:31:27,088 INFO L290 TraceCheckUtils]: 19: Hoare triple {15271#true} assume ~id3~0 >= 0; {15271#true} is VALID [2022-02-20 18:31:27,088 INFO L290 TraceCheckUtils]: 20: Hoare triple {15271#true} assume 0 == ~r1~0 % 256; {15271#true} is VALID [2022-02-20 18:31:27,088 INFO L290 TraceCheckUtils]: 21: Hoare triple {15271#true} assume 0 == ~r2~0 % 256; {15271#true} is VALID [2022-02-20 18:31:27,088 INFO L290 TraceCheckUtils]: 22: Hoare triple {15271#true} assume 0 == ~r3~0 % 256; {15271#true} is VALID [2022-02-20 18:31:27,089 INFO L290 TraceCheckUtils]: 23: Hoare triple {15271#true} assume ~max1~0 == ~id1~0; {15271#true} is VALID [2022-02-20 18:31:27,089 INFO L290 TraceCheckUtils]: 24: Hoare triple {15271#true} assume ~max2~0 == ~id2~0; {15271#true} is VALID [2022-02-20 18:31:27,089 INFO L290 TraceCheckUtils]: 25: Hoare triple {15271#true} assume ~max3~0 == ~id3~0; {15271#true} is VALID [2022-02-20 18:31:27,091 INFO L290 TraceCheckUtils]: 26: Hoare triple {15271#true} assume 0 == ~st1~0; {15273#(<= ~st1~0 0)} is VALID [2022-02-20 18:31:27,091 INFO L290 TraceCheckUtils]: 27: Hoare triple {15273#(<= ~st1~0 0)} assume 0 == ~st2~0; {15273#(<= ~st1~0 0)} is VALID [2022-02-20 18:31:27,091 INFO L290 TraceCheckUtils]: 28: Hoare triple {15273#(<= ~st1~0 0)} assume 0 == ~st3~0; {15273#(<= ~st1~0 0)} is VALID [2022-02-20 18:31:27,092 INFO L290 TraceCheckUtils]: 29: Hoare triple {15273#(<= ~st1~0 0)} assume 0 == ~nl1~0; {15274#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,092 INFO L290 TraceCheckUtils]: 30: Hoare triple {15274#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl2~0; {15274#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,092 INFO L290 TraceCheckUtils]: 31: Hoare triple {15274#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl3~0; {15274#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,093 INFO L290 TraceCheckUtils]: 32: Hoare triple {15274#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {15274#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,093 INFO L290 TraceCheckUtils]: 33: Hoare triple {15274#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {15274#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,093 INFO L290 TraceCheckUtils]: 34: Hoare triple {15274#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {15274#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,093 INFO L290 TraceCheckUtils]: 35: Hoare triple {15274#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 != ~newmax1~0 % 256; {15274#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,094 INFO L290 TraceCheckUtils]: 36: Hoare triple {15274#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 != ~newmax2~0 % 256; {15274#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,094 INFO L290 TraceCheckUtils]: 37: Hoare triple {15274#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {15274#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,094 INFO L290 TraceCheckUtils]: 38: Hoare triple {15274#(<= (+ ~nl1~0 ~st1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {15274#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,095 INFO L290 TraceCheckUtils]: 39: Hoare triple {15274#(<= (+ ~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; {15274#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,095 INFO L290 TraceCheckUtils]: 40: Hoare triple {15274#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {15274#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,095 INFO L290 TraceCheckUtils]: 41: Hoare triple {15274#(<= (+ ~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; {15274#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,096 INFO L290 TraceCheckUtils]: 42: Hoare triple {15274#(<= (+ ~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; {15274#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,096 INFO L290 TraceCheckUtils]: 43: Hoare triple {15274#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {15274#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,096 INFO L290 TraceCheckUtils]: 44: Hoare triple {15274#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r1~0 % 256 < 2; {15274#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,096 INFO L290 TraceCheckUtils]: 45: Hoare triple {15274#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep12~0 % 256); {15274#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,097 INFO L290 TraceCheckUtils]: 46: Hoare triple {15274#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep13~0 % 256); {15274#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,097 INFO L290 TraceCheckUtils]: 47: Hoare triple {15274#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode1~0 := 1; {15274#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,097 INFO L290 TraceCheckUtils]: 48: Hoare triple {15274#(<= (+ ~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; {15274#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,098 INFO L290 TraceCheckUtils]: 49: Hoare triple {15274#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {15274#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,098 INFO L290 TraceCheckUtils]: 50: Hoare triple {15274#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r2~0 % 256 < 2; {15274#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,098 INFO L290 TraceCheckUtils]: 51: Hoare triple {15274#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep21~0 % 256); {15274#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,099 INFO L290 TraceCheckUtils]: 52: Hoare triple {15274#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep23~0 % 256); {15274#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,099 INFO L290 TraceCheckUtils]: 53: Hoare triple {15274#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode2~0 := 1; {15274#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,099 INFO L290 TraceCheckUtils]: 54: Hoare triple {15274#(<= (+ ~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; {15274#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,099 INFO L290 TraceCheckUtils]: 55: Hoare triple {15274#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {15274#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,100 INFO L290 TraceCheckUtils]: 56: Hoare triple {15274#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r3~0 % 256 < 2; {15274#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,100 INFO L290 TraceCheckUtils]: 57: Hoare triple {15274#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep31~0 % 256); {15274#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,101 INFO L290 TraceCheckUtils]: 58: Hoare triple {15274#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep32~0 % 256); {15274#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,101 INFO L290 TraceCheckUtils]: 59: Hoare triple {15274#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode3~0 := 1; {15274#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,101 INFO L290 TraceCheckUtils]: 60: Hoare triple {15274#(<= (+ ~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; {15274#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,102 INFO L290 TraceCheckUtils]: 61: Hoare triple {15274#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {15274#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,102 INFO L290 TraceCheckUtils]: 62: Hoare triple {15274#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(~st1~0 + ~nl1~0 <= 1);check_~tmp~1#1 := 0; {15272#false} is VALID [2022-02-20 18:31:27,102 INFO L290 TraceCheckUtils]: 63: Hoare triple {15272#false} check_#res#1 := check_~tmp~1#1; {15272#false} is VALID [2022-02-20 18:31:27,102 INFO L290 TraceCheckUtils]: 64: Hoare triple {15272#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; {15272#false} is VALID [2022-02-20 18:31:27,102 INFO L290 TraceCheckUtils]: 65: Hoare triple {15272#false} assume 0 == assert_~arg#1 % 256; {15272#false} is VALID [2022-02-20 18:31:27,103 INFO L290 TraceCheckUtils]: 66: Hoare triple {15272#false} assume !false; {15272#false} is VALID [2022-02-20 18:31:27,103 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:31:27,103 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:27,103 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760680040] [2022-02-20 18:31:27,103 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760680040] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:27,103 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:27,104 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:31:27,104 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341172384] [2022-02-20 18:31:27,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:27,104 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-02-20 18:31:27,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:27,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have 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:31:27,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:27,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:31:27,140 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:27,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:31:27,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:31:27,141 INFO L87 Difference]: Start difference. First operand 1086 states and 1748 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have 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:31:28,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:28,308 INFO L93 Difference]: Finished difference Result 3176 states and 5180 transitions. [2022-02-20 18:31:28,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:31:28,308 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-02-20 18:31:28,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:28,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have 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:31:28,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 640 transitions. [2022-02-20 18:31:28,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have 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:31:28,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 640 transitions. [2022-02-20 18:31:28,313 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 640 transitions. [2022-02-20 18:31:28,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 640 edges. 640 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:28,854 INFO L225 Difference]: With dead ends: 3176 [2022-02-20 18:31:28,855 INFO L226 Difference]: Without dead ends: 2144 [2022-02-20 18:31:28,856 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:31:28,856 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 411 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 707 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:31:28,857 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [411 Valid, 707 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:31:28,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2144 states. [2022-02-20 18:31:29,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2144 to 1606. [2022-02-20 18:31:29,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:29,172 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2144 states. Second operand has 1606 states, 1605 states have (on average 1.618068535825545) internal successors, (2597), 1605 states have internal predecessors, (2597), 0 states have call successors, (0), 0 states have 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:31:29,174 INFO L74 IsIncluded]: Start isIncluded. First operand 2144 states. Second operand has 1606 states, 1605 states have (on average 1.618068535825545) internal successors, (2597), 1605 states have internal predecessors, (2597), 0 states have call successors, (0), 0 states have 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:31:29,176 INFO L87 Difference]: Start difference. First operand 2144 states. Second operand has 1606 states, 1605 states have (on average 1.618068535825545) internal successors, (2597), 1605 states have internal predecessors, (2597), 0 states have call successors, (0), 0 states have 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:31:29,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:29,303 INFO L93 Difference]: Finished difference Result 2144 states and 3490 transitions. [2022-02-20 18:31:29,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2144 states and 3490 transitions. [2022-02-20 18:31:29,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:29,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:29,309 INFO L74 IsIncluded]: Start isIncluded. First operand has 1606 states, 1605 states have (on average 1.618068535825545) internal successors, (2597), 1605 states have internal predecessors, (2597), 0 states have call successors, (0), 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 2144 states. [2022-02-20 18:31:29,312 INFO L87 Difference]: Start difference. First operand has 1606 states, 1605 states have (on average 1.618068535825545) internal successors, (2597), 1605 states have internal predecessors, (2597), 0 states have call successors, (0), 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 2144 states. [2022-02-20 18:31:29,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:29,451 INFO L93 Difference]: Finished difference Result 2144 states and 3490 transitions. [2022-02-20 18:31:29,452 INFO L276 IsEmpty]: Start isEmpty. Operand 2144 states and 3490 transitions. [2022-02-20 18:31:29,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:29,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:29,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:29,454 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:29,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1605 states have (on average 1.618068535825545) internal successors, (2597), 1605 states have internal predecessors, (2597), 0 states have call successors, (0), 0 states have 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:31:29,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 2597 transitions. [2022-02-20 18:31:29,538 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 2597 transitions. Word has length 67 [2022-02-20 18:31:29,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:29,538 INFO L470 AbstractCegarLoop]: Abstraction has 1606 states and 2597 transitions. [2022-02-20 18:31:29,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have 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:31:29,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 2597 transitions. [2022-02-20 18:31:29,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 18:31:29,539 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:29,540 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:31:29,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:31:29,540 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:29,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:29,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1551869537, now seen corresponding path program 1 times [2022-02-20 18:31:29,540 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:29,541 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31606926] [2022-02-20 18:31:29,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:29,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:29,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:29,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {24853#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(43, 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; {24853#true} is VALID [2022-02-20 18:31:29,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {24853#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; {24853#true} is VALID [2022-02-20 18:31:29,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {24853#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {24853#true} is VALID [2022-02-20 18:31:29,596 INFO L290 TraceCheckUtils]: 3: Hoare triple {24853#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {24853#true} is VALID [2022-02-20 18:31:29,596 INFO L290 TraceCheckUtils]: 4: Hoare triple {24853#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {24853#true} is VALID [2022-02-20 18:31:29,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {24853#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {24853#true} is VALID [2022-02-20 18:31:29,596 INFO L290 TraceCheckUtils]: 6: Hoare triple {24853#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {24853#true} is VALID [2022-02-20 18:31:29,596 INFO L290 TraceCheckUtils]: 7: Hoare triple {24853#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {24853#true} is VALID [2022-02-20 18:31:29,596 INFO L290 TraceCheckUtils]: 8: Hoare triple {24853#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {24853#true} is VALID [2022-02-20 18:31:29,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {24853#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {24853#true} is VALID [2022-02-20 18:31:29,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {24853#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {24853#true} is VALID [2022-02-20 18:31:29,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {24853#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {24853#true} is VALID [2022-02-20 18:31:29,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {24853#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {24853#true} is VALID [2022-02-20 18:31:29,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {24853#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {24853#true} is VALID [2022-02-20 18:31:29,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {24853#true} assume ~id1~0 != ~id2~0; {24853#true} is VALID [2022-02-20 18:31:29,597 INFO L290 TraceCheckUtils]: 15: Hoare triple {24853#true} assume ~id1~0 != ~id3~0; {24853#true} is VALID [2022-02-20 18:31:29,597 INFO L290 TraceCheckUtils]: 16: Hoare triple {24853#true} assume ~id2~0 != ~id3~0; {24853#true} is VALID [2022-02-20 18:31:29,597 INFO L290 TraceCheckUtils]: 17: Hoare triple {24853#true} assume ~id1~0 >= 0; {24853#true} is VALID [2022-02-20 18:31:29,597 INFO L290 TraceCheckUtils]: 18: Hoare triple {24853#true} assume ~id2~0 >= 0; {24853#true} is VALID [2022-02-20 18:31:29,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {24853#true} assume ~id3~0 >= 0; {24853#true} is VALID [2022-02-20 18:31:29,598 INFO L290 TraceCheckUtils]: 20: Hoare triple {24853#true} assume 0 == ~r1~0 % 256; {24853#true} is VALID [2022-02-20 18:31:29,598 INFO L290 TraceCheckUtils]: 21: Hoare triple {24853#true} assume 0 == ~r2~0 % 256; {24853#true} is VALID [2022-02-20 18:31:29,598 INFO L290 TraceCheckUtils]: 22: Hoare triple {24853#true} assume 0 == ~r3~0 % 256; {24853#true} is VALID [2022-02-20 18:31:29,598 INFO L290 TraceCheckUtils]: 23: Hoare triple {24853#true} assume ~max1~0 == ~id1~0; {24853#true} is VALID [2022-02-20 18:31:29,598 INFO L290 TraceCheckUtils]: 24: Hoare triple {24853#true} assume ~max2~0 == ~id2~0; {24853#true} is VALID [2022-02-20 18:31:29,598 INFO L290 TraceCheckUtils]: 25: Hoare triple {24853#true} assume ~max3~0 == ~id3~0; {24853#true} is VALID [2022-02-20 18:31:29,598 INFO L290 TraceCheckUtils]: 26: Hoare triple {24853#true} assume 0 == ~st1~0; {24853#true} is VALID [2022-02-20 18:31:29,599 INFO L290 TraceCheckUtils]: 27: Hoare triple {24853#true} assume 0 == ~st2~0; {24855#(<= ~st2~0 0)} is VALID [2022-02-20 18:31:29,599 INFO L290 TraceCheckUtils]: 28: Hoare triple {24855#(<= ~st2~0 0)} assume 0 == ~st3~0; {24855#(<= ~st2~0 0)} is VALID [2022-02-20 18:31:29,599 INFO L290 TraceCheckUtils]: 29: Hoare triple {24855#(<= ~st2~0 0)} assume 0 == ~nl1~0; {24855#(<= ~st2~0 0)} is VALID [2022-02-20 18:31:29,600 INFO L290 TraceCheckUtils]: 30: Hoare triple {24855#(<= ~st2~0 0)} assume 0 == ~nl2~0; {24856#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:29,600 INFO L290 TraceCheckUtils]: 31: Hoare triple {24856#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~nl3~0; {24856#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:29,600 INFO L290 TraceCheckUtils]: 32: Hoare triple {24856#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode1~0 % 256; {24856#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:29,601 INFO L290 TraceCheckUtils]: 33: Hoare triple {24856#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode2~0 % 256; {24856#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:29,601 INFO L290 TraceCheckUtils]: 34: Hoare triple {24856#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256; {24856#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:29,601 INFO L290 TraceCheckUtils]: 35: Hoare triple {24856#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 != ~newmax1~0 % 256; {24856#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:29,602 INFO L290 TraceCheckUtils]: 36: Hoare triple {24856#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 != ~newmax2~0 % 256; {24856#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:29,602 INFO L290 TraceCheckUtils]: 37: Hoare triple {24856#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {24856#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:29,602 INFO L290 TraceCheckUtils]: 38: Hoare triple {24856#(<= (+ ~nl2~0 ~st2~0) 0)} init_#res#1 := init_~tmp___5~0#1; {24856#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:29,603 INFO L290 TraceCheckUtils]: 39: Hoare triple {24856#(<= (+ ~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; {24856#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:29,603 INFO L290 TraceCheckUtils]: 40: Hoare triple {24856#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {24856#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:29,603 INFO L290 TraceCheckUtils]: 41: Hoare triple {24856#(<= (+ ~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; {24856#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:29,604 INFO L290 TraceCheckUtils]: 42: Hoare triple {24856#(<= (+ ~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; {24856#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:29,604 INFO L290 TraceCheckUtils]: 43: Hoare triple {24856#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode1~0 % 256); {24856#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:29,604 INFO L290 TraceCheckUtils]: 44: Hoare triple {24856#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r1~0 % 256 < 2; {24856#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:29,605 INFO L290 TraceCheckUtils]: 45: Hoare triple {24856#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep12~0 % 256); {24856#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:29,605 INFO L290 TraceCheckUtils]: 46: Hoare triple {24856#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep13~0 % 256); {24856#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:29,605 INFO L290 TraceCheckUtils]: 47: Hoare triple {24856#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode1~0 := 1; {24856#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:29,606 INFO L290 TraceCheckUtils]: 48: Hoare triple {24856#(<= (+ ~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; {24856#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:29,606 INFO L290 TraceCheckUtils]: 49: Hoare triple {24856#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode2~0 % 256); {24856#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:29,606 INFO L290 TraceCheckUtils]: 50: Hoare triple {24856#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r2~0 % 256 < 2; {24856#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:29,606 INFO L290 TraceCheckUtils]: 51: Hoare triple {24856#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep21~0 % 256); {24856#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:29,607 INFO L290 TraceCheckUtils]: 52: Hoare triple {24856#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep23~0 % 256); {24856#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:29,607 INFO L290 TraceCheckUtils]: 53: Hoare triple {24856#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode2~0 := 1; {24856#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:29,607 INFO L290 TraceCheckUtils]: 54: Hoare triple {24856#(<= (+ ~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; {24856#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:29,608 INFO L290 TraceCheckUtils]: 55: Hoare triple {24856#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode3~0 % 256); {24856#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:29,608 INFO L290 TraceCheckUtils]: 56: Hoare triple {24856#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r3~0 % 256 < 2; {24856#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:29,608 INFO L290 TraceCheckUtils]: 57: Hoare triple {24856#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep31~0 % 256); {24856#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:29,609 INFO L290 TraceCheckUtils]: 58: Hoare triple {24856#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep32~0 % 256); {24856#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:29,609 INFO L290 TraceCheckUtils]: 59: Hoare triple {24856#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode3~0 := 1; {24856#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:29,609 INFO L290 TraceCheckUtils]: 60: Hoare triple {24856#(<= (+ ~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; {24856#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:29,610 INFO L290 TraceCheckUtils]: 61: Hoare triple {24856#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {24856#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:29,610 INFO L290 TraceCheckUtils]: 62: Hoare triple {24856#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {24856#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:31:29,610 INFO L290 TraceCheckUtils]: 63: Hoare triple {24856#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(~st2~0 + ~nl2~0 <= 1);check_~tmp~1#1 := 0; {24854#false} is VALID [2022-02-20 18:31:29,611 INFO L290 TraceCheckUtils]: 64: Hoare triple {24854#false} check_#res#1 := check_~tmp~1#1; {24854#false} is VALID [2022-02-20 18:31:29,611 INFO L290 TraceCheckUtils]: 65: Hoare triple {24854#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; {24854#false} is VALID [2022-02-20 18:31:29,611 INFO L290 TraceCheckUtils]: 66: Hoare triple {24854#false} assume 0 == assert_~arg#1 % 256; {24854#false} is VALID [2022-02-20 18:31:29,611 INFO L290 TraceCheckUtils]: 67: Hoare triple {24854#false} assume !false; {24854#false} is VALID [2022-02-20 18:31:29,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:31:29,612 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:29,612 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31606926] [2022-02-20 18:31:29,612 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31606926] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:29,612 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:29,612 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:31:29,613 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862296771] [2022-02-20 18:31:29,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:29,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 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:31:29,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:29,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 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:31:29,649 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:31:29,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:31:29,650 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:29,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:31:29,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:31:29,651 INFO L87 Difference]: Start difference. First operand 1606 states and 2597 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 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:31:31,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:31,690 INFO L93 Difference]: Finished difference Result 4670 states and 7604 transitions. [2022-02-20 18:31:31,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:31:31,691 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 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:31:31,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:31,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 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:31:31,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 640 transitions. [2022-02-20 18:31:31,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 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:31:31,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 640 transitions. [2022-02-20 18:31:31,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 640 transitions. [2022-02-20 18:31:32,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 640 edges. 640 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:32,414 INFO L225 Difference]: With dead ends: 4670 [2022-02-20 18:31:32,414 INFO L226 Difference]: Without dead ends: 3118 [2022-02-20 18:31:32,416 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:31:32,416 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 411 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 706 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:31:32,417 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [411 Valid, 706 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:31:32,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3118 states. [2022-02-20 18:31:33,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3118 to 2350. [2022-02-20 18:31:33,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:33,127 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3118 states. Second operand has 2350 states, 2349 states have (on average 1.6164325244785014) internal successors, (3797), 2349 states have internal predecessors, (3797), 0 states have call successors, (0), 0 states have 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:31:33,129 INFO L74 IsIncluded]: Start isIncluded. First operand 3118 states. Second operand has 2350 states, 2349 states have (on average 1.6164325244785014) internal successors, (3797), 2349 states have internal predecessors, (3797), 0 states have call successors, (0), 0 states have 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:31:33,132 INFO L87 Difference]: Start difference. First operand 3118 states. Second operand has 2350 states, 2349 states have (on average 1.6164325244785014) internal successors, (3797), 2349 states have internal predecessors, (3797), 0 states have call successors, (0), 0 states have 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:31:33,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:33,422 INFO L93 Difference]: Finished difference Result 3118 states and 5059 transitions. [2022-02-20 18:31:33,422 INFO L276 IsEmpty]: Start isEmpty. Operand 3118 states and 5059 transitions. [2022-02-20 18:31:33,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:33,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:33,428 INFO L74 IsIncluded]: Start isIncluded. First operand has 2350 states, 2349 states have (on average 1.6164325244785014) internal successors, (3797), 2349 states have internal predecessors, (3797), 0 states have call successors, (0), 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 3118 states. [2022-02-20 18:31:33,430 INFO L87 Difference]: Start difference. First operand has 2350 states, 2349 states have (on average 1.6164325244785014) internal successors, (3797), 2349 states have internal predecessors, (3797), 0 states have call successors, (0), 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 3118 states. [2022-02-20 18:31:33,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:33,710 INFO L93 Difference]: Finished difference Result 3118 states and 5059 transitions. [2022-02-20 18:31:33,710 INFO L276 IsEmpty]: Start isEmpty. Operand 3118 states and 5059 transitions. [2022-02-20 18:31:33,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:33,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:33,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:33,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:33,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2350 states, 2349 states have (on average 1.6164325244785014) internal successors, (3797), 2349 states have internal predecessors, (3797), 0 states have call successors, (0), 0 states have 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:31:33,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 3797 transitions. [2022-02-20 18:31:33,889 INFO L78 Accepts]: Start accepts. Automaton has 2350 states and 3797 transitions. Word has length 68 [2022-02-20 18:31:33,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:33,889 INFO L470 AbstractCegarLoop]: Abstraction has 2350 states and 3797 transitions. [2022-02-20 18:31:33,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 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:31:33,889 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 3797 transitions. [2022-02-20 18:31:33,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 18:31:33,891 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:33,891 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] [2022-02-20 18:31:33,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:31:33,891 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:33,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:33,892 INFO L85 PathProgramCache]: Analyzing trace with hash -721508526, now seen corresponding path program 1 times [2022-02-20 18:31:33,892 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:33,892 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869257421] [2022-02-20 18:31:33,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:33,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:33,935 INFO L290 TraceCheckUtils]: 0: Hoare triple {38852#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(43, 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; {38852#true} is VALID [2022-02-20 18:31:33,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {38852#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; {38852#true} is VALID [2022-02-20 18:31:33,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {38852#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {38852#true} is VALID [2022-02-20 18:31:33,936 INFO L290 TraceCheckUtils]: 3: Hoare triple {38852#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {38852#true} is VALID [2022-02-20 18:31:33,936 INFO L290 TraceCheckUtils]: 4: Hoare triple {38852#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {38852#true} is VALID [2022-02-20 18:31:33,936 INFO L290 TraceCheckUtils]: 5: Hoare triple {38852#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {38852#true} is VALID [2022-02-20 18:31:33,936 INFO L290 TraceCheckUtils]: 6: Hoare triple {38852#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {38852#true} is VALID [2022-02-20 18:31:33,937 INFO L290 TraceCheckUtils]: 7: Hoare triple {38852#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {38852#true} is VALID [2022-02-20 18:31:33,937 INFO L290 TraceCheckUtils]: 8: Hoare triple {38852#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {38852#true} is VALID [2022-02-20 18:31:33,937 INFO L290 TraceCheckUtils]: 9: Hoare triple {38852#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {38852#true} is VALID [2022-02-20 18:31:33,937 INFO L290 TraceCheckUtils]: 10: Hoare triple {38852#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {38852#true} is VALID [2022-02-20 18:31:33,937 INFO L290 TraceCheckUtils]: 11: Hoare triple {38852#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {38852#true} is VALID [2022-02-20 18:31:33,937 INFO L290 TraceCheckUtils]: 12: Hoare triple {38852#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {38852#true} is VALID [2022-02-20 18:31:33,937 INFO L290 TraceCheckUtils]: 13: Hoare triple {38852#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {38852#true} is VALID [2022-02-20 18:31:33,938 INFO L290 TraceCheckUtils]: 14: Hoare triple {38852#true} assume ~id1~0 != ~id2~0; {38852#true} is VALID [2022-02-20 18:31:33,938 INFO L290 TraceCheckUtils]: 15: Hoare triple {38852#true} assume ~id1~0 != ~id3~0; {38852#true} is VALID [2022-02-20 18:31:33,938 INFO L290 TraceCheckUtils]: 16: Hoare triple {38852#true} assume ~id2~0 != ~id3~0; {38852#true} is VALID [2022-02-20 18:31:33,938 INFO L290 TraceCheckUtils]: 17: Hoare triple {38852#true} assume ~id1~0 >= 0; {38852#true} is VALID [2022-02-20 18:31:33,938 INFO L290 TraceCheckUtils]: 18: Hoare triple {38852#true} assume ~id2~0 >= 0; {38852#true} is VALID [2022-02-20 18:31:33,938 INFO L290 TraceCheckUtils]: 19: Hoare triple {38852#true} assume ~id3~0 >= 0; {38852#true} is VALID [2022-02-20 18:31:33,938 INFO L290 TraceCheckUtils]: 20: Hoare triple {38852#true} assume 0 == ~r1~0 % 256; {38852#true} is VALID [2022-02-20 18:31:33,939 INFO L290 TraceCheckUtils]: 21: Hoare triple {38852#true} assume 0 == ~r2~0 % 256; {38852#true} is VALID [2022-02-20 18:31:33,939 INFO L290 TraceCheckUtils]: 22: Hoare triple {38852#true} assume 0 == ~r3~0 % 256; {38852#true} is VALID [2022-02-20 18:31:33,939 INFO L290 TraceCheckUtils]: 23: Hoare triple {38852#true} assume ~max1~0 == ~id1~0; {38852#true} is VALID [2022-02-20 18:31:33,939 INFO L290 TraceCheckUtils]: 24: Hoare triple {38852#true} assume ~max2~0 == ~id2~0; {38852#true} is VALID [2022-02-20 18:31:33,939 INFO L290 TraceCheckUtils]: 25: Hoare triple {38852#true} assume ~max3~0 == ~id3~0; {38852#true} is VALID [2022-02-20 18:31:33,939 INFO L290 TraceCheckUtils]: 26: Hoare triple {38852#true} assume 0 == ~st1~0; {38852#true} is VALID [2022-02-20 18:31:33,939 INFO L290 TraceCheckUtils]: 27: Hoare triple {38852#true} assume 0 == ~st2~0; {38852#true} is VALID [2022-02-20 18:31:33,940 INFO L290 TraceCheckUtils]: 28: Hoare triple {38852#true} assume 0 == ~st3~0; {38854#(<= ~st3~0 0)} is VALID [2022-02-20 18:31:33,940 INFO L290 TraceCheckUtils]: 29: Hoare triple {38854#(<= ~st3~0 0)} assume 0 == ~nl1~0; {38854#(<= ~st3~0 0)} is VALID [2022-02-20 18:31:33,940 INFO L290 TraceCheckUtils]: 30: Hoare triple {38854#(<= ~st3~0 0)} assume 0 == ~nl2~0; {38854#(<= ~st3~0 0)} is VALID [2022-02-20 18:31:33,941 INFO L290 TraceCheckUtils]: 31: Hoare triple {38854#(<= ~st3~0 0)} assume 0 == ~nl3~0; {38855#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:33,941 INFO L290 TraceCheckUtils]: 32: Hoare triple {38855#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode1~0 % 256; {38855#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:33,942 INFO L290 TraceCheckUtils]: 33: Hoare triple {38855#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode2~0 % 256; {38855#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:33,942 INFO L290 TraceCheckUtils]: 34: Hoare triple {38855#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode3~0 % 256; {38855#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:33,942 INFO L290 TraceCheckUtils]: 35: Hoare triple {38855#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 != ~newmax1~0 % 256; {38855#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:33,943 INFO L290 TraceCheckUtils]: 36: Hoare triple {38855#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 != ~newmax2~0 % 256; {38855#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:33,943 INFO L290 TraceCheckUtils]: 37: Hoare triple {38855#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {38855#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:33,943 INFO L290 TraceCheckUtils]: 38: Hoare triple {38855#(<= (+ ~nl3~0 ~st3~0) 0)} init_#res#1 := init_~tmp___5~0#1; {38855#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:33,944 INFO L290 TraceCheckUtils]: 39: Hoare triple {38855#(<= (+ ~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; {38855#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:33,944 INFO L290 TraceCheckUtils]: 40: Hoare triple {38855#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {38855#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:33,944 INFO L290 TraceCheckUtils]: 41: Hoare triple {38855#(<= (+ ~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; {38855#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:33,945 INFO L290 TraceCheckUtils]: 42: Hoare triple {38855#(<= (+ ~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; {38855#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:33,945 INFO L290 TraceCheckUtils]: 43: Hoare triple {38855#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode1~0 % 256); {38855#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:33,946 INFO L290 TraceCheckUtils]: 44: Hoare triple {38855#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r1~0 % 256 < 2; {38855#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:33,946 INFO L290 TraceCheckUtils]: 45: Hoare triple {38855#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep12~0 % 256); {38855#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:33,946 INFO L290 TraceCheckUtils]: 46: Hoare triple {38855#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep13~0 % 256); {38855#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:33,947 INFO L290 TraceCheckUtils]: 47: Hoare triple {38855#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode1~0 := 1; {38855#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:33,947 INFO L290 TraceCheckUtils]: 48: Hoare triple {38855#(<= (+ ~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; {38855#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:33,947 INFO L290 TraceCheckUtils]: 49: Hoare triple {38855#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode2~0 % 256); {38855#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:33,948 INFO L290 TraceCheckUtils]: 50: Hoare triple {38855#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r2~0 % 256 < 2; {38855#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:33,948 INFO L290 TraceCheckUtils]: 51: Hoare triple {38855#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep21~0 % 256); {38855#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:33,948 INFO L290 TraceCheckUtils]: 52: Hoare triple {38855#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep23~0 % 256); {38855#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:33,949 INFO L290 TraceCheckUtils]: 53: Hoare triple {38855#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode2~0 := 1; {38855#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:33,949 INFO L290 TraceCheckUtils]: 54: Hoare triple {38855#(<= (+ ~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; {38855#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:33,950 INFO L290 TraceCheckUtils]: 55: Hoare triple {38855#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode3~0 % 256); {38855#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:33,950 INFO L290 TraceCheckUtils]: 56: Hoare triple {38855#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r3~0 % 256 < 2; {38855#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:33,951 INFO L290 TraceCheckUtils]: 57: Hoare triple {38855#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep31~0 % 256); {38855#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:33,951 INFO L290 TraceCheckUtils]: 58: Hoare triple {38855#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep32~0 % 256); {38855#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:33,951 INFO L290 TraceCheckUtils]: 59: Hoare triple {38855#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode3~0 := 1; {38855#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:33,952 INFO L290 TraceCheckUtils]: 60: Hoare triple {38855#(<= (+ ~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; {38855#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:33,952 INFO L290 TraceCheckUtils]: 61: Hoare triple {38855#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {38855#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:33,953 INFO L290 TraceCheckUtils]: 62: Hoare triple {38855#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {38855#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:33,953 INFO L290 TraceCheckUtils]: 63: Hoare triple {38855#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st2~0 + ~nl2~0 <= 1; {38855#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:31:33,953 INFO L290 TraceCheckUtils]: 64: Hoare triple {38855#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(~st3~0 + ~nl3~0 <= 1);check_~tmp~1#1 := 0; {38853#false} is VALID [2022-02-20 18:31:33,954 INFO L290 TraceCheckUtils]: 65: Hoare triple {38853#false} check_#res#1 := check_~tmp~1#1; {38853#false} is VALID [2022-02-20 18:31:33,954 INFO L290 TraceCheckUtils]: 66: Hoare triple {38853#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; {38853#false} is VALID [2022-02-20 18:31:33,954 INFO L290 TraceCheckUtils]: 67: Hoare triple {38853#false} assume 0 == assert_~arg#1 % 256; {38853#false} is VALID [2022-02-20 18:31:33,954 INFO L290 TraceCheckUtils]: 68: Hoare triple {38853#false} assume !false; {38853#false} is VALID [2022-02-20 18:31:33,954 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:31:33,954 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:33,955 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869257421] [2022-02-20 18:31:33,955 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869257421] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:33,955 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:33,955 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:31:33,955 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918664959] [2022-02-20 18:31:33,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:33,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2022-02-20 18:31:33,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:33,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have 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:31:33,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:33,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:31:33,994 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:33,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:31:33,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:31:33,995 INFO L87 Difference]: Start difference. First operand 2350 states and 3797 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have 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:31:37,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:37,100 INFO L93 Difference]: Finished difference Result 6790 states and 11032 transitions. [2022-02-20 18:31:37,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:31:37,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2022-02-20 18:31:37,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:37,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have 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:31:37,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 640 transitions. [2022-02-20 18:31:37,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have 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:31:37,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 640 transitions. [2022-02-20 18:31:37,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 640 transitions. [2022-02-20 18:31:37,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 640 edges. 640 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:38,080 INFO L225 Difference]: With dead ends: 6790 [2022-02-20 18:31:38,081 INFO L226 Difference]: Without dead ends: 4494 [2022-02-20 18:31:38,083 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:31:38,084 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 409 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:31:38,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [409 Valid, 700 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:31:38,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4494 states. [2022-02-20 18:31:39,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4494 to 3406. [2022-02-20 18:31:39,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:39,144 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4494 states. Second operand has 3406 states, 3405 states have (on average 1.6138032305433188) internal successors, (5495), 3405 states have internal predecessors, (5495), 0 states have call successors, (0), 0 states have 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:31:39,146 INFO L74 IsIncluded]: Start isIncluded. First operand 4494 states. Second operand has 3406 states, 3405 states have (on average 1.6138032305433188) internal successors, (5495), 3405 states have internal predecessors, (5495), 0 states have call successors, (0), 0 states have 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:31:39,148 INFO L87 Difference]: Start difference. First operand 4494 states. Second operand has 3406 states, 3405 states have (on average 1.6138032305433188) internal successors, (5495), 3405 states have internal predecessors, (5495), 0 states have call successors, (0), 0 states have 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:31:39,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:39,681 INFO L93 Difference]: Finished difference Result 4494 states and 7279 transitions. [2022-02-20 18:31:39,681 INFO L276 IsEmpty]: Start isEmpty. Operand 4494 states and 7279 transitions. [2022-02-20 18:31:39,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:39,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:39,688 INFO L74 IsIncluded]: Start isIncluded. First operand has 3406 states, 3405 states have (on average 1.6138032305433188) internal successors, (5495), 3405 states have internal predecessors, (5495), 0 states have call successors, (0), 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 4494 states. [2022-02-20 18:31:39,690 INFO L87 Difference]: Start difference. First operand has 3406 states, 3405 states have (on average 1.6138032305433188) internal successors, (5495), 3405 states have internal predecessors, (5495), 0 states have call successors, (0), 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 4494 states. [2022-02-20 18:31:40,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:40,229 INFO L93 Difference]: Finished difference Result 4494 states and 7279 transitions. [2022-02-20 18:31:40,229 INFO L276 IsEmpty]: Start isEmpty. Operand 4494 states and 7279 transitions. [2022-02-20 18:31:40,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:40,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:40,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:40,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:40,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3406 states, 3405 states have (on average 1.6138032305433188) internal successors, (5495), 3405 states have internal predecessors, (5495), 0 states have call successors, (0), 0 states have 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:31:40,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3406 states to 3406 states and 5495 transitions. [2022-02-20 18:31:40,597 INFO L78 Accepts]: Start accepts. Automaton has 3406 states and 5495 transitions. Word has length 69 [2022-02-20 18:31:40,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:40,597 INFO L470 AbstractCegarLoop]: Abstraction has 3406 states and 5495 transitions. [2022-02-20 18:31:40,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have 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:31:40,597 INFO L276 IsEmpty]: Start isEmpty. Operand 3406 states and 5495 transitions. [2022-02-20 18:31:40,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-20 18:31:40,598 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:40,598 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:31:40,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:31:40,599 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:40,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:40,599 INFO L85 PathProgramCache]: Analyzing trace with hash -612676452, now seen corresponding path program 1 times [2022-02-20 18:31:40,599 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:40,599 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6333218] [2022-02-20 18:31:40,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:40,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:40,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:40,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {59106#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(43, 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; {59106#true} is VALID [2022-02-20 18:31:40,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {59106#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; {59106#true} is VALID [2022-02-20 18:31:40,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {59106#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {59106#true} is VALID [2022-02-20 18:31:40,631 INFO L290 TraceCheckUtils]: 3: Hoare triple {59106#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {59106#true} is VALID [2022-02-20 18:31:40,631 INFO L290 TraceCheckUtils]: 4: Hoare triple {59106#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {59106#true} is VALID [2022-02-20 18:31:40,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {59106#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {59106#true} is VALID [2022-02-20 18:31:40,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {59106#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {59106#true} is VALID [2022-02-20 18:31:40,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {59106#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {59106#true} is VALID [2022-02-20 18:31:40,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {59106#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {59106#true} is VALID [2022-02-20 18:31:40,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {59106#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {59106#true} is VALID [2022-02-20 18:31:40,632 INFO L290 TraceCheckUtils]: 10: Hoare triple {59106#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {59106#true} is VALID [2022-02-20 18:31:40,632 INFO L290 TraceCheckUtils]: 11: Hoare triple {59106#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {59106#true} is VALID [2022-02-20 18:31:40,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {59106#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {59106#true} is VALID [2022-02-20 18:31:40,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {59106#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {59106#true} is VALID [2022-02-20 18:31:40,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {59106#true} assume ~id1~0 != ~id2~0; {59106#true} is VALID [2022-02-20 18:31:40,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {59106#true} assume ~id1~0 != ~id3~0; {59106#true} is VALID [2022-02-20 18:31:40,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {59106#true} assume ~id2~0 != ~id3~0; {59106#true} is VALID [2022-02-20 18:31:40,633 INFO L290 TraceCheckUtils]: 17: Hoare triple {59106#true} assume ~id1~0 >= 0; {59106#true} is VALID [2022-02-20 18:31:40,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {59106#true} assume ~id2~0 >= 0; {59106#true} is VALID [2022-02-20 18:31:40,633 INFO L290 TraceCheckUtils]: 19: Hoare triple {59106#true} assume ~id3~0 >= 0; {59106#true} is VALID [2022-02-20 18:31:40,633 INFO L290 TraceCheckUtils]: 20: Hoare triple {59106#true} assume 0 == ~r1~0 % 256; {59106#true} is VALID [2022-02-20 18:31:40,633 INFO L290 TraceCheckUtils]: 21: Hoare triple {59106#true} assume 0 == ~r2~0 % 256; {59106#true} is VALID [2022-02-20 18:31:40,634 INFO L290 TraceCheckUtils]: 22: Hoare triple {59106#true} assume 0 == ~r3~0 % 256; {59106#true} is VALID [2022-02-20 18:31:40,634 INFO L290 TraceCheckUtils]: 23: Hoare triple {59106#true} assume ~max1~0 == ~id1~0; {59106#true} is VALID [2022-02-20 18:31:40,634 INFO L290 TraceCheckUtils]: 24: Hoare triple {59106#true} assume ~max2~0 == ~id2~0; {59106#true} is VALID [2022-02-20 18:31:40,634 INFO L290 TraceCheckUtils]: 25: Hoare triple {59106#true} assume ~max3~0 == ~id3~0; {59106#true} is VALID [2022-02-20 18:31:40,634 INFO L290 TraceCheckUtils]: 26: Hoare triple {59106#true} assume 0 == ~st1~0; {59106#true} is VALID [2022-02-20 18:31:40,634 INFO L290 TraceCheckUtils]: 27: Hoare triple {59106#true} assume 0 == ~st2~0; {59106#true} is VALID [2022-02-20 18:31:40,634 INFO L290 TraceCheckUtils]: 28: Hoare triple {59106#true} assume 0 == ~st3~0; {59106#true} is VALID [2022-02-20 18:31:40,634 INFO L290 TraceCheckUtils]: 29: Hoare triple {59106#true} assume 0 == ~nl1~0; {59106#true} is VALID [2022-02-20 18:31:40,635 INFO L290 TraceCheckUtils]: 30: Hoare triple {59106#true} assume 0 == ~nl2~0; {59106#true} is VALID [2022-02-20 18:31:40,635 INFO L290 TraceCheckUtils]: 31: Hoare triple {59106#true} assume 0 == ~nl3~0; {59106#true} is VALID [2022-02-20 18:31:40,635 INFO L290 TraceCheckUtils]: 32: Hoare triple {59106#true} assume 0 == ~mode1~0 % 256; {59106#true} is VALID [2022-02-20 18:31:40,635 INFO L290 TraceCheckUtils]: 33: Hoare triple {59106#true} assume 0 == ~mode2~0 % 256; {59106#true} is VALID [2022-02-20 18:31:40,635 INFO L290 TraceCheckUtils]: 34: Hoare triple {59106#true} assume 0 == ~mode3~0 % 256; {59108#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:40,636 INFO L290 TraceCheckUtils]: 35: Hoare triple {59108#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~newmax1~0 % 256; {59108#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:40,636 INFO L290 TraceCheckUtils]: 36: Hoare triple {59108#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~newmax2~0 % 256; {59108#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:40,636 INFO L290 TraceCheckUtils]: 37: Hoare triple {59108#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {59108#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:40,637 INFO L290 TraceCheckUtils]: 38: Hoare triple {59108#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp___5~0#1; {59108#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:40,637 INFO L290 TraceCheckUtils]: 39: Hoare triple {59108#(= (+ (* (- 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; {59108#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:40,637 INFO L290 TraceCheckUtils]: 40: Hoare triple {59108#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {59108#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:40,638 INFO L290 TraceCheckUtils]: 41: Hoare triple {59108#(= (+ (* (- 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; {59108#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:40,638 INFO L290 TraceCheckUtils]: 42: Hoare triple {59108#(= (+ (* (- 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; {59108#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:40,638 INFO L290 TraceCheckUtils]: 43: Hoare triple {59108#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {59108#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:40,639 INFO L290 TraceCheckUtils]: 44: Hoare triple {59108#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r1~0 % 256 < 2; {59108#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:40,639 INFO L290 TraceCheckUtils]: 45: Hoare triple {59108#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep12~0 % 256); {59108#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:40,639 INFO L290 TraceCheckUtils]: 46: Hoare triple {59108#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep13~0 % 256); {59108#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:40,640 INFO L290 TraceCheckUtils]: 47: Hoare triple {59108#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {59108#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:40,640 INFO L290 TraceCheckUtils]: 48: Hoare triple {59108#(= (+ (* (- 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; {59108#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:40,640 INFO L290 TraceCheckUtils]: 49: Hoare triple {59108#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {59108#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:40,641 INFO L290 TraceCheckUtils]: 50: Hoare triple {59108#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r2~0 % 256 < 2; {59108#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:40,641 INFO L290 TraceCheckUtils]: 51: Hoare triple {59108#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep21~0 % 256); {59108#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:40,641 INFO L290 TraceCheckUtils]: 52: Hoare triple {59108#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep23~0 % 256); {59108#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:40,642 INFO L290 TraceCheckUtils]: 53: Hoare triple {59108#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {59108#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:40,642 INFO L290 TraceCheckUtils]: 54: Hoare triple {59108#(= (+ (* (- 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; {59108#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:40,643 INFO L290 TraceCheckUtils]: 55: Hoare triple {59108#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~mode3~0 % 256; {59107#false} is VALID [2022-02-20 18:31:40,643 INFO L290 TraceCheckUtils]: 56: Hoare triple {59107#false} assume !(255 == ~r3~0 % 256); {59107#false} is VALID [2022-02-20 18:31:40,643 INFO L290 TraceCheckUtils]: 57: Hoare triple {59107#false} ~r3~0 := 1 + ~r3~0 % 256; {59107#false} is VALID [2022-02-20 18:31:40,643 INFO L290 TraceCheckUtils]: 58: Hoare triple {59107#false} assume !(0 != ~ep13~0 % 256); {59107#false} is VALID [2022-02-20 18:31:40,643 INFO L290 TraceCheckUtils]: 59: Hoare triple {59107#false} assume !(0 != ~ep23~0 % 256); {59107#false} is VALID [2022-02-20 18:31:40,643 INFO L290 TraceCheckUtils]: 60: Hoare triple {59107#false} ~newmax3~0 := node3_~newmax~2#1; {59107#false} is VALID [2022-02-20 18:31:40,643 INFO L290 TraceCheckUtils]: 61: Hoare triple {59107#false} assume 2 == ~r3~0 % 256; {59107#false} is VALID [2022-02-20 18:31:40,643 INFO L290 TraceCheckUtils]: 62: Hoare triple {59107#false} assume ~max3~0 == ~id3~0;~st3~0 := 1; {59107#false} is VALID [2022-02-20 18:31:40,644 INFO L290 TraceCheckUtils]: 63: Hoare triple {59107#false} ~mode3~0 := 0; {59107#false} is VALID [2022-02-20 18:31:40,644 INFO L290 TraceCheckUtils]: 64: Hoare triple {59107#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; {59107#false} is VALID [2022-02-20 18:31:40,644 INFO L290 TraceCheckUtils]: 65: Hoare triple {59107#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {59107#false} is VALID [2022-02-20 18:31:40,644 INFO L290 TraceCheckUtils]: 66: Hoare triple {59107#false} check_#res#1 := check_~tmp~1#1; {59107#false} is VALID [2022-02-20 18:31:40,644 INFO L290 TraceCheckUtils]: 67: Hoare triple {59107#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; {59107#false} is VALID [2022-02-20 18:31:40,644 INFO L290 TraceCheckUtils]: 68: Hoare triple {59107#false} assume 0 == assert_~arg#1 % 256; {59107#false} is VALID [2022-02-20 18:31:40,644 INFO L290 TraceCheckUtils]: 69: Hoare triple {59107#false} assume !false; {59107#false} is VALID [2022-02-20 18:31:40,644 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:31:40,645 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:40,645 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6333218] [2022-02-20 18:31:40,645 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6333218] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:40,645 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:40,645 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:31:40,645 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458091237] [2022-02-20 18:31:40,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:40,646 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:31:40,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:40,646 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:31:40,688 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:31:40,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:31:40,689 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:40,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:31:40,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:31:40,689 INFO L87 Difference]: Start difference. First operand 3406 states and 5495 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:31:44,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:44,158 INFO L93 Difference]: Finished difference Result 7756 states and 12516 transitions. [2022-02-20 18:31:44,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:31:44,159 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:31:44,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:44,159 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:31:44,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 464 transitions. [2022-02-20 18:31:44,160 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:31:44,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 464 transitions. [2022-02-20 18:31:44,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 464 transitions. [2022-02-20 18:31:44,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 464 edges. 464 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:45,287 INFO L225 Difference]: With dead ends: 7756 [2022-02-20 18:31:45,288 INFO L226 Difference]: Without dead ends: 5334 [2022-02-20 18:31:45,290 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:31:45,290 INFO L933 BasicCegarLoop]: 247 mSDtfsCounter, 110 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 431 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:31:45,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 431 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:31:45,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5334 states. [2022-02-20 18:31:47,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5334 to 5332. [2022-02-20 18:31:47,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:47,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5334 states. Second operand has 5332 states, 5331 states have (on average 1.6008253610954792) internal successors, (8534), 5331 states have internal predecessors, (8534), 0 states have call successors, (0), 0 states have 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:31:47,236 INFO L74 IsIncluded]: Start isIncluded. First operand 5334 states. Second operand has 5332 states, 5331 states have (on average 1.6008253610954792) internal successors, (8534), 5331 states have internal predecessors, (8534), 0 states have call successors, (0), 0 states have 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:31:47,240 INFO L87 Difference]: Start difference. First operand 5334 states. Second operand has 5332 states, 5331 states have (on average 1.6008253610954792) internal successors, (8534), 5331 states have internal predecessors, (8534), 0 states have call successors, (0), 0 states have 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:31:47,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:47,972 INFO L93 Difference]: Finished difference Result 5334 states and 8535 transitions. [2022-02-20 18:31:47,973 INFO L276 IsEmpty]: Start isEmpty. Operand 5334 states and 8535 transitions. [2022-02-20 18:31:47,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:47,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:47,983 INFO L74 IsIncluded]: Start isIncluded. First operand has 5332 states, 5331 states have (on average 1.6008253610954792) internal successors, (8534), 5331 states have internal predecessors, (8534), 0 states have call successors, (0), 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 5334 states. [2022-02-20 18:31:47,988 INFO L87 Difference]: Start difference. First operand has 5332 states, 5331 states have (on average 1.6008253610954792) internal successors, (8534), 5331 states have internal predecessors, (8534), 0 states have call successors, (0), 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 5334 states. [2022-02-20 18:31:48,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:48,730 INFO L93 Difference]: Finished difference Result 5334 states and 8535 transitions. [2022-02-20 18:31:48,730 INFO L276 IsEmpty]: Start isEmpty. Operand 5334 states and 8535 transitions. [2022-02-20 18:31:48,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:48,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:48,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:48,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:48,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5332 states, 5331 states have (on average 1.6008253610954792) internal successors, (8534), 5331 states have internal predecessors, (8534), 0 states have call successors, (0), 0 states have 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:31:49,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5332 states to 5332 states and 8534 transitions. [2022-02-20 18:31:49,589 INFO L78 Accepts]: Start accepts. Automaton has 5332 states and 8534 transitions. Word has length 70 [2022-02-20 18:31:49,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:49,589 INFO L470 AbstractCegarLoop]: Abstraction has 5332 states and 8534 transitions. [2022-02-20 18:31:49,589 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:31:49,589 INFO L276 IsEmpty]: Start isEmpty. Operand 5332 states and 8534 transitions. [2022-02-20 18:31:49,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-20 18:31:49,590 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:49,590 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:31:49,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:31:49,590 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:49,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:49,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1846404324, now seen corresponding path program 1 times [2022-02-20 18:31:49,591 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:49,591 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205138154] [2022-02-20 18:31:49,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:49,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:49,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {84345#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(43, 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; {84345#true} is VALID [2022-02-20 18:31:49,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {84345#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; {84345#true} is VALID [2022-02-20 18:31:49,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {84345#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {84345#true} is VALID [2022-02-20 18:31:49,636 INFO L290 TraceCheckUtils]: 3: Hoare triple {84345#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {84345#true} is VALID [2022-02-20 18:31:49,636 INFO L290 TraceCheckUtils]: 4: Hoare triple {84345#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {84345#true} is VALID [2022-02-20 18:31:49,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {84345#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {84345#true} is VALID [2022-02-20 18:31:49,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {84345#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {84345#true} is VALID [2022-02-20 18:31:49,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {84345#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {84345#true} is VALID [2022-02-20 18:31:49,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {84345#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {84345#true} is VALID [2022-02-20 18:31:49,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {84345#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {84345#true} is VALID [2022-02-20 18:31:49,637 INFO L290 TraceCheckUtils]: 10: Hoare triple {84345#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {84345#true} is VALID [2022-02-20 18:31:49,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {84345#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {84345#true} is VALID [2022-02-20 18:31:49,637 INFO L290 TraceCheckUtils]: 12: Hoare triple {84345#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {84345#true} is VALID [2022-02-20 18:31:49,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {84345#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {84345#true} is VALID [2022-02-20 18:31:49,637 INFO L290 TraceCheckUtils]: 14: Hoare triple {84345#true} assume ~id1~0 != ~id2~0; {84345#true} is VALID [2022-02-20 18:31:49,637 INFO L290 TraceCheckUtils]: 15: Hoare triple {84345#true} assume ~id1~0 != ~id3~0; {84345#true} is VALID [2022-02-20 18:31:49,637 INFO L290 TraceCheckUtils]: 16: Hoare triple {84345#true} assume ~id2~0 != ~id3~0; {84345#true} is VALID [2022-02-20 18:31:49,637 INFO L290 TraceCheckUtils]: 17: Hoare triple {84345#true} assume ~id1~0 >= 0; {84345#true} is VALID [2022-02-20 18:31:49,637 INFO L290 TraceCheckUtils]: 18: Hoare triple {84345#true} assume ~id2~0 >= 0; {84345#true} is VALID [2022-02-20 18:31:49,638 INFO L290 TraceCheckUtils]: 19: Hoare triple {84345#true} assume ~id3~0 >= 0; {84345#true} is VALID [2022-02-20 18:31:49,638 INFO L290 TraceCheckUtils]: 20: Hoare triple {84345#true} assume 0 == ~r1~0 % 256; {84345#true} is VALID [2022-02-20 18:31:49,638 INFO L290 TraceCheckUtils]: 21: Hoare triple {84345#true} assume 0 == ~r2~0 % 256; {84345#true} is VALID [2022-02-20 18:31:49,638 INFO L290 TraceCheckUtils]: 22: Hoare triple {84345#true} assume 0 == ~r3~0 % 256; {84345#true} is VALID [2022-02-20 18:31:49,638 INFO L290 TraceCheckUtils]: 23: Hoare triple {84345#true} assume ~max1~0 == ~id1~0; {84345#true} is VALID [2022-02-20 18:31:49,638 INFO L290 TraceCheckUtils]: 24: Hoare triple {84345#true} assume ~max2~0 == ~id2~0; {84345#true} is VALID [2022-02-20 18:31:49,638 INFO L290 TraceCheckUtils]: 25: Hoare triple {84345#true} assume ~max3~0 == ~id3~0; {84345#true} is VALID [2022-02-20 18:31:49,638 INFO L290 TraceCheckUtils]: 26: Hoare triple {84345#true} assume 0 == ~st1~0; {84345#true} is VALID [2022-02-20 18:31:49,638 INFO L290 TraceCheckUtils]: 27: Hoare triple {84345#true} assume 0 == ~st2~0; {84345#true} is VALID [2022-02-20 18:31:49,639 INFO L290 TraceCheckUtils]: 28: Hoare triple {84345#true} assume 0 == ~st3~0; {84345#true} is VALID [2022-02-20 18:31:49,639 INFO L290 TraceCheckUtils]: 29: Hoare triple {84345#true} assume 0 == ~nl1~0; {84345#true} is VALID [2022-02-20 18:31:49,639 INFO L290 TraceCheckUtils]: 30: Hoare triple {84345#true} assume 0 == ~nl2~0; {84345#true} is VALID [2022-02-20 18:31:49,639 INFO L290 TraceCheckUtils]: 31: Hoare triple {84345#true} assume 0 == ~nl3~0; {84345#true} is VALID [2022-02-20 18:31:49,639 INFO L290 TraceCheckUtils]: 32: Hoare triple {84345#true} assume 0 == ~mode1~0 % 256; {84345#true} is VALID [2022-02-20 18:31:49,640 INFO L290 TraceCheckUtils]: 33: Hoare triple {84345#true} assume 0 == ~mode2~0 % 256; {84347#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:49,640 INFO L290 TraceCheckUtils]: 34: Hoare triple {84347#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {84347#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:49,640 INFO L290 TraceCheckUtils]: 35: Hoare triple {84347#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~newmax1~0 % 256; {84347#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:49,641 INFO L290 TraceCheckUtils]: 36: Hoare triple {84347#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~newmax2~0 % 256; {84347#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:49,641 INFO L290 TraceCheckUtils]: 37: Hoare triple {84347#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {84347#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:49,641 INFO L290 TraceCheckUtils]: 38: Hoare triple {84347#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp___5~0#1; {84347#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:49,642 INFO L290 TraceCheckUtils]: 39: Hoare triple {84347#(= (+ (* (- 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; {84347#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:49,642 INFO L290 TraceCheckUtils]: 40: Hoare triple {84347#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {84347#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:49,642 INFO L290 TraceCheckUtils]: 41: Hoare triple {84347#(= (+ (* (- 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; {84347#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:49,643 INFO L290 TraceCheckUtils]: 42: Hoare triple {84347#(= (+ (* (- 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; {84347#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:49,643 INFO L290 TraceCheckUtils]: 43: Hoare triple {84347#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {84347#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:49,643 INFO L290 TraceCheckUtils]: 44: Hoare triple {84347#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~r1~0 % 256 < 2; {84347#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:49,644 INFO L290 TraceCheckUtils]: 45: Hoare triple {84347#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~ep12~0 % 256); {84347#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:49,644 INFO L290 TraceCheckUtils]: 46: Hoare triple {84347#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~ep13~0 % 256); {84347#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:49,644 INFO L290 TraceCheckUtils]: 47: Hoare triple {84347#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {84347#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:49,645 INFO L290 TraceCheckUtils]: 48: Hoare triple {84347#(= (+ (* (- 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; {84347#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:49,645 INFO L290 TraceCheckUtils]: 49: Hoare triple {84347#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~mode2~0 % 256; {84346#false} is VALID [2022-02-20 18:31:49,645 INFO L290 TraceCheckUtils]: 50: Hoare triple {84346#false} assume !(255 == ~r2~0 % 256); {84346#false} is VALID [2022-02-20 18:31:49,645 INFO L290 TraceCheckUtils]: 51: Hoare triple {84346#false} ~r2~0 := 1 + ~r2~0 % 256; {84346#false} is VALID [2022-02-20 18:31:49,646 INFO L290 TraceCheckUtils]: 52: Hoare triple {84346#false} assume !(0 != ~ep12~0 % 256); {84346#false} is VALID [2022-02-20 18:31:49,646 INFO L290 TraceCheckUtils]: 53: Hoare triple {84346#false} assume !(0 != ~ep32~0 % 256); {84346#false} is VALID [2022-02-20 18:31:49,646 INFO L290 TraceCheckUtils]: 54: Hoare triple {84346#false} ~newmax2~0 := node2_~newmax~1#1; {84346#false} is VALID [2022-02-20 18:31:49,646 INFO L290 TraceCheckUtils]: 55: Hoare triple {84346#false} assume 2 == ~r2~0 % 256; {84346#false} is VALID [2022-02-20 18:31:49,646 INFO L290 TraceCheckUtils]: 56: Hoare triple {84346#false} assume ~max2~0 == ~id2~0;~st2~0 := 1; {84346#false} is VALID [2022-02-20 18:31:49,646 INFO L290 TraceCheckUtils]: 57: Hoare triple {84346#false} ~mode2~0 := 0; {84346#false} is VALID [2022-02-20 18:31:49,646 INFO L290 TraceCheckUtils]: 58: Hoare triple {84346#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; {84346#false} is VALID [2022-02-20 18:31:49,647 INFO L290 TraceCheckUtils]: 59: Hoare triple {84346#false} assume !(0 != ~mode3~0 % 256); {84346#false} is VALID [2022-02-20 18:31:49,647 INFO L290 TraceCheckUtils]: 60: Hoare triple {84346#false} assume ~r3~0 % 256 < 2; {84346#false} is VALID [2022-02-20 18:31:49,647 INFO L290 TraceCheckUtils]: 61: Hoare triple {84346#false} assume !(0 != ~ep31~0 % 256); {84346#false} is VALID [2022-02-20 18:31:49,647 INFO L290 TraceCheckUtils]: 62: Hoare triple {84346#false} assume !(0 != ~ep32~0 % 256); {84346#false} is VALID [2022-02-20 18:31:49,647 INFO L290 TraceCheckUtils]: 63: Hoare triple {84346#false} ~mode3~0 := 1; {84346#false} is VALID [2022-02-20 18:31:49,647 INFO L290 TraceCheckUtils]: 64: Hoare triple {84346#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; {84346#false} is VALID [2022-02-20 18:31:49,647 INFO L290 TraceCheckUtils]: 65: Hoare triple {84346#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {84346#false} is VALID [2022-02-20 18:31:49,647 INFO L290 TraceCheckUtils]: 66: Hoare triple {84346#false} check_#res#1 := check_~tmp~1#1; {84346#false} is VALID [2022-02-20 18:31:49,648 INFO L290 TraceCheckUtils]: 67: Hoare triple {84346#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; {84346#false} is VALID [2022-02-20 18:31:49,648 INFO L290 TraceCheckUtils]: 68: Hoare triple {84346#false} assume 0 == assert_~arg#1 % 256; {84346#false} is VALID [2022-02-20 18:31:49,648 INFO L290 TraceCheckUtils]: 69: Hoare triple {84346#false} assume !false; {84346#false} is VALID [2022-02-20 18:31:49,648 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:31:49,648 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:49,648 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205138154] [2022-02-20 18:31:49,648 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205138154] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:49,649 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:49,649 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:31:49,649 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157643376] [2022-02-20 18:31:49,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:49,649 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:31:49,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:49,650 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:31:49,692 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:31:49,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:31:49,693 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:49,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:31:49,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:31:49,694 INFO L87 Difference]: Start difference. First operand 5332 states and 8534 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:31:56,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:56,230 INFO L93 Difference]: Finished difference Result 11652 states and 18696 transitions. [2022-02-20 18:31:56,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:31:56,231 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:31:56,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:56,231 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:31:56,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 464 transitions. [2022-02-20 18:31:56,233 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:31:56,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 464 transitions. [2022-02-20 18:31:56,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 464 transitions. [2022-02-20 18:31:56,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 464 edges. 464 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:58,515 INFO L225 Difference]: With dead ends: 11652 [2022-02-20 18:31:58,515 INFO L226 Difference]: Without dead ends: 7898 [2022-02-20 18:31:58,527 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:31:58,528 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 116 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 465 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:31:58,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 465 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:31:58,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7898 states. [2022-02-20 18:32:01,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7898 to 7896. [2022-02-20 18:32:01,321 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:01,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7898 states. Second operand has 7896 states, 7895 states have (on average 1.592400253324889) internal successors, (12572), 7895 states have internal predecessors, (12572), 0 states have call successors, (0), 0 states have 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:01,338 INFO L74 IsIncluded]: Start isIncluded. First operand 7898 states. Second operand has 7896 states, 7895 states have (on average 1.592400253324889) internal successors, (12572), 7895 states have internal predecessors, (12572), 0 states have call successors, (0), 0 states have 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:01,345 INFO L87 Difference]: Start difference. First operand 7898 states. Second operand has 7896 states, 7895 states have (on average 1.592400253324889) internal successors, (12572), 7895 states have internal predecessors, (12572), 0 states have call successors, (0), 0 states have 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:03,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:03,015 INFO L93 Difference]: Finished difference Result 7898 states and 12573 transitions. [2022-02-20 18:32:03,015 INFO L276 IsEmpty]: Start isEmpty. Operand 7898 states and 12573 transitions. [2022-02-20 18:32:03,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:03,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:03,031 INFO L74 IsIncluded]: Start isIncluded. First operand has 7896 states, 7895 states have (on average 1.592400253324889) internal successors, (12572), 7895 states have internal predecessors, (12572), 0 states have call successors, (0), 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 7898 states. [2022-02-20 18:32:03,036 INFO L87 Difference]: Start difference. First operand has 7896 states, 7895 states have (on average 1.592400253324889) internal successors, (12572), 7895 states have internal predecessors, (12572), 0 states have call successors, (0), 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 7898 states. [2022-02-20 18:32:04,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:04,864 INFO L93 Difference]: Finished difference Result 7898 states and 12573 transitions. [2022-02-20 18:32:04,864 INFO L276 IsEmpty]: Start isEmpty. Operand 7898 states and 12573 transitions. [2022-02-20 18:32:04,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:04,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:04,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:04,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:04,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7896 states, 7895 states have (on average 1.592400253324889) internal successors, (12572), 7895 states have internal predecessors, (12572), 0 states have call successors, (0), 0 states have 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:06,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7896 states to 7896 states and 12572 transitions. [2022-02-20 18:32:06,848 INFO L78 Accepts]: Start accepts. Automaton has 7896 states and 12572 transitions. Word has length 70 [2022-02-20 18:32:06,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:06,848 INFO L470 AbstractCegarLoop]: Abstraction has 7896 states and 12572 transitions. [2022-02-20 18:32:06,848 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:06,848 INFO L276 IsEmpty]: Start isEmpty. Operand 7896 states and 12572 transitions. [2022-02-20 18:32:06,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-20 18:32:06,849 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:06,849 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:06,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:32:06,850 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:06,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:06,850 INFO L85 PathProgramCache]: Analyzing trace with hash -827061860, now seen corresponding path program 1 times [2022-02-20 18:32:06,850 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:06,850 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770062077] [2022-02-20 18:32:06,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:06,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:06,925 INFO L290 TraceCheckUtils]: 0: Hoare triple {122151#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(43, 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; {122151#true} is VALID [2022-02-20 18:32:06,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {122151#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; {122151#true} is VALID [2022-02-20 18:32:06,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {122151#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {122151#true} is VALID [2022-02-20 18:32:06,925 INFO L290 TraceCheckUtils]: 3: Hoare triple {122151#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {122151#true} is VALID [2022-02-20 18:32:06,925 INFO L290 TraceCheckUtils]: 4: Hoare triple {122151#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {122151#true} is VALID [2022-02-20 18:32:06,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {122151#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {122151#true} is VALID [2022-02-20 18:32:06,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {122151#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {122151#true} is VALID [2022-02-20 18:32:06,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {122151#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {122151#true} is VALID [2022-02-20 18:32:06,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {122151#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {122151#true} is VALID [2022-02-20 18:32:06,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {122151#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {122151#true} is VALID [2022-02-20 18:32:06,926 INFO L290 TraceCheckUtils]: 10: Hoare triple {122151#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {122151#true} is VALID [2022-02-20 18:32:06,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {122151#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {122151#true} is VALID [2022-02-20 18:32:06,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {122151#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {122151#true} is VALID [2022-02-20 18:32:06,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {122151#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {122151#true} is VALID [2022-02-20 18:32:06,926 INFO L290 TraceCheckUtils]: 14: Hoare triple {122151#true} assume ~id1~0 != ~id2~0; {122151#true} is VALID [2022-02-20 18:32:06,926 INFO L290 TraceCheckUtils]: 15: Hoare triple {122151#true} assume ~id1~0 != ~id3~0; {122151#true} is VALID [2022-02-20 18:32:06,926 INFO L290 TraceCheckUtils]: 16: Hoare triple {122151#true} assume ~id2~0 != ~id3~0; {122151#true} is VALID [2022-02-20 18:32:06,926 INFO L290 TraceCheckUtils]: 17: Hoare triple {122151#true} assume ~id1~0 >= 0; {122151#true} is VALID [2022-02-20 18:32:06,926 INFO L290 TraceCheckUtils]: 18: Hoare triple {122151#true} assume ~id2~0 >= 0; {122151#true} is VALID [2022-02-20 18:32:06,926 INFO L290 TraceCheckUtils]: 19: Hoare triple {122151#true} assume ~id3~0 >= 0; {122151#true} is VALID [2022-02-20 18:32:06,926 INFO L290 TraceCheckUtils]: 20: Hoare triple {122151#true} assume 0 == ~r1~0 % 256; {122151#true} is VALID [2022-02-20 18:32:06,927 INFO L290 TraceCheckUtils]: 21: Hoare triple {122151#true} assume 0 == ~r2~0 % 256; {122151#true} is VALID [2022-02-20 18:32:06,927 INFO L290 TraceCheckUtils]: 22: Hoare triple {122151#true} assume 0 == ~r3~0 % 256; {122151#true} is VALID [2022-02-20 18:32:06,927 INFO L290 TraceCheckUtils]: 23: Hoare triple {122151#true} assume ~max1~0 == ~id1~0; {122151#true} is VALID [2022-02-20 18:32:06,927 INFO L290 TraceCheckUtils]: 24: Hoare triple {122151#true} assume ~max2~0 == ~id2~0; {122151#true} is VALID [2022-02-20 18:32:06,927 INFO L290 TraceCheckUtils]: 25: Hoare triple {122151#true} assume ~max3~0 == ~id3~0; {122151#true} is VALID [2022-02-20 18:32:06,927 INFO L290 TraceCheckUtils]: 26: Hoare triple {122151#true} assume 0 == ~st1~0; {122151#true} is VALID [2022-02-20 18:32:06,927 INFO L290 TraceCheckUtils]: 27: Hoare triple {122151#true} assume 0 == ~st2~0; {122151#true} is VALID [2022-02-20 18:32:06,927 INFO L290 TraceCheckUtils]: 28: Hoare triple {122151#true} assume 0 == ~st3~0; {122151#true} is VALID [2022-02-20 18:32:06,927 INFO L290 TraceCheckUtils]: 29: Hoare triple {122151#true} assume 0 == ~nl1~0; {122151#true} is VALID [2022-02-20 18:32:06,927 INFO L290 TraceCheckUtils]: 30: Hoare triple {122151#true} assume 0 == ~nl2~0; {122151#true} is VALID [2022-02-20 18:32:06,928 INFO L290 TraceCheckUtils]: 31: Hoare triple {122151#true} assume 0 == ~nl3~0; {122151#true} is VALID [2022-02-20 18:32:06,929 INFO L290 TraceCheckUtils]: 32: Hoare triple {122151#true} assume 0 == ~mode1~0 % 256; {122153#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:06,929 INFO L290 TraceCheckUtils]: 33: Hoare triple {122153#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {122153#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:06,929 INFO L290 TraceCheckUtils]: 34: Hoare triple {122153#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {122153#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:06,930 INFO L290 TraceCheckUtils]: 35: Hoare triple {122153#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~newmax1~0 % 256; {122153#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:06,930 INFO L290 TraceCheckUtils]: 36: Hoare triple {122153#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~newmax2~0 % 256; {122153#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:06,930 INFO L290 TraceCheckUtils]: 37: Hoare triple {122153#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {122153#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:06,931 INFO L290 TraceCheckUtils]: 38: Hoare triple {122153#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {122153#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:06,931 INFO L290 TraceCheckUtils]: 39: Hoare triple {122153#(= (+ (* (- 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; {122153#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:06,931 INFO L290 TraceCheckUtils]: 40: Hoare triple {122153#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {122153#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:06,932 INFO L290 TraceCheckUtils]: 41: Hoare triple {122153#(= (+ (* (- 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; {122153#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:06,932 INFO L290 TraceCheckUtils]: 42: Hoare triple {122153#(= (+ (* (- 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; {122153#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:06,932 INFO L290 TraceCheckUtils]: 43: Hoare triple {122153#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256; {122152#false} is VALID [2022-02-20 18:32:06,933 INFO L290 TraceCheckUtils]: 44: Hoare triple {122152#false} assume !(255 == ~r1~0 % 256); {122152#false} is VALID [2022-02-20 18:32:06,933 INFO L290 TraceCheckUtils]: 45: Hoare triple {122152#false} ~r1~0 := 1 + ~r1~0 % 256; {122152#false} is VALID [2022-02-20 18:32:06,933 INFO L290 TraceCheckUtils]: 46: Hoare triple {122152#false} assume !(0 != ~ep21~0 % 256); {122152#false} is VALID [2022-02-20 18:32:06,933 INFO L290 TraceCheckUtils]: 47: Hoare triple {122152#false} assume !(0 != ~ep31~0 % 256); {122152#false} is VALID [2022-02-20 18:32:06,933 INFO L290 TraceCheckUtils]: 48: Hoare triple {122152#false} ~newmax1~0 := node1_~newmax~0#1; {122152#false} is VALID [2022-02-20 18:32:06,933 INFO L290 TraceCheckUtils]: 49: Hoare triple {122152#false} assume 2 == ~r1~0 % 256; {122152#false} is VALID [2022-02-20 18:32:06,933 INFO L290 TraceCheckUtils]: 50: Hoare triple {122152#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {122152#false} is VALID [2022-02-20 18:32:06,934 INFO L290 TraceCheckUtils]: 51: Hoare triple {122152#false} ~mode1~0 := 0; {122152#false} is VALID [2022-02-20 18:32:06,934 INFO L290 TraceCheckUtils]: 52: Hoare triple {122152#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; {122152#false} is VALID [2022-02-20 18:32:06,934 INFO L290 TraceCheckUtils]: 53: Hoare triple {122152#false} assume !(0 != ~mode2~0 % 256); {122152#false} is VALID [2022-02-20 18:32:06,934 INFO L290 TraceCheckUtils]: 54: Hoare triple {122152#false} assume ~r2~0 % 256 < 2; {122152#false} is VALID [2022-02-20 18:32:06,934 INFO L290 TraceCheckUtils]: 55: Hoare triple {122152#false} assume !(0 != ~ep21~0 % 256); {122152#false} is VALID [2022-02-20 18:32:06,934 INFO L290 TraceCheckUtils]: 56: Hoare triple {122152#false} assume !(0 != ~ep23~0 % 256); {122152#false} is VALID [2022-02-20 18:32:06,934 INFO L290 TraceCheckUtils]: 57: Hoare triple {122152#false} ~mode2~0 := 1; {122152#false} is VALID [2022-02-20 18:32:06,934 INFO L290 TraceCheckUtils]: 58: Hoare triple {122152#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; {122152#false} is VALID [2022-02-20 18:32:06,935 INFO L290 TraceCheckUtils]: 59: Hoare triple {122152#false} assume !(0 != ~mode3~0 % 256); {122152#false} is VALID [2022-02-20 18:32:06,935 INFO L290 TraceCheckUtils]: 60: Hoare triple {122152#false} assume ~r3~0 % 256 < 2; {122152#false} is VALID [2022-02-20 18:32:06,935 INFO L290 TraceCheckUtils]: 61: Hoare triple {122152#false} assume !(0 != ~ep31~0 % 256); {122152#false} is VALID [2022-02-20 18:32:06,935 INFO L290 TraceCheckUtils]: 62: Hoare triple {122152#false} assume !(0 != ~ep32~0 % 256); {122152#false} is VALID [2022-02-20 18:32:06,935 INFO L290 TraceCheckUtils]: 63: Hoare triple {122152#false} ~mode3~0 := 1; {122152#false} is VALID [2022-02-20 18:32:06,935 INFO L290 TraceCheckUtils]: 64: Hoare triple {122152#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; {122152#false} is VALID [2022-02-20 18:32:06,935 INFO L290 TraceCheckUtils]: 65: Hoare triple {122152#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {122152#false} is VALID [2022-02-20 18:32:06,935 INFO L290 TraceCheckUtils]: 66: Hoare triple {122152#false} check_#res#1 := check_~tmp~1#1; {122152#false} is VALID [2022-02-20 18:32:06,936 INFO L290 TraceCheckUtils]: 67: Hoare triple {122152#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; {122152#false} is VALID [2022-02-20 18:32:06,936 INFO L290 TraceCheckUtils]: 68: Hoare triple {122152#false} assume 0 == assert_~arg#1 % 256; {122152#false} is VALID [2022-02-20 18:32:06,936 INFO L290 TraceCheckUtils]: 69: Hoare triple {122152#false} assume !false; {122152#false} is VALID [2022-02-20 18:32:06,936 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:06,936 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:06,936 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770062077] [2022-02-20 18:32:06,936 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770062077] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:06,937 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:06,937 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:32:06,937 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031700172] [2022-02-20 18:32:06,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:06,937 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:06,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:06,938 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:06,983 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:06,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:32:06,983 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:06,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:32:06,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:32:06,985 INFO L87 Difference]: Start difference. First operand 7896 states and 12572 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:19,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:19,863 INFO L93 Difference]: Finished difference Result 17505 states and 28102 transitions. [2022-02-20 18:32:19,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:32:19,866 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:19,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:32:19,867 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:19,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 464 transitions. [2022-02-20 18:32:19,869 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:19,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 464 transitions. [2022-02-20 18:32:19,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 464 transitions. [2022-02-20 18:32:20,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 464 edges. 464 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:24,201 INFO L225 Difference]: With dead ends: 17505 [2022-02-20 18:32:24,201 INFO L226 Difference]: Without dead ends: 11757 [2022-02-20 18:32:24,205 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:24,207 INFO L933 BasicCegarLoop]: 309 mSDtfsCounter, 122 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 491 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:24,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 491 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:24,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11757 states. [2022-02-20 18:32:29,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11757 to 11755. [2022-02-20 18:32:29,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:29,426 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11757 states. Second operand has 11755 states, 11754 states have (on average 1.5875446656457377) internal successors, (18660), 11754 states have internal predecessors, (18660), 0 states have call successors, (0), 0 states have 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,437 INFO L74 IsIncluded]: Start isIncluded. First operand 11757 states. Second operand has 11755 states, 11754 states have (on average 1.5875446656457377) internal successors, (18660), 11754 states have internal predecessors, (18660), 0 states have call successors, (0), 0 states have 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,448 INFO L87 Difference]: Start difference. First operand 11757 states. Second operand has 11755 states, 11754 states have (on average 1.5875446656457377) internal successors, (18660), 11754 states have internal predecessors, (18660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)