./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.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.3.ufo.BOUNDED-6.pals+Problem12_label00.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 6d20f8abdac11d3a14265079d0abbd72a3c88bf6607f5bf46f98ccd96bfda721 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:38:30,359 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:38:30,361 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:38:30,394 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:38:30,395 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:38:30,396 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:38:30,397 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:38:30,398 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:38:30,400 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:38:30,400 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:38:30,401 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:38:30,402 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:38:30,402 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:38:30,403 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:38:30,404 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:38:30,405 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:38:30,408 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:38:30,409 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:38:30,411 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:38:30,416 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:38:30,418 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:38:30,419 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:38:30,421 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:38:30,422 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:38:30,427 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:38:30,427 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:38:30,428 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:38:30,429 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:38:30,429 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:38:30,430 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:38:30,430 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:38:30,431 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:38:30,432 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:38:30,434 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:38:30,435 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:38:30,435 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:38:30,436 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:38:30,436 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:38:30,436 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:38:30,437 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:38:30,438 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:38:30,438 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:38:30,468 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:38:30,469 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:38:30,469 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:38:30,469 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:38:30,470 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:38:30,470 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:38:30,471 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:38:30,471 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:38:30,471 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:38:30,471 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:38:30,472 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:38:30,472 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:38:30,472 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:38:30,473 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:38:30,473 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:38:30,473 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:38:30,473 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:38:30,473 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:38:30,473 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:38:30,474 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:38:30,474 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:38:30,474 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:38:30,474 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:38:30,474 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:38:30,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:38:30,475 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:38:30,475 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:38:30,475 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:38:30,475 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:38:30,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:38:30,476 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:38:30,476 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:38:30,476 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:38:30,476 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 -> 6d20f8abdac11d3a14265079d0abbd72a3c88bf6607f5bf46f98ccd96bfda721 [2022-02-20 19:38:30,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:38:30,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:38:30,743 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:38:30,744 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:38:30,745 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:38:30,746 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.c [2022-02-20 19:38:30,792 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbd868fda/ee7df0f311554b0c969f54e87eb1d666/FLAG3654ede06 [2022-02-20 19:38:31,414 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:38:31,415 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.c [2022-02-20 19:38:31,443 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbd868fda/ee7df0f311554b0c969f54e87eb1d666/FLAG3654ede06 [2022-02-20 19:38:31,565 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbd868fda/ee7df0f311554b0c969f54e87eb1d666 [2022-02-20 19:38:31,567 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:38:31,568 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:38:31,569 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:38:31,569 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:38:31,573 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:38:31,574 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:38:31" (1/1) ... [2022-02-20 19:38:31,574 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2104ae9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:38:31, skipping insertion in model container [2022-02-20 19:38:31,575 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:38:31" (1/1) ... [2022-02-20 19:38:31,580 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:38:31,694 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:38:31,995 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.3.ufo.BOUNDED-6.pals+Problem12_label00.c[6354,6367] [2022-02-20 19:38:32,031 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.3.ufo.BOUNDED-6.pals+Problem12_label00.c[8229,8242] [2022-02-20 19:38:32,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:38:32,718 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:38:32,760 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.3.ufo.BOUNDED-6.pals+Problem12_label00.c[6354,6367] [2022-02-20 19:38:32,764 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.3.ufo.BOUNDED-6.pals+Problem12_label00.c[8229,8242] [2022-02-20 19:38:33,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:38:33,191 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:38:33,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:38:33 WrapperNode [2022-02-20 19:38:33,191 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:38:33,192 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:38:33,193 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:38:33,193 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:38:33,199 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:38:33" (1/1) ... [2022-02-20 19:38:33,238 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:38:33" (1/1) ... [2022-02-20 19:38:33,649 INFO L137 Inliner]: procedures = 33, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 4976 [2022-02-20 19:38:33,649 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:38:33,650 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:38:33,651 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:38:33,651 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:38:33,658 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:38:33" (1/1) ... [2022-02-20 19:38:33,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:38:33" (1/1) ... [2022-02-20 19:38:33,718 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:38:33" (1/1) ... [2022-02-20 19:38:33,718 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:38:33" (1/1) ... [2022-02-20 19:38:33,933 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:38:33" (1/1) ... [2022-02-20 19:38:33,980 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:38:33" (1/1) ... [2022-02-20 19:38:34,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:38:33" (1/1) ... [2022-02-20 19:38:34,164 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:38:34,166 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:38:34,166 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:38:34,166 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:38:34,168 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:38:33" (1/1) ... [2022-02-20 19:38:34,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:38:34,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:38:34,245 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:38:34,260 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:38:34,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:38:34,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:38:34,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:38:34,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:38:34,418 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:38:34,420 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:38:42,314 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:38:42,337 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:38:42,337 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:38:42,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:38:42 BoogieIcfgContainer [2022-02-20 19:38:42,340 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:38:42,343 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:38:42,343 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:38:42,345 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:38:42,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:38:31" (1/3) ... [2022-02-20 19:38:42,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e3eb92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:38:42, skipping insertion in model container [2022-02-20 19:38:42,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:38:33" (2/3) ... [2022-02-20 19:38:42,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e3eb92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:38:42, skipping insertion in model container [2022-02-20 19:38:42,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:38:42" (3/3) ... [2022-02-20 19:38:42,348 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.c [2022-02-20 19:38:42,352 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:38:42,353 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:38:42,401 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:38:42,406 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:38:42,407 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:38:42,454 INFO L276 IsEmpty]: Start isEmpty. Operand has 878 states, 875 states have (on average 1.904) internal successors, (1666), 877 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have 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:38:42,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 19:38:42,459 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:38:42,460 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:38:42,460 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:38:42,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:38:42,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1520027445, now seen corresponding path program 1 times [2022-02-20 19:38:42,476 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:38:42,477 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409902863] [2022-02-20 19:38:42,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:38:42,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:38:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:38:42,700 INFO L290 TraceCheckUtils]: 0: Hoare triple {881#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(32, 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;~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; {883#(<= 15 ~a24~0)} is VALID [2022-02-20 19:38:42,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {883#(<= 15 ~a24~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {883#(<= 15 ~a24~0)} is VALID [2022-02-20 19:38:42,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {883#(<= 15 ~a24~0)} assume !(0 != main_#t~nondet38#1);havoc main_#t~nondet38#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet36#1, main2_#t~ret37#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {883#(<= 15 ~a24~0)} is VALID [2022-02-20 19:38:42,702 INFO L290 TraceCheckUtils]: 3: Hoare triple {883#(<= 15 ~a24~0)} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet36#1 && main2_#t~nondet36#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet36#1;havoc main2_#t~nondet36#1; {883#(<= 15 ~a24~0)} is VALID [2022-02-20 19:38:42,703 INFO L290 TraceCheckUtils]: 4: Hoare triple {883#(<= 15 ~a24~0)} assume !(((((1 != main2_~input~0#1 && 2 != main2_~input~0#1) && 3 != main2_~input~0#1) && 4 != main2_~input~0#1) && 5 != main2_~input~0#1) && 6 != main2_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main2_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret33#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {883#(<= 15 ~a24~0)} is VALID [2022-02-20 19:38:42,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {883#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {883#(<= 15 ~a24~0)} is VALID [2022-02-20 19:38:42,704 INFO L290 TraceCheckUtils]: 6: Hoare triple {883#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {883#(<= 15 ~a24~0)} is VALID [2022-02-20 19:38:42,704 INFO L290 TraceCheckUtils]: 7: Hoare triple {883#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {883#(<= 15 ~a24~0)} is VALID [2022-02-20 19:38:42,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {883#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {883#(<= 15 ~a24~0)} is VALID [2022-02-20 19:38:42,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {883#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {883#(<= 15 ~a24~0)} is VALID [2022-02-20 19:38:42,706 INFO L290 TraceCheckUtils]: 10: Hoare triple {883#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {883#(<= 15 ~a24~0)} is VALID [2022-02-20 19:38:42,706 INFO L290 TraceCheckUtils]: 11: Hoare triple {883#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {883#(<= 15 ~a24~0)} is VALID [2022-02-20 19:38:42,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {883#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {883#(<= 15 ~a24~0)} is VALID [2022-02-20 19:38:42,707 INFO L290 TraceCheckUtils]: 13: Hoare triple {883#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {883#(<= 15 ~a24~0)} is VALID [2022-02-20 19:38:42,708 INFO L290 TraceCheckUtils]: 14: Hoare triple {883#(<= 15 ~a24~0)} assume (((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0; {882#false} is VALID [2022-02-20 19:38:42,708 INFO L290 TraceCheckUtils]: 15: Hoare triple {882#false} assume !false; {882#false} is VALID [2022-02-20 19:38:42,709 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:38:42,709 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:38:42,710 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409902863] [2022-02-20 19:38:42,712 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409902863] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:38:42,712 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:38:42,712 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:38:42,715 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324538468] [2022-02-20 19:38:42,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:38:42,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 19:38:42,720 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:38:42,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:38:42,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:38:42,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:38:42,739 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:38:42,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:38:42,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:38:42,765 INFO L87 Difference]: Start difference. First operand has 878 states, 875 states have (on average 1.904) internal successors, (1666), 877 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:38:48,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:38:48,557 INFO L93 Difference]: Finished difference Result 2489 states and 4794 transitions. [2022-02-20 19:38:48,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:38:48,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 19:38:48,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:38:48,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:38:48,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4794 transitions. [2022-02-20 19:38:48,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:38:48,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4794 transitions. [2022-02-20 19:38:48,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4794 transitions. [2022-02-20 19:38:52,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4794 edges. 4794 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:38:52,697 INFO L225 Difference]: With dead ends: 2489 [2022-02-20 19:38:52,698 INFO L226 Difference]: Without dead ends: 1563 [2022-02-20 19:38:52,703 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:38:52,706 INFO L933 BasicCegarLoop]: 569 mSDtfsCounter, 916 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2334 mSolverCounterSat, 651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 2985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 651 IncrementalHoareTripleChecker+Valid, 2334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:38:52,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [916 Valid, 580 Invalid, 2985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [651 Valid, 2334 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-02-20 19:38:52,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2022-02-20 19:38:52,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1563. [2022-02-20 19:38:52,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:38:52,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1563 states. Second operand has 1563 states, 1561 states have (on average 1.6399743754003844) internal successors, (2560), 1562 states have internal predecessors, (2560), 0 states have call successors, (0), 0 states have 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:38:52,827 INFO L74 IsIncluded]: Start isIncluded. First operand 1563 states. Second operand has 1563 states, 1561 states have (on average 1.6399743754003844) internal successors, (2560), 1562 states have internal predecessors, (2560), 0 states have call successors, (0), 0 states have 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:38:52,831 INFO L87 Difference]: Start difference. First operand 1563 states. Second operand has 1563 states, 1561 states have (on average 1.6399743754003844) internal successors, (2560), 1562 states have internal predecessors, (2560), 0 states have call successors, (0), 0 states have 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:38:52,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:38:52,952 INFO L93 Difference]: Finished difference Result 1563 states and 2560 transitions. [2022-02-20 19:38:52,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2560 transitions. [2022-02-20 19:38:52,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:38:52,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:38:52,963 INFO L74 IsIncluded]: Start isIncluded. First operand has 1563 states, 1561 states have (on average 1.6399743754003844) internal successors, (2560), 1562 states have internal predecessors, (2560), 0 states have call successors, (0), 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 1563 states. [2022-02-20 19:38:52,967 INFO L87 Difference]: Start difference. First operand has 1563 states, 1561 states have (on average 1.6399743754003844) internal successors, (2560), 1562 states have internal predecessors, (2560), 0 states have call successors, (0), 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 1563 states. [2022-02-20 19:38:53,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:38:53,086 INFO L93 Difference]: Finished difference Result 1563 states and 2560 transitions. [2022-02-20 19:38:53,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2560 transitions. [2022-02-20 19:38:53,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:38:53,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:38:53,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:38:53,090 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:38:53,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1563 states, 1561 states have (on average 1.6399743754003844) internal successors, (2560), 1562 states have internal predecessors, (2560), 0 states have call successors, (0), 0 states have 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:38:53,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 2560 transitions. [2022-02-20 19:38:53,225 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 2560 transitions. Word has length 16 [2022-02-20 19:38:53,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:38:53,226 INFO L470 AbstractCegarLoop]: Abstraction has 1563 states and 2560 transitions. [2022-02-20 19:38:53,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:38:53,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2560 transitions. [2022-02-20 19:38:53,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 19:38:53,228 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:38:53,230 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] [2022-02-20 19:38:53,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:38:53,231 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:38:53,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:38:53,234 INFO L85 PathProgramCache]: Analyzing trace with hash 157814817, now seen corresponding path program 1 times [2022-02-20 19:38:53,235 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:38:53,235 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114801014] [2022-02-20 19:38:53,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:38:53,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:38:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:38:53,338 INFO L290 TraceCheckUtils]: 0: Hoare triple {8114#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(32, 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;~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; {8114#true} is VALID [2022-02-20 19:38:53,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {8114#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {8114#true} is VALID [2022-02-20 19:38:53,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {8114#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, 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~ret21#1, main1_#t~ret22#1, main1_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {8114#true} is VALID [2022-02-20 19:38:53,339 INFO L290 TraceCheckUtils]: 3: Hoare triple {8114#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {8116#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:38:53,340 INFO L290 TraceCheckUtils]: 4: Hoare triple {8116#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {8117#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:38:53,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {8117#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1; {8118#(= |ULTIMATE.start_main1_~i2~0#1| 0)} is VALID [2022-02-20 19:38:53,342 INFO L290 TraceCheckUtils]: 6: Hoare triple {8118#(= |ULTIMATE.start_main1_~i2~0#1| 0)} assume !(0 == main1_~i2~0#1); {8115#false} is VALID [2022-02-20 19:38:53,342 INFO L290 TraceCheckUtils]: 7: Hoare triple {8115#false} ~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;main1_~i2~0#1 := 0; {8115#false} is VALID [2022-02-20 19:38:53,342 INFO L290 TraceCheckUtils]: 8: Hoare triple {8115#false} assume !!(main1_~i2~0#1 < 6);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; {8115#false} is VALID [2022-02-20 19:38:53,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {8115#false} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {8115#false} is VALID [2022-02-20 19:38:53,342 INFO L290 TraceCheckUtils]: 10: Hoare triple {8115#false} assume !(node1_~m1~0#1 != ~nomsg~0); {8115#false} is VALID [2022-02-20 19:38:53,343 INFO L290 TraceCheckUtils]: 11: Hoare triple {8115#false} ~mode1~0 := 0; {8115#false} is VALID [2022-02-20 19:38:53,343 INFO L290 TraceCheckUtils]: 12: Hoare triple {8115#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; {8115#false} is VALID [2022-02-20 19:38:53,343 INFO L290 TraceCheckUtils]: 13: Hoare triple {8115#false} assume !(0 != ~mode2~0 % 256); {8115#false} is VALID [2022-02-20 19:38:53,343 INFO L290 TraceCheckUtils]: 14: Hoare triple {8115#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {8115#false} is VALID [2022-02-20 19:38:53,344 INFO L290 TraceCheckUtils]: 15: Hoare triple {8115#false} ~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; {8115#false} is VALID [2022-02-20 19:38:53,344 INFO L290 TraceCheckUtils]: 16: Hoare triple {8115#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; {8115#false} is VALID [2022-02-20 19:38:53,344 INFO L290 TraceCheckUtils]: 17: Hoare triple {8115#false} assume !(0 != ~mode3~0 % 256); {8115#false} is VALID [2022-02-20 19:38:53,344 INFO L290 TraceCheckUtils]: 18: Hoare triple {8115#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {8115#false} is VALID [2022-02-20 19:38:53,344 INFO L290 TraceCheckUtils]: 19: Hoare triple {8115#false} ~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; {8115#false} is VALID [2022-02-20 19:38:53,345 INFO L290 TraceCheckUtils]: 20: Hoare triple {8115#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {8115#false} is VALID [2022-02-20 19:38:53,345 INFO L290 TraceCheckUtils]: 21: Hoare triple {8115#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {8115#false} is VALID [2022-02-20 19:38:53,345 INFO L290 TraceCheckUtils]: 22: Hoare triple {8115#false} check_#res#1 := check_~tmp~1#1; {8115#false} is VALID [2022-02-20 19:38:53,345 INFO L290 TraceCheckUtils]: 23: Hoare triple {8115#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {8115#false} is VALID [2022-02-20 19:38:53,346 INFO L290 TraceCheckUtils]: 24: Hoare triple {8115#false} assume 0 == assert_~arg#1 % 256; {8115#false} is VALID [2022-02-20 19:38:53,346 INFO L290 TraceCheckUtils]: 25: Hoare triple {8115#false} assume !false; {8115#false} is VALID [2022-02-20 19:38:53,347 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:38:53,347 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:38:53,347 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114801014] [2022-02-20 19:38:53,347 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114801014] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:38:53,348 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:38:53,348 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:38:53,348 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051459114] [2022-02-20 19:38:53,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:38:53,350 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-02-20 19:38:53,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:38:53,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:38:53,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:38:53,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:38:53,374 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:38:53,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:38:53,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:38:53,377 INFO L87 Difference]: Start difference. First operand 1563 states and 2560 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:38:57,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:38:57,682 INFO L93 Difference]: Finished difference Result 1639 states and 2676 transitions. [2022-02-20 19:38:57,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:38:57,683 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-02-20 19:38:57,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:38:57,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:38:57,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1649 transitions. [2022-02-20 19:38:57,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:38:57,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1649 transitions. [2022-02-20 19:38:57,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 1649 transitions. [2022-02-20 19:38:59,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1649 edges. 1649 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:38:59,193 INFO L225 Difference]: With dead ends: 1639 [2022-02-20 19:38:59,193 INFO L226 Difference]: Without dead ends: 1599 [2022-02-20 19:38:59,193 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:38:59,195 INFO L933 BasicCegarLoop]: 1529 mSDtfsCounter, 58 mSDsluCounter, 4566 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 6095 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:38:59,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 6095 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:38:59,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2022-02-20 19:38:59,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1563. [2022-02-20 19:38:59,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:38:59,229 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1599 states. Second operand has 1563 states, 1561 states have (on average 1.6297245355541319) internal successors, (2544), 1562 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have 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:38:59,232 INFO L74 IsIncluded]: Start isIncluded. First operand 1599 states. Second operand has 1563 states, 1561 states have (on average 1.6297245355541319) internal successors, (2544), 1562 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have 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:38:59,236 INFO L87 Difference]: Start difference. First operand 1599 states. Second operand has 1563 states, 1561 states have (on average 1.6297245355541319) internal successors, (2544), 1562 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have 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:38:59,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:38:59,361 INFO L93 Difference]: Finished difference Result 1599 states and 2600 transitions. [2022-02-20 19:38:59,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2600 transitions. [2022-02-20 19:38:59,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:38:59,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:38:59,369 INFO L74 IsIncluded]: Start isIncluded. First operand has 1563 states, 1561 states have (on average 1.6297245355541319) internal successors, (2544), 1562 states have internal predecessors, (2544), 0 states have call successors, (0), 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 1599 states. [2022-02-20 19:38:59,372 INFO L87 Difference]: Start difference. First operand has 1563 states, 1561 states have (on average 1.6297245355541319) internal successors, (2544), 1562 states have internal predecessors, (2544), 0 states have call successors, (0), 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 1599 states. [2022-02-20 19:38:59,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:38:59,496 INFO L93 Difference]: Finished difference Result 1599 states and 2600 transitions. [2022-02-20 19:38:59,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2600 transitions. [2022-02-20 19:38:59,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:38:59,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:38:59,500 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:38:59,500 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:38:59,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1563 states, 1561 states have (on average 1.6297245355541319) internal successors, (2544), 1562 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have 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:38:59,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 2544 transitions. [2022-02-20 19:38:59,632 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 2544 transitions. Word has length 26 [2022-02-20 19:38:59,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:38:59,633 INFO L470 AbstractCegarLoop]: Abstraction has 1563 states and 2544 transitions. [2022-02-20 19:38:59,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:38:59,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2544 transitions. [2022-02-20 19:38:59,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 19:38:59,634 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:38:59,635 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:38:59,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:38:59,636 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:38:59,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:38:59,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1324654887, now seen corresponding path program 1 times [2022-02-20 19:38:59,669 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:38:59,669 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632398605] [2022-02-20 19:38:59,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:38:59,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:38:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:38:59,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {14572#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(32, 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;~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; {14572#true} is VALID [2022-02-20 19:38:59,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {14572#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {14572#true} is VALID [2022-02-20 19:38:59,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {14572#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, 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~ret21#1, main1_#t~ret22#1, main1_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {14572#true} is VALID [2022-02-20 19:38:59,786 INFO L290 TraceCheckUtils]: 3: Hoare triple {14572#true} assume 0 == ~r1~0; {14572#true} is VALID [2022-02-20 19:38:59,786 INFO L290 TraceCheckUtils]: 4: Hoare triple {14572#true} assume ~id1~0 >= 0; {14572#true} is VALID [2022-02-20 19:38:59,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {14572#true} assume 0 == ~st1~0; {14572#true} is VALID [2022-02-20 19:38:59,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {14572#true} assume ~send1~0 == ~id1~0; {14572#true} is VALID [2022-02-20 19:38:59,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {14572#true} assume 0 == ~mode1~0 % 256; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:38:59,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:38:59,791 INFO L290 TraceCheckUtils]: 9: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:38:59,791 INFO L290 TraceCheckUtils]: 10: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:38:59,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:38:59,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:38:59,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:38:59,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:38:59,796 INFO L290 TraceCheckUtils]: 15: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:38:59,796 INFO L290 TraceCheckUtils]: 16: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:38:59,797 INFO L290 TraceCheckUtils]: 17: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:38:59,797 INFO L290 TraceCheckUtils]: 18: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:38:59,800 INFO L290 TraceCheckUtils]: 19: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:38:59,801 INFO L290 TraceCheckUtils]: 20: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:38:59,801 INFO L290 TraceCheckUtils]: 21: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == main1_~i2~0#1); {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:38:59,802 INFO L290 TraceCheckUtils]: 22: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} ~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;main1_~i2~0#1 := 0; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:38:59,803 INFO L290 TraceCheckUtils]: 23: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main1_~i2~0#1 < 6);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; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:38:59,804 INFO L290 TraceCheckUtils]: 24: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {14573#false} is VALID [2022-02-20 19:38:59,804 INFO L290 TraceCheckUtils]: 25: Hoare triple {14573#false} assume !(node1_~m1~0#1 != ~nomsg~0); {14573#false} is VALID [2022-02-20 19:38:59,804 INFO L290 TraceCheckUtils]: 26: Hoare triple {14573#false} ~mode1~0 := 0; {14573#false} is VALID [2022-02-20 19:38:59,804 INFO L290 TraceCheckUtils]: 27: Hoare triple {14573#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; {14573#false} is VALID [2022-02-20 19:38:59,805 INFO L290 TraceCheckUtils]: 28: Hoare triple {14573#false} assume !(0 != ~mode2~0 % 256); {14573#false} is VALID [2022-02-20 19:38:59,806 INFO L290 TraceCheckUtils]: 29: Hoare triple {14573#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {14573#false} is VALID [2022-02-20 19:38:59,806 INFO L290 TraceCheckUtils]: 30: Hoare triple {14573#false} ~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; {14573#false} is VALID [2022-02-20 19:38:59,806 INFO L290 TraceCheckUtils]: 31: Hoare triple {14573#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; {14573#false} is VALID [2022-02-20 19:38:59,807 INFO L290 TraceCheckUtils]: 32: Hoare triple {14573#false} assume !(0 != ~mode3~0 % 256); {14573#false} is VALID [2022-02-20 19:38:59,807 INFO L290 TraceCheckUtils]: 33: Hoare triple {14573#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {14573#false} is VALID [2022-02-20 19:38:59,807 INFO L290 TraceCheckUtils]: 34: Hoare triple {14573#false} ~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; {14573#false} is VALID [2022-02-20 19:38:59,807 INFO L290 TraceCheckUtils]: 35: Hoare triple {14573#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {14573#false} is VALID [2022-02-20 19:38:59,807 INFO L290 TraceCheckUtils]: 36: Hoare triple {14573#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {14573#false} is VALID [2022-02-20 19:38:59,808 INFO L290 TraceCheckUtils]: 37: Hoare triple {14573#false} check_#res#1 := check_~tmp~1#1; {14573#false} is VALID [2022-02-20 19:38:59,808 INFO L290 TraceCheckUtils]: 38: Hoare triple {14573#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {14573#false} is VALID [2022-02-20 19:38:59,808 INFO L290 TraceCheckUtils]: 39: Hoare triple {14573#false} assume 0 == assert_~arg#1 % 256; {14573#false} is VALID [2022-02-20 19:38:59,808 INFO L290 TraceCheckUtils]: 40: Hoare triple {14573#false} assume !false; {14573#false} is VALID [2022-02-20 19:38:59,809 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:38:59,809 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:38:59,809 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632398605] [2022-02-20 19:38:59,810 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632398605] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:38:59,810 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:38:59,810 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:38:59,810 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398548118] [2022-02-20 19:38:59,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:38:59,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-02-20 19:38:59,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:38:59,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:38:59,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:38:59,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:38:59,844 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:38:59,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:38:59,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:38:59,845 INFO L87 Difference]: Start difference. First operand 1563 states and 2544 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:39:01,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:01,644 INFO L93 Difference]: Finished difference Result 1629 states and 2646 transitions. [2022-02-20 19:39:01,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:39:01,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-02-20 19:39:01,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:39:01,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:39:01,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions. [2022-02-20 19:39:01,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:39:01,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions. [2022-02-20 19:39:01,662 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1619 transitions. [2022-02-20 19:39:03,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1619 edges. 1619 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:03,197 INFO L225 Difference]: With dead ends: 1629 [2022-02-20 19:39:03,197 INFO L226 Difference]: Without dead ends: 1593 [2022-02-20 19:39:03,198 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:39:03,199 INFO L933 BasicCegarLoop]: 1559 mSDtfsCounter, 1485 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1485 SdHoareTripleChecker+Valid, 1613 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:39:03,200 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1485 Valid, 1613 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:39:03,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2022-02-20 19:39:03,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1591. [2022-02-20 19:39:03,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:39:03,268 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1593 states. Second operand has 1591 states, 1589 states have (on average 1.6286972938955318) internal successors, (2588), 1590 states have internal predecessors, (2588), 0 states have call successors, (0), 0 states have 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:39:03,270 INFO L74 IsIncluded]: Start isIncluded. First operand 1593 states. Second operand has 1591 states, 1589 states have (on average 1.6286972938955318) internal successors, (2588), 1590 states have internal predecessors, (2588), 0 states have call successors, (0), 0 states have 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:39:03,282 INFO L87 Difference]: Start difference. First operand 1593 states. Second operand has 1591 states, 1589 states have (on average 1.6286972938955318) internal successors, (2588), 1590 states have internal predecessors, (2588), 0 states have call successors, (0), 0 states have 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:39:03,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:03,409 INFO L93 Difference]: Finished difference Result 1593 states and 2589 transitions. [2022-02-20 19:39:03,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2589 transitions. [2022-02-20 19:39:03,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:03,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:03,415 INFO L74 IsIncluded]: Start isIncluded. First operand has 1591 states, 1589 states have (on average 1.6286972938955318) internal successors, (2588), 1590 states have internal predecessors, (2588), 0 states have call successors, (0), 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 1593 states. [2022-02-20 19:39:03,417 INFO L87 Difference]: Start difference. First operand has 1591 states, 1589 states have (on average 1.6286972938955318) internal successors, (2588), 1590 states have internal predecessors, (2588), 0 states have call successors, (0), 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 1593 states. [2022-02-20 19:39:03,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:03,544 INFO L93 Difference]: Finished difference Result 1593 states and 2589 transitions. [2022-02-20 19:39:03,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2589 transitions. [2022-02-20 19:39:03,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:03,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:03,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:39:03,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:39:03,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1591 states, 1589 states have (on average 1.6286972938955318) internal successors, (2588), 1590 states have internal predecessors, (2588), 0 states have call successors, (0), 0 states have 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:39:03,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 2588 transitions. [2022-02-20 19:39:03,668 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 2588 transitions. Word has length 41 [2022-02-20 19:39:03,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:39:03,668 INFO L470 AbstractCegarLoop]: Abstraction has 1591 states and 2588 transitions. [2022-02-20 19:39:03,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:39:03,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 2588 transitions. [2022-02-20 19:39:03,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 19:39:03,671 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:39:03,671 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] [2022-02-20 19:39:03,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:39:03,672 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:39:03,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:39:03,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1376027727, now seen corresponding path program 1 times [2022-02-20 19:39:03,674 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:39:03,674 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330797531] [2022-02-20 19:39:03,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:39:03,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:39:03,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:39:03,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {21035#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(32, 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;~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; {21035#true} is VALID [2022-02-20 19:39:03,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {21035#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {21035#true} is VALID [2022-02-20 19:39:03,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {21035#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, 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~ret21#1, main1_#t~ret22#1, main1_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {21035#true} is VALID [2022-02-20 19:39:03,784 INFO L290 TraceCheckUtils]: 3: Hoare triple {21035#true} assume 0 == ~r1~0; {21035#true} is VALID [2022-02-20 19:39:03,784 INFO L290 TraceCheckUtils]: 4: Hoare triple {21035#true} assume ~id1~0 >= 0; {21035#true} is VALID [2022-02-20 19:39:03,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {21035#true} assume 0 == ~st1~0; {21037#(<= ~st1~0 0)} is VALID [2022-02-20 19:39:03,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {21037#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {21037#(<= ~st1~0 0)} is VALID [2022-02-20 19:39:03,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {21037#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {21037#(<= ~st1~0 0)} is VALID [2022-02-20 19:39:03,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {21037#(<= ~st1~0 0)} assume ~id2~0 >= 0; {21037#(<= ~st1~0 0)} is VALID [2022-02-20 19:39:03,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {21037#(<= ~st1~0 0)} assume 0 == ~st2~0; {21038#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:03,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {21038#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {21038#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:03,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {21038#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {21038#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:03,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {21038#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {21038#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:03,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {21038#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:03,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:03,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:03,789 INFO L290 TraceCheckUtils]: 16: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:03,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:03,789 INFO L290 TraceCheckUtils]: 18: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:03,790 INFO L290 TraceCheckUtils]: 19: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:03,790 INFO L290 TraceCheckUtils]: 20: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:03,791 INFO L290 TraceCheckUtils]: 21: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main1_~i2~0#1); {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:03,793 INFO L290 TraceCheckUtils]: 22: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~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;main1_~i2~0#1 := 0; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:03,793 INFO L290 TraceCheckUtils]: 23: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(main1_~i2~0#1 < 6);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; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:03,794 INFO L290 TraceCheckUtils]: 24: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:03,795 INFO L290 TraceCheckUtils]: 25: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:03,795 INFO L290 TraceCheckUtils]: 26: Hoare triple {21039#(<= (+ ~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; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:03,796 INFO L290 TraceCheckUtils]: 27: Hoare triple {21039#(<= (+ ~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; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:03,797 INFO L290 TraceCheckUtils]: 28: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:03,798 INFO L290 TraceCheckUtils]: 29: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:03,798 INFO L290 TraceCheckUtils]: 30: Hoare triple {21039#(<= (+ ~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; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:03,800 INFO L290 TraceCheckUtils]: 31: Hoare triple {21039#(<= (+ ~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; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:03,800 INFO L290 TraceCheckUtils]: 32: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:03,808 INFO L290 TraceCheckUtils]: 33: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:03,809 INFO L290 TraceCheckUtils]: 34: Hoare triple {21039#(<= (+ ~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; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:03,809 INFO L290 TraceCheckUtils]: 35: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:03,812 INFO L290 TraceCheckUtils]: 36: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {21036#false} is VALID [2022-02-20 19:39:03,812 INFO L290 TraceCheckUtils]: 37: Hoare triple {21036#false} check_#res#1 := check_~tmp~1#1; {21036#false} is VALID [2022-02-20 19:39:03,812 INFO L290 TraceCheckUtils]: 38: Hoare triple {21036#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {21036#false} is VALID [2022-02-20 19:39:03,813 INFO L290 TraceCheckUtils]: 39: Hoare triple {21036#false} assume 0 == assert_~arg#1 % 256; {21036#false} is VALID [2022-02-20 19:39:03,813 INFO L290 TraceCheckUtils]: 40: Hoare triple {21036#false} assume !false; {21036#false} is VALID [2022-02-20 19:39:03,813 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:39:03,814 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:39:03,814 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330797531] [2022-02-20 19:39:03,814 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330797531] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:39:03,814 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:39:03,814 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:39:03,814 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527769408] [2022-02-20 19:39:03,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:39:03,815 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-02-20 19:39:03,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:39:03,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:39:03,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:03,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:39:03,846 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:39:03,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:39:03,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:39:03,847 INFO L87 Difference]: Start difference. First operand 1591 states and 2588 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:39:06,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:06,418 INFO L93 Difference]: Finished difference Result 1975 states and 3188 transitions. [2022-02-20 19:39:06,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 19:39:06,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-02-20 19:39:06,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:39:06,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:39:06,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1853 transitions. [2022-02-20 19:39:06,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:39:06,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1853 transitions. [2022-02-20 19:39:06,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1853 transitions. [2022-02-20 19:39:07,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1853 edges. 1853 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:08,053 INFO L225 Difference]: With dead ends: 1975 [2022-02-20 19:39:08,053 INFO L226 Difference]: Without dead ends: 1911 [2022-02-20 19:39:08,054 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:39:08,055 INFO L933 BasicCegarLoop]: 1511 mSDtfsCounter, 4709 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4709 SdHoareTripleChecker+Valid, 1779 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:39:08,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4709 Valid, 1779 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:39:08,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1911 states. [2022-02-20 19:39:08,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1911 to 1653. [2022-02-20 19:39:08,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:39:08,143 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1911 states. Second operand has 1653 states, 1651 states have (on average 1.6250757116898848) internal successors, (2683), 1652 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have 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:39:08,145 INFO L74 IsIncluded]: Start isIncluded. First operand 1911 states. Second operand has 1653 states, 1651 states have (on average 1.6250757116898848) internal successors, (2683), 1652 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have 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:39:08,147 INFO L87 Difference]: Start difference. First operand 1911 states. Second operand has 1653 states, 1651 states have (on average 1.6250757116898848) internal successors, (2683), 1652 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have 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:39:08,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:08,313 INFO L93 Difference]: Finished difference Result 1911 states and 3076 transitions. [2022-02-20 19:39:08,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 3076 transitions. [2022-02-20 19:39:08,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:08,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:08,319 INFO L74 IsIncluded]: Start isIncluded. First operand has 1653 states, 1651 states have (on average 1.6250757116898848) internal successors, (2683), 1652 states have internal predecessors, (2683), 0 states have call successors, (0), 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 1911 states. [2022-02-20 19:39:08,321 INFO L87 Difference]: Start difference. First operand has 1653 states, 1651 states have (on average 1.6250757116898848) internal successors, (2683), 1652 states have internal predecessors, (2683), 0 states have call successors, (0), 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 1911 states. [2022-02-20 19:39:08,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:08,479 INFO L93 Difference]: Finished difference Result 1911 states and 3076 transitions. [2022-02-20 19:39:08,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 3076 transitions. [2022-02-20 19:39:08,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:08,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:08,483 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:39:08,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:39:08,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1653 states, 1651 states have (on average 1.6250757116898848) internal successors, (2683), 1652 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have 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:39:08,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 2683 transitions. [2022-02-20 19:39:08,584 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 2683 transitions. Word has length 41 [2022-02-20 19:39:08,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:39:08,585 INFO L470 AbstractCegarLoop]: Abstraction has 1653 states and 2683 transitions. [2022-02-20 19:39:08,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:39:08,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 2683 transitions. [2022-02-20 19:39:08,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 19:39:08,586 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:39:08,586 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] [2022-02-20 19:39:08,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:39:08,586 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:39:08,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:39:08,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1902982177, now seen corresponding path program 1 times [2022-02-20 19:39:08,587 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:39:08,587 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415262612] [2022-02-20 19:39:08,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:39:08,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:39:08,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:39:08,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {28629#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(32, 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;~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; {28629#true} is VALID [2022-02-20 19:39:08,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {28629#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {28629#true} is VALID [2022-02-20 19:39:08,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {28629#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, 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~ret21#1, main1_#t~ret22#1, main1_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {28629#true} is VALID [2022-02-20 19:39:08,636 INFO L290 TraceCheckUtils]: 3: Hoare triple {28629#true} assume 0 == ~r1~0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:08,636 INFO L290 TraceCheckUtils]: 4: Hoare triple {28631#(<= ~r1~0 0)} assume ~id1~0 >= 0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:08,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {28631#(<= ~r1~0 0)} assume 0 == ~st1~0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:08,637 INFO L290 TraceCheckUtils]: 6: Hoare triple {28631#(<= ~r1~0 0)} assume ~send1~0 == ~id1~0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:08,637 INFO L290 TraceCheckUtils]: 7: Hoare triple {28631#(<= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:08,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {28631#(<= ~r1~0 0)} assume ~id2~0 >= 0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:08,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {28631#(<= ~r1~0 0)} assume 0 == ~st2~0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:08,638 INFO L290 TraceCheckUtils]: 10: Hoare triple {28631#(<= ~r1~0 0)} assume ~send2~0 == ~id2~0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:08,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {28631#(<= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:08,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {28631#(<= ~r1~0 0)} assume ~id3~0 >= 0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:08,640 INFO L290 TraceCheckUtils]: 13: Hoare triple {28631#(<= ~r1~0 0)} assume 0 == ~st3~0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:08,640 INFO L290 TraceCheckUtils]: 14: Hoare triple {28631#(<= ~r1~0 0)} assume ~send3~0 == ~id3~0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:08,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {28631#(<= ~r1~0 0)} assume 0 == ~mode3~0 % 256; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:08,641 INFO L290 TraceCheckUtils]: 16: Hoare triple {28631#(<= ~r1~0 0)} assume ~id1~0 != ~id2~0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:08,641 INFO L290 TraceCheckUtils]: 17: Hoare triple {28631#(<= ~r1~0 0)} assume ~id1~0 != ~id3~0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:08,642 INFO L290 TraceCheckUtils]: 18: Hoare triple {28631#(<= ~r1~0 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:08,642 INFO L290 TraceCheckUtils]: 19: Hoare triple {28631#(<= ~r1~0 0)} init_#res#1 := init_~tmp~0#1; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:08,642 INFO L290 TraceCheckUtils]: 20: Hoare triple {28631#(<= ~r1~0 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:08,643 INFO L290 TraceCheckUtils]: 21: Hoare triple {28631#(<= ~r1~0 0)} assume !(0 == main1_~i2~0#1); {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:08,643 INFO L290 TraceCheckUtils]: 22: Hoare triple {28631#(<= ~r1~0 0)} ~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;main1_~i2~0#1 := 0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:08,643 INFO L290 TraceCheckUtils]: 23: Hoare triple {28631#(<= ~r1~0 0)} assume !!(main1_~i2~0#1 < 6);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; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:08,644 INFO L290 TraceCheckUtils]: 24: Hoare triple {28631#(<= ~r1~0 0)} assume !(0 != ~mode1~0 % 256); {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:08,644 INFO L290 TraceCheckUtils]: 25: Hoare triple {28631#(<= ~r1~0 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:08,645 INFO L290 TraceCheckUtils]: 26: Hoare triple {28631#(<= ~r1~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; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:08,645 INFO L290 TraceCheckUtils]: 27: Hoare triple {28631#(<= ~r1~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; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:08,645 INFO L290 TraceCheckUtils]: 28: Hoare triple {28631#(<= ~r1~0 0)} assume !(0 != ~mode2~0 % 256); {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:08,646 INFO L290 TraceCheckUtils]: 29: Hoare triple {28631#(<= ~r1~0 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:08,646 INFO L290 TraceCheckUtils]: 30: Hoare triple {28631#(<= ~r1~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; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:08,646 INFO L290 TraceCheckUtils]: 31: Hoare triple {28631#(<= ~r1~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; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:08,647 INFO L290 TraceCheckUtils]: 32: Hoare triple {28631#(<= ~r1~0 0)} assume !(0 != ~mode3~0 % 256); {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:08,647 INFO L290 TraceCheckUtils]: 33: Hoare triple {28631#(<= ~r1~0 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:08,648 INFO L290 TraceCheckUtils]: 34: Hoare triple {28631#(<= ~r1~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; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:08,648 INFO L290 TraceCheckUtils]: 35: Hoare triple {28631#(<= ~r1~0 0)} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:08,648 INFO L290 TraceCheckUtils]: 36: Hoare triple {28631#(<= ~r1~0 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:08,649 INFO L290 TraceCheckUtils]: 37: Hoare triple {28631#(<= ~r1~0 0)} assume ~r1~0 >= 3; {28630#false} is VALID [2022-02-20 19:39:08,649 INFO L290 TraceCheckUtils]: 38: Hoare triple {28630#false} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {28630#false} is VALID [2022-02-20 19:39:08,649 INFO L290 TraceCheckUtils]: 39: Hoare triple {28630#false} check_#res#1 := check_~tmp~1#1; {28630#false} is VALID [2022-02-20 19:39:08,649 INFO L290 TraceCheckUtils]: 40: Hoare triple {28630#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {28630#false} is VALID [2022-02-20 19:39:08,649 INFO L290 TraceCheckUtils]: 41: Hoare triple {28630#false} assume 0 == assert_~arg#1 % 256; {28630#false} is VALID [2022-02-20 19:39:08,650 INFO L290 TraceCheckUtils]: 42: Hoare triple {28630#false} assume !false; {28630#false} is VALID [2022-02-20 19:39:08,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:39:08,650 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:39:08,650 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415262612] [2022-02-20 19:39:08,650 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415262612] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:39:08,650 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:39:08,650 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:39:08,650 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653050373] [2022-02-20 19:39:08,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:39:08,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 19:39:08,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:39:08,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:39:08,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:08,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:39:08,678 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:39:08,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:39:08,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:39:08,679 INFO L87 Difference]: Start difference. First operand 1653 states and 2683 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:39:10,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:10,150 INFO L93 Difference]: Finished difference Result 1840 states and 2970 transitions. [2022-02-20 19:39:10,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:39:10,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 19:39:10,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:39:10,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:39:10,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1620 transitions. [2022-02-20 19:39:10,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:39:10,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1620 transitions. [2022-02-20 19:39:10,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1620 transitions. [2022-02-20 19:39:11,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1620 edges. 1620 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:11,513 INFO L225 Difference]: With dead ends: 1840 [2022-02-20 19:39:11,513 INFO L226 Difference]: Without dead ends: 1714 [2022-02-20 19:39:11,514 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:39:11,515 INFO L933 BasicCegarLoop]: 1514 mSDtfsCounter, 1469 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1469 SdHoareTripleChecker+Valid, 1565 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:39:11,515 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1469 Valid, 1565 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:39:11,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2022-02-20 19:39:11,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 1712. [2022-02-20 19:39:11,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:39:11,625 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1714 states. Second operand has 1712 states, 1710 states have (on average 1.62046783625731) internal successors, (2771), 1711 states have internal predecessors, (2771), 0 states have call successors, (0), 0 states have 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:39:11,627 INFO L74 IsIncluded]: Start isIncluded. First operand 1714 states. Second operand has 1712 states, 1710 states have (on average 1.62046783625731) internal successors, (2771), 1711 states have internal predecessors, (2771), 0 states have call successors, (0), 0 states have 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:39:11,628 INFO L87 Difference]: Start difference. First operand 1714 states. Second operand has 1712 states, 1710 states have (on average 1.62046783625731) internal successors, (2771), 1711 states have internal predecessors, (2771), 0 states have call successors, (0), 0 states have 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:39:11,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:11,738 INFO L93 Difference]: Finished difference Result 1714 states and 2772 transitions. [2022-02-20 19:39:11,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2772 transitions. [2022-02-20 19:39:11,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:11,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:11,744 INFO L74 IsIncluded]: Start isIncluded. First operand has 1712 states, 1710 states have (on average 1.62046783625731) internal successors, (2771), 1711 states have internal predecessors, (2771), 0 states have call successors, (0), 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 1714 states. [2022-02-20 19:39:11,745 INFO L87 Difference]: Start difference. First operand has 1712 states, 1710 states have (on average 1.62046783625731) internal successors, (2771), 1711 states have internal predecessors, (2771), 0 states have call successors, (0), 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 1714 states. [2022-02-20 19:39:11,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:11,901 INFO L93 Difference]: Finished difference Result 1714 states and 2772 transitions. [2022-02-20 19:39:11,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2772 transitions. [2022-02-20 19:39:11,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:11,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:11,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:39:11,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:39:11,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1712 states, 1710 states have (on average 1.62046783625731) internal successors, (2771), 1711 states have internal predecessors, (2771), 0 states have call successors, (0), 0 states have 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:39:11,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2771 transitions. [2022-02-20 19:39:11,999 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2771 transitions. Word has length 43 [2022-02-20 19:39:11,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:39:11,999 INFO L470 AbstractCegarLoop]: Abstraction has 1712 states and 2771 transitions. [2022-02-20 19:39:12,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:39:12,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2771 transitions. [2022-02-20 19:39:12,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 19:39:12,000 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:39:12,001 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] [2022-02-20 19:39:12,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:39:12,001 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:39:12,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:39:12,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1836488665, now seen corresponding path program 1 times [2022-02-20 19:39:12,002 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:39:12,002 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863174165] [2022-02-20 19:39:12,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:39:12,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:39:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:39:12,112 INFO L290 TraceCheckUtils]: 0: Hoare triple {35732#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(32, 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;~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; {35732#true} is VALID [2022-02-20 19:39:12,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {35732#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {35732#true} is VALID [2022-02-20 19:39:12,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {35732#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, 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~ret21#1, main1_#t~ret22#1, main1_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {35732#true} is VALID [2022-02-20 19:39:12,112 INFO L290 TraceCheckUtils]: 3: Hoare triple {35732#true} assume 0 == ~r1~0; {35732#true} is VALID [2022-02-20 19:39:12,113 INFO L290 TraceCheckUtils]: 4: Hoare triple {35732#true} assume ~id1~0 >= 0; {35732#true} is VALID [2022-02-20 19:39:12,113 INFO L290 TraceCheckUtils]: 5: Hoare triple {35732#true} assume 0 == ~st1~0; {35734#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:39:12,113 INFO L290 TraceCheckUtils]: 6: Hoare triple {35734#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send1~0 == ~id1~0; {35734#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:39:12,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {35734#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode1~0 % 256; {35734#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:39:12,114 INFO L290 TraceCheckUtils]: 8: Hoare triple {35734#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id2~0 >= 0; {35734#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:39:12,115 INFO L290 TraceCheckUtils]: 9: Hoare triple {35734#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st2~0; {35735#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:39:12,115 INFO L290 TraceCheckUtils]: 10: Hoare triple {35735#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~send2~0 == ~id2~0; {35735#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:39:12,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {35735#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~mode2~0 % 256; {35735#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:39:12,116 INFO L290 TraceCheckUtils]: 12: Hoare triple {35735#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~id3~0 >= 0; {35735#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:39:12,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {35735#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~st3~0; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:12,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send3~0 == ~id3~0; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:12,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume 0 == ~mode3~0 % 256; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:12,118 INFO L290 TraceCheckUtils]: 16: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id2~0; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:12,119 INFO L290 TraceCheckUtils]: 17: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id3~0; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:12,119 INFO L290 TraceCheckUtils]: 18: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:12,119 INFO L290 TraceCheckUtils]: 19: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} init_#res#1 := init_~tmp~0#1; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:12,120 INFO L290 TraceCheckUtils]: 20: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:12,120 INFO L290 TraceCheckUtils]: 21: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == main1_~i2~0#1); {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:12,121 INFO L290 TraceCheckUtils]: 22: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} ~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;main1_~i2~0#1 := 0; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:12,121 INFO L290 TraceCheckUtils]: 23: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(main1_~i2~0#1 < 6);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; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:12,121 INFO L290 TraceCheckUtils]: 24: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode1~0 % 256); {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:12,122 INFO L290 TraceCheckUtils]: 25: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:12,122 INFO L290 TraceCheckUtils]: 26: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:12,123 INFO L290 TraceCheckUtils]: 27: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:12,123 INFO L290 TraceCheckUtils]: 28: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode2~0 % 256); {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:12,123 INFO L290 TraceCheckUtils]: 29: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:12,124 INFO L290 TraceCheckUtils]: 30: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:12,124 INFO L290 TraceCheckUtils]: 31: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:12,125 INFO L290 TraceCheckUtils]: 32: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode3~0 % 256); {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:12,125 INFO L290 TraceCheckUtils]: 33: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:12,126 INFO L290 TraceCheckUtils]: 34: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:12,126 INFO L290 TraceCheckUtils]: 35: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:12,126 INFO L290 TraceCheckUtils]: 36: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:12,127 INFO L290 TraceCheckUtils]: 37: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~r1~0 >= 3); {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:12,128 INFO L290 TraceCheckUtils]: 38: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);check_~tmp~1#1 := 0; {35733#false} is VALID [2022-02-20 19:39:12,128 INFO L290 TraceCheckUtils]: 39: Hoare triple {35733#false} check_#res#1 := check_~tmp~1#1; {35733#false} is VALID [2022-02-20 19:39:12,128 INFO L290 TraceCheckUtils]: 40: Hoare triple {35733#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {35733#false} is VALID [2022-02-20 19:39:12,128 INFO L290 TraceCheckUtils]: 41: Hoare triple {35733#false} assume 0 == assert_~arg#1 % 256; {35733#false} is VALID [2022-02-20 19:39:12,128 INFO L290 TraceCheckUtils]: 42: Hoare triple {35733#false} assume !false; {35733#false} is VALID [2022-02-20 19:39:12,129 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:39:12,129 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:39:12,129 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863174165] [2022-02-20 19:39:12,129 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863174165] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:39:12,129 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:39:12,129 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:39:12,130 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693864926] [2022-02-20 19:39:12,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:39:12,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 19:39:12,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:39:12,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:39:12,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:12,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:39:12,174 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:39:12,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:39:12,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:39:12,175 INFO L87 Difference]: Start difference. First operand 1712 states and 2771 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:39:14,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:14,924 INFO L93 Difference]: Finished difference Result 1897 states and 3053 transitions. [2022-02-20 19:39:14,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:39:14,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 19:39:14,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:39:14,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:39:14,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1627 transitions. [2022-02-20 19:39:14,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:39:14,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1627 transitions. [2022-02-20 19:39:14,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1627 transitions. [2022-02-20 19:39:16,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1627 edges. 1627 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:16,389 INFO L225 Difference]: With dead ends: 1897 [2022-02-20 19:39:16,389 INFO L226 Difference]: Without dead ends: 1714 [2022-02-20 19:39:16,390 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:39:16,391 INFO L933 BasicCegarLoop]: 1529 mSDtfsCounter, 3002 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3002 SdHoareTripleChecker+Valid, 1633 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:39:16,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3002 Valid, 1633 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:39:16,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2022-02-20 19:39:16,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 1712. [2022-02-20 19:39:16,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:39:16,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1714 states. Second operand has 1712 states, 1710 states have (on average 1.6187134502923977) internal successors, (2768), 1711 states have internal predecessors, (2768), 0 states have call successors, (0), 0 states have 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:39:16,524 INFO L74 IsIncluded]: Start isIncluded. First operand 1714 states. Second operand has 1712 states, 1710 states have (on average 1.6187134502923977) internal successors, (2768), 1711 states have internal predecessors, (2768), 0 states have call successors, (0), 0 states have 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:39:16,526 INFO L87 Difference]: Start difference. First operand 1714 states. Second operand has 1712 states, 1710 states have (on average 1.6187134502923977) internal successors, (2768), 1711 states have internal predecessors, (2768), 0 states have call successors, (0), 0 states have 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:39:16,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:16,660 INFO L93 Difference]: Finished difference Result 1714 states and 2769 transitions. [2022-02-20 19:39:16,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2769 transitions. [2022-02-20 19:39:16,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:16,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:16,665 INFO L74 IsIncluded]: Start isIncluded. First operand has 1712 states, 1710 states have (on average 1.6187134502923977) internal successors, (2768), 1711 states have internal predecessors, (2768), 0 states have call successors, (0), 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 1714 states. [2022-02-20 19:39:16,667 INFO L87 Difference]: Start difference. First operand has 1712 states, 1710 states have (on average 1.6187134502923977) internal successors, (2768), 1711 states have internal predecessors, (2768), 0 states have call successors, (0), 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 1714 states. [2022-02-20 19:39:16,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:16,803 INFO L93 Difference]: Finished difference Result 1714 states and 2769 transitions. [2022-02-20 19:39:16,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2769 transitions. [2022-02-20 19:39:16,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:16,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:16,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:39:16,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:39:16,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1712 states, 1710 states have (on average 1.6187134502923977) internal successors, (2768), 1711 states have internal predecessors, (2768), 0 states have call successors, (0), 0 states have 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:39:16,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2768 transitions. [2022-02-20 19:39:16,944 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2768 transitions. Word has length 43 [2022-02-20 19:39:16,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:39:16,945 INFO L470 AbstractCegarLoop]: Abstraction has 1712 states and 2768 transitions. [2022-02-20 19:39:16,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:39:16,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2768 transitions. [2022-02-20 19:39:16,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 19:39:16,945 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:39:16,945 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] [2022-02-20 19:39:16,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:39:16,946 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:39:16,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:39:16,946 INFO L85 PathProgramCache]: Analyzing trace with hash -47574589, now seen corresponding path program 1 times [2022-02-20 19:39:16,946 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:39:16,946 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629847757] [2022-02-20 19:39:16,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:39:16,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:39:16,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:39:16,987 INFO L290 TraceCheckUtils]: 0: Hoare triple {42907#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(32, 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;~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; {42907#true} is VALID [2022-02-20 19:39:16,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {42907#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {42907#true} is VALID [2022-02-20 19:39:16,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {42907#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, 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~ret21#1, main1_#t~ret22#1, main1_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {42907#true} is VALID [2022-02-20 19:39:16,988 INFO L290 TraceCheckUtils]: 3: Hoare triple {42907#true} assume 0 == ~r1~0; {42907#true} is VALID [2022-02-20 19:39:16,988 INFO L290 TraceCheckUtils]: 4: Hoare triple {42907#true} assume ~id1~0 >= 0; {42907#true} is VALID [2022-02-20 19:39:16,989 INFO L290 TraceCheckUtils]: 5: Hoare triple {42907#true} assume 0 == ~st1~0; {42907#true} is VALID [2022-02-20 19:39:16,989 INFO L290 TraceCheckUtils]: 6: Hoare triple {42907#true} assume ~send1~0 == ~id1~0; {42907#true} is VALID [2022-02-20 19:39:16,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {42907#true} assume 0 == ~mode1~0 % 256; {42907#true} is VALID [2022-02-20 19:39:16,989 INFO L290 TraceCheckUtils]: 8: Hoare triple {42907#true} assume ~id2~0 >= 0; {42907#true} is VALID [2022-02-20 19:39:16,989 INFO L290 TraceCheckUtils]: 9: Hoare triple {42907#true} assume 0 == ~st2~0; {42907#true} is VALID [2022-02-20 19:39:16,989 INFO L290 TraceCheckUtils]: 10: Hoare triple {42907#true} assume ~send2~0 == ~id2~0; {42907#true} is VALID [2022-02-20 19:39:16,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {42907#true} assume 0 == ~mode2~0 % 256; {42907#true} is VALID [2022-02-20 19:39:16,990 INFO L290 TraceCheckUtils]: 12: Hoare triple {42907#true} assume ~id3~0 >= 0; {42907#true} is VALID [2022-02-20 19:39:16,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {42907#true} assume 0 == ~st3~0; {42907#true} is VALID [2022-02-20 19:39:16,990 INFO L290 TraceCheckUtils]: 14: Hoare triple {42907#true} assume ~send3~0 == ~id3~0; {42907#true} is VALID [2022-02-20 19:39:16,991 INFO L290 TraceCheckUtils]: 15: Hoare triple {42907#true} assume 0 == ~mode3~0 % 256; {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:16,991 INFO L290 TraceCheckUtils]: 16: Hoare triple {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:16,992 INFO L290 TraceCheckUtils]: 17: Hoare triple {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:16,992 INFO L290 TraceCheckUtils]: 18: Hoare triple {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:16,993 INFO L290 TraceCheckUtils]: 19: Hoare triple {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:16,993 INFO L290 TraceCheckUtils]: 20: Hoare triple {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1; {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:16,993 INFO L290 TraceCheckUtils]: 21: Hoare triple {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == main1_~i2~0#1); {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:16,994 INFO L290 TraceCheckUtils]: 22: Hoare triple {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~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;main1_~i2~0#1 := 0; {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:16,994 INFO L290 TraceCheckUtils]: 23: Hoare triple {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(main1_~i2~0#1 < 6);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; {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:16,995 INFO L290 TraceCheckUtils]: 24: Hoare triple {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:16,995 INFO L290 TraceCheckUtils]: 25: Hoare triple {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:16,995 INFO L290 TraceCheckUtils]: 26: Hoare triple {42909#(= (+ (* (- 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; {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:16,996 INFO L290 TraceCheckUtils]: 27: Hoare triple {42909#(= (+ (* (- 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; {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:16,996 INFO L290 TraceCheckUtils]: 28: Hoare triple {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:16,997 INFO L290 TraceCheckUtils]: 29: Hoare triple {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:16,997 INFO L290 TraceCheckUtils]: 30: Hoare triple {42909#(= (+ (* (- 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; {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:16,997 INFO L290 TraceCheckUtils]: 31: Hoare triple {42909#(= (+ (* (- 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; {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:17,003 INFO L290 TraceCheckUtils]: 32: Hoare triple {42909#(= (+ (* (- 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; {42908#false} is VALID [2022-02-20 19:39:17,004 INFO L290 TraceCheckUtils]: 33: Hoare triple {42908#false} assume node3_~m3~0#1 != ~nomsg~0; {42908#false} is VALID [2022-02-20 19:39:17,004 INFO L290 TraceCheckUtils]: 34: Hoare triple {42908#false} assume !(node3_~m3~0#1 > ~id3~0); {42908#false} is VALID [2022-02-20 19:39:17,004 INFO L290 TraceCheckUtils]: 35: Hoare triple {42908#false} assume node3_~m3~0#1 == ~id3~0;~st3~0 := 1; {42908#false} is VALID [2022-02-20 19:39:17,004 INFO L290 TraceCheckUtils]: 36: Hoare triple {42908#false} ~mode3~0 := 0; {42908#false} is VALID [2022-02-20 19:39:17,004 INFO L290 TraceCheckUtils]: 37: Hoare triple {42908#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {42908#false} is VALID [2022-02-20 19:39:17,005 INFO L290 TraceCheckUtils]: 38: Hoare triple {42908#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {42908#false} is VALID [2022-02-20 19:39:17,005 INFO L290 TraceCheckUtils]: 39: Hoare triple {42908#false} check_#res#1 := check_~tmp~1#1; {42908#false} is VALID [2022-02-20 19:39:17,005 INFO L290 TraceCheckUtils]: 40: Hoare triple {42908#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {42908#false} is VALID [2022-02-20 19:39:17,005 INFO L290 TraceCheckUtils]: 41: Hoare triple {42908#false} assume 0 == assert_~arg#1 % 256; {42908#false} is VALID [2022-02-20 19:39:17,005 INFO L290 TraceCheckUtils]: 42: Hoare triple {42908#false} assume !false; {42908#false} is VALID [2022-02-20 19:39:17,006 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:39:17,006 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:39:17,006 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629847757] [2022-02-20 19:39:17,007 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629847757] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:39:17,007 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:39:17,007 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:39:17,008 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732555473] [2022-02-20 19:39:17,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:39:17,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 19:39:17,008 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:39:17,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:39:17,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:17,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:39:17,036 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:39:17,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:39:17,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:39:17,036 INFO L87 Difference]: Start difference. First operand 1712 states and 2768 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:39:18,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:18,956 INFO L93 Difference]: Finished difference Result 2042 states and 3264 transitions. [2022-02-20 19:39:18,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:39:18,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 19:39:18,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:39:18,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:39:18,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions. [2022-02-20 19:39:18,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:39:18,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions. [2022-02-20 19:39:18,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1619 transitions. [2022-02-20 19:39:20,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1619 edges. 1619 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:20,428 INFO L225 Difference]: With dead ends: 2042 [2022-02-20 19:39:20,428 INFO L226 Difference]: Without dead ends: 1859 [2022-02-20 19:39:20,429 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:39:20,429 INFO L933 BasicCegarLoop]: 1541 mSDtfsCounter, 1477 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1477 SdHoareTripleChecker+Valid, 1603 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:39:20,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1477 Valid, 1603 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:39:20,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2022-02-20 19:39:20,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1857. [2022-02-20 19:39:20,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:39:20,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1859 states. Second operand has 1857 states, 1855 states have (on average 1.6059299191374663) internal successors, (2979), 1856 states have internal predecessors, (2979), 0 states have call successors, (0), 0 states have 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:39:20,646 INFO L74 IsIncluded]: Start isIncluded. First operand 1859 states. Second operand has 1857 states, 1855 states have (on average 1.6059299191374663) internal successors, (2979), 1856 states have internal predecessors, (2979), 0 states have call successors, (0), 0 states have 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:39:20,647 INFO L87 Difference]: Start difference. First operand 1859 states. Second operand has 1857 states, 1855 states have (on average 1.6059299191374663) internal successors, (2979), 1856 states have internal predecessors, (2979), 0 states have call successors, (0), 0 states have 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:39:20,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:20,742 INFO L93 Difference]: Finished difference Result 1859 states and 2980 transitions. [2022-02-20 19:39:20,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2980 transitions. [2022-02-20 19:39:20,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:20,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:20,746 INFO L74 IsIncluded]: Start isIncluded. First operand has 1857 states, 1855 states have (on average 1.6059299191374663) internal successors, (2979), 1856 states have internal predecessors, (2979), 0 states have call successors, (0), 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 1859 states. [2022-02-20 19:39:20,748 INFO L87 Difference]: Start difference. First operand has 1857 states, 1855 states have (on average 1.6059299191374663) internal successors, (2979), 1856 states have internal predecessors, (2979), 0 states have call successors, (0), 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 1859 states. [2022-02-20 19:39:20,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:20,850 INFO L93 Difference]: Finished difference Result 1859 states and 2980 transitions. [2022-02-20 19:39:20,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2980 transitions. [2022-02-20 19:39:20,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:20,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:20,852 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:39:20,852 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:39:20,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1857 states, 1855 states have (on average 1.6059299191374663) internal successors, (2979), 1856 states have internal predecessors, (2979), 0 states have call successors, (0), 0 states have 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:39:20,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1857 states to 1857 states and 2979 transitions. [2022-02-20 19:39:20,962 INFO L78 Accepts]: Start accepts. Automaton has 1857 states and 2979 transitions. Word has length 43 [2022-02-20 19:39:20,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:39:20,962 INFO L470 AbstractCegarLoop]: Abstraction has 1857 states and 2979 transitions. [2022-02-20 19:39:20,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:39:20,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1857 states and 2979 transitions. [2022-02-20 19:39:20,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 19:39:20,963 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:39:20,963 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] [2022-02-20 19:39:20,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:39:20,964 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:39:20,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:39:20,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1199933027, now seen corresponding path program 1 times [2022-02-20 19:39:20,964 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:39:20,965 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172053391] [2022-02-20 19:39:20,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:39:20,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:39:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:39:21,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {50728#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(32, 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;~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; {50728#true} is VALID [2022-02-20 19:39:21,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {50728#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {50728#true} is VALID [2022-02-20 19:39:21,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {50728#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, 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~ret21#1, main1_#t~ret22#1, main1_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {50728#true} is VALID [2022-02-20 19:39:21,006 INFO L290 TraceCheckUtils]: 3: Hoare triple {50728#true} assume 0 == ~r1~0; {50728#true} is VALID [2022-02-20 19:39:21,007 INFO L290 TraceCheckUtils]: 4: Hoare triple {50728#true} assume ~id1~0 >= 0; {50728#true} is VALID [2022-02-20 19:39:21,007 INFO L290 TraceCheckUtils]: 5: Hoare triple {50728#true} assume 0 == ~st1~0; {50728#true} is VALID [2022-02-20 19:39:21,007 INFO L290 TraceCheckUtils]: 6: Hoare triple {50728#true} assume ~send1~0 == ~id1~0; {50728#true} is VALID [2022-02-20 19:39:21,007 INFO L290 TraceCheckUtils]: 7: Hoare triple {50728#true} assume 0 == ~mode1~0 % 256; {50728#true} is VALID [2022-02-20 19:39:21,007 INFO L290 TraceCheckUtils]: 8: Hoare triple {50728#true} assume ~id2~0 >= 0; {50728#true} is VALID [2022-02-20 19:39:21,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {50728#true} assume 0 == ~st2~0; {50728#true} is VALID [2022-02-20 19:39:21,008 INFO L290 TraceCheckUtils]: 10: Hoare triple {50728#true} assume ~send2~0 == ~id2~0; {50728#true} is VALID [2022-02-20 19:39:21,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {50728#true} assume 0 == ~mode2~0 % 256; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:21,009 INFO L290 TraceCheckUtils]: 12: Hoare triple {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:21,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:21,010 INFO L290 TraceCheckUtils]: 14: Hoare triple {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:21,010 INFO L290 TraceCheckUtils]: 15: Hoare triple {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:21,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:21,011 INFO L290 TraceCheckUtils]: 17: Hoare triple {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:21,011 INFO L290 TraceCheckUtils]: 18: Hoare triple {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:21,012 INFO L290 TraceCheckUtils]: 19: Hoare triple {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:21,012 INFO L290 TraceCheckUtils]: 20: Hoare triple {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:21,013 INFO L290 TraceCheckUtils]: 21: Hoare triple {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == main1_~i2~0#1); {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:21,013 INFO L290 TraceCheckUtils]: 22: Hoare triple {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~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;main1_~i2~0#1 := 0; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:21,014 INFO L290 TraceCheckUtils]: 23: Hoare triple {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(main1_~i2~0#1 < 6);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; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:21,014 INFO L290 TraceCheckUtils]: 24: Hoare triple {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:21,014 INFO L290 TraceCheckUtils]: 25: Hoare triple {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:21,015 INFO L290 TraceCheckUtils]: 26: Hoare triple {50730#(= (+ (* (- 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; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:21,015 INFO L290 TraceCheckUtils]: 27: Hoare triple {50730#(= (+ (* (- 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; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:21,016 INFO L290 TraceCheckUtils]: 28: Hoare triple {50730#(= (+ (* (- 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; {50729#false} is VALID [2022-02-20 19:39:21,016 INFO L290 TraceCheckUtils]: 29: Hoare triple {50729#false} assume node2_~m2~0#1 != ~nomsg~0; {50729#false} is VALID [2022-02-20 19:39:21,016 INFO L290 TraceCheckUtils]: 30: Hoare triple {50729#false} assume !(node2_~m2~0#1 > ~id2~0); {50729#false} is VALID [2022-02-20 19:39:21,016 INFO L290 TraceCheckUtils]: 31: Hoare triple {50729#false} assume node2_~m2~0#1 == ~id2~0;~st2~0 := 1; {50729#false} is VALID [2022-02-20 19:39:21,016 INFO L290 TraceCheckUtils]: 32: Hoare triple {50729#false} ~mode2~0 := 0; {50729#false} is VALID [2022-02-20 19:39:21,016 INFO L290 TraceCheckUtils]: 33: Hoare triple {50729#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; {50729#false} is VALID [2022-02-20 19:39:21,016 INFO L290 TraceCheckUtils]: 34: Hoare triple {50729#false} assume !(0 != ~mode3~0 % 256); {50729#false} is VALID [2022-02-20 19:39:21,017 INFO L290 TraceCheckUtils]: 35: Hoare triple {50729#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {50729#false} is VALID [2022-02-20 19:39:21,017 INFO L290 TraceCheckUtils]: 36: Hoare triple {50729#false} ~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; {50729#false} is VALID [2022-02-20 19:39:21,017 INFO L290 TraceCheckUtils]: 37: Hoare triple {50729#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {50729#false} is VALID [2022-02-20 19:39:21,017 INFO L290 TraceCheckUtils]: 38: Hoare triple {50729#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {50729#false} is VALID [2022-02-20 19:39:21,017 INFO L290 TraceCheckUtils]: 39: Hoare triple {50729#false} check_#res#1 := check_~tmp~1#1; {50729#false} is VALID [2022-02-20 19:39:21,017 INFO L290 TraceCheckUtils]: 40: Hoare triple {50729#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {50729#false} is VALID [2022-02-20 19:39:21,017 INFO L290 TraceCheckUtils]: 41: Hoare triple {50729#false} assume 0 == assert_~arg#1 % 256; {50729#false} is VALID [2022-02-20 19:39:21,017 INFO L290 TraceCheckUtils]: 42: Hoare triple {50729#false} assume !false; {50729#false} is VALID [2022-02-20 19:39:21,017 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:39:21,018 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:39:21,018 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172053391] [2022-02-20 19:39:21,018 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172053391] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:39:21,018 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:39:21,018 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:39:21,018 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992327499] [2022-02-20 19:39:21,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:39:21,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 19:39:21,019 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:39:21,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:39:21,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:21,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:39:21,047 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:39:21,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:39:21,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:39:21,047 INFO L87 Difference]: Start difference. First operand 1857 states and 2979 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:39:23,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:23,155 INFO L93 Difference]: Finished difference Result 2441 states and 3837 transitions. [2022-02-20 19:39:23,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:39:23,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 19:39:23,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:39:23,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:39:23,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions. [2022-02-20 19:39:23,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:39:23,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions. [2022-02-20 19:39:23,168 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1619 transitions. [2022-02-20 19:39:24,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1619 edges. 1619 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:24,674 INFO L225 Difference]: With dead ends: 2441 [2022-02-20 19:39:24,674 INFO L226 Difference]: Without dead ends: 2113 [2022-02-20 19:39:24,675 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:39:24,676 INFO L933 BasicCegarLoop]: 1554 mSDtfsCounter, 1481 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1481 SdHoareTripleChecker+Valid, 1612 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:39:24,676 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1481 Valid, 1612 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:39:24,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2113 states. [2022-02-20 19:39:25,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2113 to 2111. [2022-02-20 19:39:25,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:39:25,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2113 states. Second operand has 2111 states, 2109 states have (on average 1.5813181602655286) internal successors, (3335), 2110 states have internal predecessors, (3335), 0 states have call successors, (0), 0 states have 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:39:25,035 INFO L74 IsIncluded]: Start isIncluded. First operand 2113 states. Second operand has 2111 states, 2109 states have (on average 1.5813181602655286) internal successors, (3335), 2110 states have internal predecessors, (3335), 0 states have call successors, (0), 0 states have 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:39:25,036 INFO L87 Difference]: Start difference. First operand 2113 states. Second operand has 2111 states, 2109 states have (on average 1.5813181602655286) internal successors, (3335), 2110 states have internal predecessors, (3335), 0 states have call successors, (0), 0 states have 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:39:25,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:25,161 INFO L93 Difference]: Finished difference Result 2113 states and 3336 transitions. [2022-02-20 19:39:25,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 3336 transitions. [2022-02-20 19:39:25,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:25,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:25,165 INFO L74 IsIncluded]: Start isIncluded. First operand has 2111 states, 2109 states have (on average 1.5813181602655286) internal successors, (3335), 2110 states have internal predecessors, (3335), 0 states have call successors, (0), 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 2113 states. [2022-02-20 19:39:25,166 INFO L87 Difference]: Start difference. First operand has 2111 states, 2109 states have (on average 1.5813181602655286) internal successors, (3335), 2110 states have internal predecessors, (3335), 0 states have call successors, (0), 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 2113 states. [2022-02-20 19:39:25,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:25,289 INFO L93 Difference]: Finished difference Result 2113 states and 3336 transitions. [2022-02-20 19:39:25,290 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 3336 transitions. [2022-02-20 19:39:25,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:25,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:25,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:39:25,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:39:25,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2111 states, 2109 states have (on average 1.5813181602655286) internal successors, (3335), 2110 states have internal predecessors, (3335), 0 states have call successors, (0), 0 states have 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:39:25,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2111 states to 2111 states and 3335 transitions. [2022-02-20 19:39:25,424 INFO L78 Accepts]: Start accepts. Automaton has 2111 states and 3335 transitions. Word has length 43 [2022-02-20 19:39:25,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:39:25,424 INFO L470 AbstractCegarLoop]: Abstraction has 2111 states and 3335 transitions. [2022-02-20 19:39:25,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:39:25,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 3335 transitions. [2022-02-20 19:39:25,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-20 19:39:25,425 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:39:25,425 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:39:25,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:39:25,425 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:39:25,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:39:25,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1511296967, now seen corresponding path program 1 times [2022-02-20 19:39:25,426 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:39:25,426 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935545503] [2022-02-20 19:39:25,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:39:25,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:39:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:39:25,518 INFO L290 TraceCheckUtils]: 0: Hoare triple {59885#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(32, 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;~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; {59885#true} is VALID [2022-02-20 19:39:25,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {59885#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {59885#true} is VALID [2022-02-20 19:39:25,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {59885#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, 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~ret21#1, main1_#t~ret22#1, main1_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {59885#true} is VALID [2022-02-20 19:39:25,519 INFO L290 TraceCheckUtils]: 3: Hoare triple {59885#true} assume 0 == ~r1~0; {59885#true} is VALID [2022-02-20 19:39:25,519 INFO L290 TraceCheckUtils]: 4: Hoare triple {59885#true} assume ~id1~0 >= 0; {59885#true} is VALID [2022-02-20 19:39:25,519 INFO L290 TraceCheckUtils]: 5: Hoare triple {59885#true} assume 0 == ~st1~0; {59885#true} is VALID [2022-02-20 19:39:25,519 INFO L290 TraceCheckUtils]: 6: Hoare triple {59885#true} assume ~send1~0 == ~id1~0; {59885#true} is VALID [2022-02-20 19:39:25,519 INFO L290 TraceCheckUtils]: 7: Hoare triple {59885#true} assume 0 == ~mode1~0 % 256; {59885#true} is VALID [2022-02-20 19:39:25,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {59885#true} assume ~id2~0 >= 0; {59885#true} is VALID [2022-02-20 19:39:25,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {59885#true} assume 0 == ~st2~0; {59885#true} is VALID [2022-02-20 19:39:25,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {59885#true} assume ~send2~0 == ~id2~0; {59885#true} is VALID [2022-02-20 19:39:25,520 INFO L290 TraceCheckUtils]: 11: Hoare triple {59885#true} assume 0 == ~mode2~0 % 256; {59885#true} is VALID [2022-02-20 19:39:25,520 INFO L290 TraceCheckUtils]: 12: Hoare triple {59885#true} assume ~id3~0 >= 0; {59885#true} is VALID [2022-02-20 19:39:25,521 INFO L290 TraceCheckUtils]: 13: Hoare triple {59885#true} assume 0 == ~st3~0; {59885#true} is VALID [2022-02-20 19:39:25,521 INFO L290 TraceCheckUtils]: 14: Hoare triple {59885#true} assume ~send3~0 == ~id3~0; {59885#true} is VALID [2022-02-20 19:39:25,521 INFO L290 TraceCheckUtils]: 15: Hoare triple {59885#true} assume 0 == ~mode3~0 % 256; {59885#true} is VALID [2022-02-20 19:39:25,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {59885#true} assume ~id1~0 != ~id2~0; {59885#true} is VALID [2022-02-20 19:39:25,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {59885#true} assume ~id1~0 != ~id3~0; {59885#true} is VALID [2022-02-20 19:39:25,522 INFO L290 TraceCheckUtils]: 18: Hoare triple {59885#true} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {59887#(= |ULTIMATE.start_init_~tmp~0#1| 1)} is VALID [2022-02-20 19:39:25,522 INFO L290 TraceCheckUtils]: 19: Hoare triple {59887#(= |ULTIMATE.start_init_~tmp~0#1| 1)} init_#res#1 := init_~tmp~0#1; {59888#(= |ULTIMATE.start_init_#res#1| 1)} is VALID [2022-02-20 19:39:25,522 INFO L290 TraceCheckUtils]: 20: Hoare triple {59888#(= |ULTIMATE.start_init_#res#1| 1)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1; {59889#(= |ULTIMATE.start_main1_~i2~0#1| 1)} is VALID [2022-02-20 19:39:25,523 INFO L290 TraceCheckUtils]: 21: Hoare triple {59889#(= |ULTIMATE.start_main1_~i2~0#1| 1)} assume !(0 == main1_~i2~0#1); {59885#true} is VALID [2022-02-20 19:39:25,523 INFO L290 TraceCheckUtils]: 22: Hoare triple {59885#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;main1_~i2~0#1 := 0; {59885#true} is VALID [2022-02-20 19:39:25,523 INFO L290 TraceCheckUtils]: 23: Hoare triple {59885#true} assume !!(main1_~i2~0#1 < 6);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; {59885#true} is VALID [2022-02-20 19:39:25,523 INFO L290 TraceCheckUtils]: 24: Hoare triple {59885#true} assume !(0 != ~mode1~0 % 256); {59885#true} is VALID [2022-02-20 19:39:25,523 INFO L290 TraceCheckUtils]: 25: Hoare triple {59885#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {59885#true} is VALID [2022-02-20 19:39:25,523 INFO L290 TraceCheckUtils]: 26: Hoare triple {59885#true} ~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; {59885#true} is VALID [2022-02-20 19:39:25,524 INFO L290 TraceCheckUtils]: 27: Hoare triple {59885#true} 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; {59885#true} is VALID [2022-02-20 19:39:25,524 INFO L290 TraceCheckUtils]: 28: Hoare triple {59885#true} assume !(0 != ~mode2~0 % 256); {59885#true} is VALID [2022-02-20 19:39:25,524 INFO L290 TraceCheckUtils]: 29: Hoare triple {59885#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {59885#true} is VALID [2022-02-20 19:39:25,524 INFO L290 TraceCheckUtils]: 30: Hoare triple {59885#true} ~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; {59885#true} is VALID [2022-02-20 19:39:25,524 INFO L290 TraceCheckUtils]: 31: Hoare triple {59885#true} 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; {59885#true} is VALID [2022-02-20 19:39:25,524 INFO L290 TraceCheckUtils]: 32: Hoare triple {59885#true} assume !(0 != ~mode3~0 % 256); {59885#true} is VALID [2022-02-20 19:39:25,525 INFO L290 TraceCheckUtils]: 33: Hoare triple {59885#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {59885#true} is VALID [2022-02-20 19:39:25,525 INFO L290 TraceCheckUtils]: 34: Hoare triple {59885#true} ~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; {59885#true} is VALID [2022-02-20 19:39:25,525 INFO L290 TraceCheckUtils]: 35: Hoare triple {59885#true} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {59885#true} is VALID [2022-02-20 19:39:25,525 INFO L290 TraceCheckUtils]: 36: Hoare triple {59885#true} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {59885#true} is VALID [2022-02-20 19:39:25,525 INFO L290 TraceCheckUtils]: 37: Hoare triple {59885#true} assume !(~r1~0 >= 3); {59885#true} is VALID [2022-02-20 19:39:25,526 INFO L290 TraceCheckUtils]: 38: Hoare triple {59885#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {59885#true} is VALID [2022-02-20 19:39:25,526 INFO L290 TraceCheckUtils]: 39: Hoare triple {59885#true} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {59890#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} is VALID [2022-02-20 19:39:25,526 INFO L290 TraceCheckUtils]: 40: Hoare triple {59890#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} check_#res#1 := check_~tmp~1#1; {59891#(not (= 0 |ULTIMATE.start_check_#res#1|))} is VALID [2022-02-20 19:39:25,527 INFO L290 TraceCheckUtils]: 41: Hoare triple {59891#(not (= 0 |ULTIMATE.start_check_#res#1|))} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {59892#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} is VALID [2022-02-20 19:39:25,527 INFO L290 TraceCheckUtils]: 42: Hoare triple {59892#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} assume 0 == assert_~arg#1 % 256; {59886#false} is VALID [2022-02-20 19:39:25,528 INFO L290 TraceCheckUtils]: 43: Hoare triple {59886#false} assume !false; {59886#false} is VALID [2022-02-20 19:39:25,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:39:25,528 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:39:25,528 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935545503] [2022-02-20 19:39:25,528 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935545503] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:39:25,529 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:39:25,529 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:39:25,529 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884725064] [2022-02-20 19:39:25,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:39:25,529 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2022-02-20 19:39:25,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:39:25,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have 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:39:25,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:25,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:39:25,556 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:39:25,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:39:25,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:39:25,556 INFO L87 Difference]: Start difference. First operand 2111 states and 3335 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)