./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.ufo.BOUNDED-6.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_floodmax.3.ufo.BOUNDED-6.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 3f728e04159b75fd4f86d9e171d07387390897d2fdfdd24db8ac526a2f9d83e1 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:24:43,209 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:24:43,218 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:24:43,257 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:24:43,258 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:24:43,261 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:24:43,262 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:24:43,265 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:24:43,266 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:24:43,270 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:24:43,271 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:24:43,272 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:24:43,273 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:24:43,275 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:24:43,276 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:24:43,279 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:24:43,280 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:24:43,281 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:24:43,283 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:24:43,288 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:24:43,290 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:24:43,291 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:24:43,292 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:24:43,293 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:24:43,298 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:24:43,299 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:24:43,299 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:24:43,300 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:24:43,301 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:24:43,302 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:24:43,302 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:24:43,303 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:24:43,304 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:24:43,305 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:24:43,306 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:24:43,306 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:24:43,308 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:24:43,308 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:24:43,308 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:24:43,309 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:24:43,310 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:24:43,310 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:24:43,341 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:24:43,341 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:24:43,342 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:24:43,342 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:24:43,343 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:24:43,343 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:24:43,344 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:24:43,344 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:24:43,344 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:24:43,345 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:24:43,345 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:24:43,346 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:24:43,346 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:24:43,346 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:24:43,346 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:24:43,347 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:24:43,347 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:24:43,347 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:24:43,347 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:24:43,347 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:24:43,348 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:24:43,348 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:24:43,348 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:24:43,348 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:24:43,349 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:24:43,349 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:24:43,349 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:24:43,350 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:24:43,351 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:24:43,351 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:24:43,351 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:24:43,351 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:24:43,352 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:24:43,352 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 -> 3f728e04159b75fd4f86d9e171d07387390897d2fdfdd24db8ac526a2f9d83e1 [2022-02-20 18:24:43,592 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:24:43,618 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:24:43,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:24:43,621 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:24:43,622 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:24:43,623 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.ufo.BOUNDED-6.pals.c [2022-02-20 18:24:43,694 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fe2b3037/d1c4518c75be4d71be59dee09ab3eedd/FLAG4e03063c1 [2022-02-20 18:24:44,144 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:24:44,145 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.ufo.BOUNDED-6.pals.c [2022-02-20 18:24:44,168 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fe2b3037/d1c4518c75be4d71be59dee09ab3eedd/FLAG4e03063c1 [2022-02-20 18:24:44,664 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fe2b3037/d1c4518c75be4d71be59dee09ab3eedd [2022-02-20 18:24:44,666 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:24:44,667 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:24:44,670 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:24:44,670 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:24:44,672 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:24:44,673 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:24:44" (1/1) ... [2022-02-20 18:24:44,674 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3831ccb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:44, skipping insertion in model container [2022-02-20 18:24:44,674 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:24:44" (1/1) ... [2022-02-20 18:24:44,680 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:24:44,722 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:24:44,937 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_floodmax.3.ufo.BOUNDED-6.pals.c[12762,12775] [2022-02-20 18:24:44,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:24:44,947 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:24:45,045 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_floodmax.3.ufo.BOUNDED-6.pals.c[12762,12775] [2022-02-20 18:24:45,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:24:45,068 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:24:45,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:45 WrapperNode [2022-02-20 18:24:45,069 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:24:45,070 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:24:45,070 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:24:45,070 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:24:45,082 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:24:45" (1/1) ... [2022-02-20 18:24:45,103 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:24:45" (1/1) ... [2022-02-20 18:24:45,153 INFO L137 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 441 [2022-02-20 18:24:45,153 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:24:45,154 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:24:45,154 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:24:45,154 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:24:45,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:45" (1/1) ... [2022-02-20 18:24:45,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:45" (1/1) ... [2022-02-20 18:24:45,181 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:45" (1/1) ... [2022-02-20 18:24:45,184 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:45" (1/1) ... [2022-02-20 18:24:45,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:45" (1/1) ... [2022-02-20 18:24:45,216 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:45" (1/1) ... [2022-02-20 18:24:45,222 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:45" (1/1) ... [2022-02-20 18:24:45,229 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:24:45,230 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:24:45,230 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:24:45,230 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:24:45,231 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:45" (1/1) ... [2022-02-20 18:24:45,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:24:45,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:24:45,253 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:24:45,254 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:24:45,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:24:45,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:24:45,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:24:45,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:24:45,425 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:24:45,427 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:24:46,144 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:24:46,156 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:24:46,159 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 18:24:46,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:24:46 BoogieIcfgContainer [2022-02-20 18:24:46,161 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:24:46,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:24:46,163 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:24:46,165 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:24:46,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:24:44" (1/3) ... [2022-02-20 18:24:46,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@105f826d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:24:46, skipping insertion in model container [2022-02-20 18:24:46,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:45" (2/3) ... [2022-02-20 18:24:46,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@105f826d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:24:46, skipping insertion in model container [2022-02-20 18:24:46,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:24:46" (3/3) ... [2022-02-20 18:24:46,167 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.ufo.BOUNDED-6.pals.c [2022-02-20 18:24:46,171 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:24:46,171 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:24:46,205 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:24:46,210 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:24:46,211 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:24:46,228 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 129 states have (on average 1.7596899224806202) internal successors, (227), 130 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have 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:24:46,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:24:46,234 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:46,235 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:24:46,236 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:46,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:46,240 INFO L85 PathProgramCache]: Analyzing trace with hash -306716250, now seen corresponding path program 1 times [2022-02-20 18:24:46,247 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:46,247 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2922073] [2022-02-20 18:24:46,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:46,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:46,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:46,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {134#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(37, 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;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {134#true} is VALID [2022-02-20 18:24:46,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {134#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~ret37#1, main_#t~ret38#1, main_#t~post39#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;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~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;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#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; {134#true} is VALID [2022-02-20 18:24:46,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {134#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {134#true} is VALID [2022-02-20 18:24:46,502 INFO L290 TraceCheckUtils]: 3: Hoare triple {134#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {134#true} is VALID [2022-02-20 18:24:46,503 INFO L290 TraceCheckUtils]: 4: Hoare triple {134#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {134#true} is VALID [2022-02-20 18:24:46,507 INFO L290 TraceCheckUtils]: 5: Hoare triple {134#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {134#true} is VALID [2022-02-20 18:24:46,507 INFO L290 TraceCheckUtils]: 6: Hoare triple {134#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {134#true} is VALID [2022-02-20 18:24:46,508 INFO L290 TraceCheckUtils]: 7: Hoare triple {134#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {134#true} is VALID [2022-02-20 18:24:46,508 INFO L290 TraceCheckUtils]: 8: Hoare triple {134#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {134#true} is VALID [2022-02-20 18:24:46,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {134#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {134#true} is VALID [2022-02-20 18:24:46,508 INFO L290 TraceCheckUtils]: 10: Hoare triple {134#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {134#true} is VALID [2022-02-20 18:24:46,509 INFO L290 TraceCheckUtils]: 11: Hoare triple {134#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {134#true} is VALID [2022-02-20 18:24:46,509 INFO L290 TraceCheckUtils]: 12: Hoare triple {134#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {134#true} is VALID [2022-02-20 18:24:46,509 INFO L290 TraceCheckUtils]: 13: Hoare triple {134#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {134#true} is VALID [2022-02-20 18:24:46,510 INFO L290 TraceCheckUtils]: 14: Hoare triple {134#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; {134#true} is VALID [2022-02-20 18:24:46,510 INFO L290 TraceCheckUtils]: 15: Hoare triple {134#true} init_#res#1 := init_~tmp___5~0#1; {134#true} is VALID [2022-02-20 18:24:46,510 INFO L290 TraceCheckUtils]: 16: Hoare triple {134#true} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; {134#true} is VALID [2022-02-20 18:24:46,511 INFO L290 TraceCheckUtils]: 17: Hoare triple {134#true} assume 0 == main_~i2~0#1;assume false; {135#false} is VALID [2022-02-20 18:24:46,513 INFO L290 TraceCheckUtils]: 18: Hoare triple {135#false} ~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; {135#false} is VALID [2022-02-20 18:24:46,513 INFO L290 TraceCheckUtils]: 19: Hoare triple {135#false} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {135#false} is VALID [2022-02-20 18:24:46,513 INFO L290 TraceCheckUtils]: 20: Hoare triple {135#false} assume !(0 != ~mode1~0 % 256); {135#false} is VALID [2022-02-20 18:24:46,514 INFO L290 TraceCheckUtils]: 21: Hoare triple {135#false} assume !(~r1~0 < 2); {135#false} is VALID [2022-02-20 18:24:46,514 INFO L290 TraceCheckUtils]: 22: Hoare triple {135#false} ~mode1~0 := 1; {135#false} is VALID [2022-02-20 18:24:46,515 INFO L290 TraceCheckUtils]: 23: Hoare triple {135#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {135#false} is VALID [2022-02-20 18:24:46,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {135#false} assume !(0 != ~mode2~0 % 256); {135#false} is VALID [2022-02-20 18:24:46,515 INFO L290 TraceCheckUtils]: 25: Hoare triple {135#false} assume !(~r2~0 < 2); {135#false} is VALID [2022-02-20 18:24:46,516 INFO L290 TraceCheckUtils]: 26: Hoare triple {135#false} ~mode2~0 := 1; {135#false} is VALID [2022-02-20 18:24:46,516 INFO L290 TraceCheckUtils]: 27: Hoare triple {135#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {135#false} is VALID [2022-02-20 18:24:46,516 INFO L290 TraceCheckUtils]: 28: Hoare triple {135#false} assume !(0 != ~mode3~0 % 256); {135#false} is VALID [2022-02-20 18:24:46,517 INFO L290 TraceCheckUtils]: 29: Hoare triple {135#false} assume !(~r3~0 < 2); {135#false} is VALID [2022-02-20 18:24:46,517 INFO L290 TraceCheckUtils]: 30: Hoare triple {135#false} ~mode3~0 := 1; {135#false} is VALID [2022-02-20 18:24:46,517 INFO L290 TraceCheckUtils]: 31: Hoare triple {135#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; {135#false} is VALID [2022-02-20 18:24:46,517 INFO L290 TraceCheckUtils]: 32: Hoare triple {135#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {135#false} is VALID [2022-02-20 18:24:46,518 INFO L290 TraceCheckUtils]: 33: Hoare triple {135#false} check_#res#1 := check_~tmp~1#1; {135#false} is VALID [2022-02-20 18:24:46,518 INFO L290 TraceCheckUtils]: 34: Hoare triple {135#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#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; {135#false} is VALID [2022-02-20 18:24:46,518 INFO L290 TraceCheckUtils]: 35: Hoare triple {135#false} assume 0 == assert_~arg#1 % 256; {135#false} is VALID [2022-02-20 18:24:46,518 INFO L290 TraceCheckUtils]: 36: Hoare triple {135#false} assume !false; {135#false} is VALID [2022-02-20 18:24:46,528 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:24:46,528 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:46,529 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2922073] [2022-02-20 18:24:46,529 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2922073] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:46,530 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:46,530 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:24:46,531 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393309766] [2022-02-20 18:24:46,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:46,535 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:24:46,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:46,539 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:24:46,583 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:24:46,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:24:46,584 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:46,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:24:46,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:24:46,609 INFO L87 Difference]: Start difference. First operand has 131 states, 129 states have (on average 1.7596899224806202) internal successors, (227), 130 states have internal predecessors, (227), 0 states have call successors, (0), 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:24:46,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:46,750 INFO L93 Difference]: Finished difference Result 206 states and 352 transitions. [2022-02-20 18:24:46,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:24:46,751 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:24:46,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:46,752 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:24:46,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 352 transitions. [2022-02-20 18:24:46,764 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:24:46,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 352 transitions. [2022-02-20 18:24:46,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 352 transitions. [2022-02-20 18:24:47,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 352 edges. 352 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:47,085 INFO L225 Difference]: With dead ends: 206 [2022-02-20 18:24:47,086 INFO L226 Difference]: Without dead ends: 127 [2022-02-20 18:24:47,089 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:24:47,092 INFO L933 BasicCegarLoop]: 224 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, 224 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:24:47,093 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:47,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-02-20 18:24:47,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-02-20 18:24:47,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:47,123 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand has 127 states, 126 states have (on average 1.746031746031746) internal successors, (220), 126 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have 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:24:47,124 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand has 127 states, 126 states have (on average 1.746031746031746) internal successors, (220), 126 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have 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:24:47,125 INFO L87 Difference]: Start difference. First operand 127 states. Second operand has 127 states, 126 states have (on average 1.746031746031746) internal successors, (220), 126 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have 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:24:47,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:47,132 INFO L93 Difference]: Finished difference Result 127 states and 220 transitions. [2022-02-20 18:24:47,133 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 220 transitions. [2022-02-20 18:24:47,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:47,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:47,134 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 126 states have (on average 1.746031746031746) internal successors, (220), 126 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 127 states. [2022-02-20 18:24:47,135 INFO L87 Difference]: Start difference. First operand has 127 states, 126 states have (on average 1.746031746031746) internal successors, (220), 126 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 127 states. [2022-02-20 18:24:47,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:47,142 INFO L93 Difference]: Finished difference Result 127 states and 220 transitions. [2022-02-20 18:24:47,142 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 220 transitions. [2022-02-20 18:24:47,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:47,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:47,143 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:47,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:47,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.746031746031746) internal successors, (220), 126 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have 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:24:47,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 220 transitions. [2022-02-20 18:24:47,151 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 220 transitions. Word has length 37 [2022-02-20 18:24:47,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:47,151 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 220 transitions. [2022-02-20 18:24:47,151 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:24:47,152 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 220 transitions. [2022-02-20 18:24:47,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:24:47,153 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:47,153 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:24:47,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:24:47,154 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:47,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:47,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1124364700, now seen corresponding path program 1 times [2022-02-20 18:24:47,155 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:47,155 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567461851] [2022-02-20 18:24:47,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:47,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:47,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:47,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {753#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(37, 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;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {753#true} is VALID [2022-02-20 18:24:47,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {753#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~ret37#1, main_#t~ret38#1, main_#t~post39#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;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~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;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#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; {753#true} is VALID [2022-02-20 18:24:47,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {753#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {753#true} is VALID [2022-02-20 18:24:47,262 INFO L290 TraceCheckUtils]: 3: Hoare triple {753#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {753#true} is VALID [2022-02-20 18:24:47,262 INFO L290 TraceCheckUtils]: 4: Hoare triple {753#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {753#true} is VALID [2022-02-20 18:24:47,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {753#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {753#true} is VALID [2022-02-20 18:24:47,263 INFO L290 TraceCheckUtils]: 6: Hoare triple {753#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {753#true} is VALID [2022-02-20 18:24:47,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {753#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {753#true} is VALID [2022-02-20 18:24:47,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {753#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {753#true} is VALID [2022-02-20 18:24:47,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {753#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {753#true} is VALID [2022-02-20 18:24:47,264 INFO L290 TraceCheckUtils]: 10: Hoare triple {753#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {753#true} is VALID [2022-02-20 18:24:47,265 INFO L290 TraceCheckUtils]: 11: Hoare triple {753#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {753#true} is VALID [2022-02-20 18:24:47,265 INFO L290 TraceCheckUtils]: 12: Hoare triple {753#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {753#true} is VALID [2022-02-20 18:24:47,269 INFO L290 TraceCheckUtils]: 13: Hoare triple {753#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {753#true} is VALID [2022-02-20 18:24:47,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {753#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; {755#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} is VALID [2022-02-20 18:24:47,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {755#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} init_#res#1 := init_~tmp___5~0#1; {756#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 18:24:47,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {756#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; {757#(= |ULTIMATE.start_main_~i2~0#1| 0)} is VALID [2022-02-20 18:24:47,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {757#(= |ULTIMATE.start_main_~i2~0#1| 0)} assume !(0 == main_~i2~0#1); {754#false} is VALID [2022-02-20 18:24:47,272 INFO L290 TraceCheckUtils]: 18: Hoare triple {754#false} ~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; {754#false} is VALID [2022-02-20 18:24:47,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {754#false} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {754#false} is VALID [2022-02-20 18:24:47,272 INFO L290 TraceCheckUtils]: 20: Hoare triple {754#false} assume !(0 != ~mode1~0 % 256); {754#false} is VALID [2022-02-20 18:24:47,272 INFO L290 TraceCheckUtils]: 21: Hoare triple {754#false} assume !(~r1~0 < 2); {754#false} is VALID [2022-02-20 18:24:47,273 INFO L290 TraceCheckUtils]: 22: Hoare triple {754#false} ~mode1~0 := 1; {754#false} is VALID [2022-02-20 18:24:47,273 INFO L290 TraceCheckUtils]: 23: Hoare triple {754#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {754#false} is VALID [2022-02-20 18:24:47,273 INFO L290 TraceCheckUtils]: 24: Hoare triple {754#false} assume !(0 != ~mode2~0 % 256); {754#false} is VALID [2022-02-20 18:24:47,273 INFO L290 TraceCheckUtils]: 25: Hoare triple {754#false} assume !(~r2~0 < 2); {754#false} is VALID [2022-02-20 18:24:47,274 INFO L290 TraceCheckUtils]: 26: Hoare triple {754#false} ~mode2~0 := 1; {754#false} is VALID [2022-02-20 18:24:47,274 INFO L290 TraceCheckUtils]: 27: Hoare triple {754#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {754#false} is VALID [2022-02-20 18:24:47,274 INFO L290 TraceCheckUtils]: 28: Hoare triple {754#false} assume !(0 != ~mode3~0 % 256); {754#false} is VALID [2022-02-20 18:24:47,274 INFO L290 TraceCheckUtils]: 29: Hoare triple {754#false} assume !(~r3~0 < 2); {754#false} is VALID [2022-02-20 18:24:47,275 INFO L290 TraceCheckUtils]: 30: Hoare triple {754#false} ~mode3~0 := 1; {754#false} is VALID [2022-02-20 18:24:47,275 INFO L290 TraceCheckUtils]: 31: Hoare triple {754#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; {754#false} is VALID [2022-02-20 18:24:47,275 INFO L290 TraceCheckUtils]: 32: Hoare triple {754#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {754#false} is VALID [2022-02-20 18:24:47,275 INFO L290 TraceCheckUtils]: 33: Hoare triple {754#false} check_#res#1 := check_~tmp~1#1; {754#false} is VALID [2022-02-20 18:24:47,276 INFO L290 TraceCheckUtils]: 34: Hoare triple {754#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#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; {754#false} is VALID [2022-02-20 18:24:47,276 INFO L290 TraceCheckUtils]: 35: Hoare triple {754#false} assume 0 == assert_~arg#1 % 256; {754#false} is VALID [2022-02-20 18:24:47,276 INFO L290 TraceCheckUtils]: 36: Hoare triple {754#false} assume !false; {754#false} is VALID [2022-02-20 18:24:47,277 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:24:47,277 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:47,278 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567461851] [2022-02-20 18:24:47,278 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567461851] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:47,278 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:47,279 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:24:47,279 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619201974] [2022-02-20 18:24:47,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:47,281 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:24:47,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:47,283 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:24:47,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:24:47,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:24:47,322 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:47,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:24:47,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:24:47,323 INFO L87 Difference]: Start difference. First operand 127 states and 220 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:24:47,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:47,837 INFO L93 Difference]: Finished difference Result 271 states and 460 transitions. [2022-02-20 18:24:47,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:24:47,838 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:24:47,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:47,838 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:24:47,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 460 transitions. [2022-02-20 18:24:47,844 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:24:47,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 460 transitions. [2022-02-20 18:24:47,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 460 transitions. [2022-02-20 18:24:48,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 460 edges. 460 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:48,198 INFO L225 Difference]: With dead ends: 271 [2022-02-20 18:24:48,198 INFO L226 Difference]: Without dead ends: 197 [2022-02-20 18:24:48,199 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:24:48,200 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 120 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:24:48,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 832 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:48,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-02-20 18:24:48,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 127. [2022-02-20 18:24:48,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:48,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand has 127 states, 126 states have (on average 1.5317460317460319) internal successors, (193), 126 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:48,223 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand has 127 states, 126 states have (on average 1.5317460317460319) internal successors, (193), 126 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:48,223 INFO L87 Difference]: Start difference. First operand 197 states. Second operand has 127 states, 126 states have (on average 1.5317460317460319) internal successors, (193), 126 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:48,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:48,234 INFO L93 Difference]: Finished difference Result 197 states and 311 transitions. [2022-02-20 18:24:48,234 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 311 transitions. [2022-02-20 18:24:48,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:48,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:48,241 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 126 states have (on average 1.5317460317460319) internal successors, (193), 126 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 197 states. [2022-02-20 18:24:48,241 INFO L87 Difference]: Start difference. First operand has 127 states, 126 states have (on average 1.5317460317460319) internal successors, (193), 126 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 197 states. [2022-02-20 18:24:48,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:48,251 INFO L93 Difference]: Finished difference Result 197 states and 311 transitions. [2022-02-20 18:24:48,252 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 311 transitions. [2022-02-20 18:24:48,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:48,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:48,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:48,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:48,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.5317460317460319) internal successors, (193), 126 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:48,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 193 transitions. [2022-02-20 18:24:48,259 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 193 transitions. Word has length 37 [2022-02-20 18:24:48,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:48,260 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 193 transitions. [2022-02-20 18:24:48,260 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:24:48,261 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 193 transitions. [2022-02-20 18:24:48,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:24:48,265 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:48,267 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] [2022-02-20 18:24:48,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:24:48,268 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:48,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:48,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1313145683, now seen corresponding path program 1 times [2022-02-20 18:24:48,270 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:48,270 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995408577] [2022-02-20 18:24:48,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:48,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:48,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {1591#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(37, 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;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {1591#true} is VALID [2022-02-20 18:24:48,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {1591#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~ret37#1, main_#t~ret38#1, main_#t~post39#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;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~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;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#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; {1591#true} is VALID [2022-02-20 18:24:48,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {1591#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {1591#true} is VALID [2022-02-20 18:24:48,403 INFO L290 TraceCheckUtils]: 3: Hoare triple {1591#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {1591#true} is VALID [2022-02-20 18:24:48,404 INFO L290 TraceCheckUtils]: 4: Hoare triple {1591#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {1591#true} is VALID [2022-02-20 18:24:48,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {1591#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {1591#true} is VALID [2022-02-20 18:24:48,404 INFO L290 TraceCheckUtils]: 6: Hoare triple {1591#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {1591#true} is VALID [2022-02-20 18:24:48,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {1591#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {1591#true} is VALID [2022-02-20 18:24:48,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {1591#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {1591#true} is VALID [2022-02-20 18:24:48,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {1591#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {1591#true} is VALID [2022-02-20 18:24:48,405 INFO L290 TraceCheckUtils]: 10: Hoare triple {1591#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {1591#true} is VALID [2022-02-20 18:24:48,405 INFO L290 TraceCheckUtils]: 11: Hoare triple {1591#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {1591#true} is VALID [2022-02-20 18:24:48,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {1591#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {1591#true} is VALID [2022-02-20 18:24:48,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {1591#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {1591#true} is VALID [2022-02-20 18:24:48,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {1591#true} assume ~id1~0 != ~id2~0; {1591#true} is VALID [2022-02-20 18:24:48,406 INFO L290 TraceCheckUtils]: 15: Hoare triple {1591#true} assume ~id1~0 != ~id3~0; {1591#true} is VALID [2022-02-20 18:24:48,407 INFO L290 TraceCheckUtils]: 16: Hoare triple {1591#true} assume ~id2~0 != ~id3~0; {1591#true} is VALID [2022-02-20 18:24:48,407 INFO L290 TraceCheckUtils]: 17: Hoare triple {1591#true} assume ~id1~0 >= 0; {1591#true} is VALID [2022-02-20 18:24:48,407 INFO L290 TraceCheckUtils]: 18: Hoare triple {1591#true} assume ~id2~0 >= 0; {1591#true} is VALID [2022-02-20 18:24:48,407 INFO L290 TraceCheckUtils]: 19: Hoare triple {1591#true} assume ~id3~0 >= 0; {1591#true} is VALID [2022-02-20 18:24:48,408 INFO L290 TraceCheckUtils]: 20: Hoare triple {1591#true} assume 0 == ~r1~0; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:48,408 INFO L290 TraceCheckUtils]: 21: Hoare triple {1593#(<= ~r1~0 0)} assume 0 == ~r2~0; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:48,409 INFO L290 TraceCheckUtils]: 22: Hoare triple {1593#(<= ~r1~0 0)} assume 0 == ~r3~0; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:48,409 INFO L290 TraceCheckUtils]: 23: Hoare triple {1593#(<= ~r1~0 0)} assume 0 != init_~r122~0#1 % 256; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:48,410 INFO L290 TraceCheckUtils]: 24: Hoare triple {1593#(<= ~r1~0 0)} assume 0 != init_~r132~0#1 % 256; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:48,410 INFO L290 TraceCheckUtils]: 25: Hoare triple {1593#(<= ~r1~0 0)} assume 0 != init_~r212~0#1 % 256; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:48,411 INFO L290 TraceCheckUtils]: 26: Hoare triple {1593#(<= ~r1~0 0)} assume 0 != init_~r232~0#1 % 256; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:48,411 INFO L290 TraceCheckUtils]: 27: Hoare triple {1593#(<= ~r1~0 0)} assume 0 != init_~r312~0#1 % 256; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:48,412 INFO L290 TraceCheckUtils]: 28: Hoare triple {1593#(<= ~r1~0 0)} assume 0 != init_~r322~0#1 % 256; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:48,412 INFO L290 TraceCheckUtils]: 29: Hoare triple {1593#(<= ~r1~0 0)} assume ~max1~0 == ~id1~0; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:48,413 INFO L290 TraceCheckUtils]: 30: Hoare triple {1593#(<= ~r1~0 0)} assume ~max2~0 == ~id2~0; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:48,413 INFO L290 TraceCheckUtils]: 31: Hoare triple {1593#(<= ~r1~0 0)} assume ~max3~0 == ~id3~0; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:48,414 INFO L290 TraceCheckUtils]: 32: Hoare triple {1593#(<= ~r1~0 0)} assume 0 == ~st1~0; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:48,414 INFO L290 TraceCheckUtils]: 33: Hoare triple {1593#(<= ~r1~0 0)} assume 0 == ~st2~0; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:48,415 INFO L290 TraceCheckUtils]: 34: Hoare triple {1593#(<= ~r1~0 0)} assume 0 == ~st3~0; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:48,415 INFO L290 TraceCheckUtils]: 35: Hoare triple {1593#(<= ~r1~0 0)} assume 0 == ~nl1~0; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:48,416 INFO L290 TraceCheckUtils]: 36: Hoare triple {1593#(<= ~r1~0 0)} assume 0 == ~nl2~0; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:48,416 INFO L290 TraceCheckUtils]: 37: Hoare triple {1593#(<= ~r1~0 0)} assume 0 == ~nl3~0; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:48,417 INFO L290 TraceCheckUtils]: 38: Hoare triple {1593#(<= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:48,417 INFO L290 TraceCheckUtils]: 39: Hoare triple {1593#(<= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:48,418 INFO L290 TraceCheckUtils]: 40: Hoare triple {1593#(<= ~r1~0 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:48,418 INFO L290 TraceCheckUtils]: 41: Hoare triple {1593#(<= ~r1~0 0)} init_#res#1 := init_~tmp___5~0#1; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:48,418 INFO L290 TraceCheckUtils]: 42: Hoare triple {1593#(<= ~r1~0 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:48,419 INFO L290 TraceCheckUtils]: 43: Hoare triple {1593#(<= ~r1~0 0)} assume !(0 == main_~i2~0#1); {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:48,419 INFO L290 TraceCheckUtils]: 44: Hoare triple {1593#(<= ~r1~0 0)} ~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; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:48,420 INFO L290 TraceCheckUtils]: 45: Hoare triple {1593#(<= ~r1~0 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:48,420 INFO L290 TraceCheckUtils]: 46: Hoare triple {1593#(<= ~r1~0 0)} assume !(0 != ~mode1~0 % 256); {1593#(<= ~r1~0 0)} is VALID [2022-02-20 18:24:48,421 INFO L290 TraceCheckUtils]: 47: Hoare triple {1593#(<= ~r1~0 0)} assume !(~r1~0 < 2); {1592#false} is VALID [2022-02-20 18:24:48,421 INFO L290 TraceCheckUtils]: 48: Hoare triple {1592#false} ~mode1~0 := 1; {1592#false} is VALID [2022-02-20 18:24:48,421 INFO L290 TraceCheckUtils]: 49: Hoare triple {1592#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {1592#false} is VALID [2022-02-20 18:24:48,422 INFO L290 TraceCheckUtils]: 50: Hoare triple {1592#false} assume !(0 != ~mode2~0 % 256); {1592#false} is VALID [2022-02-20 18:24:48,422 INFO L290 TraceCheckUtils]: 51: Hoare triple {1592#false} assume !(~r2~0 < 2); {1592#false} is VALID [2022-02-20 18:24:48,422 INFO L290 TraceCheckUtils]: 52: Hoare triple {1592#false} ~mode2~0 := 1; {1592#false} is VALID [2022-02-20 18:24:48,422 INFO L290 TraceCheckUtils]: 53: Hoare triple {1592#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {1592#false} is VALID [2022-02-20 18:24:48,423 INFO L290 TraceCheckUtils]: 54: Hoare triple {1592#false} assume !(0 != ~mode3~0 % 256); {1592#false} is VALID [2022-02-20 18:24:48,423 INFO L290 TraceCheckUtils]: 55: Hoare triple {1592#false} assume !(~r3~0 < 2); {1592#false} is VALID [2022-02-20 18:24:48,423 INFO L290 TraceCheckUtils]: 56: Hoare triple {1592#false} ~mode3~0 := 1; {1592#false} is VALID [2022-02-20 18:24:48,423 INFO L290 TraceCheckUtils]: 57: Hoare triple {1592#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; {1592#false} is VALID [2022-02-20 18:24:48,424 INFO L290 TraceCheckUtils]: 58: Hoare triple {1592#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {1592#false} is VALID [2022-02-20 18:24:48,424 INFO L290 TraceCheckUtils]: 59: Hoare triple {1592#false} check_#res#1 := check_~tmp~1#1; {1592#false} is VALID [2022-02-20 18:24:48,424 INFO L290 TraceCheckUtils]: 60: Hoare triple {1592#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#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; {1592#false} is VALID [2022-02-20 18:24:48,424 INFO L290 TraceCheckUtils]: 61: Hoare triple {1592#false} assume 0 == assert_~arg#1 % 256; {1592#false} is VALID [2022-02-20 18:24:48,425 INFO L290 TraceCheckUtils]: 62: Hoare triple {1592#false} assume !false; {1592#false} is VALID [2022-02-20 18:24:48,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:24:48,425 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:48,426 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995408577] [2022-02-20 18:24:48,426 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995408577] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:48,426 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:48,426 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:24:48,426 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861036854] [2022-02-20 18:24:48,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:48,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-02-20 18:24:48,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:48,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:48,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:48,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:24:48,479 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:48,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:24:48,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:48,480 INFO L87 Difference]: Start difference. First operand 127 states and 193 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:48,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:48,719 INFO L93 Difference]: Finished difference Result 258 states and 412 transitions. [2022-02-20 18:24:48,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:24:48,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-02-20 18:24:48,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:48,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:48,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2022-02-20 18:24:48,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:48,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2022-02-20 18:24:48,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 412 transitions. [2022-02-20 18:24:49,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 412 edges. 412 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:49,024 INFO L225 Difference]: With dead ends: 258 [2022-02-20 18:24:49,024 INFO L226 Difference]: Without dead ends: 188 [2022-02-20 18:24:49,024 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:24:49,026 INFO L933 BasicCegarLoop]: 268 mSDtfsCounter, 93 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:24:49,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 421 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:49,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-02-20 18:24:49,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2022-02-20 18:24:49,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:49,041 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand has 186 states, 185 states have (on average 1.5567567567567568) internal successors, (288), 185 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have 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:24:49,041 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand has 186 states, 185 states have (on average 1.5567567567567568) internal successors, (288), 185 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have 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:24:49,042 INFO L87 Difference]: Start difference. First operand 188 states. Second operand has 186 states, 185 states have (on average 1.5567567567567568) internal successors, (288), 185 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have 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:24:49,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:49,047 INFO L93 Difference]: Finished difference Result 188 states and 289 transitions. [2022-02-20 18:24:49,047 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 289 transitions. [2022-02-20 18:24:49,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:49,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:49,048 INFO L74 IsIncluded]: Start isIncluded. First operand has 186 states, 185 states have (on average 1.5567567567567568) internal successors, (288), 185 states have internal predecessors, (288), 0 states have call successors, (0), 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 188 states. [2022-02-20 18:24:49,049 INFO L87 Difference]: Start difference. First operand has 186 states, 185 states have (on average 1.5567567567567568) internal successors, (288), 185 states have internal predecessors, (288), 0 states have call successors, (0), 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 188 states. [2022-02-20 18:24:49,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:49,054 INFO L93 Difference]: Finished difference Result 188 states and 289 transitions. [2022-02-20 18:24:49,054 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 289 transitions. [2022-02-20 18:24:49,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:49,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:49,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:49,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:49,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.5567567567567568) internal successors, (288), 185 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have 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:24:49,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 288 transitions. [2022-02-20 18:24:49,060 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 288 transitions. Word has length 63 [2022-02-20 18:24:49,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:49,061 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 288 transitions. [2022-02-20 18:24:49,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:49,061 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 288 transitions. [2022-02-20 18:24:49,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:24:49,062 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:49,062 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] [2022-02-20 18:24:49,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:24:49,063 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:49,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:49,063 INFO L85 PathProgramCache]: Analyzing trace with hash -255493166, now seen corresponding path program 1 times [2022-02-20 18:24:49,063 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:49,064 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330855153] [2022-02-20 18:24:49,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:49,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:49,201 INFO L290 TraceCheckUtils]: 0: Hoare triple {2458#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(37, 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;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {2458#true} is VALID [2022-02-20 18:24:49,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {2458#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~ret37#1, main_#t~ret38#1, main_#t~post39#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;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~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;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#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; {2458#true} is VALID [2022-02-20 18:24:49,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {2458#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {2458#true} is VALID [2022-02-20 18:24:49,202 INFO L290 TraceCheckUtils]: 3: Hoare triple {2458#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {2458#true} is VALID [2022-02-20 18:24:49,203 INFO L290 TraceCheckUtils]: 4: Hoare triple {2458#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {2458#true} is VALID [2022-02-20 18:24:49,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {2458#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {2458#true} is VALID [2022-02-20 18:24:49,208 INFO L290 TraceCheckUtils]: 6: Hoare triple {2458#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {2458#true} is VALID [2022-02-20 18:24:49,208 INFO L290 TraceCheckUtils]: 7: Hoare triple {2458#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {2458#true} is VALID [2022-02-20 18:24:49,208 INFO L290 TraceCheckUtils]: 8: Hoare triple {2458#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {2458#true} is VALID [2022-02-20 18:24:49,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {2458#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {2458#true} is VALID [2022-02-20 18:24:49,209 INFO L290 TraceCheckUtils]: 10: Hoare triple {2458#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {2458#true} is VALID [2022-02-20 18:24:49,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {2458#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {2458#true} is VALID [2022-02-20 18:24:49,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {2458#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {2458#true} is VALID [2022-02-20 18:24:49,209 INFO L290 TraceCheckUtils]: 13: Hoare triple {2458#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {2458#true} is VALID [2022-02-20 18:24:49,209 INFO L290 TraceCheckUtils]: 14: Hoare triple {2458#true} assume ~id1~0 != ~id2~0; {2458#true} is VALID [2022-02-20 18:24:49,209 INFO L290 TraceCheckUtils]: 15: Hoare triple {2458#true} assume ~id1~0 != ~id3~0; {2458#true} is VALID [2022-02-20 18:24:49,210 INFO L290 TraceCheckUtils]: 16: Hoare triple {2458#true} assume ~id2~0 != ~id3~0; {2458#true} is VALID [2022-02-20 18:24:49,210 INFO L290 TraceCheckUtils]: 17: Hoare triple {2458#true} assume ~id1~0 >= 0; {2458#true} is VALID [2022-02-20 18:24:49,210 INFO L290 TraceCheckUtils]: 18: Hoare triple {2458#true} assume ~id2~0 >= 0; {2458#true} is VALID [2022-02-20 18:24:49,210 INFO L290 TraceCheckUtils]: 19: Hoare triple {2458#true} assume ~id3~0 >= 0; {2458#true} is VALID [2022-02-20 18:24:49,210 INFO L290 TraceCheckUtils]: 20: Hoare triple {2458#true} assume 0 == ~r1~0; {2458#true} is VALID [2022-02-20 18:24:49,211 INFO L290 TraceCheckUtils]: 21: Hoare triple {2458#true} assume 0 == ~r2~0; {2458#true} is VALID [2022-02-20 18:24:49,211 INFO L290 TraceCheckUtils]: 22: Hoare triple {2458#true} assume 0 == ~r3~0; {2458#true} is VALID [2022-02-20 18:24:49,211 INFO L290 TraceCheckUtils]: 23: Hoare triple {2458#true} assume 0 != init_~r122~0#1 % 256; {2458#true} is VALID [2022-02-20 18:24:49,211 INFO L290 TraceCheckUtils]: 24: Hoare triple {2458#true} assume 0 != init_~r132~0#1 % 256; {2458#true} is VALID [2022-02-20 18:24:49,211 INFO L290 TraceCheckUtils]: 25: Hoare triple {2458#true} assume 0 != init_~r212~0#1 % 256; {2458#true} is VALID [2022-02-20 18:24:49,211 INFO L290 TraceCheckUtils]: 26: Hoare triple {2458#true} assume 0 != init_~r232~0#1 % 256; {2458#true} is VALID [2022-02-20 18:24:49,212 INFO L290 TraceCheckUtils]: 27: Hoare triple {2458#true} assume 0 != init_~r312~0#1 % 256; {2458#true} is VALID [2022-02-20 18:24:49,212 INFO L290 TraceCheckUtils]: 28: Hoare triple {2458#true} assume 0 != init_~r322~0#1 % 256; {2458#true} is VALID [2022-02-20 18:24:49,212 INFO L290 TraceCheckUtils]: 29: Hoare triple {2458#true} assume ~max1~0 == ~id1~0; {2458#true} is VALID [2022-02-20 18:24:49,212 INFO L290 TraceCheckUtils]: 30: Hoare triple {2458#true} assume ~max2~0 == ~id2~0; {2458#true} is VALID [2022-02-20 18:24:49,212 INFO L290 TraceCheckUtils]: 31: Hoare triple {2458#true} assume ~max3~0 == ~id3~0; {2458#true} is VALID [2022-02-20 18:24:49,212 INFO L290 TraceCheckUtils]: 32: Hoare triple {2458#true} assume 0 == ~st1~0; {2458#true} is VALID [2022-02-20 18:24:49,213 INFO L290 TraceCheckUtils]: 33: Hoare triple {2458#true} assume 0 == ~st2~0; {2458#true} is VALID [2022-02-20 18:24:49,213 INFO L290 TraceCheckUtils]: 34: Hoare triple {2458#true} assume 0 == ~st3~0; {2458#true} is VALID [2022-02-20 18:24:49,213 INFO L290 TraceCheckUtils]: 35: Hoare triple {2458#true} assume 0 == ~nl1~0; {2458#true} is VALID [2022-02-20 18:24:49,213 INFO L290 TraceCheckUtils]: 36: Hoare triple {2458#true} assume 0 == ~nl2~0; {2458#true} is VALID [2022-02-20 18:24:49,213 INFO L290 TraceCheckUtils]: 37: Hoare triple {2458#true} assume 0 == ~nl3~0; {2458#true} is VALID [2022-02-20 18:24:49,214 INFO L290 TraceCheckUtils]: 38: Hoare triple {2458#true} assume 0 == ~mode1~0 % 256; {2460#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:24:49,215 INFO L290 TraceCheckUtils]: 39: Hoare triple {2460#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {2460#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:24:49,215 INFO L290 TraceCheckUtils]: 40: Hoare triple {2460#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {2460#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:24:49,217 INFO L290 TraceCheckUtils]: 41: Hoare triple {2460#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {2460#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:24:49,218 INFO L290 TraceCheckUtils]: 42: Hoare triple {2460#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; {2460#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:24:49,218 INFO L290 TraceCheckUtils]: 43: Hoare triple {2460#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == main_~i2~0#1); {2460#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:24:49,219 INFO L290 TraceCheckUtils]: 44: Hoare triple {2460#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} ~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; {2460#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:24:49,219 INFO L290 TraceCheckUtils]: 45: Hoare triple {2460#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {2460#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:24:49,220 INFO L290 TraceCheckUtils]: 46: Hoare triple {2460#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); {2459#false} is VALID [2022-02-20 18:24:49,220 INFO L290 TraceCheckUtils]: 47: Hoare triple {2459#false} assume !(0 != ~ep21~0 % 256); {2459#false} is VALID [2022-02-20 18:24:49,220 INFO L290 TraceCheckUtils]: 48: Hoare triple {2459#false} assume !(0 != ~ep31~0 % 256); {2459#false} is VALID [2022-02-20 18:24:49,221 INFO L290 TraceCheckUtils]: 49: Hoare triple {2459#false} assume !(2 == ~r1~0); {2459#false} is VALID [2022-02-20 18:24:49,221 INFO L290 TraceCheckUtils]: 50: Hoare triple {2459#false} ~mode1~0 := 0; {2459#false} is VALID [2022-02-20 18:24:49,221 INFO L290 TraceCheckUtils]: 51: Hoare triple {2459#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {2459#false} is VALID [2022-02-20 18:24:49,221 INFO L290 TraceCheckUtils]: 52: Hoare triple {2459#false} assume !(0 != ~mode2~0 % 256); {2459#false} is VALID [2022-02-20 18:24:49,221 INFO L290 TraceCheckUtils]: 53: Hoare triple {2459#false} assume !(~r2~0 < 2); {2459#false} is VALID [2022-02-20 18:24:49,221 INFO L290 TraceCheckUtils]: 54: Hoare triple {2459#false} ~mode2~0 := 1; {2459#false} is VALID [2022-02-20 18:24:49,222 INFO L290 TraceCheckUtils]: 55: Hoare triple {2459#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {2459#false} is VALID [2022-02-20 18:24:49,222 INFO L290 TraceCheckUtils]: 56: Hoare triple {2459#false} assume !(0 != ~mode3~0 % 256); {2459#false} is VALID [2022-02-20 18:24:49,222 INFO L290 TraceCheckUtils]: 57: Hoare triple {2459#false} assume !(~r3~0 < 2); {2459#false} is VALID [2022-02-20 18:24:49,223 INFO L290 TraceCheckUtils]: 58: Hoare triple {2459#false} ~mode3~0 := 1; {2459#false} is VALID [2022-02-20 18:24:49,223 INFO L290 TraceCheckUtils]: 59: Hoare triple {2459#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; {2459#false} is VALID [2022-02-20 18:24:49,223 INFO L290 TraceCheckUtils]: 60: Hoare triple {2459#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {2459#false} is VALID [2022-02-20 18:24:49,223 INFO L290 TraceCheckUtils]: 61: Hoare triple {2459#false} check_#res#1 := check_~tmp~1#1; {2459#false} is VALID [2022-02-20 18:24:49,223 INFO L290 TraceCheckUtils]: 62: Hoare triple {2459#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#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; {2459#false} is VALID [2022-02-20 18:24:49,224 INFO L290 TraceCheckUtils]: 63: Hoare triple {2459#false} assume 0 == assert_~arg#1 % 256; {2459#false} is VALID [2022-02-20 18:24:49,224 INFO L290 TraceCheckUtils]: 64: Hoare triple {2459#false} assume !false; {2459#false} is VALID [2022-02-20 18:24:49,225 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:24:49,226 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:49,226 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330855153] [2022-02-20 18:24:49,226 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330855153] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:49,226 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:49,226 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:24:49,227 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234810921] [2022-02-20 18:24:49,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:49,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-02-20 18:24:49,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:49,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:24:49,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:49,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:24:49,281 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:49,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:24:49,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:49,282 INFO L87 Difference]: Start difference. First operand 186 states and 288 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:24:49,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:49,559 INFO L93 Difference]: Finished difference Result 313 states and 501 transitions. [2022-02-20 18:24:49,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:24:49,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-02-20 18:24:49,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:49,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:24:49,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2022-02-20 18:24:49,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:24:49,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2022-02-20 18:24:49,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 403 transitions. [2022-02-20 18:24:49,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 403 edges. 403 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:49,860 INFO L225 Difference]: With dead ends: 313 [2022-02-20 18:24:49,860 INFO L226 Difference]: Without dead ends: 243 [2022-02-20 18:24:49,861 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:24:49,862 INFO L933 BasicCegarLoop]: 273 mSDtfsCounter, 102 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 441 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:24:49,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 441 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:49,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-02-20 18:24:49,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2022-02-20 18:24:49,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:49,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 243 states. Second operand has 241 states, 240 states have (on average 1.5833333333333333) internal successors, (380), 240 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have 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:24:49,889 INFO L74 IsIncluded]: Start isIncluded. First operand 243 states. Second operand has 241 states, 240 states have (on average 1.5833333333333333) internal successors, (380), 240 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have 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:24:49,889 INFO L87 Difference]: Start difference. First operand 243 states. Second operand has 241 states, 240 states have (on average 1.5833333333333333) internal successors, (380), 240 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have 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:24:49,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:49,896 INFO L93 Difference]: Finished difference Result 243 states and 381 transitions. [2022-02-20 18:24:49,897 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 381 transitions. [2022-02-20 18:24:49,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:49,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:49,898 INFO L74 IsIncluded]: Start isIncluded. First operand has 241 states, 240 states have (on average 1.5833333333333333) internal successors, (380), 240 states have internal predecessors, (380), 0 states have call successors, (0), 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 243 states. [2022-02-20 18:24:49,898 INFO L87 Difference]: Start difference. First operand has 241 states, 240 states have (on average 1.5833333333333333) internal successors, (380), 240 states have internal predecessors, (380), 0 states have call successors, (0), 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 243 states. [2022-02-20 18:24:49,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:49,909 INFO L93 Difference]: Finished difference Result 243 states and 381 transitions. [2022-02-20 18:24:49,909 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 381 transitions. [2022-02-20 18:24:49,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:49,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:49,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:49,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:49,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 1.5833333333333333) internal successors, (380), 240 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have 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:24:49,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 380 transitions. [2022-02-20 18:24:49,918 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 380 transitions. Word has length 65 [2022-02-20 18:24:49,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:49,918 INFO L470 AbstractCegarLoop]: Abstraction has 241 states and 380 transitions. [2022-02-20 18:24:49,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:24:49,919 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 380 transitions. [2022-02-20 18:24:49,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:24:49,919 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:49,919 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] [2022-02-20 18:24:49,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:24:49,920 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:49,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:49,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1395779292, now seen corresponding path program 1 times [2022-02-20 18:24:49,921 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:49,921 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599953933] [2022-02-20 18:24:49,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:49,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:49,983 INFO L290 TraceCheckUtils]: 0: Hoare triple {3563#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(37, 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;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {3563#true} is VALID [2022-02-20 18:24:49,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {3563#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~ret37#1, main_#t~ret38#1, main_#t~post39#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;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~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;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#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; {3563#true} is VALID [2022-02-20 18:24:49,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {3563#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {3563#true} is VALID [2022-02-20 18:24:49,984 INFO L290 TraceCheckUtils]: 3: Hoare triple {3563#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {3563#true} is VALID [2022-02-20 18:24:49,984 INFO L290 TraceCheckUtils]: 4: Hoare triple {3563#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {3563#true} is VALID [2022-02-20 18:24:49,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {3563#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {3563#true} is VALID [2022-02-20 18:24:49,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {3563#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {3563#true} is VALID [2022-02-20 18:24:49,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {3563#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {3563#true} is VALID [2022-02-20 18:24:49,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {3563#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {3563#true} is VALID [2022-02-20 18:24:49,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {3563#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {3563#true} is VALID [2022-02-20 18:24:49,985 INFO L290 TraceCheckUtils]: 10: Hoare triple {3563#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {3563#true} is VALID [2022-02-20 18:24:49,985 INFO L290 TraceCheckUtils]: 11: Hoare triple {3563#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {3563#true} is VALID [2022-02-20 18:24:49,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {3563#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {3563#true} is VALID [2022-02-20 18:24:49,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {3563#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {3563#true} is VALID [2022-02-20 18:24:49,986 INFO L290 TraceCheckUtils]: 14: Hoare triple {3563#true} assume ~id1~0 != ~id2~0; {3563#true} is VALID [2022-02-20 18:24:49,986 INFO L290 TraceCheckUtils]: 15: Hoare triple {3563#true} assume ~id1~0 != ~id3~0; {3563#true} is VALID [2022-02-20 18:24:49,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {3563#true} assume ~id2~0 != ~id3~0; {3563#true} is VALID [2022-02-20 18:24:49,986 INFO L290 TraceCheckUtils]: 17: Hoare triple {3563#true} assume ~id1~0 >= 0; {3563#true} is VALID [2022-02-20 18:24:49,986 INFO L290 TraceCheckUtils]: 18: Hoare triple {3563#true} assume ~id2~0 >= 0; {3563#true} is VALID [2022-02-20 18:24:49,986 INFO L290 TraceCheckUtils]: 19: Hoare triple {3563#true} assume ~id3~0 >= 0; {3563#true} is VALID [2022-02-20 18:24:49,987 INFO L290 TraceCheckUtils]: 20: Hoare triple {3563#true} assume 0 == ~r1~0; {3563#true} is VALID [2022-02-20 18:24:49,987 INFO L290 TraceCheckUtils]: 21: Hoare triple {3563#true} assume 0 == ~r2~0; {3565#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:49,987 INFO L290 TraceCheckUtils]: 22: Hoare triple {3565#(<= ~r2~0 0)} assume 0 == ~r3~0; {3565#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:49,988 INFO L290 TraceCheckUtils]: 23: Hoare triple {3565#(<= ~r2~0 0)} assume 0 != init_~r122~0#1 % 256; {3565#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:49,988 INFO L290 TraceCheckUtils]: 24: Hoare triple {3565#(<= ~r2~0 0)} assume 0 != init_~r132~0#1 % 256; {3565#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:49,989 INFO L290 TraceCheckUtils]: 25: Hoare triple {3565#(<= ~r2~0 0)} assume 0 != init_~r212~0#1 % 256; {3565#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:49,989 INFO L290 TraceCheckUtils]: 26: Hoare triple {3565#(<= ~r2~0 0)} assume 0 != init_~r232~0#1 % 256; {3565#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:49,989 INFO L290 TraceCheckUtils]: 27: Hoare triple {3565#(<= ~r2~0 0)} assume 0 != init_~r312~0#1 % 256; {3565#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:49,990 INFO L290 TraceCheckUtils]: 28: Hoare triple {3565#(<= ~r2~0 0)} assume 0 != init_~r322~0#1 % 256; {3565#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:49,990 INFO L290 TraceCheckUtils]: 29: Hoare triple {3565#(<= ~r2~0 0)} assume ~max1~0 == ~id1~0; {3565#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:49,990 INFO L290 TraceCheckUtils]: 30: Hoare triple {3565#(<= ~r2~0 0)} assume ~max2~0 == ~id2~0; {3565#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:49,991 INFO L290 TraceCheckUtils]: 31: Hoare triple {3565#(<= ~r2~0 0)} assume ~max3~0 == ~id3~0; {3565#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:49,991 INFO L290 TraceCheckUtils]: 32: Hoare triple {3565#(<= ~r2~0 0)} assume 0 == ~st1~0; {3565#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:49,991 INFO L290 TraceCheckUtils]: 33: Hoare triple {3565#(<= ~r2~0 0)} assume 0 == ~st2~0; {3565#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:49,992 INFO L290 TraceCheckUtils]: 34: Hoare triple {3565#(<= ~r2~0 0)} assume 0 == ~st3~0; {3565#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:49,992 INFO L290 TraceCheckUtils]: 35: Hoare triple {3565#(<= ~r2~0 0)} assume 0 == ~nl1~0; {3565#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:49,992 INFO L290 TraceCheckUtils]: 36: Hoare triple {3565#(<= ~r2~0 0)} assume 0 == ~nl2~0; {3565#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:49,993 INFO L290 TraceCheckUtils]: 37: Hoare triple {3565#(<= ~r2~0 0)} assume 0 == ~nl3~0; {3565#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:49,993 INFO L290 TraceCheckUtils]: 38: Hoare triple {3565#(<= ~r2~0 0)} assume 0 == ~mode1~0 % 256; {3565#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:49,993 INFO L290 TraceCheckUtils]: 39: Hoare triple {3565#(<= ~r2~0 0)} assume 0 == ~mode2~0 % 256; {3565#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:49,994 INFO L290 TraceCheckUtils]: 40: Hoare triple {3565#(<= ~r2~0 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {3565#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:49,994 INFO L290 TraceCheckUtils]: 41: Hoare triple {3565#(<= ~r2~0 0)} init_#res#1 := init_~tmp___5~0#1; {3565#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:49,994 INFO L290 TraceCheckUtils]: 42: Hoare triple {3565#(<= ~r2~0 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; {3565#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:49,995 INFO L290 TraceCheckUtils]: 43: Hoare triple {3565#(<= ~r2~0 0)} assume !(0 == main_~i2~0#1); {3565#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:49,995 INFO L290 TraceCheckUtils]: 44: Hoare triple {3565#(<= ~r2~0 0)} ~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; {3565#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:49,996 INFO L290 TraceCheckUtils]: 45: Hoare triple {3565#(<= ~r2~0 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {3565#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:49,996 INFO L290 TraceCheckUtils]: 46: Hoare triple {3565#(<= ~r2~0 0)} assume !(0 != ~mode1~0 % 256); {3565#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:49,996 INFO L290 TraceCheckUtils]: 47: Hoare triple {3565#(<= ~r2~0 0)} assume ~r1~0 < 2; {3565#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:49,997 INFO L290 TraceCheckUtils]: 48: Hoare triple {3565#(<= ~r2~0 0)} assume !(0 != ~ep12~0 % 256); {3565#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:49,997 INFO L290 TraceCheckUtils]: 49: Hoare triple {3565#(<= ~r2~0 0)} assume !(0 != ~ep13~0 % 256); {3565#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:49,997 INFO L290 TraceCheckUtils]: 50: Hoare triple {3565#(<= ~r2~0 0)} ~mode1~0 := 1; {3565#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:49,998 INFO L290 TraceCheckUtils]: 51: Hoare triple {3565#(<= ~r2~0 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {3565#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:49,998 INFO L290 TraceCheckUtils]: 52: Hoare triple {3565#(<= ~r2~0 0)} assume !(0 != ~mode2~0 % 256); {3565#(<= ~r2~0 0)} is VALID [2022-02-20 18:24:49,999 INFO L290 TraceCheckUtils]: 53: Hoare triple {3565#(<= ~r2~0 0)} assume !(~r2~0 < 2); {3564#false} is VALID [2022-02-20 18:24:49,999 INFO L290 TraceCheckUtils]: 54: Hoare triple {3564#false} ~mode2~0 := 1; {3564#false} is VALID [2022-02-20 18:24:49,999 INFO L290 TraceCheckUtils]: 55: Hoare triple {3564#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {3564#false} is VALID [2022-02-20 18:24:49,999 INFO L290 TraceCheckUtils]: 56: Hoare triple {3564#false} assume !(0 != ~mode3~0 % 256); {3564#false} is VALID [2022-02-20 18:24:49,999 INFO L290 TraceCheckUtils]: 57: Hoare triple {3564#false} assume !(~r3~0 < 2); {3564#false} is VALID [2022-02-20 18:24:49,999 INFO L290 TraceCheckUtils]: 58: Hoare triple {3564#false} ~mode3~0 := 1; {3564#false} is VALID [2022-02-20 18:24:50,000 INFO L290 TraceCheckUtils]: 59: Hoare triple {3564#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; {3564#false} is VALID [2022-02-20 18:24:50,000 INFO L290 TraceCheckUtils]: 60: Hoare triple {3564#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {3564#false} is VALID [2022-02-20 18:24:50,000 INFO L290 TraceCheckUtils]: 61: Hoare triple {3564#false} check_#res#1 := check_~tmp~1#1; {3564#false} is VALID [2022-02-20 18:24:50,000 INFO L290 TraceCheckUtils]: 62: Hoare triple {3564#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#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; {3564#false} is VALID [2022-02-20 18:24:50,000 INFO L290 TraceCheckUtils]: 63: Hoare triple {3564#false} assume 0 == assert_~arg#1 % 256; {3564#false} is VALID [2022-02-20 18:24:50,000 INFO L290 TraceCheckUtils]: 64: Hoare triple {3564#false} assume !false; {3564#false} is VALID [2022-02-20 18:24:50,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:24:50,001 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:50,001 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599953933] [2022-02-20 18:24:50,001 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599953933] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:50,001 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:50,002 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:24:50,002 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368957178] [2022-02-20 18:24:50,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:50,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-02-20 18:24:50,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:50,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:24:50,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:50,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:24:50,046 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:50,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:24:50,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:50,047 INFO L87 Difference]: Start difference. First operand 241 states and 380 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:24:50,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:50,314 INFO L93 Difference]: Finished difference Result 584 states and 947 transitions. [2022-02-20 18:24:50,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:24:50,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-02-20 18:24:50,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:50,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:24:50,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2022-02-20 18:24:50,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:24:50,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2022-02-20 18:24:50,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 416 transitions. [2022-02-20 18:24:50,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 416 edges. 416 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:50,617 INFO L225 Difference]: With dead ends: 584 [2022-02-20 18:24:50,617 INFO L226 Difference]: Without dead ends: 402 [2022-02-20 18:24:50,618 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:24:50,618 INFO L933 BasicCegarLoop]: 266 mSDtfsCounter, 95 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:24:50,619 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 428 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:50,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-02-20 18:24:50,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 400. [2022-02-20 18:24:50,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:50,655 INFO L82 GeneralOperation]: Start isEquivalent. First operand 402 states. Second operand has 400 states, 399 states have (on average 1.6040100250626566) internal successors, (640), 399 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have 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:24:50,656 INFO L74 IsIncluded]: Start isIncluded. First operand 402 states. Second operand has 400 states, 399 states have (on average 1.6040100250626566) internal successors, (640), 399 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have 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:24:50,657 INFO L87 Difference]: Start difference. First operand 402 states. Second operand has 400 states, 399 states have (on average 1.6040100250626566) internal successors, (640), 399 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have 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:24:50,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:50,667 INFO L93 Difference]: Finished difference Result 402 states and 641 transitions. [2022-02-20 18:24:50,667 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 641 transitions. [2022-02-20 18:24:50,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:50,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:50,669 INFO L74 IsIncluded]: Start isIncluded. First operand has 400 states, 399 states have (on average 1.6040100250626566) internal successors, (640), 399 states have internal predecessors, (640), 0 states have call successors, (0), 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 402 states. [2022-02-20 18:24:50,670 INFO L87 Difference]: Start difference. First operand has 400 states, 399 states have (on average 1.6040100250626566) internal successors, (640), 399 states have internal predecessors, (640), 0 states have call successors, (0), 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 402 states. [2022-02-20 18:24:50,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:50,680 INFO L93 Difference]: Finished difference Result 402 states and 641 transitions. [2022-02-20 18:24:50,680 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 641 transitions. [2022-02-20 18:24:50,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:50,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:50,681 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:50,681 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:50,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 1.6040100250626566) internal successors, (640), 399 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have 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:24:50,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 640 transitions. [2022-02-20 18:24:50,693 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 640 transitions. Word has length 65 [2022-02-20 18:24:50,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:50,693 INFO L470 AbstractCegarLoop]: Abstraction has 400 states and 640 transitions. [2022-02-20 18:24:50,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:24:50,694 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 640 transitions. [2022-02-20 18:24:50,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 18:24:50,694 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:50,694 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:24:50,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:24:50,695 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:50,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:50,695 INFO L85 PathProgramCache]: Analyzing trace with hash -812427391, now seen corresponding path program 1 times [2022-02-20 18:24:50,696 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:50,696 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183920127] [2022-02-20 18:24:50,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:50,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:50,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:50,769 INFO L290 TraceCheckUtils]: 0: Hoare triple {5480#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(37, 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;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {5480#true} is VALID [2022-02-20 18:24:50,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {5480#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~ret37#1, main_#t~ret38#1, main_#t~post39#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;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~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;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#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; {5480#true} is VALID [2022-02-20 18:24:50,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {5480#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {5480#true} is VALID [2022-02-20 18:24:50,770 INFO L290 TraceCheckUtils]: 3: Hoare triple {5480#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {5480#true} is VALID [2022-02-20 18:24:50,770 INFO L290 TraceCheckUtils]: 4: Hoare triple {5480#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {5480#true} is VALID [2022-02-20 18:24:50,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {5480#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {5480#true} is VALID [2022-02-20 18:24:50,770 INFO L290 TraceCheckUtils]: 6: Hoare triple {5480#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {5480#true} is VALID [2022-02-20 18:24:50,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {5480#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {5480#true} is VALID [2022-02-20 18:24:50,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {5480#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {5480#true} is VALID [2022-02-20 18:24:50,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {5480#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {5480#true} is VALID [2022-02-20 18:24:50,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {5480#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {5480#true} is VALID [2022-02-20 18:24:50,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {5480#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {5480#true} is VALID [2022-02-20 18:24:50,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {5480#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {5480#true} is VALID [2022-02-20 18:24:50,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {5480#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {5480#true} is VALID [2022-02-20 18:24:50,772 INFO L290 TraceCheckUtils]: 14: Hoare triple {5480#true} assume ~id1~0 != ~id2~0; {5480#true} is VALID [2022-02-20 18:24:50,772 INFO L290 TraceCheckUtils]: 15: Hoare triple {5480#true} assume ~id1~0 != ~id3~0; {5480#true} is VALID [2022-02-20 18:24:50,772 INFO L290 TraceCheckUtils]: 16: Hoare triple {5480#true} assume ~id2~0 != ~id3~0; {5480#true} is VALID [2022-02-20 18:24:50,772 INFO L290 TraceCheckUtils]: 17: Hoare triple {5480#true} assume ~id1~0 >= 0; {5480#true} is VALID [2022-02-20 18:24:50,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {5480#true} assume ~id2~0 >= 0; {5480#true} is VALID [2022-02-20 18:24:50,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {5480#true} assume ~id3~0 >= 0; {5480#true} is VALID [2022-02-20 18:24:50,773 INFO L290 TraceCheckUtils]: 20: Hoare triple {5480#true} assume 0 == ~r1~0; {5480#true} is VALID [2022-02-20 18:24:50,773 INFO L290 TraceCheckUtils]: 21: Hoare triple {5480#true} assume 0 == ~r2~0; {5480#true} is VALID [2022-02-20 18:24:50,773 INFO L290 TraceCheckUtils]: 22: Hoare triple {5480#true} assume 0 == ~r3~0; {5480#true} is VALID [2022-02-20 18:24:50,773 INFO L290 TraceCheckUtils]: 23: Hoare triple {5480#true} assume 0 != init_~r122~0#1 % 256; {5480#true} is VALID [2022-02-20 18:24:50,773 INFO L290 TraceCheckUtils]: 24: Hoare triple {5480#true} assume 0 != init_~r132~0#1 % 256; {5480#true} is VALID [2022-02-20 18:24:50,773 INFO L290 TraceCheckUtils]: 25: Hoare triple {5480#true} assume 0 != init_~r212~0#1 % 256; {5480#true} is VALID [2022-02-20 18:24:50,774 INFO L290 TraceCheckUtils]: 26: Hoare triple {5480#true} assume 0 != init_~r232~0#1 % 256; {5480#true} is VALID [2022-02-20 18:24:50,774 INFO L290 TraceCheckUtils]: 27: Hoare triple {5480#true} assume 0 != init_~r312~0#1 % 256; {5480#true} is VALID [2022-02-20 18:24:50,774 INFO L290 TraceCheckUtils]: 28: Hoare triple {5480#true} assume 0 != init_~r322~0#1 % 256; {5480#true} is VALID [2022-02-20 18:24:50,774 INFO L290 TraceCheckUtils]: 29: Hoare triple {5480#true} assume ~max1~0 == ~id1~0; {5480#true} is VALID [2022-02-20 18:24:50,774 INFO L290 TraceCheckUtils]: 30: Hoare triple {5480#true} assume ~max2~0 == ~id2~0; {5480#true} is VALID [2022-02-20 18:24:50,774 INFO L290 TraceCheckUtils]: 31: Hoare triple {5480#true} assume ~max3~0 == ~id3~0; {5480#true} is VALID [2022-02-20 18:24:50,775 INFO L290 TraceCheckUtils]: 32: Hoare triple {5480#true} assume 0 == ~st1~0; {5480#true} is VALID [2022-02-20 18:24:50,775 INFO L290 TraceCheckUtils]: 33: Hoare triple {5480#true} assume 0 == ~st2~0; {5480#true} is VALID [2022-02-20 18:24:50,775 INFO L290 TraceCheckUtils]: 34: Hoare triple {5480#true} assume 0 == ~st3~0; {5480#true} is VALID [2022-02-20 18:24:50,775 INFO L290 TraceCheckUtils]: 35: Hoare triple {5480#true} assume 0 == ~nl1~0; {5480#true} is VALID [2022-02-20 18:24:50,775 INFO L290 TraceCheckUtils]: 36: Hoare triple {5480#true} assume 0 == ~nl2~0; {5480#true} is VALID [2022-02-20 18:24:50,775 INFO L290 TraceCheckUtils]: 37: Hoare triple {5480#true} assume 0 == ~nl3~0; {5480#true} is VALID [2022-02-20 18:24:50,776 INFO L290 TraceCheckUtils]: 38: Hoare triple {5480#true} assume 0 == ~mode1~0 % 256; {5480#true} is VALID [2022-02-20 18:24:50,778 INFO L290 TraceCheckUtils]: 39: Hoare triple {5480#true} assume 0 == ~mode2~0 % 256; {5482#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:50,778 INFO L290 TraceCheckUtils]: 40: Hoare triple {5482#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {5482#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:50,778 INFO L290 TraceCheckUtils]: 41: Hoare triple {5482#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp___5~0#1; {5482#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:50,779 INFO L290 TraceCheckUtils]: 42: Hoare triple {5482#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; {5482#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:50,780 INFO L290 TraceCheckUtils]: 43: Hoare triple {5482#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == main_~i2~0#1); {5482#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:50,780 INFO L290 TraceCheckUtils]: 44: Hoare triple {5482#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~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; {5482#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:50,781 INFO L290 TraceCheckUtils]: 45: Hoare triple {5482#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {5482#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:50,781 INFO L290 TraceCheckUtils]: 46: Hoare triple {5482#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {5482#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:50,782 INFO L290 TraceCheckUtils]: 47: Hoare triple {5482#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~r1~0 < 2; {5482#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:50,782 INFO L290 TraceCheckUtils]: 48: Hoare triple {5482#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~ep12~0 % 256); {5482#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:50,783 INFO L290 TraceCheckUtils]: 49: Hoare triple {5482#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~ep13~0 % 256); {5482#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:50,783 INFO L290 TraceCheckUtils]: 50: Hoare triple {5482#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {5482#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:50,783 INFO L290 TraceCheckUtils]: 51: Hoare triple {5482#(= (+ (* (- 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; {5482#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:24:50,784 INFO L290 TraceCheckUtils]: 52: Hoare triple {5482#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~mode2~0 % 256;~r2~0 := (if (1 + ~r2~0) % 256 <= 127 then (1 + ~r2~0) % 256 else (1 + ~r2~0) % 256 - 256); {5481#false} is VALID [2022-02-20 18:24:50,784 INFO L290 TraceCheckUtils]: 53: Hoare triple {5481#false} assume !(0 != ~ep12~0 % 256); {5481#false} is VALID [2022-02-20 18:24:50,785 INFO L290 TraceCheckUtils]: 54: Hoare triple {5481#false} assume !(0 != ~ep32~0 % 256); {5481#false} is VALID [2022-02-20 18:24:50,785 INFO L290 TraceCheckUtils]: 55: Hoare triple {5481#false} assume !(2 == ~r2~0); {5481#false} is VALID [2022-02-20 18:24:50,785 INFO L290 TraceCheckUtils]: 56: Hoare triple {5481#false} ~mode2~0 := 0; {5481#false} is VALID [2022-02-20 18:24:50,785 INFO L290 TraceCheckUtils]: 57: Hoare triple {5481#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {5481#false} is VALID [2022-02-20 18:24:50,785 INFO L290 TraceCheckUtils]: 58: Hoare triple {5481#false} assume !(0 != ~mode3~0 % 256); {5481#false} is VALID [2022-02-20 18:24:50,785 INFO L290 TraceCheckUtils]: 59: Hoare triple {5481#false} assume !(~r3~0 < 2); {5481#false} is VALID [2022-02-20 18:24:50,786 INFO L290 TraceCheckUtils]: 60: Hoare triple {5481#false} ~mode3~0 := 1; {5481#false} is VALID [2022-02-20 18:24:50,786 INFO L290 TraceCheckUtils]: 61: Hoare triple {5481#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; {5481#false} is VALID [2022-02-20 18:24:50,786 INFO L290 TraceCheckUtils]: 62: Hoare triple {5481#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {5481#false} is VALID [2022-02-20 18:24:50,786 INFO L290 TraceCheckUtils]: 63: Hoare triple {5481#false} check_#res#1 := check_~tmp~1#1; {5481#false} is VALID [2022-02-20 18:24:50,786 INFO L290 TraceCheckUtils]: 64: Hoare triple {5481#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#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; {5481#false} is VALID [2022-02-20 18:24:50,786 INFO L290 TraceCheckUtils]: 65: Hoare triple {5481#false} assume 0 == assert_~arg#1 % 256; {5481#false} is VALID [2022-02-20 18:24:50,787 INFO L290 TraceCheckUtils]: 66: Hoare triple {5481#false} assume !false; {5481#false} is VALID [2022-02-20 18:24:50,787 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:24:50,787 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:50,787 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183920127] [2022-02-20 18:24:50,788 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183920127] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:50,788 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:50,788 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:24:50,788 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566192503] [2022-02-20 18:24:50,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:50,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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:24:50,789 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:50,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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:24:50,834 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:24:50,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:24:50,834 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:50,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:24:50,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:50,835 INFO L87 Difference]: Start difference. First operand 400 states and 640 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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:24:51,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:51,122 INFO L93 Difference]: Finished difference Result 729 states and 1183 transitions. [2022-02-20 18:24:51,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:24:51,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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:24:51,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:51,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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:24:51,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2022-02-20 18:24:51,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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:24:51,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2022-02-20 18:24:51,127 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 403 transitions. [2022-02-20 18:24:51,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 403 edges. 403 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:51,437 INFO L225 Difference]: With dead ends: 729 [2022-02-20 18:24:51,437 INFO L226 Difference]: Without dead ends: 547 [2022-02-20 18:24:51,437 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:24:51,438 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 96 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 427 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:24:51,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 427 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:51,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2022-02-20 18:24:51,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 545. [2022-02-20 18:24:51,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:51,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 547 states. Second operand has 545 states, 544 states have (on average 1.6084558823529411) internal successors, (875), 544 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have 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:24:51,478 INFO L74 IsIncluded]: Start isIncluded. First operand 547 states. Second operand has 545 states, 544 states have (on average 1.6084558823529411) internal successors, (875), 544 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have 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:24:51,479 INFO L87 Difference]: Start difference. First operand 547 states. Second operand has 545 states, 544 states have (on average 1.6084558823529411) internal successors, (875), 544 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have 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:24:51,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:51,494 INFO L93 Difference]: Finished difference Result 547 states and 876 transitions. [2022-02-20 18:24:51,494 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 876 transitions. [2022-02-20 18:24:51,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:51,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:51,496 INFO L74 IsIncluded]: Start isIncluded. First operand has 545 states, 544 states have (on average 1.6084558823529411) internal successors, (875), 544 states have internal predecessors, (875), 0 states have call successors, (0), 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 547 states. [2022-02-20 18:24:51,497 INFO L87 Difference]: Start difference. First operand has 545 states, 544 states have (on average 1.6084558823529411) internal successors, (875), 544 states have internal predecessors, (875), 0 states have call successors, (0), 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 547 states. [2022-02-20 18:24:51,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:51,514 INFO L93 Difference]: Finished difference Result 547 states and 876 transitions. [2022-02-20 18:24:51,514 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 876 transitions. [2022-02-20 18:24:51,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:51,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:51,515 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:51,515 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:51,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 544 states have (on average 1.6084558823529411) internal successors, (875), 544 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have 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:24:51,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 875 transitions. [2022-02-20 18:24:51,533 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 875 transitions. Word has length 67 [2022-02-20 18:24:51,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:51,534 INFO L470 AbstractCegarLoop]: Abstraction has 545 states and 875 transitions. [2022-02-20 18:24:51,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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:24:51,534 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 875 transitions. [2022-02-20 18:24:51,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 18:24:51,534 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:51,535 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:24:51,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:24:51,535 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:51,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:51,536 INFO L85 PathProgramCache]: Analyzing trace with hash 221435787, now seen corresponding path program 1 times [2022-02-20 18:24:51,536 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:51,536 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737385275] [2022-02-20 18:24:51,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:51,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:51,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:51,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {8027#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(37, 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;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {8027#true} is VALID [2022-02-20 18:24:51,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {8027#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~ret37#1, main_#t~ret38#1, main_#t~post39#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;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~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;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#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; {8027#true} is VALID [2022-02-20 18:24:51,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {8027#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {8027#true} is VALID [2022-02-20 18:24:51,628 INFO L290 TraceCheckUtils]: 3: Hoare triple {8027#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {8027#true} is VALID [2022-02-20 18:24:51,628 INFO L290 TraceCheckUtils]: 4: Hoare triple {8027#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {8027#true} is VALID [2022-02-20 18:24:51,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {8027#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {8027#true} is VALID [2022-02-20 18:24:51,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {8027#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {8027#true} is VALID [2022-02-20 18:24:51,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {8027#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {8027#true} is VALID [2022-02-20 18:24:51,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {8027#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {8027#true} is VALID [2022-02-20 18:24:51,629 INFO L290 TraceCheckUtils]: 9: Hoare triple {8027#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {8027#true} is VALID [2022-02-20 18:24:51,629 INFO L290 TraceCheckUtils]: 10: Hoare triple {8027#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {8027#true} is VALID [2022-02-20 18:24:51,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {8027#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {8027#true} is VALID [2022-02-20 18:24:51,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {8027#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {8027#true} is VALID [2022-02-20 18:24:51,630 INFO L290 TraceCheckUtils]: 13: Hoare triple {8027#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {8027#true} is VALID [2022-02-20 18:24:51,630 INFO L290 TraceCheckUtils]: 14: Hoare triple {8027#true} assume ~id1~0 != ~id2~0; {8027#true} is VALID [2022-02-20 18:24:51,630 INFO L290 TraceCheckUtils]: 15: Hoare triple {8027#true} assume ~id1~0 != ~id3~0; {8027#true} is VALID [2022-02-20 18:24:51,630 INFO L290 TraceCheckUtils]: 16: Hoare triple {8027#true} assume ~id2~0 != ~id3~0; {8027#true} is VALID [2022-02-20 18:24:51,631 INFO L290 TraceCheckUtils]: 17: Hoare triple {8027#true} assume ~id1~0 >= 0; {8027#true} is VALID [2022-02-20 18:24:51,631 INFO L290 TraceCheckUtils]: 18: Hoare triple {8027#true} assume ~id2~0 >= 0; {8027#true} is VALID [2022-02-20 18:24:51,631 INFO L290 TraceCheckUtils]: 19: Hoare triple {8027#true} assume ~id3~0 >= 0; {8027#true} is VALID [2022-02-20 18:24:51,631 INFO L290 TraceCheckUtils]: 20: Hoare triple {8027#true} assume 0 == ~r1~0; {8027#true} is VALID [2022-02-20 18:24:51,631 INFO L290 TraceCheckUtils]: 21: Hoare triple {8027#true} assume 0 == ~r2~0; {8027#true} is VALID [2022-02-20 18:24:51,632 INFO L290 TraceCheckUtils]: 22: Hoare triple {8027#true} assume 0 == ~r3~0; {8029#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:51,632 INFO L290 TraceCheckUtils]: 23: Hoare triple {8029#(<= ~r3~0 0)} assume 0 != init_~r122~0#1 % 256; {8029#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:51,632 INFO L290 TraceCheckUtils]: 24: Hoare triple {8029#(<= ~r3~0 0)} assume 0 != init_~r132~0#1 % 256; {8029#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:51,633 INFO L290 TraceCheckUtils]: 25: Hoare triple {8029#(<= ~r3~0 0)} assume 0 != init_~r212~0#1 % 256; {8029#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:51,633 INFO L290 TraceCheckUtils]: 26: Hoare triple {8029#(<= ~r3~0 0)} assume 0 != init_~r232~0#1 % 256; {8029#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:51,633 INFO L290 TraceCheckUtils]: 27: Hoare triple {8029#(<= ~r3~0 0)} assume 0 != init_~r312~0#1 % 256; {8029#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:51,634 INFO L290 TraceCheckUtils]: 28: Hoare triple {8029#(<= ~r3~0 0)} assume 0 != init_~r322~0#1 % 256; {8029#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:51,634 INFO L290 TraceCheckUtils]: 29: Hoare triple {8029#(<= ~r3~0 0)} assume ~max1~0 == ~id1~0; {8029#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:51,634 INFO L290 TraceCheckUtils]: 30: Hoare triple {8029#(<= ~r3~0 0)} assume ~max2~0 == ~id2~0; {8029#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:51,635 INFO L290 TraceCheckUtils]: 31: Hoare triple {8029#(<= ~r3~0 0)} assume ~max3~0 == ~id3~0; {8029#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:51,635 INFO L290 TraceCheckUtils]: 32: Hoare triple {8029#(<= ~r3~0 0)} assume 0 == ~st1~0; {8029#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:51,636 INFO L290 TraceCheckUtils]: 33: Hoare triple {8029#(<= ~r3~0 0)} assume 0 == ~st2~0; {8029#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:51,637 INFO L290 TraceCheckUtils]: 34: Hoare triple {8029#(<= ~r3~0 0)} assume 0 == ~st3~0; {8029#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:51,641 INFO L290 TraceCheckUtils]: 35: Hoare triple {8029#(<= ~r3~0 0)} assume 0 == ~nl1~0; {8029#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:51,641 INFO L290 TraceCheckUtils]: 36: Hoare triple {8029#(<= ~r3~0 0)} assume 0 == ~nl2~0; {8029#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:51,641 INFO L290 TraceCheckUtils]: 37: Hoare triple {8029#(<= ~r3~0 0)} assume 0 == ~nl3~0; {8029#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:51,642 INFO L290 TraceCheckUtils]: 38: Hoare triple {8029#(<= ~r3~0 0)} assume 0 == ~mode1~0 % 256; {8029#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:51,642 INFO L290 TraceCheckUtils]: 39: Hoare triple {8029#(<= ~r3~0 0)} assume 0 == ~mode2~0 % 256; {8029#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:51,642 INFO L290 TraceCheckUtils]: 40: Hoare triple {8029#(<= ~r3~0 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {8029#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:51,643 INFO L290 TraceCheckUtils]: 41: Hoare triple {8029#(<= ~r3~0 0)} init_#res#1 := init_~tmp___5~0#1; {8029#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:51,643 INFO L290 TraceCheckUtils]: 42: Hoare triple {8029#(<= ~r3~0 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; {8029#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:51,644 INFO L290 TraceCheckUtils]: 43: Hoare triple {8029#(<= ~r3~0 0)} assume !(0 == main_~i2~0#1); {8029#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:51,644 INFO L290 TraceCheckUtils]: 44: Hoare triple {8029#(<= ~r3~0 0)} ~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; {8029#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:51,644 INFO L290 TraceCheckUtils]: 45: Hoare triple {8029#(<= ~r3~0 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {8029#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:51,645 INFO L290 TraceCheckUtils]: 46: Hoare triple {8029#(<= ~r3~0 0)} assume !(0 != ~mode1~0 % 256); {8029#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:51,645 INFO L290 TraceCheckUtils]: 47: Hoare triple {8029#(<= ~r3~0 0)} assume ~r1~0 < 2; {8029#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:51,645 INFO L290 TraceCheckUtils]: 48: Hoare triple {8029#(<= ~r3~0 0)} assume !(0 != ~ep12~0 % 256); {8029#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:51,646 INFO L290 TraceCheckUtils]: 49: Hoare triple {8029#(<= ~r3~0 0)} assume !(0 != ~ep13~0 % 256); {8029#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:51,646 INFO L290 TraceCheckUtils]: 50: Hoare triple {8029#(<= ~r3~0 0)} ~mode1~0 := 1; {8029#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:51,646 INFO L290 TraceCheckUtils]: 51: Hoare triple {8029#(<= ~r3~0 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {8029#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:51,647 INFO L290 TraceCheckUtils]: 52: Hoare triple {8029#(<= ~r3~0 0)} assume !(0 != ~mode2~0 % 256); {8029#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:51,647 INFO L290 TraceCheckUtils]: 53: Hoare triple {8029#(<= ~r3~0 0)} assume ~r2~0 < 2; {8029#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:51,647 INFO L290 TraceCheckUtils]: 54: Hoare triple {8029#(<= ~r3~0 0)} assume !(0 != ~ep21~0 % 256); {8029#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:51,648 INFO L290 TraceCheckUtils]: 55: Hoare triple {8029#(<= ~r3~0 0)} assume !(0 != ~ep23~0 % 256); {8029#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:51,648 INFO L290 TraceCheckUtils]: 56: Hoare triple {8029#(<= ~r3~0 0)} ~mode2~0 := 1; {8029#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:51,648 INFO L290 TraceCheckUtils]: 57: Hoare triple {8029#(<= ~r3~0 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {8029#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:51,649 INFO L290 TraceCheckUtils]: 58: Hoare triple {8029#(<= ~r3~0 0)} assume !(0 != ~mode3~0 % 256); {8029#(<= ~r3~0 0)} is VALID [2022-02-20 18:24:51,649 INFO L290 TraceCheckUtils]: 59: Hoare triple {8029#(<= ~r3~0 0)} assume !(~r3~0 < 2); {8028#false} is VALID [2022-02-20 18:24:51,649 INFO L290 TraceCheckUtils]: 60: Hoare triple {8028#false} ~mode3~0 := 1; {8028#false} is VALID [2022-02-20 18:24:51,650 INFO L290 TraceCheckUtils]: 61: Hoare triple {8028#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; {8028#false} is VALID [2022-02-20 18:24:51,650 INFO L290 TraceCheckUtils]: 62: Hoare triple {8028#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {8028#false} is VALID [2022-02-20 18:24:51,650 INFO L290 TraceCheckUtils]: 63: Hoare triple {8028#false} check_#res#1 := check_~tmp~1#1; {8028#false} is VALID [2022-02-20 18:24:51,650 INFO L290 TraceCheckUtils]: 64: Hoare triple {8028#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#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; {8028#false} is VALID [2022-02-20 18:24:51,650 INFO L290 TraceCheckUtils]: 65: Hoare triple {8028#false} assume 0 == assert_~arg#1 % 256; {8028#false} is VALID [2022-02-20 18:24:51,650 INFO L290 TraceCheckUtils]: 66: Hoare triple {8028#false} assume !false; {8028#false} is VALID [2022-02-20 18:24:51,651 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:24:51,651 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:51,651 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737385275] [2022-02-20 18:24:51,651 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737385275] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:51,651 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:51,651 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:24:51,652 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73319788] [2022-02-20 18:24:51,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:51,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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:24:51,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:51,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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:24:51,696 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:24:51,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:24:51,696 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:51,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:24:51,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:51,697 INFO L87 Difference]: Start difference. First operand 545 states and 875 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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:24:52,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:52,114 INFO L93 Difference]: Finished difference Result 1434 states and 2326 transitions. [2022-02-20 18:24:52,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:24:52,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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:24:52,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:52,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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:24:52,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2022-02-20 18:24:52,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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:24:52,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2022-02-20 18:24:52,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 416 transitions. [2022-02-20 18:24:52,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 416 edges. 416 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:52,436 INFO L225 Difference]: With dead ends: 1434 [2022-02-20 18:24:52,436 INFO L226 Difference]: Without dead ends: 958 [2022-02-20 18:24:52,437 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:24:52,438 INFO L933 BasicCegarLoop]: 252 mSDtfsCounter, 89 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:24:52,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 415 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:52,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2022-02-20 18:24:52,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 956. [2022-02-20 18:24:52,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:52,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 958 states. Second operand has 956 states, 955 states have (on average 1.6041884816753926) internal successors, (1532), 955 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have 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:24:52,572 INFO L74 IsIncluded]: Start isIncluded. First operand 958 states. Second operand has 956 states, 955 states have (on average 1.6041884816753926) internal successors, (1532), 955 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have 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:24:52,573 INFO L87 Difference]: Start difference. First operand 958 states. Second operand has 956 states, 955 states have (on average 1.6041884816753926) internal successors, (1532), 955 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have 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:24:52,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:52,618 INFO L93 Difference]: Finished difference Result 958 states and 1533 transitions. [2022-02-20 18:24:52,618 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1533 transitions. [2022-02-20 18:24:52,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:52,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:52,622 INFO L74 IsIncluded]: Start isIncluded. First operand has 956 states, 955 states have (on average 1.6041884816753926) internal successors, (1532), 955 states have internal predecessors, (1532), 0 states have call successors, (0), 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 958 states. [2022-02-20 18:24:52,623 INFO L87 Difference]: Start difference. First operand has 956 states, 955 states have (on average 1.6041884816753926) internal successors, (1532), 955 states have internal predecessors, (1532), 0 states have call successors, (0), 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 958 states. [2022-02-20 18:24:52,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:52,668 INFO L93 Difference]: Finished difference Result 958 states and 1533 transitions. [2022-02-20 18:24:52,669 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1533 transitions. [2022-02-20 18:24:52,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:52,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:52,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:52,670 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:52,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 955 states have (on average 1.6041884816753926) internal successors, (1532), 955 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have 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:24:52,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1532 transitions. [2022-02-20 18:24:52,744 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1532 transitions. Word has length 67 [2022-02-20 18:24:52,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:52,745 INFO L470 AbstractCegarLoop]: Abstraction has 956 states and 1532 transitions. [2022-02-20 18:24:52,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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:24:52,745 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1532 transitions. [2022-02-20 18:24:52,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 18:24:52,746 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:52,746 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:24:52,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:24:52,746 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:52,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:52,747 INFO L85 PathProgramCache]: Analyzing trace with hash 664156592, now seen corresponding path program 1 times [2022-02-20 18:24:52,747 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:52,747 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560942183] [2022-02-20 18:24:52,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:52,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:52,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:52,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {12704#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(37, 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;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {12704#true} is VALID [2022-02-20 18:24:52,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {12704#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~ret37#1, main_#t~ret38#1, main_#t~post39#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;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~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;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#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; {12704#true} is VALID [2022-02-20 18:24:52,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {12704#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {12704#true} is VALID [2022-02-20 18:24:52,796 INFO L290 TraceCheckUtils]: 3: Hoare triple {12704#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {12704#true} is VALID [2022-02-20 18:24:52,797 INFO L290 TraceCheckUtils]: 4: Hoare triple {12704#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {12704#true} is VALID [2022-02-20 18:24:52,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {12704#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {12704#true} is VALID [2022-02-20 18:24:52,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {12704#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {12704#true} is VALID [2022-02-20 18:24:52,797 INFO L290 TraceCheckUtils]: 7: Hoare triple {12704#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {12704#true} is VALID [2022-02-20 18:24:52,797 INFO L290 TraceCheckUtils]: 8: Hoare triple {12704#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {12704#true} is VALID [2022-02-20 18:24:52,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {12704#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {12704#true} is VALID [2022-02-20 18:24:52,797 INFO L290 TraceCheckUtils]: 10: Hoare triple {12704#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {12704#true} is VALID [2022-02-20 18:24:52,798 INFO L290 TraceCheckUtils]: 11: Hoare triple {12704#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {12704#true} is VALID [2022-02-20 18:24:52,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {12704#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {12704#true} is VALID [2022-02-20 18:24:52,798 INFO L290 TraceCheckUtils]: 13: Hoare triple {12704#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {12704#true} is VALID [2022-02-20 18:24:52,798 INFO L290 TraceCheckUtils]: 14: Hoare triple {12704#true} assume ~id1~0 != ~id2~0; {12704#true} is VALID [2022-02-20 18:24:52,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {12704#true} assume ~id1~0 != ~id3~0; {12704#true} is VALID [2022-02-20 18:24:52,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {12704#true} assume ~id2~0 != ~id3~0; {12704#true} is VALID [2022-02-20 18:24:52,798 INFO L290 TraceCheckUtils]: 17: Hoare triple {12704#true} assume ~id1~0 >= 0; {12704#true} is VALID [2022-02-20 18:24:52,799 INFO L290 TraceCheckUtils]: 18: Hoare triple {12704#true} assume ~id2~0 >= 0; {12704#true} is VALID [2022-02-20 18:24:52,799 INFO L290 TraceCheckUtils]: 19: Hoare triple {12704#true} assume ~id3~0 >= 0; {12704#true} is VALID [2022-02-20 18:24:52,799 INFO L290 TraceCheckUtils]: 20: Hoare triple {12704#true} assume 0 == ~r1~0; {12704#true} is VALID [2022-02-20 18:24:52,799 INFO L290 TraceCheckUtils]: 21: Hoare triple {12704#true} assume 0 == ~r2~0; {12704#true} is VALID [2022-02-20 18:24:52,799 INFO L290 TraceCheckUtils]: 22: Hoare triple {12704#true} assume 0 == ~r3~0; {12704#true} is VALID [2022-02-20 18:24:52,799 INFO L290 TraceCheckUtils]: 23: Hoare triple {12704#true} assume 0 != init_~r122~0#1 % 256; {12704#true} is VALID [2022-02-20 18:24:52,799 INFO L290 TraceCheckUtils]: 24: Hoare triple {12704#true} assume 0 != init_~r132~0#1 % 256; {12704#true} is VALID [2022-02-20 18:24:52,800 INFO L290 TraceCheckUtils]: 25: Hoare triple {12704#true} assume 0 != init_~r212~0#1 % 256; {12704#true} is VALID [2022-02-20 18:24:52,800 INFO L290 TraceCheckUtils]: 26: Hoare triple {12704#true} assume 0 != init_~r232~0#1 % 256; {12704#true} is VALID [2022-02-20 18:24:52,800 INFO L290 TraceCheckUtils]: 27: Hoare triple {12704#true} assume 0 != init_~r312~0#1 % 256; {12704#true} is VALID [2022-02-20 18:24:52,800 INFO L290 TraceCheckUtils]: 28: Hoare triple {12704#true} assume 0 != init_~r322~0#1 % 256; {12704#true} is VALID [2022-02-20 18:24:52,800 INFO L290 TraceCheckUtils]: 29: Hoare triple {12704#true} assume ~max1~0 == ~id1~0; {12704#true} is VALID [2022-02-20 18:24:52,800 INFO L290 TraceCheckUtils]: 30: Hoare triple {12704#true} assume ~max2~0 == ~id2~0; {12704#true} is VALID [2022-02-20 18:24:52,800 INFO L290 TraceCheckUtils]: 31: Hoare triple {12704#true} assume ~max3~0 == ~id3~0; {12704#true} is VALID [2022-02-20 18:24:52,800 INFO L290 TraceCheckUtils]: 32: Hoare triple {12704#true} assume 0 == ~st1~0; {12704#true} is VALID [2022-02-20 18:24:52,801 INFO L290 TraceCheckUtils]: 33: Hoare triple {12704#true} assume 0 == ~st2~0; {12704#true} is VALID [2022-02-20 18:24:52,801 INFO L290 TraceCheckUtils]: 34: Hoare triple {12704#true} assume 0 == ~st3~0; {12704#true} is VALID [2022-02-20 18:24:52,801 INFO L290 TraceCheckUtils]: 35: Hoare triple {12704#true} assume 0 == ~nl1~0; {12704#true} is VALID [2022-02-20 18:24:52,801 INFO L290 TraceCheckUtils]: 36: Hoare triple {12704#true} assume 0 == ~nl2~0; {12704#true} is VALID [2022-02-20 18:24:52,801 INFO L290 TraceCheckUtils]: 37: Hoare triple {12704#true} assume 0 == ~nl3~0; {12704#true} is VALID [2022-02-20 18:24:52,801 INFO L290 TraceCheckUtils]: 38: Hoare triple {12704#true} assume 0 == ~mode1~0 % 256; {12704#true} is VALID [2022-02-20 18:24:52,801 INFO L290 TraceCheckUtils]: 39: Hoare triple {12704#true} assume 0 == ~mode2~0 % 256; {12704#true} is VALID [2022-02-20 18:24:52,802 INFO L290 TraceCheckUtils]: 40: Hoare triple {12704#true} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {12706#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:52,803 INFO L290 TraceCheckUtils]: 41: Hoare triple {12706#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp___5~0#1; {12706#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:52,803 INFO L290 TraceCheckUtils]: 42: Hoare triple {12706#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; {12706#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:52,804 INFO L290 TraceCheckUtils]: 43: Hoare triple {12706#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == main_~i2~0#1); {12706#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:52,804 INFO L290 TraceCheckUtils]: 44: Hoare triple {12706#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~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; {12706#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:52,805 INFO L290 TraceCheckUtils]: 45: Hoare triple {12706#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {12706#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:52,805 INFO L290 TraceCheckUtils]: 46: Hoare triple {12706#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {12706#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:52,805 INFO L290 TraceCheckUtils]: 47: Hoare triple {12706#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r1~0 < 2; {12706#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:52,806 INFO L290 TraceCheckUtils]: 48: Hoare triple {12706#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep12~0 % 256); {12706#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:52,806 INFO L290 TraceCheckUtils]: 49: Hoare triple {12706#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep13~0 % 256); {12706#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:52,807 INFO L290 TraceCheckUtils]: 50: Hoare triple {12706#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {12706#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:52,807 INFO L290 TraceCheckUtils]: 51: Hoare triple {12706#(= (+ (* (- 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; {12706#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:52,808 INFO L290 TraceCheckUtils]: 52: Hoare triple {12706#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {12706#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:52,808 INFO L290 TraceCheckUtils]: 53: Hoare triple {12706#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r2~0 < 2; {12706#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:52,808 INFO L290 TraceCheckUtils]: 54: Hoare triple {12706#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep21~0 % 256); {12706#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:52,809 INFO L290 TraceCheckUtils]: 55: Hoare triple {12706#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep23~0 % 256); {12706#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:52,809 INFO L290 TraceCheckUtils]: 56: Hoare triple {12706#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {12706#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:52,810 INFO L290 TraceCheckUtils]: 57: Hoare triple {12706#(= (+ (* (- 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; {12706#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:52,811 INFO L290 TraceCheckUtils]: 58: Hoare triple {12706#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~mode3~0 % 256;~r3~0 := (if (1 + ~r3~0) % 256 <= 127 then (1 + ~r3~0) % 256 else (1 + ~r3~0) % 256 - 256); {12705#false} is VALID [2022-02-20 18:24:52,811 INFO L290 TraceCheckUtils]: 59: Hoare triple {12705#false} assume !(0 != ~ep13~0 % 256); {12705#false} is VALID [2022-02-20 18:24:52,811 INFO L290 TraceCheckUtils]: 60: Hoare triple {12705#false} assume !(0 != ~ep23~0 % 256); {12705#false} is VALID [2022-02-20 18:24:52,811 INFO L290 TraceCheckUtils]: 61: Hoare triple {12705#false} assume !(2 == ~r3~0); {12705#false} is VALID [2022-02-20 18:24:52,811 INFO L290 TraceCheckUtils]: 62: Hoare triple {12705#false} ~mode3~0 := 0; {12705#false} is VALID [2022-02-20 18:24:52,811 INFO L290 TraceCheckUtils]: 63: Hoare triple {12705#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; {12705#false} is VALID [2022-02-20 18:24:52,811 INFO L290 TraceCheckUtils]: 64: Hoare triple {12705#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {12705#false} is VALID [2022-02-20 18:24:52,812 INFO L290 TraceCheckUtils]: 65: Hoare triple {12705#false} check_#res#1 := check_~tmp~1#1; {12705#false} is VALID [2022-02-20 18:24:52,812 INFO L290 TraceCheckUtils]: 66: Hoare triple {12705#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#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; {12705#false} is VALID [2022-02-20 18:24:52,812 INFO L290 TraceCheckUtils]: 67: Hoare triple {12705#false} assume 0 == assert_~arg#1 % 256; {12705#false} is VALID [2022-02-20 18:24:52,812 INFO L290 TraceCheckUtils]: 68: Hoare triple {12705#false} assume !false; {12705#false} is VALID [2022-02-20 18:24:52,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:24:52,813 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:52,813 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560942183] [2022-02-20 18:24:52,813 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560942183] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:52,813 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:52,813 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:24:52,813 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424372594] [2022-02-20 18:24:52,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:52,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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:24:52,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:52,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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:24:52,869 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:24:52,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:24:52,869 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:52,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:24:52,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:52,870 INFO L87 Difference]: Start difference. First operand 956 states and 1532 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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:24:53,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:53,394 INFO L93 Difference]: Finished difference Result 1783 states and 2881 transitions. [2022-02-20 18:24:53,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:24:53,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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:24:53,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:53,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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:24:53,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2022-02-20 18:24:53,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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:24:53,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2022-02-20 18:24:53,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 403 transitions. [2022-02-20 18:24:53,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 403 edges. 403 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:53,760 INFO L225 Difference]: With dead ends: 1783 [2022-02-20 18:24:53,760 INFO L226 Difference]: Without dead ends: 1307 [2022-02-20 18:24:53,761 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:24:53,762 INFO L933 BasicCegarLoop]: 243 mSDtfsCounter, 90 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 413 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:24:53,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 413 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:53,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1307 states. [2022-02-20 18:24:53,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1307 to 1305. [2022-02-20 18:24:53,900 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:53,903 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1307 states. Second operand has 1305 states, 1304 states have (on average 1.5996932515337423) internal successors, (2086), 1304 states have internal predecessors, (2086), 0 states have call successors, (0), 0 states have 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:24:53,906 INFO L74 IsIncluded]: Start isIncluded. First operand 1307 states. Second operand has 1305 states, 1304 states have (on average 1.5996932515337423) internal successors, (2086), 1304 states have internal predecessors, (2086), 0 states have call successors, (0), 0 states have 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:24:53,908 INFO L87 Difference]: Start difference. First operand 1307 states. Second operand has 1305 states, 1304 states have (on average 1.5996932515337423) internal successors, (2086), 1304 states have internal predecessors, (2086), 0 states have call successors, (0), 0 states have 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:24:53,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:53,979 INFO L93 Difference]: Finished difference Result 1307 states and 2087 transitions. [2022-02-20 18:24:53,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 2087 transitions. [2022-02-20 18:24:53,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:53,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:53,984 INFO L74 IsIncluded]: Start isIncluded. First operand has 1305 states, 1304 states have (on average 1.5996932515337423) internal successors, (2086), 1304 states have internal predecessors, (2086), 0 states have call successors, (0), 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 1307 states. [2022-02-20 18:24:53,986 INFO L87 Difference]: Start difference. First operand has 1305 states, 1304 states have (on average 1.5996932515337423) internal successors, (2086), 1304 states have internal predecessors, (2086), 0 states have call successors, (0), 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 1307 states. [2022-02-20 18:24:54,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:54,057 INFO L93 Difference]: Finished difference Result 1307 states and 2087 transitions. [2022-02-20 18:24:54,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 2087 transitions. [2022-02-20 18:24:54,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:54,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:54,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:54,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:54,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1305 states, 1304 states have (on average 1.5996932515337423) internal successors, (2086), 1304 states have internal predecessors, (2086), 0 states have call successors, (0), 0 states have 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:24:54,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 2086 transitions. [2022-02-20 18:24:54,161 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 2086 transitions. Word has length 69 [2022-02-20 18:24:54,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:54,161 INFO L470 AbstractCegarLoop]: Abstraction has 1305 states and 2086 transitions. [2022-02-20 18:24:54,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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:24:54,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 2086 transitions. [2022-02-20 18:24:54,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 18:24:54,162 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:54,163 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:24:54,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:24:54,163 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:54,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:54,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1757720902, now seen corresponding path program 1 times [2022-02-20 18:24:54,164 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:54,164 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777549919] [2022-02-20 18:24:54,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:54,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:54,233 INFO L290 TraceCheckUtils]: 0: Hoare triple {18923#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(37, 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;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {18923#true} is VALID [2022-02-20 18:24:54,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {18923#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~ret37#1, main_#t~ret38#1, main_#t~post39#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;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~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;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#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; {18923#true} is VALID [2022-02-20 18:24:54,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {18923#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {18923#true} is VALID [2022-02-20 18:24:54,234 INFO L290 TraceCheckUtils]: 3: Hoare triple {18923#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {18923#true} is VALID [2022-02-20 18:24:54,234 INFO L290 TraceCheckUtils]: 4: Hoare triple {18923#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {18923#true} is VALID [2022-02-20 18:24:54,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {18923#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {18923#true} is VALID [2022-02-20 18:24:54,234 INFO L290 TraceCheckUtils]: 6: Hoare triple {18923#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {18923#true} is VALID [2022-02-20 18:24:54,235 INFO L290 TraceCheckUtils]: 7: Hoare triple {18923#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {18923#true} is VALID [2022-02-20 18:24:54,235 INFO L290 TraceCheckUtils]: 8: Hoare triple {18923#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {18923#true} is VALID [2022-02-20 18:24:54,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {18923#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {18923#true} is VALID [2022-02-20 18:24:54,235 INFO L290 TraceCheckUtils]: 10: Hoare triple {18923#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {18923#true} is VALID [2022-02-20 18:24:54,235 INFO L290 TraceCheckUtils]: 11: Hoare triple {18923#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {18923#true} is VALID [2022-02-20 18:24:54,235 INFO L290 TraceCheckUtils]: 12: Hoare triple {18923#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {18923#true} is VALID [2022-02-20 18:24:54,236 INFO L290 TraceCheckUtils]: 13: Hoare triple {18923#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {18923#true} is VALID [2022-02-20 18:24:54,236 INFO L290 TraceCheckUtils]: 14: Hoare triple {18923#true} assume ~id1~0 != ~id2~0; {18923#true} is VALID [2022-02-20 18:24:54,236 INFO L290 TraceCheckUtils]: 15: Hoare triple {18923#true} assume ~id1~0 != ~id3~0; {18923#true} is VALID [2022-02-20 18:24:54,236 INFO L290 TraceCheckUtils]: 16: Hoare triple {18923#true} assume ~id2~0 != ~id3~0; {18923#true} is VALID [2022-02-20 18:24:54,236 INFO L290 TraceCheckUtils]: 17: Hoare triple {18923#true} assume ~id1~0 >= 0; {18923#true} is VALID [2022-02-20 18:24:54,237 INFO L290 TraceCheckUtils]: 18: Hoare triple {18923#true} assume ~id2~0 >= 0; {18923#true} is VALID [2022-02-20 18:24:54,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {18923#true} assume ~id3~0 >= 0; {18923#true} is VALID [2022-02-20 18:24:54,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {18923#true} assume 0 == ~r1~0; {18923#true} is VALID [2022-02-20 18:24:54,237 INFO L290 TraceCheckUtils]: 21: Hoare triple {18923#true} assume 0 == ~r2~0; {18923#true} is VALID [2022-02-20 18:24:54,237 INFO L290 TraceCheckUtils]: 22: Hoare triple {18923#true} assume 0 == ~r3~0; {18923#true} is VALID [2022-02-20 18:24:54,237 INFO L290 TraceCheckUtils]: 23: Hoare triple {18923#true} assume 0 != init_~r122~0#1 % 256; {18923#true} is VALID [2022-02-20 18:24:54,238 INFO L290 TraceCheckUtils]: 24: Hoare triple {18923#true} assume 0 != init_~r132~0#1 % 256; {18923#true} is VALID [2022-02-20 18:24:54,238 INFO L290 TraceCheckUtils]: 25: Hoare triple {18923#true} assume 0 != init_~r212~0#1 % 256; {18923#true} is VALID [2022-02-20 18:24:54,238 INFO L290 TraceCheckUtils]: 26: Hoare triple {18923#true} assume 0 != init_~r232~0#1 % 256; {18923#true} is VALID [2022-02-20 18:24:54,238 INFO L290 TraceCheckUtils]: 27: Hoare triple {18923#true} assume 0 != init_~r312~0#1 % 256; {18923#true} is VALID [2022-02-20 18:24:54,238 INFO L290 TraceCheckUtils]: 28: Hoare triple {18923#true} assume 0 != init_~r322~0#1 % 256; {18923#true} is VALID [2022-02-20 18:24:54,238 INFO L290 TraceCheckUtils]: 29: Hoare triple {18923#true} assume ~max1~0 == ~id1~0; {18923#true} is VALID [2022-02-20 18:24:54,239 INFO L290 TraceCheckUtils]: 30: Hoare triple {18923#true} assume ~max2~0 == ~id2~0; {18923#true} is VALID [2022-02-20 18:24:54,239 INFO L290 TraceCheckUtils]: 31: Hoare triple {18923#true} assume ~max3~0 == ~id3~0; {18923#true} is VALID [2022-02-20 18:24:54,239 INFO L290 TraceCheckUtils]: 32: Hoare triple {18923#true} assume 0 == ~st1~0; {18925#(<= ~st1~0 0)} is VALID [2022-02-20 18:24:54,240 INFO L290 TraceCheckUtils]: 33: Hoare triple {18925#(<= ~st1~0 0)} assume 0 == ~st2~0; {18926#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,240 INFO L290 TraceCheckUtils]: 34: Hoare triple {18926#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,241 INFO L290 TraceCheckUtils]: 35: Hoare triple {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl1~0; {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,241 INFO L290 TraceCheckUtils]: 36: Hoare triple {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl2~0; {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,242 INFO L290 TraceCheckUtils]: 37: Hoare triple {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl3~0; {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,242 INFO L290 TraceCheckUtils]: 38: Hoare triple {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,242 INFO L290 TraceCheckUtils]: 39: Hoare triple {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,243 INFO L290 TraceCheckUtils]: 40: Hoare triple {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,243 INFO L290 TraceCheckUtils]: 41: Hoare triple {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,244 INFO L290 TraceCheckUtils]: 42: Hoare triple {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,244 INFO L290 TraceCheckUtils]: 43: Hoare triple {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~i2~0#1); {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,244 INFO L290 TraceCheckUtils]: 44: Hoare triple {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~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; {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,245 INFO L290 TraceCheckUtils]: 45: Hoare triple {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,245 INFO L290 TraceCheckUtils]: 46: Hoare triple {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,245 INFO L290 TraceCheckUtils]: 47: Hoare triple {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 2; {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,246 INFO L290 TraceCheckUtils]: 48: Hoare triple {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep12~0 % 256); {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,246 INFO L290 TraceCheckUtils]: 49: Hoare triple {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep13~0 % 256); {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,247 INFO L290 TraceCheckUtils]: 50: Hoare triple {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,247 INFO L290 TraceCheckUtils]: 51: Hoare triple {18927#(<= (+ ~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; {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,247 INFO L290 TraceCheckUtils]: 52: Hoare triple {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,248 INFO L290 TraceCheckUtils]: 53: Hoare triple {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r2~0 < 2; {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,248 INFO L290 TraceCheckUtils]: 54: Hoare triple {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep21~0 % 256); {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,249 INFO L290 TraceCheckUtils]: 55: Hoare triple {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep23~0 % 256); {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,249 INFO L290 TraceCheckUtils]: 56: Hoare triple {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,249 INFO L290 TraceCheckUtils]: 57: Hoare triple {18927#(<= (+ ~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; {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,250 INFO L290 TraceCheckUtils]: 58: Hoare triple {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,250 INFO L290 TraceCheckUtils]: 59: Hoare triple {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r3~0 < 2; {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,250 INFO L290 TraceCheckUtils]: 60: Hoare triple {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep31~0 % 256); {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,251 INFO L290 TraceCheckUtils]: 61: Hoare triple {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep32~0 % 256); {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,251 INFO L290 TraceCheckUtils]: 62: Hoare triple {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,252 INFO L290 TraceCheckUtils]: 63: Hoare triple {18927#(<= (+ ~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; {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:54,252 INFO L290 TraceCheckUtils]: 64: Hoare triple {18927#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {18924#false} is VALID [2022-02-20 18:24:54,252 INFO L290 TraceCheckUtils]: 65: Hoare triple {18924#false} check_#res#1 := check_~tmp~1#1; {18924#false} is VALID [2022-02-20 18:24:54,253 INFO L290 TraceCheckUtils]: 66: Hoare triple {18924#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#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; {18924#false} is VALID [2022-02-20 18:24:54,253 INFO L290 TraceCheckUtils]: 67: Hoare triple {18924#false} assume 0 == assert_~arg#1 % 256; {18924#false} is VALID [2022-02-20 18:24:54,253 INFO L290 TraceCheckUtils]: 68: Hoare triple {18924#false} assume !false; {18924#false} is VALID [2022-02-20 18:24:54,253 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:24:54,254 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:54,254 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777549919] [2022-02-20 18:24:54,254 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777549919] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:54,254 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:54,254 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:24:54,254 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616911457] [2022-02-20 18:24:54,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:54,255 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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:24:54,255 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:54,255 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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:24:54,309 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:24:54,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:24:54,310 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:54,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:24:54,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:24:54,311 INFO L87 Difference]: Start difference. First operand 1305 states and 2086 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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:24:57,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:57,915 INFO L93 Difference]: Finished difference Result 6582 states and 10723 transitions. [2022-02-20 18:24:57,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:24:57,915 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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:24:57,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:57,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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:24:57,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 901 transitions. [2022-02-20 18:24:57,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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:24:57,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 901 transitions. [2022-02-20 18:24:57,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 901 transitions. [2022-02-20 18:24:58,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 901 edges. 901 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:59,348 INFO L225 Difference]: With dead ends: 6582 [2022-02-20 18:24:59,348 INFO L226 Difference]: Without dead ends: 5356 [2022-02-20 18:24:59,350 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:24:59,350 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 774 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:24:59,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [774 Valid, 1196 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:24:59,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5356 states. [2022-02-20 18:25:00,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5356 to 2452. [2022-02-20 18:25:00,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:25:00,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5356 states. Second operand has 2452 states, 2451 states have (on average 1.5968992248062015) internal successors, (3914), 2451 states have internal predecessors, (3914), 0 states have call successors, (0), 0 states have 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:25:00,135 INFO L74 IsIncluded]: Start isIncluded. First operand 5356 states. Second operand has 2452 states, 2451 states have (on average 1.5968992248062015) internal successors, (3914), 2451 states have internal predecessors, (3914), 0 states have call successors, (0), 0 states have 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:25:00,137 INFO L87 Difference]: Start difference. First operand 5356 states. Second operand has 2452 states, 2451 states have (on average 1.5968992248062015) internal successors, (3914), 2451 states have internal predecessors, (3914), 0 states have call successors, (0), 0 states have 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:25:00,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:25:00,917 INFO L93 Difference]: Finished difference Result 5356 states and 8631 transitions. [2022-02-20 18:25:00,917 INFO L276 IsEmpty]: Start isEmpty. Operand 5356 states and 8631 transitions. [2022-02-20 18:25:00,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:25:00,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:25:00,929 INFO L74 IsIncluded]: Start isIncluded. First operand has 2452 states, 2451 states have (on average 1.5968992248062015) internal successors, (3914), 2451 states have internal predecessors, (3914), 0 states have call successors, (0), 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 5356 states. [2022-02-20 18:25:00,933 INFO L87 Difference]: Start difference. First operand has 2452 states, 2451 states have (on average 1.5968992248062015) internal successors, (3914), 2451 states have internal predecessors, (3914), 0 states have call successors, (0), 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 5356 states. [2022-02-20 18:25:01,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:25:01,710 INFO L93 Difference]: Finished difference Result 5356 states and 8631 transitions. [2022-02-20 18:25:01,710 INFO L276 IsEmpty]: Start isEmpty. Operand 5356 states and 8631 transitions. [2022-02-20 18:25:01,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:25:01,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:25:01,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:25:01,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:25:01,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2452 states, 2451 states have (on average 1.5968992248062015) internal successors, (3914), 2451 states have internal predecessors, (3914), 0 states have call successors, (0), 0 states have 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:25:01,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2452 states to 2452 states and 3914 transitions. [2022-02-20 18:25:01,934 INFO L78 Accepts]: Start accepts. Automaton has 2452 states and 3914 transitions. Word has length 69 [2022-02-20 18:25:01,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:25:01,934 INFO L470 AbstractCegarLoop]: Abstraction has 2452 states and 3914 transitions. [2022-02-20 18:25:01,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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:25:01,934 INFO L276 IsEmpty]: Start isEmpty. Operand 2452 states and 3914 transitions. [2022-02-20 18:25:01,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-20 18:25:01,935 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:25:01,935 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:25:01,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:25:01,935 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:25:01,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:25:01,936 INFO L85 PathProgramCache]: Analyzing trace with hash -577605759, now seen corresponding path program 1 times [2022-02-20 18:25:01,936 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:25:01,936 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185094888] [2022-02-20 18:25:01,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:25:01,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:25:01,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:25:01,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {40207#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(37, 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;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {40207#true} is VALID [2022-02-20 18:25:01,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {40207#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~ret37#1, main_#t~ret38#1, main_#t~post39#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;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~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;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#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; {40207#true} is VALID [2022-02-20 18:25:01,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {40207#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {40207#true} is VALID [2022-02-20 18:25:01,990 INFO L290 TraceCheckUtils]: 3: Hoare triple {40207#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {40207#true} is VALID [2022-02-20 18:25:01,990 INFO L290 TraceCheckUtils]: 4: Hoare triple {40207#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {40207#true} is VALID [2022-02-20 18:25:01,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {40207#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {40207#true} is VALID [2022-02-20 18:25:01,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {40207#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {40207#true} is VALID [2022-02-20 18:25:01,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {40207#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {40207#true} is VALID [2022-02-20 18:25:01,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {40207#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {40207#true} is VALID [2022-02-20 18:25:01,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {40207#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {40207#true} is VALID [2022-02-20 18:25:01,991 INFO L290 TraceCheckUtils]: 10: Hoare triple {40207#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {40207#true} is VALID [2022-02-20 18:25:01,991 INFO L290 TraceCheckUtils]: 11: Hoare triple {40207#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {40207#true} is VALID [2022-02-20 18:25:01,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {40207#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {40207#true} is VALID [2022-02-20 18:25:01,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {40207#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {40207#true} is VALID [2022-02-20 18:25:01,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {40207#true} assume ~id1~0 != ~id2~0; {40207#true} is VALID [2022-02-20 18:25:01,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {40207#true} assume ~id1~0 != ~id3~0; {40207#true} is VALID [2022-02-20 18:25:01,992 INFO L290 TraceCheckUtils]: 16: Hoare triple {40207#true} assume ~id2~0 != ~id3~0; {40207#true} is VALID [2022-02-20 18:25:01,992 INFO L290 TraceCheckUtils]: 17: Hoare triple {40207#true} assume ~id1~0 >= 0; {40207#true} is VALID [2022-02-20 18:25:01,992 INFO L290 TraceCheckUtils]: 18: Hoare triple {40207#true} assume ~id2~0 >= 0; {40207#true} is VALID [2022-02-20 18:25:01,993 INFO L290 TraceCheckUtils]: 19: Hoare triple {40207#true} assume ~id3~0 >= 0; {40207#true} is VALID [2022-02-20 18:25:01,993 INFO L290 TraceCheckUtils]: 20: Hoare triple {40207#true} assume 0 == ~r1~0; {40207#true} is VALID [2022-02-20 18:25:01,993 INFO L290 TraceCheckUtils]: 21: Hoare triple {40207#true} assume 0 == ~r2~0; {40207#true} is VALID [2022-02-20 18:25:01,993 INFO L290 TraceCheckUtils]: 22: Hoare triple {40207#true} assume 0 == ~r3~0; {40207#true} is VALID [2022-02-20 18:25:01,993 INFO L290 TraceCheckUtils]: 23: Hoare triple {40207#true} assume 0 != init_~r122~0#1 % 256; {40207#true} is VALID [2022-02-20 18:25:01,993 INFO L290 TraceCheckUtils]: 24: Hoare triple {40207#true} assume 0 != init_~r132~0#1 % 256; {40207#true} is VALID [2022-02-20 18:25:01,993 INFO L290 TraceCheckUtils]: 25: Hoare triple {40207#true} assume 0 != init_~r212~0#1 % 256; {40207#true} is VALID [2022-02-20 18:25:01,994 INFO L290 TraceCheckUtils]: 26: Hoare triple {40207#true} assume 0 != init_~r232~0#1 % 256; {40207#true} is VALID [2022-02-20 18:25:01,994 INFO L290 TraceCheckUtils]: 27: Hoare triple {40207#true} assume 0 != init_~r312~0#1 % 256; {40207#true} is VALID [2022-02-20 18:25:01,994 INFO L290 TraceCheckUtils]: 28: Hoare triple {40207#true} assume 0 != init_~r322~0#1 % 256; {40207#true} is VALID [2022-02-20 18:25:01,994 INFO L290 TraceCheckUtils]: 29: Hoare triple {40207#true} assume ~max1~0 == ~id1~0; {40207#true} is VALID [2022-02-20 18:25:01,994 INFO L290 TraceCheckUtils]: 30: Hoare triple {40207#true} assume ~max2~0 == ~id2~0; {40207#true} is VALID [2022-02-20 18:25:01,994 INFO L290 TraceCheckUtils]: 31: Hoare triple {40207#true} assume ~max3~0 == ~id3~0; {40207#true} is VALID [2022-02-20 18:25:01,995 INFO L290 TraceCheckUtils]: 32: Hoare triple {40207#true} assume 0 == ~st1~0; {40209#(<= ~st1~0 0)} is VALID [2022-02-20 18:25:01,995 INFO L290 TraceCheckUtils]: 33: Hoare triple {40209#(<= ~st1~0 0)} assume 0 == ~st2~0; {40209#(<= ~st1~0 0)} is VALID [2022-02-20 18:25:01,995 INFO L290 TraceCheckUtils]: 34: Hoare triple {40209#(<= ~st1~0 0)} assume 0 == ~st3~0; {40209#(<= ~st1~0 0)} is VALID [2022-02-20 18:25:01,996 INFO L290 TraceCheckUtils]: 35: Hoare triple {40209#(<= ~st1~0 0)} assume 0 == ~nl1~0; {40210#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:01,996 INFO L290 TraceCheckUtils]: 36: Hoare triple {40210#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl2~0; {40210#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:01,996 INFO L290 TraceCheckUtils]: 37: Hoare triple {40210#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl3~0; {40210#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:01,997 INFO L290 TraceCheckUtils]: 38: Hoare triple {40210#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {40210#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:01,997 INFO L290 TraceCheckUtils]: 39: Hoare triple {40210#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {40210#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:01,997 INFO L290 TraceCheckUtils]: 40: Hoare triple {40210#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {40210#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:01,998 INFO L290 TraceCheckUtils]: 41: Hoare triple {40210#(<= (+ ~nl1~0 ~st1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {40210#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:01,998 INFO L290 TraceCheckUtils]: 42: Hoare triple {40210#(<= (+ ~nl1~0 ~st1~0) 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; {40210#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:01,998 INFO L290 TraceCheckUtils]: 43: Hoare triple {40210#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 == main_~i2~0#1); {40210#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:01,999 INFO L290 TraceCheckUtils]: 44: Hoare triple {40210#(<= (+ ~nl1~0 ~st1~0) 0)} ~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; {40210#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:01,999 INFO L290 TraceCheckUtils]: 45: Hoare triple {40210#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {40210#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:01,999 INFO L290 TraceCheckUtils]: 46: Hoare triple {40210#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {40210#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:02,000 INFO L290 TraceCheckUtils]: 47: Hoare triple {40210#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r1~0 < 2; {40210#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:02,000 INFO L290 TraceCheckUtils]: 48: Hoare triple {40210#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep12~0 % 256); {40210#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:02,000 INFO L290 TraceCheckUtils]: 49: Hoare triple {40210#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep13~0 % 256); {40210#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:02,001 INFO L290 TraceCheckUtils]: 50: Hoare triple {40210#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode1~0 := 1; {40210#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:02,001 INFO L290 TraceCheckUtils]: 51: Hoare triple {40210#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {40210#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:02,001 INFO L290 TraceCheckUtils]: 52: Hoare triple {40210#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {40210#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:02,002 INFO L290 TraceCheckUtils]: 53: Hoare triple {40210#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r2~0 < 2; {40210#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:02,002 INFO L290 TraceCheckUtils]: 54: Hoare triple {40210#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep21~0 % 256); {40210#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:02,002 INFO L290 TraceCheckUtils]: 55: Hoare triple {40210#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep23~0 % 256); {40210#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:02,003 INFO L290 TraceCheckUtils]: 56: Hoare triple {40210#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode2~0 := 1; {40210#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:02,003 INFO L290 TraceCheckUtils]: 57: Hoare triple {40210#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {40210#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:02,003 INFO L290 TraceCheckUtils]: 58: Hoare triple {40210#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {40210#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:02,004 INFO L290 TraceCheckUtils]: 59: Hoare triple {40210#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r3~0 < 2; {40210#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:02,004 INFO L290 TraceCheckUtils]: 60: Hoare triple {40210#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep31~0 % 256); {40210#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:02,004 INFO L290 TraceCheckUtils]: 61: Hoare triple {40210#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep32~0 % 256); {40210#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:02,005 INFO L290 TraceCheckUtils]: 62: Hoare triple {40210#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode3~0 := 1; {40210#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:02,005 INFO L290 TraceCheckUtils]: 63: Hoare triple {40210#(<= (+ ~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; {40210#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:02,005 INFO L290 TraceCheckUtils]: 64: Hoare triple {40210#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {40210#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:25:02,006 INFO L290 TraceCheckUtils]: 65: Hoare triple {40210#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(~st1~0 + ~nl1~0 <= 1);check_~tmp~1#1 := 0; {40208#false} is VALID [2022-02-20 18:25:02,006 INFO L290 TraceCheckUtils]: 66: Hoare triple {40208#false} check_#res#1 := check_~tmp~1#1; {40208#false} is VALID [2022-02-20 18:25:02,006 INFO L290 TraceCheckUtils]: 67: Hoare triple {40208#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#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; {40208#false} is VALID [2022-02-20 18:25:02,006 INFO L290 TraceCheckUtils]: 68: Hoare triple {40208#false} assume 0 == assert_~arg#1 % 256; {40208#false} is VALID [2022-02-20 18:25:02,007 INFO L290 TraceCheckUtils]: 69: Hoare triple {40208#false} assume !false; {40208#false} is VALID [2022-02-20 18:25:02,007 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:25:02,007 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:25:02,007 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185094888] [2022-02-20 18:25:02,007 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185094888] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:25:02,007 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:25:02,008 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:25:02,008 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681651072] [2022-02-20 18:25:02,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:25:02,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 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:25:02,009 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:25:02,009 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 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:25:02,057 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:25:02,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:25:02,057 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:25:02,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:25:02,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:25:02,058 INFO L87 Difference]: Start difference. First operand 2452 states and 3914 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 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:25:06,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:25:06,238 INFO L93 Difference]: Finished difference Result 7943 states and 12835 transitions. [2022-02-20 18:25:06,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:25:06,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 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:25:06,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:25:06,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 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:25:06,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 547 transitions. [2022-02-20 18:25:06,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 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:25:06,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 547 transitions. [2022-02-20 18:25:06,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 547 transitions. [2022-02-20 18:25:06,582 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 547 edges. 547 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:25:07,515 INFO L225 Difference]: With dead ends: 7943 [2022-02-20 18:25:07,515 INFO L226 Difference]: Without dead ends: 5570 [2022-02-20 18:25:07,519 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:25:07,519 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 338 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 626 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:25:07,520 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [338 Valid, 626 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:25:07,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5570 states. [2022-02-20 18:25:08,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5570 to 3992. [2022-02-20 18:25:08,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:25:08,797 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5570 states. Second operand has 3992 states, 3991 states have (on average 1.5995990979704335) internal successors, (6384), 3991 states have internal predecessors, (6384), 0 states have call successors, (0), 0 states have 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:25:08,802 INFO L74 IsIncluded]: Start isIncluded. First operand 5570 states. Second operand has 3992 states, 3991 states have (on average 1.5995990979704335) internal successors, (6384), 3991 states have internal predecessors, (6384), 0 states have call successors, (0), 0 states have 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:25:08,807 INFO L87 Difference]: Start difference. First operand 5570 states. Second operand has 3992 states, 3991 states have (on average 1.5995990979704335) internal successors, (6384), 3991 states have internal predecessors, (6384), 0 states have call successors, (0), 0 states have 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:25:09,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:25:09,647 INFO L93 Difference]: Finished difference Result 5570 states and 8975 transitions. [2022-02-20 18:25:09,647 INFO L276 IsEmpty]: Start isEmpty. Operand 5570 states and 8975 transitions. [2022-02-20 18:25:09,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:25:09,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:25:09,659 INFO L74 IsIncluded]: Start isIncluded. First operand has 3992 states, 3991 states have (on average 1.5995990979704335) internal successors, (6384), 3991 states have internal predecessors, (6384), 0 states have call successors, (0), 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 5570 states. [2022-02-20 18:25:09,664 INFO L87 Difference]: Start difference. First operand has 3992 states, 3991 states have (on average 1.5995990979704335) internal successors, (6384), 3991 states have internal predecessors, (6384), 0 states have call successors, (0), 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 5570 states. [2022-02-20 18:25:10,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:25:10,545 INFO L93 Difference]: Finished difference Result 5570 states and 8975 transitions. [2022-02-20 18:25:10,545 INFO L276 IsEmpty]: Start isEmpty. Operand 5570 states and 8975 transitions. [2022-02-20 18:25:10,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:25:10,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:25:10,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:25:10,550 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:25:10,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3992 states, 3991 states have (on average 1.5995990979704335) internal successors, (6384), 3991 states have internal predecessors, (6384), 0 states have call successors, (0), 0 states have 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:25:11,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3992 states to 3992 states and 6384 transitions. [2022-02-20 18:25:11,058 INFO L78 Accepts]: Start accepts. Automaton has 3992 states and 6384 transitions. Word has length 70 [2022-02-20 18:25:11,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:25:11,058 INFO L470 AbstractCegarLoop]: Abstraction has 3992 states and 6384 transitions. [2022-02-20 18:25:11,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 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:25:11,058 INFO L276 IsEmpty]: Start isEmpty. Operand 3992 states and 6384 transitions. [2022-02-20 18:25:11,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-02-20 18:25:11,059 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:25:11,059 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:25:11,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:25:11,059 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:25:11,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:25:11,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1815229649, now seen corresponding path program 1 times [2022-02-20 18:25:11,060 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:25:11,060 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227235656] [2022-02-20 18:25:11,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:25:11,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:25:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:25:11,112 INFO L290 TraceCheckUtils]: 0: Hoare triple {65315#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(37, 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;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {65315#true} is VALID [2022-02-20 18:25:11,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {65315#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~ret37#1, main_#t~ret38#1, main_#t~post39#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;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~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;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#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; {65315#true} is VALID [2022-02-20 18:25:11,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {65315#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {65315#true} is VALID [2022-02-20 18:25:11,113 INFO L290 TraceCheckUtils]: 3: Hoare triple {65315#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {65315#true} is VALID [2022-02-20 18:25:11,113 INFO L290 TraceCheckUtils]: 4: Hoare triple {65315#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {65315#true} is VALID [2022-02-20 18:25:11,113 INFO L290 TraceCheckUtils]: 5: Hoare triple {65315#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {65315#true} is VALID [2022-02-20 18:25:11,113 INFO L290 TraceCheckUtils]: 6: Hoare triple {65315#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {65315#true} is VALID [2022-02-20 18:25:11,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {65315#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {65315#true} is VALID [2022-02-20 18:25:11,114 INFO L290 TraceCheckUtils]: 8: Hoare triple {65315#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {65315#true} is VALID [2022-02-20 18:25:11,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {65315#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {65315#true} is VALID [2022-02-20 18:25:11,114 INFO L290 TraceCheckUtils]: 10: Hoare triple {65315#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {65315#true} is VALID [2022-02-20 18:25:11,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {65315#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {65315#true} is VALID [2022-02-20 18:25:11,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {65315#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {65315#true} is VALID [2022-02-20 18:25:11,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {65315#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {65315#true} is VALID [2022-02-20 18:25:11,114 INFO L290 TraceCheckUtils]: 14: Hoare triple {65315#true} assume ~id1~0 != ~id2~0; {65315#true} is VALID [2022-02-20 18:25:11,114 INFO L290 TraceCheckUtils]: 15: Hoare triple {65315#true} assume ~id1~0 != ~id3~0; {65315#true} is VALID [2022-02-20 18:25:11,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {65315#true} assume ~id2~0 != ~id3~0; {65315#true} is VALID [2022-02-20 18:25:11,115 INFO L290 TraceCheckUtils]: 17: Hoare triple {65315#true} assume ~id1~0 >= 0; {65315#true} is VALID [2022-02-20 18:25:11,115 INFO L290 TraceCheckUtils]: 18: Hoare triple {65315#true} assume ~id2~0 >= 0; {65315#true} is VALID [2022-02-20 18:25:11,115 INFO L290 TraceCheckUtils]: 19: Hoare triple {65315#true} assume ~id3~0 >= 0; {65315#true} is VALID [2022-02-20 18:25:11,115 INFO L290 TraceCheckUtils]: 20: Hoare triple {65315#true} assume 0 == ~r1~0; {65315#true} is VALID [2022-02-20 18:25:11,115 INFO L290 TraceCheckUtils]: 21: Hoare triple {65315#true} assume 0 == ~r2~0; {65315#true} is VALID [2022-02-20 18:25:11,115 INFO L290 TraceCheckUtils]: 22: Hoare triple {65315#true} assume 0 == ~r3~0; {65315#true} is VALID [2022-02-20 18:25:11,116 INFO L290 TraceCheckUtils]: 23: Hoare triple {65315#true} assume 0 != init_~r122~0#1 % 256; {65315#true} is VALID [2022-02-20 18:25:11,116 INFO L290 TraceCheckUtils]: 24: Hoare triple {65315#true} assume 0 != init_~r132~0#1 % 256; {65315#true} is VALID [2022-02-20 18:25:11,116 INFO L290 TraceCheckUtils]: 25: Hoare triple {65315#true} assume 0 != init_~r212~0#1 % 256; {65315#true} is VALID [2022-02-20 18:25:11,116 INFO L290 TraceCheckUtils]: 26: Hoare triple {65315#true} assume 0 != init_~r232~0#1 % 256; {65315#true} is VALID [2022-02-20 18:25:11,116 INFO L290 TraceCheckUtils]: 27: Hoare triple {65315#true} assume 0 != init_~r312~0#1 % 256; {65315#true} is VALID [2022-02-20 18:25:11,116 INFO L290 TraceCheckUtils]: 28: Hoare triple {65315#true} assume 0 != init_~r322~0#1 % 256; {65315#true} is VALID [2022-02-20 18:25:11,116 INFO L290 TraceCheckUtils]: 29: Hoare triple {65315#true} assume ~max1~0 == ~id1~0; {65315#true} is VALID [2022-02-20 18:25:11,117 INFO L290 TraceCheckUtils]: 30: Hoare triple {65315#true} assume ~max2~0 == ~id2~0; {65315#true} is VALID [2022-02-20 18:25:11,117 INFO L290 TraceCheckUtils]: 31: Hoare triple {65315#true} assume ~max3~0 == ~id3~0; {65315#true} is VALID [2022-02-20 18:25:11,117 INFO L290 TraceCheckUtils]: 32: Hoare triple {65315#true} assume 0 == ~st1~0; {65315#true} is VALID [2022-02-20 18:25:11,117 INFO L290 TraceCheckUtils]: 33: Hoare triple {65315#true} assume 0 == ~st2~0; {65317#(<= ~st2~0 0)} is VALID [2022-02-20 18:25:11,118 INFO L290 TraceCheckUtils]: 34: Hoare triple {65317#(<= ~st2~0 0)} assume 0 == ~st3~0; {65317#(<= ~st2~0 0)} is VALID [2022-02-20 18:25:11,118 INFO L290 TraceCheckUtils]: 35: Hoare triple {65317#(<= ~st2~0 0)} assume 0 == ~nl1~0; {65317#(<= ~st2~0 0)} is VALID [2022-02-20 18:25:11,118 INFO L290 TraceCheckUtils]: 36: Hoare triple {65317#(<= ~st2~0 0)} assume 0 == ~nl2~0; {65318#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:11,119 INFO L290 TraceCheckUtils]: 37: Hoare triple {65318#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~nl3~0; {65318#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:11,119 INFO L290 TraceCheckUtils]: 38: Hoare triple {65318#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode1~0 % 256; {65318#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:11,120 INFO L290 TraceCheckUtils]: 39: Hoare triple {65318#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode2~0 % 256; {65318#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:11,120 INFO L290 TraceCheckUtils]: 40: Hoare triple {65318#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {65318#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:11,120 INFO L290 TraceCheckUtils]: 41: Hoare triple {65318#(<= (+ ~nl2~0 ~st2~0) 0)} init_#res#1 := init_~tmp___5~0#1; {65318#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:11,121 INFO L290 TraceCheckUtils]: 42: Hoare triple {65318#(<= (+ ~nl2~0 ~st2~0) 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; {65318#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:11,121 INFO L290 TraceCheckUtils]: 43: Hoare triple {65318#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 == main_~i2~0#1); {65318#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:11,122 INFO L290 TraceCheckUtils]: 44: Hoare triple {65318#(<= (+ ~nl2~0 ~st2~0) 0)} ~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; {65318#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:11,122 INFO L290 TraceCheckUtils]: 45: Hoare triple {65318#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {65318#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:11,122 INFO L290 TraceCheckUtils]: 46: Hoare triple {65318#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode1~0 % 256); {65318#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:11,123 INFO L290 TraceCheckUtils]: 47: Hoare triple {65318#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r1~0 < 2; {65318#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:11,123 INFO L290 TraceCheckUtils]: 48: Hoare triple {65318#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep12~0 % 256); {65318#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:11,124 INFO L290 TraceCheckUtils]: 49: Hoare triple {65318#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep13~0 % 256); {65318#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:11,124 INFO L290 TraceCheckUtils]: 50: Hoare triple {65318#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode1~0 := 1; {65318#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:11,124 INFO L290 TraceCheckUtils]: 51: Hoare triple {65318#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {65318#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:11,125 INFO L290 TraceCheckUtils]: 52: Hoare triple {65318#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode2~0 % 256); {65318#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:11,125 INFO L290 TraceCheckUtils]: 53: Hoare triple {65318#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r2~0 < 2; {65318#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:11,126 INFO L290 TraceCheckUtils]: 54: Hoare triple {65318#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep21~0 % 256); {65318#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:11,126 INFO L290 TraceCheckUtils]: 55: Hoare triple {65318#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep23~0 % 256); {65318#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:11,126 INFO L290 TraceCheckUtils]: 56: Hoare triple {65318#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode2~0 := 1; {65318#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:11,127 INFO L290 TraceCheckUtils]: 57: Hoare triple {65318#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {65318#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:11,127 INFO L290 TraceCheckUtils]: 58: Hoare triple {65318#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode3~0 % 256); {65318#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:11,127 INFO L290 TraceCheckUtils]: 59: Hoare triple {65318#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r3~0 < 2; {65318#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:11,128 INFO L290 TraceCheckUtils]: 60: Hoare triple {65318#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep31~0 % 256); {65318#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:11,128 INFO L290 TraceCheckUtils]: 61: Hoare triple {65318#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep32~0 % 256); {65318#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:11,129 INFO L290 TraceCheckUtils]: 62: Hoare triple {65318#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode3~0 := 1; {65318#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:11,129 INFO L290 TraceCheckUtils]: 63: Hoare triple {65318#(<= (+ ~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; {65318#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:11,130 INFO L290 TraceCheckUtils]: 64: Hoare triple {65318#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {65318#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:11,130 INFO L290 TraceCheckUtils]: 65: Hoare triple {65318#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {65318#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:25:11,130 INFO L290 TraceCheckUtils]: 66: Hoare triple {65318#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(~st2~0 + ~nl2~0 <= 1);check_~tmp~1#1 := 0; {65316#false} is VALID [2022-02-20 18:25:11,131 INFO L290 TraceCheckUtils]: 67: Hoare triple {65316#false} check_#res#1 := check_~tmp~1#1; {65316#false} is VALID [2022-02-20 18:25:11,131 INFO L290 TraceCheckUtils]: 68: Hoare triple {65316#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#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; {65316#false} is VALID [2022-02-20 18:25:11,131 INFO L290 TraceCheckUtils]: 69: Hoare triple {65316#false} assume 0 == assert_~arg#1 % 256; {65316#false} is VALID [2022-02-20 18:25:11,131 INFO L290 TraceCheckUtils]: 70: Hoare triple {65316#false} assume !false; {65316#false} is VALID [2022-02-20 18:25:11,131 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:25:11,132 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:25:11,132 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227235656] [2022-02-20 18:25:11,132 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227235656] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:25:11,132 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:25:11,132 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:25:11,132 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900851245] [2022-02-20 18:25:11,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:25:11,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2022-02-20 18:25:11,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:25:11,133 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have 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:25:11,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:25:11,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:25:11,187 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:25:11,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:25:11,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:25:11,188 INFO L87 Difference]: Start difference. First operand 3992 states and 6384 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have 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:25:20,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:25:20,476 INFO L93 Difference]: Finished difference Result 12755 states and 20495 transitions. [2022-02-20 18:25:20,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:25:20,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2022-02-20 18:25:20,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:25:20,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have 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:25:20,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 547 transitions. [2022-02-20 18:25:20,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have 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:25:20,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 547 transitions. [2022-02-20 18:25:20,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 547 transitions. [2022-02-20 18:25:20,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 547 edges. 547 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:25:23,213 INFO L225 Difference]: With dead ends: 12755 [2022-02-20 18:25:23,213 INFO L226 Difference]: Without dead ends: 8842 [2022-02-20 18:25:23,217 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:25:23,218 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 336 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 623 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:25:23,218 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 623 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:25:23,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8842 states. [2022-02-20 18:25:25,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8842 to 6388. [2022-02-20 18:25:25,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:25:25,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8842 states. Second operand has 6388 states, 6387 states have (on average 1.5913574448097698) internal successors, (10164), 6387 states have internal predecessors, (10164), 0 states have call successors, (0), 0 states have 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:25:25,827 INFO L74 IsIncluded]: Start isIncluded. First operand 8842 states. Second operand has 6388 states, 6387 states have (on average 1.5913574448097698) internal successors, (10164), 6387 states have internal predecessors, (10164), 0 states have call successors, (0), 0 states have 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:25:25,834 INFO L87 Difference]: Start difference. First operand 8842 states. Second operand has 6388 states, 6387 states have (on average 1.5913574448097698) internal successors, (10164), 6387 states have internal predecessors, (10164), 0 states have call successors, (0), 0 states have 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:25:27,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:25:27,792 INFO L93 Difference]: Finished difference Result 8842 states and 14135 transitions. [2022-02-20 18:25:27,792 INFO L276 IsEmpty]: Start isEmpty. Operand 8842 states and 14135 transitions. [2022-02-20 18:25:27,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:25:27,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:25:27,808 INFO L74 IsIncluded]: Start isIncluded. First operand has 6388 states, 6387 states have (on average 1.5913574448097698) internal successors, (10164), 6387 states have internal predecessors, (10164), 0 states have call successors, (0), 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 8842 states. [2022-02-20 18:25:27,816 INFO L87 Difference]: Start difference. First operand has 6388 states, 6387 states have (on average 1.5913574448097698) internal successors, (10164), 6387 states have internal predecessors, (10164), 0 states have call successors, (0), 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 8842 states. [2022-02-20 18:25:30,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:25:30,033 INFO L93 Difference]: Finished difference Result 8842 states and 14135 transitions. [2022-02-20 18:25:30,033 INFO L276 IsEmpty]: Start isEmpty. Operand 8842 states and 14135 transitions. [2022-02-20 18:25:30,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:25:30,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:25:30,043 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:25:30,043 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:25:30,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6388 states, 6387 states have (on average 1.5913574448097698) internal successors, (10164), 6387 states have internal predecessors, (10164), 0 states have call successors, (0), 0 states have 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:25:31,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6388 states to 6388 states and 10164 transitions. [2022-02-20 18:25:31,461 INFO L78 Accepts]: Start accepts. Automaton has 6388 states and 10164 transitions. Word has length 71 [2022-02-20 18:25:31,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:25:31,461 INFO L470 AbstractCegarLoop]: Abstraction has 6388 states and 10164 transitions. [2022-02-20 18:25:31,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have 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:25:31,461 INFO L276 IsEmpty]: Start isEmpty. Operand 6388 states and 10164 transitions. [2022-02-20 18:25:31,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 18:25:31,461 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:25:31,462 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:25:31,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:25:31,462 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:25:31,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:25:31,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1147279688, now seen corresponding path program 1 times [2022-02-20 18:25:31,463 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:25:31,463 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689464842] [2022-02-20 18:25:31,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:25:31,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:25:31,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:25:31,525 INFO L290 TraceCheckUtils]: 0: Hoare triple {105435#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(37, 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;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; {105435#true} is VALID [2022-02-20 18:25:31,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {105435#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~ret37#1, main_#t~ret38#1, main_#t~post39#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;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~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;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#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; {105435#true} is VALID [2022-02-20 18:25:31,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {105435#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {105435#true} is VALID [2022-02-20 18:25:31,525 INFO L290 TraceCheckUtils]: 3: Hoare triple {105435#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {105435#true} is VALID [2022-02-20 18:25:31,525 INFO L290 TraceCheckUtils]: 4: Hoare triple {105435#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {105435#true} is VALID [2022-02-20 18:25:31,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {105435#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {105435#true} is VALID [2022-02-20 18:25:31,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {105435#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {105435#true} is VALID [2022-02-20 18:25:31,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {105435#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {105435#true} is VALID [2022-02-20 18:25:31,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {105435#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {105435#true} is VALID [2022-02-20 18:25:31,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {105435#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {105435#true} is VALID [2022-02-20 18:25:31,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {105435#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {105435#true} is VALID [2022-02-20 18:25:31,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {105435#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {105435#true} is VALID [2022-02-20 18:25:31,527 INFO L290 TraceCheckUtils]: 12: Hoare triple {105435#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {105435#true} is VALID [2022-02-20 18:25:31,527 INFO L290 TraceCheckUtils]: 13: Hoare triple {105435#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {105435#true} is VALID [2022-02-20 18:25:31,527 INFO L290 TraceCheckUtils]: 14: Hoare triple {105435#true} assume ~id1~0 != ~id2~0; {105435#true} is VALID [2022-02-20 18:25:31,527 INFO L290 TraceCheckUtils]: 15: Hoare triple {105435#true} assume ~id1~0 != ~id3~0; {105435#true} is VALID [2022-02-20 18:25:31,527 INFO L290 TraceCheckUtils]: 16: Hoare triple {105435#true} assume ~id2~0 != ~id3~0; {105435#true} is VALID [2022-02-20 18:25:31,527 INFO L290 TraceCheckUtils]: 17: Hoare triple {105435#true} assume ~id1~0 >= 0; {105435#true} is VALID [2022-02-20 18:25:31,527 INFO L290 TraceCheckUtils]: 18: Hoare triple {105435#true} assume ~id2~0 >= 0; {105435#true} is VALID [2022-02-20 18:25:31,528 INFO L290 TraceCheckUtils]: 19: Hoare triple {105435#true} assume ~id3~0 >= 0; {105435#true} is VALID [2022-02-20 18:25:31,528 INFO L290 TraceCheckUtils]: 20: Hoare triple {105435#true} assume 0 == ~r1~0; {105435#true} is VALID [2022-02-20 18:25:31,528 INFO L290 TraceCheckUtils]: 21: Hoare triple {105435#true} assume 0 == ~r2~0; {105435#true} is VALID [2022-02-20 18:25:31,528 INFO L290 TraceCheckUtils]: 22: Hoare triple {105435#true} assume 0 == ~r3~0; {105435#true} is VALID [2022-02-20 18:25:31,528 INFO L290 TraceCheckUtils]: 23: Hoare triple {105435#true} assume 0 != init_~r122~0#1 % 256; {105435#true} is VALID [2022-02-20 18:25:31,528 INFO L290 TraceCheckUtils]: 24: Hoare triple {105435#true} assume 0 != init_~r132~0#1 % 256; {105435#true} is VALID [2022-02-20 18:25:31,528 INFO L290 TraceCheckUtils]: 25: Hoare triple {105435#true} assume 0 != init_~r212~0#1 % 256; {105435#true} is VALID [2022-02-20 18:25:31,529 INFO L290 TraceCheckUtils]: 26: Hoare triple {105435#true} assume 0 != init_~r232~0#1 % 256; {105435#true} is VALID [2022-02-20 18:25:31,529 INFO L290 TraceCheckUtils]: 27: Hoare triple {105435#true} assume 0 != init_~r312~0#1 % 256; {105435#true} is VALID [2022-02-20 18:25:31,529 INFO L290 TraceCheckUtils]: 28: Hoare triple {105435#true} assume 0 != init_~r322~0#1 % 256; {105435#true} is VALID [2022-02-20 18:25:31,529 INFO L290 TraceCheckUtils]: 29: Hoare triple {105435#true} assume ~max1~0 == ~id1~0; {105435#true} is VALID [2022-02-20 18:25:31,529 INFO L290 TraceCheckUtils]: 30: Hoare triple {105435#true} assume ~max2~0 == ~id2~0; {105435#true} is VALID [2022-02-20 18:25:31,529 INFO L290 TraceCheckUtils]: 31: Hoare triple {105435#true} assume ~max3~0 == ~id3~0; {105435#true} is VALID [2022-02-20 18:25:31,529 INFO L290 TraceCheckUtils]: 32: Hoare triple {105435#true} assume 0 == ~st1~0; {105435#true} is VALID [2022-02-20 18:25:31,530 INFO L290 TraceCheckUtils]: 33: Hoare triple {105435#true} assume 0 == ~st2~0; {105435#true} is VALID [2022-02-20 18:25:31,530 INFO L290 TraceCheckUtils]: 34: Hoare triple {105435#true} assume 0 == ~st3~0; {105437#(<= ~st3~0 0)} is VALID [2022-02-20 18:25:31,530 INFO L290 TraceCheckUtils]: 35: Hoare triple {105437#(<= ~st3~0 0)} assume 0 == ~nl1~0; {105437#(<= ~st3~0 0)} is VALID [2022-02-20 18:25:31,531 INFO L290 TraceCheckUtils]: 36: Hoare triple {105437#(<= ~st3~0 0)} assume 0 == ~nl2~0; {105437#(<= ~st3~0 0)} is VALID [2022-02-20 18:25:31,531 INFO L290 TraceCheckUtils]: 37: Hoare triple {105437#(<= ~st3~0 0)} assume 0 == ~nl3~0; {105438#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:31,531 INFO L290 TraceCheckUtils]: 38: Hoare triple {105438#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode1~0 % 256; {105438#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:31,532 INFO L290 TraceCheckUtils]: 39: Hoare triple {105438#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode2~0 % 256; {105438#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:31,532 INFO L290 TraceCheckUtils]: 40: Hoare triple {105438#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {105438#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:31,533 INFO L290 TraceCheckUtils]: 41: Hoare triple {105438#(<= (+ ~nl3~0 ~st3~0) 0)} init_#res#1 := init_~tmp___5~0#1; {105438#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:31,533 INFO L290 TraceCheckUtils]: 42: Hoare triple {105438#(<= (+ ~nl3~0 ~st3~0) 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; {105438#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:31,533 INFO L290 TraceCheckUtils]: 43: Hoare triple {105438#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 == main_~i2~0#1); {105438#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:31,534 INFO L290 TraceCheckUtils]: 44: Hoare triple {105438#(<= (+ ~nl3~0 ~st3~0) 0)} ~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; {105438#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:31,534 INFO L290 TraceCheckUtils]: 45: Hoare triple {105438#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {105438#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:31,534 INFO L290 TraceCheckUtils]: 46: Hoare triple {105438#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode1~0 % 256); {105438#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:31,535 INFO L290 TraceCheckUtils]: 47: Hoare triple {105438#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r1~0 < 2; {105438#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:31,535 INFO L290 TraceCheckUtils]: 48: Hoare triple {105438#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep12~0 % 256); {105438#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:31,536 INFO L290 TraceCheckUtils]: 49: Hoare triple {105438#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep13~0 % 256); {105438#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:31,536 INFO L290 TraceCheckUtils]: 50: Hoare triple {105438#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode1~0 := 1; {105438#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:31,536 INFO L290 TraceCheckUtils]: 51: Hoare triple {105438#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {105438#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:31,537 INFO L290 TraceCheckUtils]: 52: Hoare triple {105438#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode2~0 % 256); {105438#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:31,537 INFO L290 TraceCheckUtils]: 53: Hoare triple {105438#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r2~0 < 2; {105438#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:31,537 INFO L290 TraceCheckUtils]: 54: Hoare triple {105438#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep21~0 % 256); {105438#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:31,538 INFO L290 TraceCheckUtils]: 55: Hoare triple {105438#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep23~0 % 256); {105438#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:31,538 INFO L290 TraceCheckUtils]: 56: Hoare triple {105438#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode2~0 := 1; {105438#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:31,538 INFO L290 TraceCheckUtils]: 57: Hoare triple {105438#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {105438#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:31,539 INFO L290 TraceCheckUtils]: 58: Hoare triple {105438#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode3~0 % 256); {105438#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:31,539 INFO L290 TraceCheckUtils]: 59: Hoare triple {105438#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r3~0 < 2; {105438#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:31,540 INFO L290 TraceCheckUtils]: 60: Hoare triple {105438#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep31~0 % 256); {105438#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:31,540 INFO L290 TraceCheckUtils]: 61: Hoare triple {105438#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep32~0 % 256); {105438#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:31,540 INFO L290 TraceCheckUtils]: 62: Hoare triple {105438#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode3~0 := 1; {105438#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:31,541 INFO L290 TraceCheckUtils]: 63: Hoare triple {105438#(<= (+ ~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; {105438#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:31,541 INFO L290 TraceCheckUtils]: 64: Hoare triple {105438#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {105438#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:31,542 INFO L290 TraceCheckUtils]: 65: Hoare triple {105438#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {105438#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:31,542 INFO L290 TraceCheckUtils]: 66: Hoare triple {105438#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st2~0 + ~nl2~0 <= 1; {105438#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:25:31,542 INFO L290 TraceCheckUtils]: 67: Hoare triple {105438#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(~st3~0 + ~nl3~0 <= 1);check_~tmp~1#1 := 0; {105436#false} is VALID [2022-02-20 18:25:31,543 INFO L290 TraceCheckUtils]: 68: Hoare triple {105436#false} check_#res#1 := check_~tmp~1#1; {105436#false} is VALID [2022-02-20 18:25:31,543 INFO L290 TraceCheckUtils]: 69: Hoare triple {105436#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#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; {105436#false} is VALID [2022-02-20 18:25:31,543 INFO L290 TraceCheckUtils]: 70: Hoare triple {105436#false} assume 0 == assert_~arg#1 % 256; {105436#false} is VALID [2022-02-20 18:25:31,543 INFO L290 TraceCheckUtils]: 71: Hoare triple {105436#false} assume !false; {105436#false} is VALID [2022-02-20 18:25:31,543 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:25:31,544 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:25:31,544 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689464842] [2022-02-20 18:25:31,544 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689464842] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:25:31,544 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:25:31,544 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:25:31,544 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067852371] [2022-02-20 18:25:31,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:25:31,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-02-20 18:25:31,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:25:31,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:25:31,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:25:31,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:25:31,595 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:25:31,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:25:31,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:25:31,597 INFO L87 Difference]: Start difference. First operand 6388 states and 10164 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)