./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label09.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/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label09.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 163b1e4f0aac9bc589d5c69fa383b82ca836f7f4fc72d1577e6f9bf24923b682 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:45:48,234 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:45:48,236 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:45:48,257 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:45:48,258 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:45:48,260 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:45:48,261 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:45:48,264 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:45:48,265 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:45:48,268 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:45:48,268 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:45:48,269 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:45:48,270 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:45:48,271 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:45:48,272 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:45:48,273 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:45:48,274 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:45:48,275 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:45:48,277 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:45:48,280 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:45:48,281 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:45:48,282 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:45:48,283 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:45:48,284 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:45:48,287 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:45:48,287 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:45:48,288 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:45:48,288 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:45:48,289 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:45:48,289 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:45:48,290 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:45:48,291 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:45:48,292 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:45:48,293 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:45:48,293 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:45:48,294 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:45:48,294 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:45:48,294 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:45:48,294 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:45:48,295 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:45:48,295 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:45:48,297 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:45:48,320 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:45:48,322 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:45:48,322 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:45:48,322 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:45:48,323 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:45:48,323 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:45:48,324 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:45:48,324 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:45:48,324 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:45:48,324 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:45:48,325 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:45:48,325 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:45:48,325 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:45:48,325 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:45:48,325 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:45:48,325 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:45:48,325 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:45:48,326 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:45:48,326 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:45:48,326 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:45:48,326 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:45:48,326 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:45:48,326 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:45:48,326 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:45:48,326 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:45:48,327 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:45:48,327 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:45:48,328 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:45:48,328 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:45:48,328 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:45:48,328 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:45:48,328 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:45:48,328 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:45:48,329 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 -> 163b1e4f0aac9bc589d5c69fa383b82ca836f7f4fc72d1577e6f9bf24923b682 [2022-02-20 19:45:48,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:45:48,543 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:45:48,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:45:48,546 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:45:48,546 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:45:48,547 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c [2022-02-20 19:45:48,600 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02002e517/6dd314bf28154f809d42bcd5f4bbb4bf/FLAGb155bfe6c [2022-02-20 19:45:49,140 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:45:49,141 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c [2022-02-20 19:45:49,164 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02002e517/6dd314bf28154f809d42bcd5f4bbb4bf/FLAGb155bfe6c [2022-02-20 19:45:49,623 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02002e517/6dd314bf28154f809d42bcd5f4bbb4bf [2022-02-20 19:45:49,625 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:45:49,625 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:45:49,626 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:45:49,626 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:45:49,628 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:45:49,629 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:45:49" (1/1) ... [2022-02-20 19:45:49,630 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@603e26d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:45:49, skipping insertion in model container [2022-02-20 19:45:49,630 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:45:49" (1/1) ... [2022-02-20 19:45:49,634 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:45:49,718 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:45:50,013 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/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c[11742,11755] [2022-02-20 19:45:50,057 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/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c[19490,19503] [2022-02-20 19:45:50,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:45:50,601 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:45:50,629 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/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c[11742,11755] [2022-02-20 19:45:50,636 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/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c[19490,19503] [2022-02-20 19:45:50,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:45:50,962 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:45:50,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:45:50 WrapperNode [2022-02-20 19:45:50,963 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:45:50,964 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:45:50,964 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:45:50,964 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:45:50,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:45:50" (1/1) ... [2022-02-20 19:45:51,012 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:45:50" (1/1) ... [2022-02-20 19:45:51,366 INFO L137 Inliner]: procedures = 37, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5086 [2022-02-20 19:45:51,366 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:45:51,368 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:45:51,368 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:45:51,368 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:45:51,374 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:45:50" (1/1) ... [2022-02-20 19:45:51,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:45:50" (1/1) ... [2022-02-20 19:45:51,430 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:45:50" (1/1) ... [2022-02-20 19:45:51,451 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:45:50" (1/1) ... [2022-02-20 19:45:51,574 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:45:50" (1/1) ... [2022-02-20 19:45:51,590 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:45:50" (1/1) ... [2022-02-20 19:45:51,613 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:45:50" (1/1) ... [2022-02-20 19:45:51,652 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:45:51,654 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:45:51,654 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:45:51,654 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:45:51,655 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:45:50" (1/1) ... [2022-02-20 19:45:51,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:45:51,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:45:51,700 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 19:45:51,764 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 19:45:51,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:45:51,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:45:51,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:45:51,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:45:51,863 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:45:51,864 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:45:57,950 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:45:57,965 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:45:57,965 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:45:57,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:45:57 BoogieIcfgContainer [2022-02-20 19:45:57,968 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:45:57,971 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:45:57,971 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:45:57,974 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:45:57,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:45:49" (1/3) ... [2022-02-20 19:45:57,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c8fd2ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:45:57, skipping insertion in model container [2022-02-20 19:45:57,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:45:50" (2/3) ... [2022-02-20 19:45:57,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c8fd2ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:45:57, skipping insertion in model container [2022-02-20 19:45:57,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:45:57" (3/3) ... [2022-02-20 19:45:57,976 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c [2022-02-20 19:45:57,979 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:45:57,980 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:45:58,026 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:45:58,037 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 19:45:58,038 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:45:58,069 INFO L276 IsEmpty]: Start isEmpty. Operand has 909 states, 906 states have (on average 1.900662251655629) internal successors, (1722), 908 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:58,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 19:45:58,075 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:45:58,075 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] [2022-02-20 19:45:58,076 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:45:58,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:45:58,081 INFO L85 PathProgramCache]: Analyzing trace with hash -441366565, now seen corresponding path program 1 times [2022-02-20 19:45:58,088 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:45:58,088 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206154973] [2022-02-20 19:45:58,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:45:58,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:45:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:45:58,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {912#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {912#true} is VALID [2022-02-20 19:45:58,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {912#true} is VALID [2022-02-20 19:45:58,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {912#true} is VALID [2022-02-20 19:45:58,261 INFO L290 TraceCheckUtils]: 3: Hoare triple {912#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {912#true} is VALID [2022-02-20 19:45:58,261 INFO L290 TraceCheckUtils]: 4: Hoare triple {912#true} init_#res#1 := init_~tmp~0#1; {912#true} is VALID [2022-02-20 19:45:58,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {912#true} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {912#true} is VALID [2022-02-20 19:45:58,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {912#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {913#false} is VALID [2022-02-20 19:45:58,262 INFO L290 TraceCheckUtils]: 7: Hoare triple {913#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {913#false} is VALID [2022-02-20 19:45:58,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {913#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {913#false} is VALID [2022-02-20 19:45:58,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {913#false} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {913#false} is VALID [2022-02-20 19:45:58,275 INFO L290 TraceCheckUtils]: 10: Hoare triple {913#false} assume !(node1_~m1~0#1 != ~nomsg~0); {913#false} is VALID [2022-02-20 19:45:58,275 INFO L290 TraceCheckUtils]: 11: Hoare triple {913#false} ~mode1~0 := 0; {913#false} is VALID [2022-02-20 19:45:58,276 INFO L290 TraceCheckUtils]: 12: Hoare triple {913#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {913#false} is VALID [2022-02-20 19:45:58,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {913#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {913#false} is VALID [2022-02-20 19:45:58,276 INFO L290 TraceCheckUtils]: 14: Hoare triple {913#false} assume !(node2_~m2~0#1 != ~nomsg~0); {913#false} is VALID [2022-02-20 19:45:58,276 INFO L290 TraceCheckUtils]: 15: Hoare triple {913#false} ~mode2~0 := 0; {913#false} is VALID [2022-02-20 19:45:58,276 INFO L290 TraceCheckUtils]: 16: Hoare triple {913#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {913#false} is VALID [2022-02-20 19:45:58,276 INFO L290 TraceCheckUtils]: 17: Hoare triple {913#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {913#false} is VALID [2022-02-20 19:45:58,277 INFO L290 TraceCheckUtils]: 18: Hoare triple {913#false} assume !(node3_~m3~0#1 != ~nomsg~0); {913#false} is VALID [2022-02-20 19:45:58,277 INFO L290 TraceCheckUtils]: 19: Hoare triple {913#false} ~mode3~0 := 0; {913#false} is VALID [2022-02-20 19:45:58,277 INFO L290 TraceCheckUtils]: 20: Hoare triple {913#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {913#false} is VALID [2022-02-20 19:45:58,277 INFO L290 TraceCheckUtils]: 21: Hoare triple {913#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {913#false} is VALID [2022-02-20 19:45:58,277 INFO L290 TraceCheckUtils]: 22: Hoare triple {913#false} assume !(node4_~m4~0#1 != ~nomsg~0); {913#false} is VALID [2022-02-20 19:45:58,278 INFO L290 TraceCheckUtils]: 23: Hoare triple {913#false} ~mode4~0 := 0; {913#false} is VALID [2022-02-20 19:45:58,278 INFO L290 TraceCheckUtils]: 24: Hoare triple {913#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {913#false} is VALID [2022-02-20 19:45:58,278 INFO L290 TraceCheckUtils]: 25: Hoare triple {913#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {913#false} is VALID [2022-02-20 19:45:58,278 INFO L290 TraceCheckUtils]: 26: Hoare triple {913#false} assume !(node5_~m5~0#1 != ~nomsg~0); {913#false} is VALID [2022-02-20 19:45:58,278 INFO L290 TraceCheckUtils]: 27: Hoare triple {913#false} ~mode5~0 := 0; {913#false} is VALID [2022-02-20 19:45:58,279 INFO L290 TraceCheckUtils]: 28: Hoare triple {913#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {913#false} is VALID [2022-02-20 19:45:58,279 INFO L290 TraceCheckUtils]: 29: Hoare triple {913#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {913#false} is VALID [2022-02-20 19:45:58,279 INFO L290 TraceCheckUtils]: 30: Hoare triple {913#false} check_#res#1 := check_~tmp~1#1; {913#false} is VALID [2022-02-20 19:45:58,279 INFO L290 TraceCheckUtils]: 31: Hoare triple {913#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {913#false} is VALID [2022-02-20 19:45:58,279 INFO L290 TraceCheckUtils]: 32: Hoare triple {913#false} assume 0 == assert_~arg#1 % 256; {913#false} is VALID [2022-02-20 19:45:58,280 INFO L290 TraceCheckUtils]: 33: Hoare triple {913#false} assume !false; {913#false} is VALID [2022-02-20 19:45:58,280 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 19:45:58,281 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:45:58,281 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206154973] [2022-02-20 19:45:58,281 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206154973] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:45:58,282 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:45:58,282 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:45:58,283 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602467674] [2022-02-20 19:45:58,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:45:58,287 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2022-02-20 19:45:58,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:45:58,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:58,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:58,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 19:45:58,322 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:45:58,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 19:45:58,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:45:58,346 INFO L87 Difference]: Start difference. First operand has 909 states, 906 states have (on average 1.900662251655629) internal successors, (1722), 908 states have internal predecessors, (1722), 0 states have call successors, (0), 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 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:59,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:59,624 INFO L93 Difference]: Finished difference Result 1779 states and 3372 transitions. [2022-02-20 19:45:59,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 19:45:59,624 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2022-02-20 19:45:59,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:45:59,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:59,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3372 transitions. [2022-02-20 19:45:59,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:59,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3372 transitions. [2022-02-20 19:45:59,674 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 3372 transitions. [2022-02-20 19:46:02,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3372 edges. 3372 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:46:02,223 INFO L225 Difference]: With dead ends: 1779 [2022-02-20 19:46:02,223 INFO L226 Difference]: Without dead ends: 843 [2022-02-20 19:46:02,230 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 19:46:02,233 INFO L933 BasicCegarLoop]: 1653 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, 1653 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 19:46:02,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1653 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:46:02,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2022-02-20 19:46:02,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 843. [2022-02-20 19:46:02,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:46:02,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 843 states. Second operand has 843 states, 841 states have (on average 1.8894173602853745) internal successors, (1589), 842 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:02,301 INFO L74 IsIncluded]: Start isIncluded. First operand 843 states. Second operand has 843 states, 841 states have (on average 1.8894173602853745) internal successors, (1589), 842 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:02,302 INFO L87 Difference]: Start difference. First operand 843 states. Second operand has 843 states, 841 states have (on average 1.8894173602853745) internal successors, (1589), 842 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:02,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:02,326 INFO L93 Difference]: Finished difference Result 843 states and 1589 transitions. [2022-02-20 19:46:02,326 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1589 transitions. [2022-02-20 19:46:02,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:46:02,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:46:02,331 INFO L74 IsIncluded]: Start isIncluded. First operand has 843 states, 841 states have (on average 1.8894173602853745) internal successors, (1589), 842 states have internal predecessors, (1589), 0 states have call successors, (0), 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 843 states. [2022-02-20 19:46:02,332 INFO L87 Difference]: Start difference. First operand has 843 states, 841 states have (on average 1.8894173602853745) internal successors, (1589), 842 states have internal predecessors, (1589), 0 states have call successors, (0), 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 843 states. [2022-02-20 19:46:02,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:02,356 INFO L93 Difference]: Finished difference Result 843 states and 1589 transitions. [2022-02-20 19:46:02,356 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1589 transitions. [2022-02-20 19:46:02,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:46:02,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:46:02,358 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:46:02,358 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:46:02,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 841 states have (on average 1.8894173602853745) internal successors, (1589), 842 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:02,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1589 transitions. [2022-02-20 19:46:02,384 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1589 transitions. Word has length 34 [2022-02-20 19:46:02,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:46:02,384 INFO L470 AbstractCegarLoop]: Abstraction has 843 states and 1589 transitions. [2022-02-20 19:46:02,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:02,385 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1589 transitions. [2022-02-20 19:46:02,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 19:46:02,385 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:46:02,385 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] [2022-02-20 19:46:02,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:46:02,386 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:46:02,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:46:02,386 INFO L85 PathProgramCache]: Analyzing trace with hash -950839655, now seen corresponding path program 1 times [2022-02-20 19:46:02,387 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:46:02,387 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158566471] [2022-02-20 19:46:02,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:46:02,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:46:02,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:46:02,464 INFO L290 TraceCheckUtils]: 0: Hoare triple {5268#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {5268#true} is VALID [2022-02-20 19:46:02,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {5268#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {5268#true} is VALID [2022-02-20 19:46:02,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {5268#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {5268#true} is VALID [2022-02-20 19:46:02,466 INFO L290 TraceCheckUtils]: 3: Hoare triple {5268#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {5270#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:46:02,466 INFO L290 TraceCheckUtils]: 4: Hoare triple {5270#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {5271#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:46:02,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {5271#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {5272#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:46:02,467 INFO L290 TraceCheckUtils]: 6: Hoare triple {5272#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {5269#false} is VALID [2022-02-20 19:46:02,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {5269#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {5269#false} is VALID [2022-02-20 19:46:02,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {5269#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {5269#false} is VALID [2022-02-20 19:46:02,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {5269#false} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {5269#false} is VALID [2022-02-20 19:46:02,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {5269#false} assume !(node1_~m1~0#1 != ~nomsg~0); {5269#false} is VALID [2022-02-20 19:46:02,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {5269#false} ~mode1~0 := 0; {5269#false} is VALID [2022-02-20 19:46:02,468 INFO L290 TraceCheckUtils]: 12: Hoare triple {5269#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {5269#false} is VALID [2022-02-20 19:46:02,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {5269#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {5269#false} is VALID [2022-02-20 19:46:02,469 INFO L290 TraceCheckUtils]: 14: Hoare triple {5269#false} assume !(node2_~m2~0#1 != ~nomsg~0); {5269#false} is VALID [2022-02-20 19:46:02,471 INFO L290 TraceCheckUtils]: 15: Hoare triple {5269#false} ~mode2~0 := 0; {5269#false} is VALID [2022-02-20 19:46:02,471 INFO L290 TraceCheckUtils]: 16: Hoare triple {5269#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {5269#false} is VALID [2022-02-20 19:46:02,471 INFO L290 TraceCheckUtils]: 17: Hoare triple {5269#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {5269#false} is VALID [2022-02-20 19:46:02,473 INFO L290 TraceCheckUtils]: 18: Hoare triple {5269#false} assume !(node3_~m3~0#1 != ~nomsg~0); {5269#false} is VALID [2022-02-20 19:46:02,473 INFO L290 TraceCheckUtils]: 19: Hoare triple {5269#false} ~mode3~0 := 0; {5269#false} is VALID [2022-02-20 19:46:02,473 INFO L290 TraceCheckUtils]: 20: Hoare triple {5269#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {5269#false} is VALID [2022-02-20 19:46:02,473 INFO L290 TraceCheckUtils]: 21: Hoare triple {5269#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {5269#false} is VALID [2022-02-20 19:46:02,474 INFO L290 TraceCheckUtils]: 22: Hoare triple {5269#false} assume !(node4_~m4~0#1 != ~nomsg~0); {5269#false} is VALID [2022-02-20 19:46:02,474 INFO L290 TraceCheckUtils]: 23: Hoare triple {5269#false} ~mode4~0 := 0; {5269#false} is VALID [2022-02-20 19:46:02,474 INFO L290 TraceCheckUtils]: 24: Hoare triple {5269#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {5269#false} is VALID [2022-02-20 19:46:02,474 INFO L290 TraceCheckUtils]: 25: Hoare triple {5269#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {5269#false} is VALID [2022-02-20 19:46:02,474 INFO L290 TraceCheckUtils]: 26: Hoare triple {5269#false} assume !(node5_~m5~0#1 != ~nomsg~0); {5269#false} is VALID [2022-02-20 19:46:02,474 INFO L290 TraceCheckUtils]: 27: Hoare triple {5269#false} ~mode5~0 := 0; {5269#false} is VALID [2022-02-20 19:46:02,475 INFO L290 TraceCheckUtils]: 28: Hoare triple {5269#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {5269#false} is VALID [2022-02-20 19:46:02,475 INFO L290 TraceCheckUtils]: 29: Hoare triple {5269#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {5269#false} is VALID [2022-02-20 19:46:02,475 INFO L290 TraceCheckUtils]: 30: Hoare triple {5269#false} check_#res#1 := check_~tmp~1#1; {5269#false} is VALID [2022-02-20 19:46:02,475 INFO L290 TraceCheckUtils]: 31: Hoare triple {5269#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {5269#false} is VALID [2022-02-20 19:46:02,475 INFO L290 TraceCheckUtils]: 32: Hoare triple {5269#false} assume 0 == assert_~arg#1 % 256; {5269#false} is VALID [2022-02-20 19:46:02,475 INFO L290 TraceCheckUtils]: 33: Hoare triple {5269#false} assume !false; {5269#false} is VALID [2022-02-20 19:46:02,476 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 19:46:02,476 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:46:02,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158566471] [2022-02-20 19:46:02,476 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158566471] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:46:02,477 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:46:02,477 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:46:02,477 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805057351] [2022-02-20 19:46:02,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:46:02,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2022-02-20 19:46:02,479 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:46:02,479 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:02,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:46:02,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:46:02,500 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:46:02,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:46:02,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:46:02,502 INFO L87 Difference]: Start difference. First operand 843 states and 1589 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:06,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:06,249 INFO L93 Difference]: Finished difference Result 899 states and 1675 transitions. [2022-02-20 19:46:06,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:46:06,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2022-02-20 19:46:06,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:46:06,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:06,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1675 transitions. [2022-02-20 19:46:06,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:06,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1675 transitions. [2022-02-20 19:46:06,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1675 transitions. [2022-02-20 19:46:07,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1675 edges. 1675 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:46:07,522 INFO L225 Difference]: With dead ends: 899 [2022-02-20 19:46:07,522 INFO L226 Difference]: Without dead ends: 843 [2022-02-20 19:46:07,523 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 19:46:07,524 INFO L933 BasicCegarLoop]: 1587 mSDtfsCounter, 3 mSDsluCounter, 4727 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6314 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:46:07,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6314 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:46:07,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2022-02-20 19:46:07,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 843. [2022-02-20 19:46:07,535 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:46:07,536 INFO L82 GeneralOperation]: Start isEquivalent. First operand 843 states. Second operand has 843 states, 841 states have (on average 1.8525564803804995) internal successors, (1558), 842 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:07,537 INFO L74 IsIncluded]: Start isIncluded. First operand 843 states. Second operand has 843 states, 841 states have (on average 1.8525564803804995) internal successors, (1558), 842 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:07,538 INFO L87 Difference]: Start difference. First operand 843 states. Second operand has 843 states, 841 states have (on average 1.8525564803804995) internal successors, (1558), 842 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:07,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:07,560 INFO L93 Difference]: Finished difference Result 843 states and 1558 transitions. [2022-02-20 19:46:07,561 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1558 transitions. [2022-02-20 19:46:07,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:46:07,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:46:07,563 INFO L74 IsIncluded]: Start isIncluded. First operand has 843 states, 841 states have (on average 1.8525564803804995) internal successors, (1558), 842 states have internal predecessors, (1558), 0 states have call successors, (0), 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 843 states. [2022-02-20 19:46:07,564 INFO L87 Difference]: Start difference. First operand has 843 states, 841 states have (on average 1.8525564803804995) internal successors, (1558), 842 states have internal predecessors, (1558), 0 states have call successors, (0), 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 843 states. [2022-02-20 19:46:07,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:07,587 INFO L93 Difference]: Finished difference Result 843 states and 1558 transitions. [2022-02-20 19:46:07,587 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1558 transitions. [2022-02-20 19:46:07,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:46:07,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:46:07,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:46:07,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:46:07,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 841 states have (on average 1.8525564803804995) internal successors, (1558), 842 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:07,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1558 transitions. [2022-02-20 19:46:07,613 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1558 transitions. Word has length 34 [2022-02-20 19:46:07,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:46:07,614 INFO L470 AbstractCegarLoop]: Abstraction has 843 states and 1558 transitions. [2022-02-20 19:46:07,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:07,614 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1558 transitions. [2022-02-20 19:46:07,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:46:07,616 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:46:07,616 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:46:07,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:46:07,617 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:46:07,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:46:07,619 INFO L85 PathProgramCache]: Analyzing trace with hash -695028240, now seen corresponding path program 1 times [2022-02-20 19:46:07,619 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:46:07,620 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098692327] [2022-02-20 19:46:07,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:46:07,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:46:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:46:07,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {8744#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {8744#true} is VALID [2022-02-20 19:46:07,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {8744#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {8744#true} is VALID [2022-02-20 19:46:07,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {8744#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {8744#true} is VALID [2022-02-20 19:46:07,715 INFO L290 TraceCheckUtils]: 3: Hoare triple {8744#true} assume 0 == ~r1~0 % 256; {8744#true} is VALID [2022-02-20 19:46:07,715 INFO L290 TraceCheckUtils]: 4: Hoare triple {8744#true} assume ~id1~0 >= 0; {8744#true} is VALID [2022-02-20 19:46:07,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {8744#true} assume 0 == ~st1~0; {8744#true} is VALID [2022-02-20 19:46:07,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {8744#true} assume ~send1~0 == ~id1~0; {8744#true} is VALID [2022-02-20 19:46:07,716 INFO L290 TraceCheckUtils]: 7: Hoare triple {8744#true} assume 0 == ~mode1~0 % 256; {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:07,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:07,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:07,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:07,718 INFO L290 TraceCheckUtils]: 11: Hoare triple {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:07,718 INFO L290 TraceCheckUtils]: 12: Hoare triple {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:07,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:07,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:07,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:07,720 INFO L290 TraceCheckUtils]: 16: Hoare triple {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:07,720 INFO L290 TraceCheckUtils]: 17: Hoare triple {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:07,721 INFO L290 TraceCheckUtils]: 18: Hoare triple {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:07,721 INFO L290 TraceCheckUtils]: 19: Hoare triple {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:07,722 INFO L290 TraceCheckUtils]: 20: Hoare triple {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:07,723 INFO L290 TraceCheckUtils]: 21: Hoare triple {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:07,723 INFO L290 TraceCheckUtils]: 22: Hoare triple {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:07,723 INFO L290 TraceCheckUtils]: 23: Hoare triple {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:07,724 INFO L290 TraceCheckUtils]: 24: Hoare triple {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:07,724 INFO L290 TraceCheckUtils]: 25: Hoare triple {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:07,725 INFO L290 TraceCheckUtils]: 26: Hoare triple {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:07,725 INFO L290 TraceCheckUtils]: 27: Hoare triple {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:07,726 INFO L290 TraceCheckUtils]: 28: Hoare triple {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:07,726 INFO L290 TraceCheckUtils]: 29: Hoare triple {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:07,727 INFO L290 TraceCheckUtils]: 30: Hoare triple {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:07,727 INFO L290 TraceCheckUtils]: 31: Hoare triple {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:07,727 INFO L290 TraceCheckUtils]: 32: Hoare triple {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:07,728 INFO L290 TraceCheckUtils]: 33: Hoare triple {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:07,728 INFO L290 TraceCheckUtils]: 34: Hoare triple {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:07,729 INFO L290 TraceCheckUtils]: 35: Hoare triple {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:07,729 INFO L290 TraceCheckUtils]: 36: Hoare triple {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:07,732 INFO L290 TraceCheckUtils]: 37: Hoare triple {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:07,732 INFO L290 TraceCheckUtils]: 38: Hoare triple {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:46:07,733 INFO L290 TraceCheckUtils]: 39: Hoare triple {8746#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {8745#false} is VALID [2022-02-20 19:46:07,733 INFO L290 TraceCheckUtils]: 40: Hoare triple {8745#false} assume !(node1_~m1~0#1 != ~nomsg~0); {8745#false} is VALID [2022-02-20 19:46:07,733 INFO L290 TraceCheckUtils]: 41: Hoare triple {8745#false} ~mode1~0 := 0; {8745#false} is VALID [2022-02-20 19:46:07,734 INFO L290 TraceCheckUtils]: 42: Hoare triple {8745#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {8745#false} is VALID [2022-02-20 19:46:07,735 INFO L290 TraceCheckUtils]: 43: Hoare triple {8745#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {8745#false} is VALID [2022-02-20 19:46:07,735 INFO L290 TraceCheckUtils]: 44: Hoare triple {8745#false} assume !(node2_~m2~0#1 != ~nomsg~0); {8745#false} is VALID [2022-02-20 19:46:07,735 INFO L290 TraceCheckUtils]: 45: Hoare triple {8745#false} ~mode2~0 := 0; {8745#false} is VALID [2022-02-20 19:46:07,736 INFO L290 TraceCheckUtils]: 46: Hoare triple {8745#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {8745#false} is VALID [2022-02-20 19:46:07,736 INFO L290 TraceCheckUtils]: 47: Hoare triple {8745#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {8745#false} is VALID [2022-02-20 19:46:07,742 INFO L290 TraceCheckUtils]: 48: Hoare triple {8745#false} assume !(node3_~m3~0#1 != ~nomsg~0); {8745#false} is VALID [2022-02-20 19:46:07,742 INFO L290 TraceCheckUtils]: 49: Hoare triple {8745#false} ~mode3~0 := 0; {8745#false} is VALID [2022-02-20 19:46:07,744 INFO L290 TraceCheckUtils]: 50: Hoare triple {8745#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {8745#false} is VALID [2022-02-20 19:46:07,744 INFO L290 TraceCheckUtils]: 51: Hoare triple {8745#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {8745#false} is VALID [2022-02-20 19:46:07,745 INFO L290 TraceCheckUtils]: 52: Hoare triple {8745#false} assume !(node4_~m4~0#1 != ~nomsg~0); {8745#false} is VALID [2022-02-20 19:46:07,745 INFO L290 TraceCheckUtils]: 53: Hoare triple {8745#false} ~mode4~0 := 0; {8745#false} is VALID [2022-02-20 19:46:07,745 INFO L290 TraceCheckUtils]: 54: Hoare triple {8745#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {8745#false} is VALID [2022-02-20 19:46:07,745 INFO L290 TraceCheckUtils]: 55: Hoare triple {8745#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {8745#false} is VALID [2022-02-20 19:46:07,745 INFO L290 TraceCheckUtils]: 56: Hoare triple {8745#false} assume !(node5_~m5~0#1 != ~nomsg~0); {8745#false} is VALID [2022-02-20 19:46:07,746 INFO L290 TraceCheckUtils]: 57: Hoare triple {8745#false} ~mode5~0 := 0; {8745#false} is VALID [2022-02-20 19:46:07,746 INFO L290 TraceCheckUtils]: 58: Hoare triple {8745#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {8745#false} is VALID [2022-02-20 19:46:07,746 INFO L290 TraceCheckUtils]: 59: Hoare triple {8745#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {8745#false} is VALID [2022-02-20 19:46:07,746 INFO L290 TraceCheckUtils]: 60: Hoare triple {8745#false} check_#res#1 := check_~tmp~1#1; {8745#false} is VALID [2022-02-20 19:46:07,747 INFO L290 TraceCheckUtils]: 61: Hoare triple {8745#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {8745#false} is VALID [2022-02-20 19:46:07,747 INFO L290 TraceCheckUtils]: 62: Hoare triple {8745#false} assume 0 == assert_~arg#1 % 256; {8745#false} is VALID [2022-02-20 19:46:07,747 INFO L290 TraceCheckUtils]: 63: Hoare triple {8745#false} assume !false; {8745#false} is VALID [2022-02-20 19:46:07,747 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 19:46:07,748 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:46:07,748 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098692327] [2022-02-20 19:46:07,748 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098692327] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:46:07,749 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:46:07,749 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:46:07,749 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618468429] [2022-02-20 19:46:07,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:46:07,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:46:07,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:46:07,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:07,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:46:07,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:46:07,795 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:46:07,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:46:07,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:46:07,796 INFO L87 Difference]: Start difference. First operand 843 states and 1558 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:09,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:09,497 INFO L93 Difference]: Finished difference Result 941 states and 1712 transitions. [2022-02-20 19:46:09,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:46:09,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:46:09,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:46:09,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:09,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:46:09,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:09,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:46:09,509 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1712 transitions. [2022-02-20 19:46:10,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1712 edges. 1712 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:46:10,947 INFO L225 Difference]: With dead ends: 941 [2022-02-20 19:46:10,947 INFO L226 Difference]: Without dead ends: 889 [2022-02-20 19:46:10,948 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 19:46:10,948 INFO L933 BasicCegarLoop]: 1626 mSDtfsCounter, 1511 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1511 SdHoareTripleChecker+Valid, 1706 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 19:46:10,949 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1511 Valid, 1706 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:46:10,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2022-02-20 19:46:10,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 887. [2022-02-20 19:46:10,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:46:10,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 889 states. Second operand has 887 states, 885 states have (on average 1.83954802259887) internal successors, (1628), 886 states have internal predecessors, (1628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:10,961 INFO L74 IsIncluded]: Start isIncluded. First operand 889 states. Second operand has 887 states, 885 states have (on average 1.83954802259887) internal successors, (1628), 886 states have internal predecessors, (1628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:10,962 INFO L87 Difference]: Start difference. First operand 889 states. Second operand has 887 states, 885 states have (on average 1.83954802259887) internal successors, (1628), 886 states have internal predecessors, (1628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:10,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:10,986 INFO L93 Difference]: Finished difference Result 889 states and 1629 transitions. [2022-02-20 19:46:10,987 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1629 transitions. [2022-02-20 19:46:10,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:46:10,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:46:10,989 INFO L74 IsIncluded]: Start isIncluded. First operand has 887 states, 885 states have (on average 1.83954802259887) internal successors, (1628), 886 states have internal predecessors, (1628), 0 states have call successors, (0), 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 889 states. [2022-02-20 19:46:10,991 INFO L87 Difference]: Start difference. First operand has 887 states, 885 states have (on average 1.83954802259887) internal successors, (1628), 886 states have internal predecessors, (1628), 0 states have call successors, (0), 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 889 states. [2022-02-20 19:46:11,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:11,016 INFO L93 Difference]: Finished difference Result 889 states and 1629 transitions. [2022-02-20 19:46:11,016 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1629 transitions. [2022-02-20 19:46:11,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:46:11,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:46:11,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:46:11,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:46:11,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 885 states have (on average 1.83954802259887) internal successors, (1628), 886 states have internal predecessors, (1628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:11,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1628 transitions. [2022-02-20 19:46:11,043 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1628 transitions. Word has length 64 [2022-02-20 19:46:11,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:46:11,079 INFO L470 AbstractCegarLoop]: Abstraction has 887 states and 1628 transitions. [2022-02-20 19:46:11,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:11,080 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1628 transitions. [2022-02-20 19:46:11,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:46:11,080 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:46:11,080 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:46:11,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:46:11,080 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:46:11,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:46:11,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1440610970, now seen corresponding path program 1 times [2022-02-20 19:46:11,081 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:46:11,081 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99457994] [2022-02-20 19:46:11,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:46:11,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:46:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:46:11,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {12407#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {12407#true} is VALID [2022-02-20 19:46:11,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {12407#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {12407#true} is VALID [2022-02-20 19:46:11,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {12407#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {12407#true} is VALID [2022-02-20 19:46:11,156 INFO L290 TraceCheckUtils]: 3: Hoare triple {12407#true} assume 0 == ~r1~0 % 256; {12407#true} is VALID [2022-02-20 19:46:11,156 INFO L290 TraceCheckUtils]: 4: Hoare triple {12407#true} assume ~id1~0 >= 0; {12407#true} is VALID [2022-02-20 19:46:11,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {12407#true} assume 0 == ~st1~0; {12407#true} is VALID [2022-02-20 19:46:11,157 INFO L290 TraceCheckUtils]: 6: Hoare triple {12407#true} assume ~send1~0 == ~id1~0; {12407#true} is VALID [2022-02-20 19:46:11,157 INFO L290 TraceCheckUtils]: 7: Hoare triple {12407#true} assume 0 == ~mode1~0 % 256; {12407#true} is VALID [2022-02-20 19:46:11,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {12407#true} assume ~id2~0 >= 0; {12407#true} is VALID [2022-02-20 19:46:11,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {12407#true} assume 0 == ~st2~0; {12407#true} is VALID [2022-02-20 19:46:11,157 INFO L290 TraceCheckUtils]: 10: Hoare triple {12407#true} assume ~send2~0 == ~id2~0; {12407#true} is VALID [2022-02-20 19:46:11,166 INFO L290 TraceCheckUtils]: 11: Hoare triple {12407#true} assume 0 == ~mode2~0 % 256; {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:11,167 INFO L290 TraceCheckUtils]: 12: Hoare triple {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:11,167 INFO L290 TraceCheckUtils]: 13: Hoare triple {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:11,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:11,168 INFO L290 TraceCheckUtils]: 15: Hoare triple {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:11,168 INFO L290 TraceCheckUtils]: 16: Hoare triple {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:11,169 INFO L290 TraceCheckUtils]: 17: Hoare triple {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:11,169 INFO L290 TraceCheckUtils]: 18: Hoare triple {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:11,169 INFO L290 TraceCheckUtils]: 19: Hoare triple {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:11,170 INFO L290 TraceCheckUtils]: 20: Hoare triple {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:11,170 INFO L290 TraceCheckUtils]: 21: Hoare triple {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:11,171 INFO L290 TraceCheckUtils]: 22: Hoare triple {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:11,171 INFO L290 TraceCheckUtils]: 23: Hoare triple {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:11,171 INFO L290 TraceCheckUtils]: 24: Hoare triple {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:11,172 INFO L290 TraceCheckUtils]: 25: Hoare triple {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:11,172 INFO L290 TraceCheckUtils]: 26: Hoare triple {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:11,173 INFO L290 TraceCheckUtils]: 27: Hoare triple {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:11,173 INFO L290 TraceCheckUtils]: 28: Hoare triple {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:11,173 INFO L290 TraceCheckUtils]: 29: Hoare triple {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:11,174 INFO L290 TraceCheckUtils]: 30: Hoare triple {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:11,174 INFO L290 TraceCheckUtils]: 31: Hoare triple {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:11,175 INFO L290 TraceCheckUtils]: 32: Hoare triple {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:11,175 INFO L290 TraceCheckUtils]: 33: Hoare triple {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:11,175 INFO L290 TraceCheckUtils]: 34: Hoare triple {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:11,176 INFO L290 TraceCheckUtils]: 35: Hoare triple {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:11,176 INFO L290 TraceCheckUtils]: 36: Hoare triple {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:11,177 INFO L290 TraceCheckUtils]: 37: Hoare triple {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:11,177 INFO L290 TraceCheckUtils]: 38: Hoare triple {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:11,178 INFO L290 TraceCheckUtils]: 39: Hoare triple {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:11,178 INFO L290 TraceCheckUtils]: 40: Hoare triple {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:11,179 INFO L290 TraceCheckUtils]: 41: Hoare triple {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:11,179 INFO L290 TraceCheckUtils]: 42: Hoare triple {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:46:11,180 INFO L290 TraceCheckUtils]: 43: Hoare triple {12409#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {12408#false} is VALID [2022-02-20 19:46:11,180 INFO L290 TraceCheckUtils]: 44: Hoare triple {12408#false} assume !(node2_~m2~0#1 != ~nomsg~0); {12408#false} is VALID [2022-02-20 19:46:11,180 INFO L290 TraceCheckUtils]: 45: Hoare triple {12408#false} ~mode2~0 := 0; {12408#false} is VALID [2022-02-20 19:46:11,180 INFO L290 TraceCheckUtils]: 46: Hoare triple {12408#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {12408#false} is VALID [2022-02-20 19:46:11,180 INFO L290 TraceCheckUtils]: 47: Hoare triple {12408#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {12408#false} is VALID [2022-02-20 19:46:11,180 INFO L290 TraceCheckUtils]: 48: Hoare triple {12408#false} assume !(node3_~m3~0#1 != ~nomsg~0); {12408#false} is VALID [2022-02-20 19:46:11,181 INFO L290 TraceCheckUtils]: 49: Hoare triple {12408#false} ~mode3~0 := 0; {12408#false} is VALID [2022-02-20 19:46:11,181 INFO L290 TraceCheckUtils]: 50: Hoare triple {12408#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {12408#false} is VALID [2022-02-20 19:46:11,181 INFO L290 TraceCheckUtils]: 51: Hoare triple {12408#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {12408#false} is VALID [2022-02-20 19:46:11,181 INFO L290 TraceCheckUtils]: 52: Hoare triple {12408#false} assume !(node4_~m4~0#1 != ~nomsg~0); {12408#false} is VALID [2022-02-20 19:46:11,181 INFO L290 TraceCheckUtils]: 53: Hoare triple {12408#false} ~mode4~0 := 0; {12408#false} is VALID [2022-02-20 19:46:11,181 INFO L290 TraceCheckUtils]: 54: Hoare triple {12408#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {12408#false} is VALID [2022-02-20 19:46:11,182 INFO L290 TraceCheckUtils]: 55: Hoare triple {12408#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {12408#false} is VALID [2022-02-20 19:46:11,182 INFO L290 TraceCheckUtils]: 56: Hoare triple {12408#false} assume !(node5_~m5~0#1 != ~nomsg~0); {12408#false} is VALID [2022-02-20 19:46:11,182 INFO L290 TraceCheckUtils]: 57: Hoare triple {12408#false} ~mode5~0 := 0; {12408#false} is VALID [2022-02-20 19:46:11,182 INFO L290 TraceCheckUtils]: 58: Hoare triple {12408#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {12408#false} is VALID [2022-02-20 19:46:11,182 INFO L290 TraceCheckUtils]: 59: Hoare triple {12408#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {12408#false} is VALID [2022-02-20 19:46:11,183 INFO L290 TraceCheckUtils]: 60: Hoare triple {12408#false} check_#res#1 := check_~tmp~1#1; {12408#false} is VALID [2022-02-20 19:46:11,183 INFO L290 TraceCheckUtils]: 61: Hoare triple {12408#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {12408#false} is VALID [2022-02-20 19:46:11,183 INFO L290 TraceCheckUtils]: 62: Hoare triple {12408#false} assume 0 == assert_~arg#1 % 256; {12408#false} is VALID [2022-02-20 19:46:11,183 INFO L290 TraceCheckUtils]: 63: Hoare triple {12408#false} assume !false; {12408#false} is VALID [2022-02-20 19:46:11,184 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 19:46:11,185 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:46:11,185 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99457994] [2022-02-20 19:46:11,185 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99457994] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:46:11,185 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:46:11,185 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:46:11,185 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113315024] [2022-02-20 19:46:11,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:46:11,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:46:11,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:46:11,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:11,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:46:11,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:46:11,223 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:46:11,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:46:11,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:46:11,224 INFO L87 Difference]: Start difference. First operand 887 states and 1628 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:12,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:12,964 INFO L93 Difference]: Finished difference Result 1067 states and 1912 transitions. [2022-02-20 19:46:12,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:46:12,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:46:12,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:46:12,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:12,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:46:12,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:12,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:46:12,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1712 transitions. [2022-02-20 19:46:14,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1712 edges. 1712 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:46:14,365 INFO L225 Difference]: With dead ends: 1067 [2022-02-20 19:46:14,366 INFO L226 Difference]: Without dead ends: 971 [2022-02-20 19:46:14,366 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 19:46:14,367 INFO L933 BasicCegarLoop]: 1621 mSDtfsCounter, 1507 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1705 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 19:46:14,367 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1507 Valid, 1705 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:46:14,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2022-02-20 19:46:14,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 969. [2022-02-20 19:46:14,385 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:46:14,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 971 states. Second operand has 969 states, 967 states have (on average 1.8169596690796277) internal successors, (1757), 968 states have internal predecessors, (1757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:14,387 INFO L74 IsIncluded]: Start isIncluded. First operand 971 states. Second operand has 969 states, 967 states have (on average 1.8169596690796277) internal successors, (1757), 968 states have internal predecessors, (1757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:14,389 INFO L87 Difference]: Start difference. First operand 971 states. Second operand has 969 states, 967 states have (on average 1.8169596690796277) internal successors, (1757), 968 states have internal predecessors, (1757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:14,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:14,418 INFO L93 Difference]: Finished difference Result 971 states and 1758 transitions. [2022-02-20 19:46:14,418 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1758 transitions. [2022-02-20 19:46:14,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:46:14,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:46:14,422 INFO L74 IsIncluded]: Start isIncluded. First operand has 969 states, 967 states have (on average 1.8169596690796277) internal successors, (1757), 968 states have internal predecessors, (1757), 0 states have call successors, (0), 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 971 states. [2022-02-20 19:46:14,423 INFO L87 Difference]: Start difference. First operand has 969 states, 967 states have (on average 1.8169596690796277) internal successors, (1757), 968 states have internal predecessors, (1757), 0 states have call successors, (0), 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 971 states. [2022-02-20 19:46:14,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:14,453 INFO L93 Difference]: Finished difference Result 971 states and 1758 transitions. [2022-02-20 19:46:14,453 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1758 transitions. [2022-02-20 19:46:14,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:46:14,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:46:14,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:46:14,454 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:46:14,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 967 states have (on average 1.8169596690796277) internal successors, (1757), 968 states have internal predecessors, (1757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:14,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1757 transitions. [2022-02-20 19:46:14,485 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1757 transitions. Word has length 64 [2022-02-20 19:46:14,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:46:14,485 INFO L470 AbstractCegarLoop]: Abstraction has 969 states and 1757 transitions. [2022-02-20 19:46:14,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:14,485 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1757 transitions. [2022-02-20 19:46:14,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:46:14,486 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:46:14,486 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:46:14,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:46:14,487 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:46:14,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:46:14,488 INFO L85 PathProgramCache]: Analyzing trace with hash 914325468, now seen corresponding path program 1 times [2022-02-20 19:46:14,488 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:46:14,488 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290024240] [2022-02-20 19:46:14,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:46:14,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:46:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:46:14,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {16482#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {16482#true} is VALID [2022-02-20 19:46:14,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {16482#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {16482#true} is VALID [2022-02-20 19:46:14,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {16482#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {16482#true} is VALID [2022-02-20 19:46:14,581 INFO L290 TraceCheckUtils]: 3: Hoare triple {16482#true} assume 0 == ~r1~0 % 256; {16482#true} is VALID [2022-02-20 19:46:14,581 INFO L290 TraceCheckUtils]: 4: Hoare triple {16482#true} assume ~id1~0 >= 0; {16482#true} is VALID [2022-02-20 19:46:14,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {16482#true} assume 0 == ~st1~0; {16482#true} is VALID [2022-02-20 19:46:14,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {16482#true} assume ~send1~0 == ~id1~0; {16482#true} is VALID [2022-02-20 19:46:14,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {16482#true} assume 0 == ~mode1~0 % 256; {16482#true} is VALID [2022-02-20 19:46:14,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {16482#true} assume ~id2~0 >= 0; {16482#true} is VALID [2022-02-20 19:46:14,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {16482#true} assume 0 == ~st2~0; {16482#true} is VALID [2022-02-20 19:46:14,584 INFO L290 TraceCheckUtils]: 10: Hoare triple {16482#true} assume ~send2~0 == ~id2~0; {16482#true} is VALID [2022-02-20 19:46:14,585 INFO L290 TraceCheckUtils]: 11: Hoare triple {16482#true} assume 0 == ~mode2~0 % 256; {16482#true} is VALID [2022-02-20 19:46:14,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {16482#true} assume ~id3~0 >= 0; {16482#true} is VALID [2022-02-20 19:46:14,585 INFO L290 TraceCheckUtils]: 13: Hoare triple {16482#true} assume 0 == ~st3~0; {16482#true} is VALID [2022-02-20 19:46:14,585 INFO L290 TraceCheckUtils]: 14: Hoare triple {16482#true} assume ~send3~0 == ~id3~0; {16482#true} is VALID [2022-02-20 19:46:14,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {16482#true} assume 0 == ~mode3~0 % 256; {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:14,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:14,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:14,587 INFO L290 TraceCheckUtils]: 18: Hoare triple {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:14,587 INFO L290 TraceCheckUtils]: 19: Hoare triple {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:14,587 INFO L290 TraceCheckUtils]: 20: Hoare triple {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:14,588 INFO L290 TraceCheckUtils]: 21: Hoare triple {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:14,588 INFO L290 TraceCheckUtils]: 22: Hoare triple {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:14,588 INFO L290 TraceCheckUtils]: 23: Hoare triple {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:14,589 INFO L290 TraceCheckUtils]: 24: Hoare triple {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:14,589 INFO L290 TraceCheckUtils]: 25: Hoare triple {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:14,589 INFO L290 TraceCheckUtils]: 26: Hoare triple {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:14,590 INFO L290 TraceCheckUtils]: 27: Hoare triple {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:14,637 INFO L290 TraceCheckUtils]: 28: Hoare triple {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:14,637 INFO L290 TraceCheckUtils]: 29: Hoare triple {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:14,637 INFO L290 TraceCheckUtils]: 30: Hoare triple {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:14,638 INFO L290 TraceCheckUtils]: 31: Hoare triple {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:14,638 INFO L290 TraceCheckUtils]: 32: Hoare triple {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:14,639 INFO L290 TraceCheckUtils]: 33: Hoare triple {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:14,639 INFO L290 TraceCheckUtils]: 34: Hoare triple {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:14,639 INFO L290 TraceCheckUtils]: 35: Hoare triple {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:14,640 INFO L290 TraceCheckUtils]: 36: Hoare triple {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:14,640 INFO L290 TraceCheckUtils]: 37: Hoare triple {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:14,640 INFO L290 TraceCheckUtils]: 38: Hoare triple {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:14,641 INFO L290 TraceCheckUtils]: 39: Hoare triple {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:14,641 INFO L290 TraceCheckUtils]: 40: Hoare triple {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:14,641 INFO L290 TraceCheckUtils]: 41: Hoare triple {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:14,642 INFO L290 TraceCheckUtils]: 42: Hoare triple {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:14,642 INFO L290 TraceCheckUtils]: 43: Hoare triple {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:14,646 INFO L290 TraceCheckUtils]: 44: Hoare triple {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:14,646 INFO L290 TraceCheckUtils]: 45: Hoare triple {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:14,647 INFO L290 TraceCheckUtils]: 46: Hoare triple {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:46:14,648 INFO L290 TraceCheckUtils]: 47: Hoare triple {16484#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {16483#false} is VALID [2022-02-20 19:46:14,648 INFO L290 TraceCheckUtils]: 48: Hoare triple {16483#false} assume !(node3_~m3~0#1 != ~nomsg~0); {16483#false} is VALID [2022-02-20 19:46:14,648 INFO L290 TraceCheckUtils]: 49: Hoare triple {16483#false} ~mode3~0 := 0; {16483#false} is VALID [2022-02-20 19:46:14,648 INFO L290 TraceCheckUtils]: 50: Hoare triple {16483#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {16483#false} is VALID [2022-02-20 19:46:14,649 INFO L290 TraceCheckUtils]: 51: Hoare triple {16483#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {16483#false} is VALID [2022-02-20 19:46:14,649 INFO L290 TraceCheckUtils]: 52: Hoare triple {16483#false} assume !(node4_~m4~0#1 != ~nomsg~0); {16483#false} is VALID [2022-02-20 19:46:14,649 INFO L290 TraceCheckUtils]: 53: Hoare triple {16483#false} ~mode4~0 := 0; {16483#false} is VALID [2022-02-20 19:46:14,649 INFO L290 TraceCheckUtils]: 54: Hoare triple {16483#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {16483#false} is VALID [2022-02-20 19:46:14,649 INFO L290 TraceCheckUtils]: 55: Hoare triple {16483#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {16483#false} is VALID [2022-02-20 19:46:14,649 INFO L290 TraceCheckUtils]: 56: Hoare triple {16483#false} assume !(node5_~m5~0#1 != ~nomsg~0); {16483#false} is VALID [2022-02-20 19:46:14,649 INFO L290 TraceCheckUtils]: 57: Hoare triple {16483#false} ~mode5~0 := 0; {16483#false} is VALID [2022-02-20 19:46:14,650 INFO L290 TraceCheckUtils]: 58: Hoare triple {16483#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {16483#false} is VALID [2022-02-20 19:46:14,650 INFO L290 TraceCheckUtils]: 59: Hoare triple {16483#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {16483#false} is VALID [2022-02-20 19:46:14,650 INFO L290 TraceCheckUtils]: 60: Hoare triple {16483#false} check_#res#1 := check_~tmp~1#1; {16483#false} is VALID [2022-02-20 19:46:14,650 INFO L290 TraceCheckUtils]: 61: Hoare triple {16483#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {16483#false} is VALID [2022-02-20 19:46:14,650 INFO L290 TraceCheckUtils]: 62: Hoare triple {16483#false} assume 0 == assert_~arg#1 % 256; {16483#false} is VALID [2022-02-20 19:46:14,650 INFO L290 TraceCheckUtils]: 63: Hoare triple {16483#false} assume !false; {16483#false} is VALID [2022-02-20 19:46:14,650 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 19:46:14,651 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:46:14,651 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290024240] [2022-02-20 19:46:14,651 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290024240] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:46:14,651 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:46:14,651 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:46:14,651 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175986273] [2022-02-20 19:46:14,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:46:14,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:46:14,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:46:14,652 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:14,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:46:14,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:46:14,691 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:46:14,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:46:14,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:46:14,691 INFO L87 Difference]: Start difference. First operand 969 states and 1757 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:16,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:16,339 INFO L93 Difference]: Finished difference Result 1301 states and 2279 transitions. [2022-02-20 19:46:16,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:46:16,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:46:16,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:46:16,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:16,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:46:16,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:16,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:46:16,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1712 transitions. [2022-02-20 19:46:17,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1712 edges. 1712 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:46:17,745 INFO L225 Difference]: With dead ends: 1301 [2022-02-20 19:46:17,745 INFO L226 Difference]: Without dead ends: 1123 [2022-02-20 19:46:17,746 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 19:46:17,746 INFO L933 BasicCegarLoop]: 1616 mSDtfsCounter, 1503 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 1704 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 19:46:17,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1503 Valid, 1704 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:46:17,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2022-02-20 19:46:17,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1121. [2022-02-20 19:46:17,762 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:46:17,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1123 states. Second operand has 1121 states, 1119 states have (on average 1.7810545129579982) internal successors, (1993), 1120 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:17,764 INFO L74 IsIncluded]: Start isIncluded. First operand 1123 states. Second operand has 1121 states, 1119 states have (on average 1.7810545129579982) internal successors, (1993), 1120 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:17,765 INFO L87 Difference]: Start difference. First operand 1123 states. Second operand has 1121 states, 1119 states have (on average 1.7810545129579982) internal successors, (1993), 1120 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:17,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:17,798 INFO L93 Difference]: Finished difference Result 1123 states and 1994 transitions. [2022-02-20 19:46:17,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1994 transitions. [2022-02-20 19:46:17,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:46:17,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:46:17,801 INFO L74 IsIncluded]: Start isIncluded. First operand has 1121 states, 1119 states have (on average 1.7810545129579982) internal successors, (1993), 1120 states have internal predecessors, (1993), 0 states have call successors, (0), 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 1123 states. [2022-02-20 19:46:17,802 INFO L87 Difference]: Start difference. First operand has 1121 states, 1119 states have (on average 1.7810545129579982) internal successors, (1993), 1120 states have internal predecessors, (1993), 0 states have call successors, (0), 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 1123 states. [2022-02-20 19:46:17,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:17,835 INFO L93 Difference]: Finished difference Result 1123 states and 1994 transitions. [2022-02-20 19:46:17,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1994 transitions. [2022-02-20 19:46:17,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:46:17,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:46:17,837 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:46:17,837 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:46:17,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 1119 states have (on average 1.7810545129579982) internal successors, (1993), 1120 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:17,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1993 transitions. [2022-02-20 19:46:17,872 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1993 transitions. Word has length 64 [2022-02-20 19:46:17,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:46:17,873 INFO L470 AbstractCegarLoop]: Abstraction has 1121 states and 1993 transitions. [2022-02-20 19:46:17,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:17,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1993 transitions. [2022-02-20 19:46:17,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:46:17,873 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:46:17,873 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:46:17,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:46:17,874 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:46:17,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:46:17,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1701027568, now seen corresponding path program 1 times [2022-02-20 19:46:17,874 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:46:17,874 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446777775] [2022-02-20 19:46:17,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:46:17,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:46:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:46:17,920 INFO L290 TraceCheckUtils]: 0: Hoare triple {21327#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {21327#true} is VALID [2022-02-20 19:46:17,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {21327#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {21327#true} is VALID [2022-02-20 19:46:17,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {21327#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {21327#true} is VALID [2022-02-20 19:46:17,921 INFO L290 TraceCheckUtils]: 3: Hoare triple {21327#true} assume 0 == ~r1~0 % 256; {21327#true} is VALID [2022-02-20 19:46:17,921 INFO L290 TraceCheckUtils]: 4: Hoare triple {21327#true} assume ~id1~0 >= 0; {21327#true} is VALID [2022-02-20 19:46:17,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {21327#true} assume 0 == ~st1~0; {21327#true} is VALID [2022-02-20 19:46:17,921 INFO L290 TraceCheckUtils]: 6: Hoare triple {21327#true} assume ~send1~0 == ~id1~0; {21327#true} is VALID [2022-02-20 19:46:17,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {21327#true} assume 0 == ~mode1~0 % 256; {21327#true} is VALID [2022-02-20 19:46:17,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {21327#true} assume ~id2~0 >= 0; {21327#true} is VALID [2022-02-20 19:46:17,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {21327#true} assume 0 == ~st2~0; {21327#true} is VALID [2022-02-20 19:46:17,922 INFO L290 TraceCheckUtils]: 10: Hoare triple {21327#true} assume ~send2~0 == ~id2~0; {21327#true} is VALID [2022-02-20 19:46:17,922 INFO L290 TraceCheckUtils]: 11: Hoare triple {21327#true} assume 0 == ~mode2~0 % 256; {21327#true} is VALID [2022-02-20 19:46:17,922 INFO L290 TraceCheckUtils]: 12: Hoare triple {21327#true} assume ~id3~0 >= 0; {21327#true} is VALID [2022-02-20 19:46:17,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {21327#true} assume 0 == ~st3~0; {21327#true} is VALID [2022-02-20 19:46:17,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {21327#true} assume ~send3~0 == ~id3~0; {21327#true} is VALID [2022-02-20 19:46:17,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {21327#true} assume 0 == ~mode3~0 % 256; {21327#true} is VALID [2022-02-20 19:46:17,923 INFO L290 TraceCheckUtils]: 16: Hoare triple {21327#true} assume ~id4~0 >= 0; {21327#true} is VALID [2022-02-20 19:46:17,923 INFO L290 TraceCheckUtils]: 17: Hoare triple {21327#true} assume 0 == ~st4~0; {21327#true} is VALID [2022-02-20 19:46:17,923 INFO L290 TraceCheckUtils]: 18: Hoare triple {21327#true} assume ~send4~0 == ~id4~0; {21327#true} is VALID [2022-02-20 19:46:17,923 INFO L290 TraceCheckUtils]: 19: Hoare triple {21327#true} assume 0 == ~mode4~0 % 256; {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:17,924 INFO L290 TraceCheckUtils]: 20: Hoare triple {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:17,924 INFO L290 TraceCheckUtils]: 21: Hoare triple {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:17,925 INFO L290 TraceCheckUtils]: 22: Hoare triple {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:17,925 INFO L290 TraceCheckUtils]: 23: Hoare triple {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:17,925 INFO L290 TraceCheckUtils]: 24: Hoare triple {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:17,926 INFO L290 TraceCheckUtils]: 25: Hoare triple {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:17,926 INFO L290 TraceCheckUtils]: 26: Hoare triple {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:17,926 INFO L290 TraceCheckUtils]: 27: Hoare triple {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:17,927 INFO L290 TraceCheckUtils]: 28: Hoare triple {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:17,927 INFO L290 TraceCheckUtils]: 29: Hoare triple {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:17,927 INFO L290 TraceCheckUtils]: 30: Hoare triple {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:17,928 INFO L290 TraceCheckUtils]: 31: Hoare triple {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:17,928 INFO L290 TraceCheckUtils]: 32: Hoare triple {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:17,929 INFO L290 TraceCheckUtils]: 33: Hoare triple {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:17,929 INFO L290 TraceCheckUtils]: 34: Hoare triple {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:17,929 INFO L290 TraceCheckUtils]: 35: Hoare triple {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:17,930 INFO L290 TraceCheckUtils]: 36: Hoare triple {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:17,930 INFO L290 TraceCheckUtils]: 37: Hoare triple {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:17,930 INFO L290 TraceCheckUtils]: 38: Hoare triple {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:17,931 INFO L290 TraceCheckUtils]: 39: Hoare triple {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:17,931 INFO L290 TraceCheckUtils]: 40: Hoare triple {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:17,931 INFO L290 TraceCheckUtils]: 41: Hoare triple {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:17,932 INFO L290 TraceCheckUtils]: 42: Hoare triple {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:17,932 INFO L290 TraceCheckUtils]: 43: Hoare triple {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:17,932 INFO L290 TraceCheckUtils]: 44: Hoare triple {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:17,933 INFO L290 TraceCheckUtils]: 45: Hoare triple {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:17,933 INFO L290 TraceCheckUtils]: 46: Hoare triple {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:17,934 INFO L290 TraceCheckUtils]: 47: Hoare triple {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:17,934 INFO L290 TraceCheckUtils]: 48: Hoare triple {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite7#1 := ~p3_new~0; {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:17,934 INFO L290 TraceCheckUtils]: 49: Hoare triple {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:17,935 INFO L290 TraceCheckUtils]: 50: Hoare triple {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:46:17,935 INFO L290 TraceCheckUtils]: 51: Hoare triple {21329#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {21328#false} is VALID [2022-02-20 19:46:17,935 INFO L290 TraceCheckUtils]: 52: Hoare triple {21328#false} assume !(node4_~m4~0#1 != ~nomsg~0); {21328#false} is VALID [2022-02-20 19:46:17,935 INFO L290 TraceCheckUtils]: 53: Hoare triple {21328#false} ~mode4~0 := 0; {21328#false} is VALID [2022-02-20 19:46:17,936 INFO L290 TraceCheckUtils]: 54: Hoare triple {21328#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {21328#false} is VALID [2022-02-20 19:46:17,936 INFO L290 TraceCheckUtils]: 55: Hoare triple {21328#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {21328#false} is VALID [2022-02-20 19:46:17,936 INFO L290 TraceCheckUtils]: 56: Hoare triple {21328#false} assume !(node5_~m5~0#1 != ~nomsg~0); {21328#false} is VALID [2022-02-20 19:46:17,936 INFO L290 TraceCheckUtils]: 57: Hoare triple {21328#false} ~mode5~0 := 0; {21328#false} is VALID [2022-02-20 19:46:17,936 INFO L290 TraceCheckUtils]: 58: Hoare triple {21328#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {21328#false} is VALID [2022-02-20 19:46:17,936 INFO L290 TraceCheckUtils]: 59: Hoare triple {21328#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {21328#false} is VALID [2022-02-20 19:46:17,936 INFO L290 TraceCheckUtils]: 60: Hoare triple {21328#false} check_#res#1 := check_~tmp~1#1; {21328#false} is VALID [2022-02-20 19:46:17,937 INFO L290 TraceCheckUtils]: 61: Hoare triple {21328#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {21328#false} is VALID [2022-02-20 19:46:17,937 INFO L290 TraceCheckUtils]: 62: Hoare triple {21328#false} assume 0 == assert_~arg#1 % 256; {21328#false} is VALID [2022-02-20 19:46:17,937 INFO L290 TraceCheckUtils]: 63: Hoare triple {21328#false} assume !false; {21328#false} is VALID [2022-02-20 19:46:17,937 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 19:46:17,937 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:46:17,937 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446777775] [2022-02-20 19:46:17,938 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446777775] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:46:17,938 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:46:17,938 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:46:17,938 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720148076] [2022-02-20 19:46:17,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:46:17,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:46:17,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:46:17,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:17,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:46:17,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:46:17,975 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:46:17,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:46:17,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:46:17,975 INFO L87 Difference]: Start difference. First operand 1121 states and 1993 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:19,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:19,677 INFO L93 Difference]: Finished difference Result 1733 states and 2947 transitions. [2022-02-20 19:46:19,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:46:19,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:46:19,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:46:19,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:19,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:46:19,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:19,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:46:19,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1712 transitions. [2022-02-20 19:46:20,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1712 edges. 1712 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:46:21,048 INFO L225 Difference]: With dead ends: 1733 [2022-02-20 19:46:21,048 INFO L226 Difference]: Without dead ends: 1403 [2022-02-20 19:46:21,049 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 19:46:21,051 INFO L933 BasicCegarLoop]: 1611 mSDtfsCounter, 1499 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 1703 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 19:46:21,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1499 Valid, 1703 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:46:21,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2022-02-20 19:46:21,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 1401. [2022-02-20 19:46:21,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:46:21,078 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1403 states. Second operand has 1401 states, 1399 states have (on average 1.7305218012866332) internal successors, (2421), 1400 states have internal predecessors, (2421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:21,079 INFO L74 IsIncluded]: Start isIncluded. First operand 1403 states. Second operand has 1401 states, 1399 states have (on average 1.7305218012866332) internal successors, (2421), 1400 states have internal predecessors, (2421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:21,081 INFO L87 Difference]: Start difference. First operand 1403 states. Second operand has 1401 states, 1399 states have (on average 1.7305218012866332) internal successors, (2421), 1400 states have internal predecessors, (2421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:21,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:21,129 INFO L93 Difference]: Finished difference Result 1403 states and 2422 transitions. [2022-02-20 19:46:21,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 2422 transitions. [2022-02-20 19:46:21,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:46:21,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:46:21,139 INFO L74 IsIncluded]: Start isIncluded. First operand has 1401 states, 1399 states have (on average 1.7305218012866332) internal successors, (2421), 1400 states have internal predecessors, (2421), 0 states have call successors, (0), 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 1403 states. [2022-02-20 19:46:21,141 INFO L87 Difference]: Start difference. First operand has 1401 states, 1399 states have (on average 1.7305218012866332) internal successors, (2421), 1400 states have internal predecessors, (2421), 0 states have call successors, (0), 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 1403 states. [2022-02-20 19:46:21,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:21,190 INFO L93 Difference]: Finished difference Result 1403 states and 2422 transitions. [2022-02-20 19:46:21,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 2422 transitions. [2022-02-20 19:46:21,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:46:21,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:46:21,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:46:21,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:46:21,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1401 states, 1399 states have (on average 1.7305218012866332) internal successors, (2421), 1400 states have internal predecessors, (2421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:21,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 2421 transitions. [2022-02-20 19:46:21,247 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 2421 transitions. Word has length 64 [2022-02-20 19:46:21,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:46:21,247 INFO L470 AbstractCegarLoop]: Abstraction has 1401 states and 2421 transitions. [2022-02-20 19:46:21,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:21,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 2421 transitions. [2022-02-20 19:46:21,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:46:21,249 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:46:21,249 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:46:21,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:46:21,249 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:46:21,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:46:21,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1105068988, now seen corresponding path program 1 times [2022-02-20 19:46:21,250 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:46:21,250 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985504739] [2022-02-20 19:46:21,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:46:21,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:46:21,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:46:21,317 INFO L290 TraceCheckUtils]: 0: Hoare triple {27604#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {27604#true} is VALID [2022-02-20 19:46:21,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {27604#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {27604#true} is VALID [2022-02-20 19:46:21,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {27604#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {27604#true} is VALID [2022-02-20 19:46:21,317 INFO L290 TraceCheckUtils]: 3: Hoare triple {27604#true} assume 0 == ~r1~0 % 256; {27604#true} is VALID [2022-02-20 19:46:21,317 INFO L290 TraceCheckUtils]: 4: Hoare triple {27604#true} assume ~id1~0 >= 0; {27604#true} is VALID [2022-02-20 19:46:21,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {27604#true} assume 0 == ~st1~0; {27604#true} is VALID [2022-02-20 19:46:21,318 INFO L290 TraceCheckUtils]: 6: Hoare triple {27604#true} assume ~send1~0 == ~id1~0; {27604#true} is VALID [2022-02-20 19:46:21,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {27604#true} assume 0 == ~mode1~0 % 256; {27604#true} is VALID [2022-02-20 19:46:21,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {27604#true} assume ~id2~0 >= 0; {27604#true} is VALID [2022-02-20 19:46:21,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {27604#true} assume 0 == ~st2~0; {27604#true} is VALID [2022-02-20 19:46:21,318 INFO L290 TraceCheckUtils]: 10: Hoare triple {27604#true} assume ~send2~0 == ~id2~0; {27604#true} is VALID [2022-02-20 19:46:21,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {27604#true} assume 0 == ~mode2~0 % 256; {27604#true} is VALID [2022-02-20 19:46:21,318 INFO L290 TraceCheckUtils]: 12: Hoare triple {27604#true} assume ~id3~0 >= 0; {27604#true} is VALID [2022-02-20 19:46:21,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {27604#true} assume 0 == ~st3~0; {27604#true} is VALID [2022-02-20 19:46:21,319 INFO L290 TraceCheckUtils]: 14: Hoare triple {27604#true} assume ~send3~0 == ~id3~0; {27604#true} is VALID [2022-02-20 19:46:21,319 INFO L290 TraceCheckUtils]: 15: Hoare triple {27604#true} assume 0 == ~mode3~0 % 256; {27604#true} is VALID [2022-02-20 19:46:21,323 INFO L290 TraceCheckUtils]: 16: Hoare triple {27604#true} assume ~id4~0 >= 0; {27604#true} is VALID [2022-02-20 19:46:21,323 INFO L290 TraceCheckUtils]: 17: Hoare triple {27604#true} assume 0 == ~st4~0; {27604#true} is VALID [2022-02-20 19:46:21,323 INFO L290 TraceCheckUtils]: 18: Hoare triple {27604#true} assume ~send4~0 == ~id4~0; {27604#true} is VALID [2022-02-20 19:46:21,324 INFO L290 TraceCheckUtils]: 19: Hoare triple {27604#true} assume 0 == ~mode4~0 % 256; {27604#true} is VALID [2022-02-20 19:46:21,324 INFO L290 TraceCheckUtils]: 20: Hoare triple {27604#true} assume ~id5~0 >= 0; {27604#true} is VALID [2022-02-20 19:46:21,324 INFO L290 TraceCheckUtils]: 21: Hoare triple {27604#true} assume 0 == ~st5~0; {27604#true} is VALID [2022-02-20 19:46:21,324 INFO L290 TraceCheckUtils]: 22: Hoare triple {27604#true} assume ~send5~0 == ~id5~0; {27604#true} is VALID [2022-02-20 19:46:21,325 INFO L290 TraceCheckUtils]: 23: Hoare triple {27604#true} assume 0 == ~mode5~0 % 256; {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:21,325 INFO L290 TraceCheckUtils]: 24: Hoare triple {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:21,325 INFO L290 TraceCheckUtils]: 25: Hoare triple {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:21,326 INFO L290 TraceCheckUtils]: 26: Hoare triple {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:21,326 INFO L290 TraceCheckUtils]: 27: Hoare triple {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:21,326 INFO L290 TraceCheckUtils]: 28: Hoare triple {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:21,327 INFO L290 TraceCheckUtils]: 29: Hoare triple {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:21,327 INFO L290 TraceCheckUtils]: 30: Hoare triple {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:21,327 INFO L290 TraceCheckUtils]: 31: Hoare triple {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:21,328 INFO L290 TraceCheckUtils]: 32: Hoare triple {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:21,328 INFO L290 TraceCheckUtils]: 33: Hoare triple {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:21,328 INFO L290 TraceCheckUtils]: 34: Hoare triple {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:21,329 INFO L290 TraceCheckUtils]: 35: Hoare triple {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:21,329 INFO L290 TraceCheckUtils]: 36: Hoare triple {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:21,329 INFO L290 TraceCheckUtils]: 37: Hoare triple {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:21,330 INFO L290 TraceCheckUtils]: 38: Hoare triple {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:21,330 INFO L290 TraceCheckUtils]: 39: Hoare triple {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:21,331 INFO L290 TraceCheckUtils]: 40: Hoare triple {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:21,331 INFO L290 TraceCheckUtils]: 41: Hoare triple {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:21,331 INFO L290 TraceCheckUtils]: 42: Hoare triple {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:21,332 INFO L290 TraceCheckUtils]: 43: Hoare triple {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:21,333 INFO L290 TraceCheckUtils]: 44: Hoare triple {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:21,333 INFO L290 TraceCheckUtils]: 45: Hoare triple {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:21,334 INFO L290 TraceCheckUtils]: 46: Hoare triple {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:21,336 INFO L290 TraceCheckUtils]: 47: Hoare triple {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:21,337 INFO L290 TraceCheckUtils]: 48: Hoare triple {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite7#1 := ~p3_new~0; {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:21,337 INFO L290 TraceCheckUtils]: 49: Hoare triple {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:21,338 INFO L290 TraceCheckUtils]: 50: Hoare triple {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:21,338 INFO L290 TraceCheckUtils]: 51: Hoare triple {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:21,339 INFO L290 TraceCheckUtils]: 52: Hoare triple {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0);node4_#t~ite8#1 := ~p4_new~0; {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:21,339 INFO L290 TraceCheckUtils]: 53: Hoare triple {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:21,340 INFO L290 TraceCheckUtils]: 54: Hoare triple {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:46:21,340 INFO L290 TraceCheckUtils]: 55: Hoare triple {27606#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {27605#false} is VALID [2022-02-20 19:46:21,340 INFO L290 TraceCheckUtils]: 56: Hoare triple {27605#false} assume !(node5_~m5~0#1 != ~nomsg~0); {27605#false} is VALID [2022-02-20 19:46:21,340 INFO L290 TraceCheckUtils]: 57: Hoare triple {27605#false} ~mode5~0 := 0; {27605#false} is VALID [2022-02-20 19:46:21,341 INFO L290 TraceCheckUtils]: 58: Hoare triple {27605#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {27605#false} is VALID [2022-02-20 19:46:21,341 INFO L290 TraceCheckUtils]: 59: Hoare triple {27605#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {27605#false} is VALID [2022-02-20 19:46:21,341 INFO L290 TraceCheckUtils]: 60: Hoare triple {27605#false} check_#res#1 := check_~tmp~1#1; {27605#false} is VALID [2022-02-20 19:46:21,342 INFO L290 TraceCheckUtils]: 61: Hoare triple {27605#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {27605#false} is VALID [2022-02-20 19:46:21,342 INFO L290 TraceCheckUtils]: 62: Hoare triple {27605#false} assume 0 == assert_~arg#1 % 256; {27605#false} is VALID [2022-02-20 19:46:21,342 INFO L290 TraceCheckUtils]: 63: Hoare triple {27605#false} assume !false; {27605#false} is VALID [2022-02-20 19:46:21,342 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 19:46:21,342 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:46:21,342 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985504739] [2022-02-20 19:46:21,343 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985504739] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:46:21,343 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:46:21,343 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:46:21,343 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223890825] [2022-02-20 19:46:21,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:46:21,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:46:21,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:46:21,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:21,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:46:21,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:46:21,387 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:46:21,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:46:21,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:46:21,388 INFO L87 Difference]: Start difference. First operand 1401 states and 2421 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:23,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:23,067 INFO L93 Difference]: Finished difference Result 2525 states and 4151 transitions. [2022-02-20 19:46:23,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:46:23,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:46:23,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:46:23,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:23,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:46:23,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:23,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:46:23,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1712 transitions. [2022-02-20 19:46:24,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1712 edges. 1712 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:46:24,510 INFO L225 Difference]: With dead ends: 2525 [2022-02-20 19:46:24,510 INFO L226 Difference]: Without dead ends: 1915 [2022-02-20 19:46:24,511 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 19:46:24,512 INFO L933 BasicCegarLoop]: 1606 mSDtfsCounter, 1495 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1495 SdHoareTripleChecker+Valid, 1702 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 19:46:24,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1495 Valid, 1702 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:46:24,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1915 states. [2022-02-20 19:46:24,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1915 to 1913. [2022-02-20 19:46:24,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:46:24,546 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1915 states. Second operand has 1913 states, 1911 states have (on average 1.6687598116169544) internal successors, (3189), 1912 states have internal predecessors, (3189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:24,548 INFO L74 IsIncluded]: Start isIncluded. First operand 1915 states. Second operand has 1913 states, 1911 states have (on average 1.6687598116169544) internal successors, (3189), 1912 states have internal predecessors, (3189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:24,549 INFO L87 Difference]: Start difference. First operand 1915 states. Second operand has 1913 states, 1911 states have (on average 1.6687598116169544) internal successors, (3189), 1912 states have internal predecessors, (3189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:24,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:24,639 INFO L93 Difference]: Finished difference Result 1915 states and 3190 transitions. [2022-02-20 19:46:24,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 3190 transitions. [2022-02-20 19:46:24,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:46:24,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:46:24,644 INFO L74 IsIncluded]: Start isIncluded. First operand has 1913 states, 1911 states have (on average 1.6687598116169544) internal successors, (3189), 1912 states have internal predecessors, (3189), 0 states have call successors, (0), 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 1915 states. [2022-02-20 19:46:24,645 INFO L87 Difference]: Start difference. First operand has 1913 states, 1911 states have (on average 1.6687598116169544) internal successors, (3189), 1912 states have internal predecessors, (3189), 0 states have call successors, (0), 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 1915 states. [2022-02-20 19:46:24,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:24,736 INFO L93 Difference]: Finished difference Result 1915 states and 3190 transitions. [2022-02-20 19:46:24,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 3190 transitions. [2022-02-20 19:46:24,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:46:24,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:46:24,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:46:24,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:46:24,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1913 states, 1911 states have (on average 1.6687598116169544) internal successors, (3189), 1912 states have internal predecessors, (3189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:24,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1913 states to 1913 states and 3189 transitions. [2022-02-20 19:46:24,844 INFO L78 Accepts]: Start accepts. Automaton has 1913 states and 3189 transitions. Word has length 64 [2022-02-20 19:46:24,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:46:24,844 INFO L470 AbstractCegarLoop]: Abstraction has 1913 states and 3189 transitions. [2022-02-20 19:46:24,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:24,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1913 states and 3189 transitions. [2022-02-20 19:46:24,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:46:24,845 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:46:24,845 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:46:24,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:46:24,845 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:46:24,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:46:24,846 INFO L85 PathProgramCache]: Analyzing trace with hash 112916410, now seen corresponding path program 1 times [2022-02-20 19:46:24,846 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:46:24,846 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692347801] [2022-02-20 19:46:24,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:46:24,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:46:24,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:46:24,905 INFO L290 TraceCheckUtils]: 0: Hoare triple {36529#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {36529#true} is VALID [2022-02-20 19:46:24,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {36529#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {36529#true} is VALID [2022-02-20 19:46:24,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {36529#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {36529#true} is VALID [2022-02-20 19:46:24,905 INFO L290 TraceCheckUtils]: 3: Hoare triple {36529#true} assume 0 == ~r1~0 % 256; {36529#true} is VALID [2022-02-20 19:46:24,906 INFO L290 TraceCheckUtils]: 4: Hoare triple {36529#true} assume ~id1~0 >= 0; {36529#true} is VALID [2022-02-20 19:46:24,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {36529#true} assume 0 == ~st1~0; {36531#(<= ~st1~0 0)} is VALID [2022-02-20 19:46:24,906 INFO L290 TraceCheckUtils]: 6: Hoare triple {36531#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {36531#(<= ~st1~0 0)} is VALID [2022-02-20 19:46:24,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {36531#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {36531#(<= ~st1~0 0)} is VALID [2022-02-20 19:46:24,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {36531#(<= ~st1~0 0)} assume ~id2~0 >= 0; {36531#(<= ~st1~0 0)} is VALID [2022-02-20 19:46:24,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {36531#(<= ~st1~0 0)} assume 0 == ~st2~0; {36532#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,907 INFO L290 TraceCheckUtils]: 10: Hoare triple {36532#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {36532#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,908 INFO L290 TraceCheckUtils]: 11: Hoare triple {36532#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {36532#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {36532#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {36532#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {36532#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {36533#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {36533#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {36533#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {36533#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {36533#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,909 INFO L290 TraceCheckUtils]: 16: Hoare triple {36533#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {36533#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,909 INFO L290 TraceCheckUtils]: 17: Hoare triple {36533#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {36534#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,911 INFO L290 TraceCheckUtils]: 18: Hoare triple {36534#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {36534#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,911 INFO L290 TraceCheckUtils]: 19: Hoare triple {36534#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {36534#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,914 INFO L290 TraceCheckUtils]: 20: Hoare triple {36534#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {36534#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,914 INFO L290 TraceCheckUtils]: 21: Hoare triple {36534#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,915 INFO L290 TraceCheckUtils]: 22: Hoare triple {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,915 INFO L290 TraceCheckUtils]: 23: Hoare triple {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,915 INFO L290 TraceCheckUtils]: 24: Hoare triple {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,916 INFO L290 TraceCheckUtils]: 25: Hoare triple {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,916 INFO L290 TraceCheckUtils]: 26: Hoare triple {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,916 INFO L290 TraceCheckUtils]: 27: Hoare triple {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,917 INFO L290 TraceCheckUtils]: 28: Hoare triple {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,917 INFO L290 TraceCheckUtils]: 29: Hoare triple {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,917 INFO L290 TraceCheckUtils]: 30: Hoare triple {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,918 INFO L290 TraceCheckUtils]: 31: Hoare triple {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,918 INFO L290 TraceCheckUtils]: 32: Hoare triple {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,919 INFO L290 TraceCheckUtils]: 33: Hoare triple {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,919 INFO L290 TraceCheckUtils]: 34: Hoare triple {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,919 INFO L290 TraceCheckUtils]: 35: Hoare triple {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,920 INFO L290 TraceCheckUtils]: 36: Hoare triple {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,920 INFO L290 TraceCheckUtils]: 37: Hoare triple {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,920 INFO L290 TraceCheckUtils]: 38: Hoare triple {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,921 INFO L290 TraceCheckUtils]: 39: Hoare triple {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,921 INFO L290 TraceCheckUtils]: 40: Hoare triple {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,922 INFO L290 TraceCheckUtils]: 41: Hoare triple {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,922 INFO L290 TraceCheckUtils]: 42: Hoare triple {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,922 INFO L290 TraceCheckUtils]: 43: Hoare triple {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,923 INFO L290 TraceCheckUtils]: 44: Hoare triple {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,923 INFO L290 TraceCheckUtils]: 45: Hoare triple {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,923 INFO L290 TraceCheckUtils]: 46: Hoare triple {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,924 INFO L290 TraceCheckUtils]: 47: Hoare triple {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,924 INFO L290 TraceCheckUtils]: 48: Hoare triple {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite7#1 := ~p3_new~0; {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,924 INFO L290 TraceCheckUtils]: 49: Hoare triple {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,925 INFO L290 TraceCheckUtils]: 50: Hoare triple {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,925 INFO L290 TraceCheckUtils]: 51: Hoare triple {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,925 INFO L290 TraceCheckUtils]: 52: Hoare triple {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0);node4_#t~ite8#1 := ~p4_new~0; {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,926 INFO L290 TraceCheckUtils]: 53: Hoare triple {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,926 INFO L290 TraceCheckUtils]: 54: Hoare triple {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,927 INFO L290 TraceCheckUtils]: 55: Hoare triple {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode5~0 % 256); {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,927 INFO L290 TraceCheckUtils]: 56: Hoare triple {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,927 INFO L290 TraceCheckUtils]: 57: Hoare triple {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,928 INFO L290 TraceCheckUtils]: 58: Hoare triple {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:46:24,928 INFO L290 TraceCheckUtils]: 59: Hoare triple {36535#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {36530#false} is VALID [2022-02-20 19:46:24,928 INFO L290 TraceCheckUtils]: 60: Hoare triple {36530#false} check_#res#1 := check_~tmp~1#1; {36530#false} is VALID [2022-02-20 19:46:24,928 INFO L290 TraceCheckUtils]: 61: Hoare triple {36530#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {36530#false} is VALID [2022-02-20 19:46:24,929 INFO L290 TraceCheckUtils]: 62: Hoare triple {36530#false} assume 0 == assert_~arg#1 % 256; {36530#false} is VALID [2022-02-20 19:46:24,929 INFO L290 TraceCheckUtils]: 63: Hoare triple {36530#false} assume !false; {36530#false} is VALID [2022-02-20 19:46:24,929 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 19:46:24,929 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:46:24,929 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692347801] [2022-02-20 19:46:24,930 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692347801] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:46:24,930 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:46:24,930 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:46:24,930 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18208628] [2022-02-20 19:46:24,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:46:24,930 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:46:24,931 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:46:24,931 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:24,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:46:24,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:46:24,968 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:46:24,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:46:24,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:46:24,969 INFO L87 Difference]: Start difference. First operand 1913 states and 3189 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:37,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:37,027 INFO L93 Difference]: Finished difference Result 13133 states and 20319 transitions. [2022-02-20 19:46:37,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:46:37,027 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:46:37,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:46:37,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:37,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2378 transitions. [2022-02-20 19:46:37,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:37,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2378 transitions. [2022-02-20 19:46:37,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 2378 transitions. [2022-02-20 19:46:38,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2378 edges. 2378 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:46:43,117 INFO L225 Difference]: With dead ends: 13133 [2022-02-20 19:46:43,117 INFO L226 Difference]: Without dead ends: 12011 [2022-02-20 19:46:43,119 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-02-20 19:46:43,120 INFO L933 BasicCegarLoop]: 1552 mSDtfsCounter, 8512 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8512 SdHoareTripleChecker+Valid, 2392 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:46:43,120 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8512 Valid, 2392 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 19:46:43,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12011 states. [2022-02-20 19:46:44,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12011 to 3033. [2022-02-20 19:46:44,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:46:44,268 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12011 states. Second operand has 3033 states, 3031 states have (on average 1.5958429561200924) internal successors, (4837), 3032 states have internal predecessors, (4837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:44,270 INFO L74 IsIncluded]: Start isIncluded. First operand 12011 states. Second operand has 3033 states, 3031 states have (on average 1.5958429561200924) internal successors, (4837), 3032 states have internal predecessors, (4837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:44,273 INFO L87 Difference]: Start difference. First operand 12011 states. Second operand has 3033 states, 3031 states have (on average 1.5958429561200924) internal successors, (4837), 3032 states have internal predecessors, (4837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:47,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:47,868 INFO L93 Difference]: Finished difference Result 12011 states and 18286 transitions. [2022-02-20 19:46:47,868 INFO L276 IsEmpty]: Start isEmpty. Operand 12011 states and 18286 transitions. [2022-02-20 19:46:47,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:46:47,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:46:47,885 INFO L74 IsIncluded]: Start isIncluded. First operand has 3033 states, 3031 states have (on average 1.5958429561200924) internal successors, (4837), 3032 states have internal predecessors, (4837), 0 states have call successors, (0), 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 12011 states. [2022-02-20 19:46:47,887 INFO L87 Difference]: Start difference. First operand has 3033 states, 3031 states have (on average 1.5958429561200924) internal successors, (4837), 3032 states have internal predecessors, (4837), 0 states have call successors, (0), 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 12011 states. [2022-02-20 19:46:51,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:51,643 INFO L93 Difference]: Finished difference Result 12011 states and 18286 transitions. [2022-02-20 19:46:51,643 INFO L276 IsEmpty]: Start isEmpty. Operand 12011 states and 18286 transitions. [2022-02-20 19:46:51,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:46:51,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:46:51,654 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:46:51,654 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:46:51,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3033 states, 3031 states have (on average 1.5958429561200924) internal successors, (4837), 3032 states have internal predecessors, (4837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:51,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3033 states to 3033 states and 4837 transitions. [2022-02-20 19:46:51,950 INFO L78 Accepts]: Start accepts. Automaton has 3033 states and 4837 transitions. Word has length 64 [2022-02-20 19:46:51,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:46:51,951 INFO L470 AbstractCegarLoop]: Abstraction has 3033 states and 4837 transitions. [2022-02-20 19:46:51,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:51,951 INFO L276 IsEmpty]: Start isEmpty. Operand 3033 states and 4837 transitions. [2022-02-20 19:46:51,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:46:51,951 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:46:51,951 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:46:51,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:46:51,952 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:46:51,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:46:51,952 INFO L85 PathProgramCache]: Analyzing trace with hash -277208054, now seen corresponding path program 1 times [2022-02-20 19:46:51,952 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:46:51,952 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054413252] [2022-02-20 19:46:51,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:46:51,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:46:51,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:46:51,997 INFO L290 TraceCheckUtils]: 0: Hoare triple {80081#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {80081#true} is VALID [2022-02-20 19:46:51,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {80081#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {80081#true} is VALID [2022-02-20 19:46:51,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {80081#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {80081#true} is VALID [2022-02-20 19:46:51,998 INFO L290 TraceCheckUtils]: 3: Hoare triple {80081#true} assume 0 == ~r1~0 % 256; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:51,998 INFO L290 TraceCheckUtils]: 4: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 >= 0; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:51,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:51,999 INFO L290 TraceCheckUtils]: 6: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 == ~id1~0; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:51,999 INFO L290 TraceCheckUtils]: 7: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:51,999 INFO L290 TraceCheckUtils]: 8: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 >= 0; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,000 INFO L290 TraceCheckUtils]: 10: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 == ~id2~0; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 >= 0; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,006 INFO L290 TraceCheckUtils]: 14: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 == ~id3~0; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,007 INFO L290 TraceCheckUtils]: 15: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id4~0 >= 0; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,007 INFO L290 TraceCheckUtils]: 17: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st4~0; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,008 INFO L290 TraceCheckUtils]: 18: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send4~0 == ~id4~0; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,008 INFO L290 TraceCheckUtils]: 19: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode4~0 % 256; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,008 INFO L290 TraceCheckUtils]: 20: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id5~0 >= 0; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,008 INFO L290 TraceCheckUtils]: 21: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st5~0; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,009 INFO L290 TraceCheckUtils]: 22: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send5~0 == ~id5~0; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,009 INFO L290 TraceCheckUtils]: 23: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode5~0 % 256; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,009 INFO L290 TraceCheckUtils]: 24: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id2~0; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,010 INFO L290 TraceCheckUtils]: 25: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id3~0; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,010 INFO L290 TraceCheckUtils]: 26: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id4~0; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,010 INFO L290 TraceCheckUtils]: 27: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id5~0; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,010 INFO L290 TraceCheckUtils]: 28: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id3~0; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,011 INFO L290 TraceCheckUtils]: 29: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id4~0; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,011 INFO L290 TraceCheckUtils]: 30: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id5~0; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,011 INFO L290 TraceCheckUtils]: 31: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 != ~id4~0; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,012 INFO L290 TraceCheckUtils]: 32: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 != ~id5~0; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,012 INFO L290 TraceCheckUtils]: 33: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,012 INFO L290 TraceCheckUtils]: 34: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} init_#res#1 := init_~tmp~0#1; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,012 INFO L290 TraceCheckUtils]: 35: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,013 INFO L290 TraceCheckUtils]: 36: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == assume_abort_if_not_~cond#1); {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,013 INFO L290 TraceCheckUtils]: 37: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,013 INFO L290 TraceCheckUtils]: 38: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,014 INFO L290 TraceCheckUtils]: 39: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode1~0 % 256); {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,014 INFO L290 TraceCheckUtils]: 40: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,014 INFO L290 TraceCheckUtils]: 41: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,014 INFO L290 TraceCheckUtils]: 42: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,015 INFO L290 TraceCheckUtils]: 43: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode2~0 % 256); {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,015 INFO L290 TraceCheckUtils]: 44: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,015 INFO L290 TraceCheckUtils]: 45: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,016 INFO L290 TraceCheckUtils]: 46: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,016 INFO L290 TraceCheckUtils]: 47: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode3~0 % 256); {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,016 INFO L290 TraceCheckUtils]: 48: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite7#1 := ~p3_new~0; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,016 INFO L290 TraceCheckUtils]: 49: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,017 INFO L290 TraceCheckUtils]: 50: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,017 INFO L290 TraceCheckUtils]: 51: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode4~0 % 256); {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,017 INFO L290 TraceCheckUtils]: 52: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0);node4_#t~ite8#1 := ~p4_new~0; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,018 INFO L290 TraceCheckUtils]: 53: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,018 INFO L290 TraceCheckUtils]: 54: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,018 INFO L290 TraceCheckUtils]: 55: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode5~0 % 256); {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,018 INFO L290 TraceCheckUtils]: 56: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,019 INFO L290 TraceCheckUtils]: 57: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,019 INFO L290 TraceCheckUtils]: 58: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,019 INFO L290 TraceCheckUtils]: 59: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:46:52,020 INFO L290 TraceCheckUtils]: 60: Hoare triple {80083#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~r1~0 % 256 >= 5; {80082#false} is VALID [2022-02-20 19:46:52,020 INFO L290 TraceCheckUtils]: 61: Hoare triple {80082#false} assume ~r1~0 % 256 < 5;check_~tmp~1#1 := 1; {80082#false} is VALID [2022-02-20 19:46:52,020 INFO L290 TraceCheckUtils]: 62: Hoare triple {80082#false} check_#res#1 := check_~tmp~1#1; {80082#false} is VALID [2022-02-20 19:46:52,020 INFO L290 TraceCheckUtils]: 63: Hoare triple {80082#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {80082#false} is VALID [2022-02-20 19:46:52,020 INFO L290 TraceCheckUtils]: 64: Hoare triple {80082#false} assume 0 == assert_~arg#1 % 256; {80082#false} is VALID [2022-02-20 19:46:52,020 INFO L290 TraceCheckUtils]: 65: Hoare triple {80082#false} assume !false; {80082#false} is VALID [2022-02-20 19:46:52,021 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 19:46:52,021 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:46:52,021 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054413252] [2022-02-20 19:46:52,021 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054413252] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:46:52,021 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:46:52,021 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:46:52,021 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148640232] [2022-02-20 19:46:52,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:46:52,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 19:46:52,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:46:52,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:46:52,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:46:52,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:46:52,062 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:46:52,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:46:52,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:46:52,063 INFO L87 Difference]: Start difference. First operand 3033 states and 4837 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)