./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 66e52001defd7e771c0df8c73cdf4ec6b3d90072c8faf9f52fce6d45ff1a83e7 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:28:47,493 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:28:47,496 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:28:47,531 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:28:47,532 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:28:47,534 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:28:47,536 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:28:47,538 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:28:47,539 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:28:47,542 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:28:47,543 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:28:47,544 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:28:47,544 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:28:47,546 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:28:47,547 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:28:47,549 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:28:47,550 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:28:47,550 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:28:47,552 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:28:47,556 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:28:47,557 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:28:47,558 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:28:47,559 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:28:47,560 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:28:47,564 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:28:47,565 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:28:47,565 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:28:47,566 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:28:47,567 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:28:47,567 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:28:47,568 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:28:47,569 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:28:47,570 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:28:47,570 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:28:47,571 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:28:47,572 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:28:47,572 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:28:47,572 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:28:47,572 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:28:47,573 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:28:47,573 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:28:47,574 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:28:47,598 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:28:47,599 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:28:47,599 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:28:47,599 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:28:47,600 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:28:47,600 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:28:47,601 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:28:47,601 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:28:47,601 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:28:47,601 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:28:47,602 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:28:47,602 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:28:47,602 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:28:47,602 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:28:47,602 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:28:47,603 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:28:47,603 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:28:47,603 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:28:47,603 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:28:47,603 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:28:47,603 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:28:47,604 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:28:47,604 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:28:47,604 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:28:47,604 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:28:47,604 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:28:47,604 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:28:47,604 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:28:47,605 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:28:47,605 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:28:47,605 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:28:47,605 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:28:47,606 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:28:47,606 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 -> 66e52001defd7e771c0df8c73cdf4ec6b3d90072c8faf9f52fce6d45ff1a83e7 [2022-02-20 18:28:47,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:28:47,844 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:28:47,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:28:47,846 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:28:47,847 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:28:47,848 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c [2022-02-20 18:28:47,906 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11b7d6dd2/93fddda5886b4ab782aedb9cb22df132/FLAGcb03ae507 [2022-02-20 18:28:48,266 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:28:48,267 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c [2022-02-20 18:28:48,272 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11b7d6dd2/93fddda5886b4ab782aedb9cb22df132/FLAGcb03ae507 [2022-02-20 18:28:48,280 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11b7d6dd2/93fddda5886b4ab782aedb9cb22df132 [2022-02-20 18:28:48,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:28:48,283 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:28:48,284 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:28:48,284 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:28:48,287 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:28:48,288 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:28:48" (1/1) ... [2022-02-20 18:28:48,288 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bc004f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:48, skipping insertion in model container [2022-02-20 18:28:48,288 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:28:48" (1/1) ... [2022-02-20 18:28:48,293 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:28:48,323 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:28:48,515 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c[6080,6093] [2022-02-20 18:28:48,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:28:48,526 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:28:48,576 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c[6080,6093] [2022-02-20 18:28:48,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:28:48,591 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:28:48,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:48 WrapperNode [2022-02-20 18:28:48,593 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:28:48,595 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:28:48,595 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:28:48,595 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:28:48,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:48" (1/1) ... [2022-02-20 18:28:48,615 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:48" (1/1) ... [2022-02-20 18:28:48,645 INFO L137 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 220 [2022-02-20 18:28:48,646 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:28:48,646 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:28:48,646 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:28:48,646 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:28:48,652 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:48" (1/1) ... [2022-02-20 18:28:48,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:48" (1/1) ... [2022-02-20 18:28:48,661 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:48" (1/1) ... [2022-02-20 18:28:48,662 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:48" (1/1) ... [2022-02-20 18:28:48,668 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:48" (1/1) ... [2022-02-20 18:28:48,677 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:48" (1/1) ... [2022-02-20 18:28:48,680 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:48" (1/1) ... [2022-02-20 18:28:48,684 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:28:48,686 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:28:48,686 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:28:48,687 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:28:48,687 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:48" (1/1) ... [2022-02-20 18:28:48,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:28:48,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:28:48,732 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:28:48,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:28:48,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:28:48,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:28:48,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:28:48,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:28:48,815 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:28:48,816 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:28:49,204 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:28:49,210 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:28:49,213 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 18:28:49,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:28:49 BoogieIcfgContainer [2022-02-20 18:28:49,215 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:28:49,216 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:28:49,216 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:28:49,219 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:28:49,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:28:48" (1/3) ... [2022-02-20 18:28:49,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f902827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:28:49, skipping insertion in model container [2022-02-20 18:28:49,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:48" (2/3) ... [2022-02-20 18:28:49,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f902827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:28:49, skipping insertion in model container [2022-02-20 18:28:49,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:28:49" (3/3) ... [2022-02-20 18:28:49,222 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c [2022-02-20 18:28:49,226 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:28:49,226 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:28:49,268 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:28:49,280 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:28:49,280 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:28:49,295 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 62 states have (on average 1.6774193548387097) internal successors, (104), 63 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:49,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 18:28:49,300 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:49,301 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] [2022-02-20 18:28:49,302 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:49,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:49,306 INFO L85 PathProgramCache]: Analyzing trace with hash -980022832, now seen corresponding path program 1 times [2022-02-20 18:28:49,313 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:49,314 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381390498] [2022-02-20 18:28:49,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:49,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:49,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {67#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(34, 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; {67#true} is VALID [2022-02-20 18:28:49,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1, main_#t~ret21#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -128 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 127;~id1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~st1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~send1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~mode1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {67#true} is VALID [2022-02-20 18:28:49,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {67#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {67#true} is VALID [2022-02-20 18:28:49,483 INFO L290 TraceCheckUtils]: 3: Hoare triple {67#true} init_#res#1 := init_~tmp~0#1; {67#true} is VALID [2022-02-20 18:28:49,483 INFO L290 TraceCheckUtils]: 4: Hoare triple {67#true} main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret20#1 && main_#t~ret20#1 <= 2147483647;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {67#true} is VALID [2022-02-20 18:28:49,484 INFO L290 TraceCheckUtils]: 5: Hoare triple {67#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {68#false} is VALID [2022-02-20 18:28:49,484 INFO L290 TraceCheckUtils]: 6: Hoare triple {68#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {68#false} is VALID [2022-02-20 18:28:49,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {68#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {68#false} is VALID [2022-02-20 18:28:49,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {68#false} assume !(0 != ~mode1~0 % 256); {68#false} is VALID [2022-02-20 18:28:49,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {68#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {68#false} is VALID [2022-02-20 18:28:49,485 INFO L290 TraceCheckUtils]: 10: Hoare triple {68#false} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {68#false} is VALID [2022-02-20 18:28:49,486 INFO L290 TraceCheckUtils]: 11: Hoare triple {68#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {68#false} is VALID [2022-02-20 18:28:49,486 INFO L290 TraceCheckUtils]: 12: Hoare triple {68#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {68#false} is VALID [2022-02-20 18:28:49,486 INFO L290 TraceCheckUtils]: 13: Hoare triple {68#false} assume !(node2_~m2~0#1 != ~nomsg~0); {68#false} is VALID [2022-02-20 18:28:49,486 INFO L290 TraceCheckUtils]: 14: Hoare triple {68#false} ~mode2~0 := 0; {68#false} is VALID [2022-02-20 18:28:49,486 INFO L290 TraceCheckUtils]: 15: Hoare triple {68#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {68#false} is VALID [2022-02-20 18:28:49,487 INFO L290 TraceCheckUtils]: 16: Hoare triple {68#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {68#false} is VALID [2022-02-20 18:28:49,487 INFO L290 TraceCheckUtils]: 17: Hoare triple {68#false} assume !(node3_~m3~0#1 != ~nomsg~0); {68#false} is VALID [2022-02-20 18:28:49,487 INFO L290 TraceCheckUtils]: 18: Hoare triple {68#false} ~mode3~0 := 0; {68#false} is VALID [2022-02-20 18:28:49,488 INFO L290 TraceCheckUtils]: 19: Hoare triple {68#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; {68#false} is VALID [2022-02-20 18:28:49,488 INFO L290 TraceCheckUtils]: 20: Hoare triple {68#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {68#false} is VALID [2022-02-20 18:28:49,488 INFO L290 TraceCheckUtils]: 21: Hoare triple {68#false} check_#res#1 := check_~tmp~1#1; {68#false} is VALID [2022-02-20 18:28:49,492 INFO L290 TraceCheckUtils]: 22: Hoare triple {68#false} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {68#false} is VALID [2022-02-20 18:28:49,492 INFO L290 TraceCheckUtils]: 23: Hoare triple {68#false} assume 0 == assert_~arg#1 % 256; {68#false} is VALID [2022-02-20 18:28:49,493 INFO L290 TraceCheckUtils]: 24: Hoare triple {68#false} assume !false; {68#false} is VALID [2022-02-20 18:28:49,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:28:49,494 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:49,495 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381390498] [2022-02-20 18:28:49,495 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381390498] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:49,495 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:49,495 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:28:49,498 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522830127] [2022-02-20 18:28:49,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:49,502 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-02-20 18:28:49,503 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:49,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:49,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:49,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:28:49,536 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:49,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:28:49,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:28:49,557 INFO L87 Difference]: Start difference. First operand has 64 states, 62 states have (on average 1.6774193548387097) internal successors, (104), 63 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:49,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:49,641 INFO L93 Difference]: Finished difference Result 103 states and 167 transitions. [2022-02-20 18:28:49,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:28:49,642 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-02-20 18:28:49,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:49,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:49,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 167 transitions. [2022-02-20 18:28:49,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:49,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 167 transitions. [2022-02-20 18:28:49,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 167 transitions. [2022-02-20 18:28:49,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:49,786 INFO L225 Difference]: With dead ends: 103 [2022-02-20 18:28:49,787 INFO L226 Difference]: Without dead ends: 60 [2022-02-20 18:28:49,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:28:49,791 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:28:49,792 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:49,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-02-20 18:28:49,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-02-20 18:28:49,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:49,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 59 states have (on average 1.6440677966101696) internal successors, (97), 59 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:49,814 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 59 states have (on average 1.6440677966101696) internal successors, (97), 59 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:49,815 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 59 states have (on average 1.6440677966101696) internal successors, (97), 59 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:49,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:49,819 INFO L93 Difference]: Finished difference Result 60 states and 97 transitions. [2022-02-20 18:28:49,819 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 97 transitions. [2022-02-20 18:28:49,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:49,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:49,821 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 59 states have (on average 1.6440677966101696) internal successors, (97), 59 states have internal predecessors, (97), 0 states have call successors, (0), 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 60 states. [2022-02-20 18:28:49,821 INFO L87 Difference]: Start difference. First operand has 60 states, 59 states have (on average 1.6440677966101696) internal successors, (97), 59 states have internal predecessors, (97), 0 states have call successors, (0), 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 60 states. [2022-02-20 18:28:49,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:49,825 INFO L93 Difference]: Finished difference Result 60 states and 97 transitions. [2022-02-20 18:28:49,826 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 97 transitions. [2022-02-20 18:28:49,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:49,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:49,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:49,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:49,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.6440677966101696) internal successors, (97), 59 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:49,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 97 transitions. [2022-02-20 18:28:49,848 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 97 transitions. Word has length 25 [2022-02-20 18:28:49,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:49,848 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 97 transitions. [2022-02-20 18:28:49,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:49,849 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 97 transitions. [2022-02-20 18:28:49,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 18:28:49,850 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:49,850 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] [2022-02-20 18:28:49,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:28:49,850 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:49,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:49,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1797671282, now seen corresponding path program 1 times [2022-02-20 18:28:49,851 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:49,851 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492911467] [2022-02-20 18:28:49,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:49,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:49,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:49,935 INFO L290 TraceCheckUtils]: 0: Hoare triple {375#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(34, 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; {375#true} is VALID [2022-02-20 18:28:49,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {375#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1, main_#t~ret21#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -128 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 127;~id1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~st1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~send1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~mode1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {375#true} is VALID [2022-02-20 18:28:49,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {375#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {377#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 18:28:49,937 INFO L290 TraceCheckUtils]: 3: Hoare triple {377#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {378#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 18:28:49,938 INFO L290 TraceCheckUtils]: 4: Hoare triple {378#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret20#1 && main_#t~ret20#1 <= 2147483647;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {379#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 18:28:49,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {379#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {376#false} is VALID [2022-02-20 18:28:49,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {376#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {376#false} is VALID [2022-02-20 18:28:49,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {376#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {376#false} is VALID [2022-02-20 18:28:49,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {376#false} assume !(0 != ~mode1~0 % 256); {376#false} is VALID [2022-02-20 18:28:49,939 INFO L290 TraceCheckUtils]: 9: Hoare triple {376#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {376#false} is VALID [2022-02-20 18:28:49,939 INFO L290 TraceCheckUtils]: 10: Hoare triple {376#false} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {376#false} is VALID [2022-02-20 18:28:49,939 INFO L290 TraceCheckUtils]: 11: Hoare triple {376#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {376#false} is VALID [2022-02-20 18:28:49,939 INFO L290 TraceCheckUtils]: 12: Hoare triple {376#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {376#false} is VALID [2022-02-20 18:28:49,940 INFO L290 TraceCheckUtils]: 13: Hoare triple {376#false} assume !(node2_~m2~0#1 != ~nomsg~0); {376#false} is VALID [2022-02-20 18:28:49,940 INFO L290 TraceCheckUtils]: 14: Hoare triple {376#false} ~mode2~0 := 0; {376#false} is VALID [2022-02-20 18:28:49,940 INFO L290 TraceCheckUtils]: 15: Hoare triple {376#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {376#false} is VALID [2022-02-20 18:28:49,940 INFO L290 TraceCheckUtils]: 16: Hoare triple {376#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {376#false} is VALID [2022-02-20 18:28:49,940 INFO L290 TraceCheckUtils]: 17: Hoare triple {376#false} assume !(node3_~m3~0#1 != ~nomsg~0); {376#false} is VALID [2022-02-20 18:28:49,941 INFO L290 TraceCheckUtils]: 18: Hoare triple {376#false} ~mode3~0 := 0; {376#false} is VALID [2022-02-20 18:28:49,941 INFO L290 TraceCheckUtils]: 19: Hoare triple {376#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; {376#false} is VALID [2022-02-20 18:28:49,941 INFO L290 TraceCheckUtils]: 20: Hoare triple {376#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {376#false} is VALID [2022-02-20 18:28:49,941 INFO L290 TraceCheckUtils]: 21: Hoare triple {376#false} check_#res#1 := check_~tmp~1#1; {376#false} is VALID [2022-02-20 18:28:49,941 INFO L290 TraceCheckUtils]: 22: Hoare triple {376#false} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {376#false} is VALID [2022-02-20 18:28:49,941 INFO L290 TraceCheckUtils]: 23: Hoare triple {376#false} assume 0 == assert_~arg#1 % 256; {376#false} is VALID [2022-02-20 18:28:49,942 INFO L290 TraceCheckUtils]: 24: Hoare triple {376#false} assume !false; {376#false} is VALID [2022-02-20 18:28:49,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:28:49,942 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:49,942 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492911467] [2022-02-20 18:28:49,943 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492911467] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:49,943 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:49,943 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:28:49,943 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776877631] [2022-02-20 18:28:49,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:49,944 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-02-20 18:28:49,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:49,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:49,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:49,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:28:49,962 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:49,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:28:49,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:28:49,963 INFO L87 Difference]: Start difference. First operand 60 states and 97 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:50,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:50,155 INFO L93 Difference]: Finished difference Result 102 states and 160 transitions. [2022-02-20 18:28:50,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:28:50,155 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-02-20 18:28:50,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:50,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:50,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2022-02-20 18:28:50,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:50,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2022-02-20 18:28:50,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 160 transitions. [2022-02-20 18:28:50,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:50,273 INFO L225 Difference]: With dead ends: 102 [2022-02-20 18:28:50,273 INFO L226 Difference]: Without dead ends: 60 [2022-02-20 18:28:50,274 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:28:50,275 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 3 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:28:50,275 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 361 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:50,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-02-20 18:28:50,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-02-20 18:28:50,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:50,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 59 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:50,281 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 59 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:50,281 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 59 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:50,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:50,284 INFO L93 Difference]: Finished difference Result 60 states and 81 transitions. [2022-02-20 18:28:50,284 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 81 transitions. [2022-02-20 18:28:50,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:50,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:50,293 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 59 states have internal predecessors, (81), 0 states have call successors, (0), 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 60 states. [2022-02-20 18:28:50,294 INFO L87 Difference]: Start difference. First operand has 60 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 59 states have internal predecessors, (81), 0 states have call successors, (0), 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 60 states. [2022-02-20 18:28:50,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:50,296 INFO L93 Difference]: Finished difference Result 60 states and 81 transitions. [2022-02-20 18:28:50,296 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 81 transitions. [2022-02-20 18:28:50,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:50,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:50,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:50,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:50,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 59 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:50,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 81 transitions. [2022-02-20 18:28:50,298 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 81 transitions. Word has length 25 [2022-02-20 18:28:50,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:50,299 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 81 transitions. [2022-02-20 18:28:50,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:50,299 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 81 transitions. [2022-02-20 18:28:50,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-20 18:28:50,300 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:50,300 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] [2022-02-20 18:28:50,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:28:50,301 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:50,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:50,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1903157419, now seen corresponding path program 1 times [2022-02-20 18:28:50,301 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:50,302 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261569344] [2022-02-20 18:28:50,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:50,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:50,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:50,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {689#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(34, 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; {689#true} is VALID [2022-02-20 18:28:50,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {689#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1, main_#t~ret21#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -128 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 127;~id1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~st1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~send1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~mode1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {689#true} is VALID [2022-02-20 18:28:50,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {689#true} assume 0 == ~r1~0 % 256; {689#true} is VALID [2022-02-20 18:28:50,362 INFO L290 TraceCheckUtils]: 3: Hoare triple {689#true} assume ~id1~0 >= 0; {689#true} is VALID [2022-02-20 18:28:50,362 INFO L290 TraceCheckUtils]: 4: Hoare triple {689#true} assume 0 == ~st1~0; {689#true} is VALID [2022-02-20 18:28:50,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {689#true} assume ~send1~0 == ~id1~0; {689#true} is VALID [2022-02-20 18:28:50,362 INFO L290 TraceCheckUtils]: 6: Hoare triple {689#true} assume 0 == ~mode1~0 % 256; {689#true} is VALID [2022-02-20 18:28:50,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {689#true} assume ~id2~0 >= 0; {689#true} is VALID [2022-02-20 18:28:50,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {689#true} assume 0 == ~st2~0; {689#true} is VALID [2022-02-20 18:28:50,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {689#true} assume ~send2~0 == ~id2~0; {689#true} is VALID [2022-02-20 18:28:50,364 INFO L290 TraceCheckUtils]: 10: Hoare triple {689#true} assume 0 == ~mode2~0 % 256; {691#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:50,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {691#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {691#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:50,365 INFO L290 TraceCheckUtils]: 12: Hoare triple {691#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {691#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:50,365 INFO L290 TraceCheckUtils]: 13: Hoare triple {691#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {691#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:50,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {691#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {691#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:50,366 INFO L290 TraceCheckUtils]: 15: Hoare triple {691#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {691#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:50,366 INFO L290 TraceCheckUtils]: 16: Hoare triple {691#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {691#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:50,367 INFO L290 TraceCheckUtils]: 17: Hoare triple {691#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {691#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:50,367 INFO L290 TraceCheckUtils]: 18: Hoare triple {691#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {691#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:50,368 INFO L290 TraceCheckUtils]: 19: Hoare triple {691#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret20#1 && main_#t~ret20#1 <= 2147483647;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {691#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:50,368 INFO L290 TraceCheckUtils]: 20: Hoare triple {691#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {691#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:50,369 INFO L290 TraceCheckUtils]: 21: Hoare triple {691#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {691#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:50,369 INFO L290 TraceCheckUtils]: 22: Hoare triple {691#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {691#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:50,370 INFO L290 TraceCheckUtils]: 23: Hoare triple {691#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {691#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:50,370 INFO L290 TraceCheckUtils]: 24: Hoare triple {691#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {691#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:50,371 INFO L290 TraceCheckUtils]: 25: Hoare triple {691#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {691#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:50,371 INFO L290 TraceCheckUtils]: 26: Hoare triple {691#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {691#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:50,372 INFO L290 TraceCheckUtils]: 27: Hoare triple {691#(= (+ (* (- 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; {690#false} is VALID [2022-02-20 18:28:50,372 INFO L290 TraceCheckUtils]: 28: Hoare triple {690#false} assume !(node2_~m2~0#1 != ~nomsg~0); {690#false} is VALID [2022-02-20 18:28:50,372 INFO L290 TraceCheckUtils]: 29: Hoare triple {690#false} ~mode2~0 := 0; {690#false} is VALID [2022-02-20 18:28:50,372 INFO L290 TraceCheckUtils]: 30: Hoare triple {690#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {690#false} is VALID [2022-02-20 18:28:50,372 INFO L290 TraceCheckUtils]: 31: Hoare triple {690#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {690#false} is VALID [2022-02-20 18:28:50,373 INFO L290 TraceCheckUtils]: 32: Hoare triple {690#false} assume !(node3_~m3~0#1 != ~nomsg~0); {690#false} is VALID [2022-02-20 18:28:50,373 INFO L290 TraceCheckUtils]: 33: Hoare triple {690#false} ~mode3~0 := 0; {690#false} is VALID [2022-02-20 18:28:50,373 INFO L290 TraceCheckUtils]: 34: Hoare triple {690#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; {690#false} is VALID [2022-02-20 18:28:50,373 INFO L290 TraceCheckUtils]: 35: Hoare triple {690#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {690#false} is VALID [2022-02-20 18:28:50,373 INFO L290 TraceCheckUtils]: 36: Hoare triple {690#false} check_#res#1 := check_~tmp~1#1; {690#false} is VALID [2022-02-20 18:28:50,373 INFO L290 TraceCheckUtils]: 37: Hoare triple {690#false} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {690#false} is VALID [2022-02-20 18:28:50,374 INFO L290 TraceCheckUtils]: 38: Hoare triple {690#false} assume 0 == assert_~arg#1 % 256; {690#false} is VALID [2022-02-20 18:28:50,374 INFO L290 TraceCheckUtils]: 39: Hoare triple {690#false} assume !false; {690#false} is VALID [2022-02-20 18:28:50,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:28:50,374 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:50,375 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261569344] [2022-02-20 18:28:50,375 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261569344] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:50,375 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:50,375 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:28:50,375 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701861564] [2022-02-20 18:28:50,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:50,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2022-02-20 18:28:50,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:50,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:50,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:50,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:28:50,402 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:50,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:28:50,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:50,403 INFO L87 Difference]: Start difference. First operand 60 states and 81 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:50,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:50,504 INFO L93 Difference]: Finished difference Result 130 states and 189 transitions. [2022-02-20 18:28:50,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:28:50,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2022-02-20 18:28:50,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:50,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:50,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2022-02-20 18:28:50,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:50,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2022-02-20 18:28:50,509 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 189 transitions. [2022-02-20 18:28:50,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:50,643 INFO L225 Difference]: With dead ends: 130 [2022-02-20 18:28:50,643 INFO L226 Difference]: Without dead ends: 92 [2022-02-20 18:28:50,643 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:50,644 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 45 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:28:50,645 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 171 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:50,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-02-20 18:28:50,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2022-02-20 18:28:50,651 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:50,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 90 states, 89 states have (on average 1.4382022471910112) internal successors, (128), 89 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:50,652 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 90 states, 89 states have (on average 1.4382022471910112) internal successors, (128), 89 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:50,652 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 90 states, 89 states have (on average 1.4382022471910112) internal successors, (128), 89 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:50,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:50,654 INFO L93 Difference]: Finished difference Result 92 states and 129 transitions. [2022-02-20 18:28:50,654 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 129 transitions. [2022-02-20 18:28:50,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:50,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:50,655 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 89 states have (on average 1.4382022471910112) internal successors, (128), 89 states have internal predecessors, (128), 0 states have call successors, (0), 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 92 states. [2022-02-20 18:28:50,656 INFO L87 Difference]: Start difference. First operand has 90 states, 89 states have (on average 1.4382022471910112) internal successors, (128), 89 states have internal predecessors, (128), 0 states have call successors, (0), 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 92 states. [2022-02-20 18:28:50,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:50,658 INFO L93 Difference]: Finished difference Result 92 states and 129 transitions. [2022-02-20 18:28:50,658 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 129 transitions. [2022-02-20 18:28:50,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:50,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:50,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:50,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:50,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.4382022471910112) internal successors, (128), 89 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:50,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 128 transitions. [2022-02-20 18:28:50,661 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 128 transitions. Word has length 40 [2022-02-20 18:28:50,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:50,662 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 128 transitions. [2022-02-20 18:28:50,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:50,662 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 128 transitions. [2022-02-20 18:28:50,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-20 18:28:50,663 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:50,663 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] [2022-02-20 18:28:50,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:28:50,663 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:50,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:50,664 INFO L85 PathProgramCache]: Analyzing trace with hash -2054016735, now seen corresponding path program 1 times [2022-02-20 18:28:50,664 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:50,664 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929335480] [2022-02-20 18:28:50,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:50,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:50,714 INFO L290 TraceCheckUtils]: 0: Hoare triple {1130#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(34, 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; {1130#true} is VALID [2022-02-20 18:28:50,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {1130#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1, main_#t~ret21#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -128 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 127;~id1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~st1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~send1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~mode1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1130#true} is VALID [2022-02-20 18:28:50,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {1130#true} assume 0 == ~r1~0 % 256; {1130#true} is VALID [2022-02-20 18:28:50,715 INFO L290 TraceCheckUtils]: 3: Hoare triple {1130#true} assume ~id1~0 >= 0; {1130#true} is VALID [2022-02-20 18:28:50,715 INFO L290 TraceCheckUtils]: 4: Hoare triple {1130#true} assume 0 == ~st1~0; {1130#true} is VALID [2022-02-20 18:28:50,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {1130#true} assume ~send1~0 == ~id1~0; {1130#true} is VALID [2022-02-20 18:28:50,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {1130#true} assume 0 == ~mode1~0 % 256; {1130#true} is VALID [2022-02-20 18:28:50,716 INFO L290 TraceCheckUtils]: 7: Hoare triple {1130#true} assume ~id2~0 >= 0; {1130#true} is VALID [2022-02-20 18:28:50,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {1130#true} assume 0 == ~st2~0; {1130#true} is VALID [2022-02-20 18:28:50,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {1130#true} assume ~send2~0 == ~id2~0; {1130#true} is VALID [2022-02-20 18:28:50,716 INFO L290 TraceCheckUtils]: 10: Hoare triple {1130#true} assume 0 == ~mode2~0 % 256; {1130#true} is VALID [2022-02-20 18:28:50,717 INFO L290 TraceCheckUtils]: 11: Hoare triple {1130#true} assume ~id3~0 >= 0; {1130#true} is VALID [2022-02-20 18:28:50,717 INFO L290 TraceCheckUtils]: 12: Hoare triple {1130#true} assume 0 == ~st3~0; {1130#true} is VALID [2022-02-20 18:28:50,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {1130#true} assume ~send3~0 == ~id3~0; {1130#true} is VALID [2022-02-20 18:28:50,718 INFO L290 TraceCheckUtils]: 14: Hoare triple {1130#true} assume 0 == ~mode3~0 % 256; {1132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:50,718 INFO L290 TraceCheckUtils]: 15: Hoare triple {1132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {1132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:50,719 INFO L290 TraceCheckUtils]: 16: Hoare triple {1132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {1132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:50,719 INFO L290 TraceCheckUtils]: 17: Hoare triple {1132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {1132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:50,719 INFO L290 TraceCheckUtils]: 18: Hoare triple {1132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {1132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:50,720 INFO L290 TraceCheckUtils]: 19: Hoare triple {1132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret20#1 && main_#t~ret20#1 <= 2147483647;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:50,720 INFO L290 TraceCheckUtils]: 20: Hoare triple {1132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {1132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:50,721 INFO L290 TraceCheckUtils]: 21: Hoare triple {1132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:50,721 INFO L290 TraceCheckUtils]: 22: Hoare triple {1132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:50,722 INFO L290 TraceCheckUtils]: 23: Hoare triple {1132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {1132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:50,722 INFO L290 TraceCheckUtils]: 24: Hoare triple {1132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {1132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:50,723 INFO L290 TraceCheckUtils]: 25: Hoare triple {1132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {1132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:50,723 INFO L290 TraceCheckUtils]: 26: Hoare triple {1132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:50,724 INFO L290 TraceCheckUtils]: 27: Hoare triple {1132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {1132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:50,724 INFO L290 TraceCheckUtils]: 28: Hoare triple {1132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {1132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:50,725 INFO L290 TraceCheckUtils]: 29: Hoare triple {1132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {1132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:50,725 INFO L290 TraceCheckUtils]: 30: Hoare triple {1132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1132#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:50,726 INFO L290 TraceCheckUtils]: 31: Hoare triple {1132#(= (+ (* (- 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; {1131#false} is VALID [2022-02-20 18:28:50,726 INFO L290 TraceCheckUtils]: 32: Hoare triple {1131#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1131#false} is VALID [2022-02-20 18:28:50,726 INFO L290 TraceCheckUtils]: 33: Hoare triple {1131#false} ~mode3~0 := 0; {1131#false} is VALID [2022-02-20 18:28:50,726 INFO L290 TraceCheckUtils]: 34: Hoare triple {1131#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; {1131#false} is VALID [2022-02-20 18:28:50,726 INFO L290 TraceCheckUtils]: 35: Hoare triple {1131#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {1131#false} is VALID [2022-02-20 18:28:50,727 INFO L290 TraceCheckUtils]: 36: Hoare triple {1131#false} check_#res#1 := check_~tmp~1#1; {1131#false} is VALID [2022-02-20 18:28:50,727 INFO L290 TraceCheckUtils]: 37: Hoare triple {1131#false} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1131#false} is VALID [2022-02-20 18:28:50,727 INFO L290 TraceCheckUtils]: 38: Hoare triple {1131#false} assume 0 == assert_~arg#1 % 256; {1131#false} is VALID [2022-02-20 18:28:50,727 INFO L290 TraceCheckUtils]: 39: Hoare triple {1131#false} assume !false; {1131#false} is VALID [2022-02-20 18:28:50,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:28:50,728 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:50,728 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929335480] [2022-02-20 18:28:50,728 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929335480] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:50,728 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:50,728 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:28:50,729 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101812126] [2022-02-20 18:28:50,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:50,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2022-02-20 18:28:50,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:50,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:50,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:50,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:28:50,755 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:50,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:28:50,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:50,756 INFO L87 Difference]: Start difference. First operand 90 states and 128 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:50,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:50,856 INFO L93 Difference]: Finished difference Result 214 states and 320 transitions. [2022-02-20 18:28:50,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:28:50,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2022-02-20 18:28:50,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:50,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:50,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2022-02-20 18:28:50,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:50,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2022-02-20 18:28:50,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 189 transitions. [2022-02-20 18:28:50,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:50,998 INFO L225 Difference]: With dead ends: 214 [2022-02-20 18:28:50,998 INFO L226 Difference]: Without dead ends: 146 [2022-02-20 18:28:50,999 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:51,000 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 41 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:28:51,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 170 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:51,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-02-20 18:28:51,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2022-02-20 18:28:51,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:51,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 144 states, 143 states have (on average 1.4755244755244756) internal successors, (211), 143 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:51,010 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 144 states, 143 states have (on average 1.4755244755244756) internal successors, (211), 143 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:51,010 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 144 states, 143 states have (on average 1.4755244755244756) internal successors, (211), 143 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:51,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:51,014 INFO L93 Difference]: Finished difference Result 146 states and 212 transitions. [2022-02-20 18:28:51,014 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 212 transitions. [2022-02-20 18:28:51,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:51,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:51,015 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 143 states have (on average 1.4755244755244756) internal successors, (211), 143 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 146 states. [2022-02-20 18:28:51,016 INFO L87 Difference]: Start difference. First operand has 144 states, 143 states have (on average 1.4755244755244756) internal successors, (211), 143 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 146 states. [2022-02-20 18:28:51,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:51,019 INFO L93 Difference]: Finished difference Result 146 states and 212 transitions. [2022-02-20 18:28:51,019 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 212 transitions. [2022-02-20 18:28:51,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:51,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:51,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:51,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:51,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.4755244755244756) internal successors, (211), 143 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:51,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2022-02-20 18:28:51,024 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 211 transitions. Word has length 40 [2022-02-20 18:28:51,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:51,025 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 211 transitions. [2022-02-20 18:28:51,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:51,025 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 211 transitions. [2022-02-20 18:28:51,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-20 18:28:51,026 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:51,026 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] [2022-02-20 18:28:51,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:28:51,026 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:51,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:51,027 INFO L85 PathProgramCache]: Analyzing trace with hash -836031337, now seen corresponding path program 1 times [2022-02-20 18:28:51,027 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:51,027 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40683805] [2022-02-20 18:28:51,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:51,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:51,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {1847#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(34, 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; {1847#true} is VALID [2022-02-20 18:28:51,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {1847#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1, main_#t~ret21#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -128 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 127;~id1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~st1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~send1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~mode1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1847#true} is VALID [2022-02-20 18:28:51,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {1847#true} assume 0 == ~r1~0 % 256; {1847#true} is VALID [2022-02-20 18:28:51,090 INFO L290 TraceCheckUtils]: 3: Hoare triple {1847#true} assume ~id1~0 >= 0; {1847#true} is VALID [2022-02-20 18:28:51,090 INFO L290 TraceCheckUtils]: 4: Hoare triple {1847#true} assume 0 == ~st1~0; {1849#(<= ~st1~0 0)} is VALID [2022-02-20 18:28:51,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {1849#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {1849#(<= ~st1~0 0)} is VALID [2022-02-20 18:28:51,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {1849#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {1849#(<= ~st1~0 0)} is VALID [2022-02-20 18:28:51,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {1849#(<= ~st1~0 0)} assume ~id2~0 >= 0; {1849#(<= ~st1~0 0)} is VALID [2022-02-20 18:28:51,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {1849#(<= ~st1~0 0)} assume 0 == ~st2~0; {1850#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:51,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {1850#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {1850#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:51,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {1850#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {1850#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:51,093 INFO L290 TraceCheckUtils]: 11: Hoare triple {1850#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {1850#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:51,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {1850#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:51,093 INFO L290 TraceCheckUtils]: 13: Hoare triple {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:51,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:51,094 INFO L290 TraceCheckUtils]: 15: Hoare triple {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:51,095 INFO L290 TraceCheckUtils]: 16: Hoare triple {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:51,095 INFO L290 TraceCheckUtils]: 17: Hoare triple {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:51,095 INFO L290 TraceCheckUtils]: 18: Hoare triple {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:51,096 INFO L290 TraceCheckUtils]: 19: Hoare triple {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret20#1 && main_#t~ret20#1 <= 2147483647;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:51,096 INFO L290 TraceCheckUtils]: 20: Hoare triple {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:51,096 INFO L290 TraceCheckUtils]: 21: Hoare triple {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:51,097 INFO L290 TraceCheckUtils]: 22: Hoare triple {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:51,097 INFO L290 TraceCheckUtils]: 23: Hoare triple {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:51,098 INFO L290 TraceCheckUtils]: 24: Hoare triple {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:51,098 INFO L290 TraceCheckUtils]: 25: Hoare triple {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:51,098 INFO L290 TraceCheckUtils]: 26: Hoare triple {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:51,099 INFO L290 TraceCheckUtils]: 27: Hoare triple {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:51,099 INFO L290 TraceCheckUtils]: 28: Hoare triple {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:51,099 INFO L290 TraceCheckUtils]: 29: Hoare triple {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:51,100 INFO L290 TraceCheckUtils]: 30: Hoare triple {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:51,100 INFO L290 TraceCheckUtils]: 31: Hoare triple {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:51,101 INFO L290 TraceCheckUtils]: 32: Hoare triple {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:51,101 INFO L290 TraceCheckUtils]: 33: Hoare triple {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:51,101 INFO L290 TraceCheckUtils]: 34: Hoare triple {1851#(<= (+ ~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; {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:51,102 INFO L290 TraceCheckUtils]: 35: Hoare triple {1851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {1848#false} is VALID [2022-02-20 18:28:51,102 INFO L290 TraceCheckUtils]: 36: Hoare triple {1848#false} check_#res#1 := check_~tmp~1#1; {1848#false} is VALID [2022-02-20 18:28:51,102 INFO L290 TraceCheckUtils]: 37: Hoare triple {1848#false} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1848#false} is VALID [2022-02-20 18:28:51,102 INFO L290 TraceCheckUtils]: 38: Hoare triple {1848#false} assume 0 == assert_~arg#1 % 256; {1848#false} is VALID [2022-02-20 18:28:51,103 INFO L290 TraceCheckUtils]: 39: Hoare triple {1848#false} assume !false; {1848#false} is VALID [2022-02-20 18:28:51,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:28:51,103 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:51,103 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40683805] [2022-02-20 18:28:51,104 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40683805] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:51,104 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:51,104 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:28:51,104 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987492255] [2022-02-20 18:28:51,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:51,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2022-02-20 18:28:51,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:51,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:51,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:51,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:28:51,130 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:51,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:28:51,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:28:51,131 INFO L87 Difference]: Start difference. First operand 144 states and 211 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:51,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:51,698 INFO L93 Difference]: Finished difference Result 876 states and 1345 transitions. [2022-02-20 18:28:51,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:28:51,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2022-02-20 18:28:51,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:51,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:51,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 435 transitions. [2022-02-20 18:28:51,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:51,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 435 transitions. [2022-02-20 18:28:51,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 435 transitions. [2022-02-20 18:28:51,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 435 edges. 435 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:52,012 INFO L225 Difference]: With dead ends: 876 [2022-02-20 18:28:52,013 INFO L226 Difference]: Without dead ends: 754 [2022-02-20 18:28:52,013 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:28:52,014 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 376 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:28:52,015 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [376 Valid, 495 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:52,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2022-02-20 18:28:52,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 264. [2022-02-20 18:28:52,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:52,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 754 states. Second operand has 264 states, 263 states have (on average 1.4866920152091254) internal successors, (391), 263 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:52,085 INFO L74 IsIncluded]: Start isIncluded. First operand 754 states. Second operand has 264 states, 263 states have (on average 1.4866920152091254) internal successors, (391), 263 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:52,086 INFO L87 Difference]: Start difference. First operand 754 states. Second operand has 264 states, 263 states have (on average 1.4866920152091254) internal successors, (391), 263 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:52,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:52,108 INFO L93 Difference]: Finished difference Result 754 states and 1132 transitions. [2022-02-20 18:28:52,108 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1132 transitions. [2022-02-20 18:28:52,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:52,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:52,110 INFO L74 IsIncluded]: Start isIncluded. First operand has 264 states, 263 states have (on average 1.4866920152091254) internal successors, (391), 263 states have internal predecessors, (391), 0 states have call successors, (0), 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 754 states. [2022-02-20 18:28:52,111 INFO L87 Difference]: Start difference. First operand has 264 states, 263 states have (on average 1.4866920152091254) internal successors, (391), 263 states have internal predecessors, (391), 0 states have call successors, (0), 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 754 states. [2022-02-20 18:28:52,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:52,131 INFO L93 Difference]: Finished difference Result 754 states and 1132 transitions. [2022-02-20 18:28:52,132 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1132 transitions. [2022-02-20 18:28:52,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:52,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:52,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:52,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:52,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 1.4866920152091254) internal successors, (391), 263 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:52,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 391 transitions. [2022-02-20 18:28:52,139 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 391 transitions. Word has length 40 [2022-02-20 18:28:52,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:52,140 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 391 transitions. [2022-02-20 18:28:52,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:52,140 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 391 transitions. [2022-02-20 18:28:52,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 18:28:52,141 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:52,141 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] [2022-02-20 18:28:52,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:28:52,141 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:52,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:52,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1682931033, now seen corresponding path program 1 times [2022-02-20 18:28:52,142 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:52,142 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560447095] [2022-02-20 18:28:52,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:52,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:52,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {4727#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(34, 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; {4727#true} is VALID [2022-02-20 18:28:52,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {4727#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1, main_#t~ret21#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -128 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 127;~id1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~st1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~send1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~mode1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {4727#true} is VALID [2022-02-20 18:28:52,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {4727#true} assume 0 == ~r1~0 % 256; {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:52,191 INFO L290 TraceCheckUtils]: 3: Hoare triple {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 >= 0; {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:52,192 INFO L290 TraceCheckUtils]: 4: Hoare triple {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:52,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 == ~id1~0; {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:52,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:52,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 >= 0; {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:52,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:52,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 == ~id2~0; {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:52,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:52,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 >= 0; {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:52,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:52,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 == ~id3~0; {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:52,195 INFO L290 TraceCheckUtils]: 14: Hoare triple {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:52,195 INFO L290 TraceCheckUtils]: 15: Hoare triple {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id2~0; {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:52,196 INFO L290 TraceCheckUtils]: 16: Hoare triple {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id3~0; {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:52,196 INFO L290 TraceCheckUtils]: 17: Hoare triple {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:52,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} init_#res#1 := init_~tmp~0#1; {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:52,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret20#1 && main_#t~ret20#1 <= 2147483647;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:52,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == assume_abort_if_not_~cond#1); {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:52,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:52,197 INFO L290 TraceCheckUtils]: 22: Hoare triple {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:52,198 INFO L290 TraceCheckUtils]: 23: Hoare triple {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode1~0 % 256); {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:52,198 INFO L290 TraceCheckUtils]: 24: Hoare triple {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:52,198 INFO L290 TraceCheckUtils]: 25: Hoare triple {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:52,199 INFO L290 TraceCheckUtils]: 26: Hoare triple {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:52,199 INFO L290 TraceCheckUtils]: 27: Hoare triple {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode2~0 % 256); {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:52,199 INFO L290 TraceCheckUtils]: 28: Hoare triple {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:52,200 INFO L290 TraceCheckUtils]: 29: Hoare triple {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:52,200 INFO L290 TraceCheckUtils]: 30: Hoare triple {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:52,200 INFO L290 TraceCheckUtils]: 31: Hoare triple {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode3~0 % 256); {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:52,200 INFO L290 TraceCheckUtils]: 32: Hoare triple {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:52,201 INFO L290 TraceCheckUtils]: 33: Hoare triple {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:52,201 INFO L290 TraceCheckUtils]: 34: Hoare triple {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} 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; {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:52,201 INFO L290 TraceCheckUtils]: 35: Hoare triple {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:28:52,202 INFO L290 TraceCheckUtils]: 36: Hoare triple {4729#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~r1~0 % 256 >= 3; {4728#false} is VALID [2022-02-20 18:28:52,202 INFO L290 TraceCheckUtils]: 37: Hoare triple {4728#false} assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; {4728#false} is VALID [2022-02-20 18:28:52,202 INFO L290 TraceCheckUtils]: 38: Hoare triple {4728#false} check_#res#1 := check_~tmp~1#1; {4728#false} is VALID [2022-02-20 18:28:52,202 INFO L290 TraceCheckUtils]: 39: Hoare triple {4728#false} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {4728#false} is VALID [2022-02-20 18:28:52,203 INFO L290 TraceCheckUtils]: 40: Hoare triple {4728#false} assume 0 == assert_~arg#1 % 256; {4728#false} is VALID [2022-02-20 18:28:52,203 INFO L290 TraceCheckUtils]: 41: Hoare triple {4728#false} assume !false; {4728#false} is VALID [2022-02-20 18:28:52,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:28:52,203 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:52,203 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560447095] [2022-02-20 18:28:52,203 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560447095] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:52,204 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:52,204 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:28:52,204 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763676978] [2022-02-20 18:28:52,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:52,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2022-02-20 18:28:52,205 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:52,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:52,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:52,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:28:52,230 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:52,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:28:52,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:52,230 INFO L87 Difference]: Start difference. First operand 264 states and 391 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:52,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:52,437 INFO L93 Difference]: Finished difference Result 704 states and 1053 transitions. [2022-02-20 18:28:52,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:28:52,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2022-02-20 18:28:52,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:52,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:52,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 190 transitions. [2022-02-20 18:28:52,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:52,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 190 transitions. [2022-02-20 18:28:52,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 190 transitions. [2022-02-20 18:28:52,550 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:52,559 INFO L225 Difference]: With dead ends: 704 [2022-02-20 18:28:52,559 INFO L226 Difference]: Without dead ends: 462 [2022-02-20 18:28:52,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:52,560 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 32 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:28:52,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 130 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:52,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2022-02-20 18:28:52,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 452. [2022-02-20 18:28:52,700 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:52,701 INFO L82 GeneralOperation]: Start isEquivalent. First operand 462 states. Second operand has 452 states, 451 states have (on average 1.4523281596452329) internal successors, (655), 451 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:52,702 INFO L74 IsIncluded]: Start isIncluded. First operand 462 states. Second operand has 452 states, 451 states have (on average 1.4523281596452329) internal successors, (655), 451 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:52,702 INFO L87 Difference]: Start difference. First operand 462 states. Second operand has 452 states, 451 states have (on average 1.4523281596452329) internal successors, (655), 451 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:52,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:52,711 INFO L93 Difference]: Finished difference Result 462 states and 664 transitions. [2022-02-20 18:28:52,711 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 664 transitions. [2022-02-20 18:28:52,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:52,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:52,713 INFO L74 IsIncluded]: Start isIncluded. First operand has 452 states, 451 states have (on average 1.4523281596452329) internal successors, (655), 451 states have internal predecessors, (655), 0 states have call successors, (0), 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 462 states. [2022-02-20 18:28:52,713 INFO L87 Difference]: Start difference. First operand has 452 states, 451 states have (on average 1.4523281596452329) internal successors, (655), 451 states have internal predecessors, (655), 0 states have call successors, (0), 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 462 states. [2022-02-20 18:28:52,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:52,722 INFO L93 Difference]: Finished difference Result 462 states and 664 transitions. [2022-02-20 18:28:52,722 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 664 transitions. [2022-02-20 18:28:52,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:52,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:52,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:52,723 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:52,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 451 states have (on average 1.4523281596452329) internal successors, (655), 451 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:52,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 655 transitions. [2022-02-20 18:28:52,732 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 655 transitions. Word has length 42 [2022-02-20 18:28:52,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:52,733 INFO L470 AbstractCegarLoop]: Abstraction has 452 states and 655 transitions. [2022-02-20 18:28:52,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:52,733 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 655 transitions. [2022-02-20 18:28:52,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 18:28:52,733 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:52,734 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] [2022-02-20 18:28:52,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:28:52,734 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:52,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:52,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1616437521, now seen corresponding path program 1 times [2022-02-20 18:28:52,734 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:52,735 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126260876] [2022-02-20 18:28:52,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:52,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:52,842 INFO L290 TraceCheckUtils]: 0: Hoare triple {7046#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(34, 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; {7046#true} is VALID [2022-02-20 18:28:52,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {7046#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1, main_#t~ret21#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -128 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 127;~id1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~st1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~send1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~mode1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {7046#true} is VALID [2022-02-20 18:28:52,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {7046#true} assume 0 == ~r1~0 % 256; {7046#true} is VALID [2022-02-20 18:28:52,843 INFO L290 TraceCheckUtils]: 3: Hoare triple {7046#true} assume ~id1~0 >= 0; {7046#true} is VALID [2022-02-20 18:28:52,843 INFO L290 TraceCheckUtils]: 4: Hoare triple {7046#true} assume 0 == ~st1~0; {7048#(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 18:28:52,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {7048#(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; {7048#(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 18:28:52,845 INFO L290 TraceCheckUtils]: 6: Hoare triple {7048#(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; {7048#(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 18:28:52,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {7048#(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; {7048#(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 18:28:52,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {7048#(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; {7049#(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 18:28:52,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {7049#(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; {7049#(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 18:28:52,847 INFO L290 TraceCheckUtils]: 10: Hoare triple {7049#(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; {7049#(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 18:28:52,847 INFO L290 TraceCheckUtils]: 11: Hoare triple {7049#(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; {7049#(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 18:28:52,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {7049#(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; {7050#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:52,849 INFO L290 TraceCheckUtils]: 13: Hoare triple {7050#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send3~0 == ~id3~0; {7050#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:52,849 INFO L290 TraceCheckUtils]: 14: Hoare triple {7050#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume 0 == ~mode3~0 % 256; {7050#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:52,849 INFO L290 TraceCheckUtils]: 15: Hoare triple {7050#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id2~0; {7050#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:52,850 INFO L290 TraceCheckUtils]: 16: Hoare triple {7050#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id3~0; {7050#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:52,850 INFO L290 TraceCheckUtils]: 17: Hoare triple {7050#(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; {7050#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:52,850 INFO L290 TraceCheckUtils]: 18: Hoare triple {7050#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} init_#res#1 := init_~tmp~0#1; {7050#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:52,851 INFO L290 TraceCheckUtils]: 19: Hoare triple {7050#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret20#1 && main_#t~ret20#1 <= 2147483647;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {7050#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:52,851 INFO L290 TraceCheckUtils]: 20: Hoare triple {7050#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == assume_abort_if_not_~cond#1); {7050#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:52,852 INFO L290 TraceCheckUtils]: 21: Hoare triple {7050#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {7050#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:52,852 INFO L290 TraceCheckUtils]: 22: Hoare triple {7050#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {7050#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:52,853 INFO L290 TraceCheckUtils]: 23: Hoare triple {7050#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode1~0 % 256); {7050#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:52,853 INFO L290 TraceCheckUtils]: 24: Hoare triple {7050#(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~ite4#1 := ~send1~0; {7050#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:52,853 INFO L290 TraceCheckUtils]: 25: Hoare triple {7050#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {7050#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:52,854 INFO L290 TraceCheckUtils]: 26: Hoare triple {7050#(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~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {7050#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:52,854 INFO L290 TraceCheckUtils]: 27: Hoare triple {7050#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode2~0 % 256); {7050#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:52,855 INFO L290 TraceCheckUtils]: 28: Hoare triple {7050#(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~ite5#1 := ~send2~0; {7050#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:52,855 INFO L290 TraceCheckUtils]: 29: Hoare triple {7050#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {7050#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:52,855 INFO L290 TraceCheckUtils]: 30: Hoare triple {7050#(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~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {7050#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:52,860 INFO L290 TraceCheckUtils]: 31: Hoare triple {7050#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode3~0 % 256); {7050#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:52,861 INFO L290 TraceCheckUtils]: 32: Hoare triple {7050#(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~ite6#1 := ~send3~0; {7050#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:52,861 INFO L290 TraceCheckUtils]: 33: Hoare triple {7050#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {7050#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:52,862 INFO L290 TraceCheckUtils]: 34: Hoare triple {7050#(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; {7050#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:52,862 INFO L290 TraceCheckUtils]: 35: Hoare triple {7050#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {7050#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:52,862 INFO L290 TraceCheckUtils]: 36: Hoare triple {7050#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~r1~0 % 256 >= 3); {7050#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:52,863 INFO L290 TraceCheckUtils]: 37: Hoare triple {7050#(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; {7047#false} is VALID [2022-02-20 18:28:52,863 INFO L290 TraceCheckUtils]: 38: Hoare triple {7047#false} check_#res#1 := check_~tmp~1#1; {7047#false} is VALID [2022-02-20 18:28:52,863 INFO L290 TraceCheckUtils]: 39: Hoare triple {7047#false} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {7047#false} is VALID [2022-02-20 18:28:52,863 INFO L290 TraceCheckUtils]: 40: Hoare triple {7047#false} assume 0 == assert_~arg#1 % 256; {7047#false} is VALID [2022-02-20 18:28:52,863 INFO L290 TraceCheckUtils]: 41: Hoare triple {7047#false} assume !false; {7047#false} is VALID [2022-02-20 18:28:52,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:28:52,864 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:52,864 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126260876] [2022-02-20 18:28:52,864 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126260876] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:52,864 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:52,865 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:28:52,865 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004504050] [2022-02-20 18:28:52,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:52,865 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2022-02-20 18:28:52,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:52,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:52,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:52,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:28:52,893 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:52,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:28:52,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:28:52,894 INFO L87 Difference]: Start difference. First operand 452 states and 655 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:53,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:53,243 INFO L93 Difference]: Finished difference Result 884 states and 1289 transitions. [2022-02-20 18:28:53,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:28:53,243 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2022-02-20 18:28:53,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:53,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:53,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 197 transitions. [2022-02-20 18:28:53,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:53,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 197 transitions. [2022-02-20 18:28:53,245 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 197 transitions. [2022-02-20 18:28:53,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:53,365 INFO L225 Difference]: With dead ends: 884 [2022-02-20 18:28:53,365 INFO L226 Difference]: Without dead ends: 454 [2022-02-20 18:28:53,366 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 18:28:53,367 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 92 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:28:53,367 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 242 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:53,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2022-02-20 18:28:53,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 452. [2022-02-20 18:28:53,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:53,514 INFO L82 GeneralOperation]: Start isEquivalent. First operand 454 states. Second operand has 452 states, 451 states have (on average 1.434589800443459) internal successors, (647), 451 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:53,515 INFO L74 IsIncluded]: Start isIncluded. First operand 454 states. Second operand has 452 states, 451 states have (on average 1.434589800443459) internal successors, (647), 451 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:53,516 INFO L87 Difference]: Start difference. First operand 454 states. Second operand has 452 states, 451 states have (on average 1.434589800443459) internal successors, (647), 451 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:53,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:53,524 INFO L93 Difference]: Finished difference Result 454 states and 648 transitions. [2022-02-20 18:28:53,524 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 648 transitions. [2022-02-20 18:28:53,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:53,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:53,525 INFO L74 IsIncluded]: Start isIncluded. First operand has 452 states, 451 states have (on average 1.434589800443459) internal successors, (647), 451 states have internal predecessors, (647), 0 states have call successors, (0), 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 454 states. [2022-02-20 18:28:53,526 INFO L87 Difference]: Start difference. First operand has 452 states, 451 states have (on average 1.434589800443459) internal successors, (647), 451 states have internal predecessors, (647), 0 states have call successors, (0), 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 454 states. [2022-02-20 18:28:53,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:53,534 INFO L93 Difference]: Finished difference Result 454 states and 648 transitions. [2022-02-20 18:28:53,534 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 648 transitions. [2022-02-20 18:28:53,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:53,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:53,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:53,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:53,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 451 states have (on average 1.434589800443459) internal successors, (647), 451 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:53,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 647 transitions. [2022-02-20 18:28:53,545 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 647 transitions. Word has length 42 [2022-02-20 18:28:53,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:53,545 INFO L470 AbstractCegarLoop]: Abstraction has 452 states and 647 transitions. [2022-02-20 18:28:53,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:53,546 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 647 transitions. [2022-02-20 18:28:53,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 18:28:53,546 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:53,546 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 18:28:53,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:28:53,546 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:53,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:53,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1015321205, now seen corresponding path program 1 times [2022-02-20 18:28:53,547 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:53,547 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644206570] [2022-02-20 18:28:53,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:53,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:53,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:53,607 INFO L290 TraceCheckUtils]: 0: Hoare triple {9577#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(34, 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; {9577#true} is VALID [2022-02-20 18:28:53,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {9577#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1, main_#t~ret21#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -128 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 127;~id1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~st1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~send1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~mode1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {9577#true} is VALID [2022-02-20 18:28:53,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {9577#true} assume 0 == ~r1~0 % 256; {9577#true} is VALID [2022-02-20 18:28:53,608 INFO L290 TraceCheckUtils]: 3: Hoare triple {9577#true} assume ~id1~0 >= 0; {9577#true} is VALID [2022-02-20 18:28:53,608 INFO L290 TraceCheckUtils]: 4: Hoare triple {9577#true} assume 0 == ~st1~0; {9577#true} is VALID [2022-02-20 18:28:53,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {9577#true} assume ~send1~0 == ~id1~0; {9577#true} is VALID [2022-02-20 18:28:53,608 INFO L290 TraceCheckUtils]: 6: Hoare triple {9577#true} assume 0 == ~mode1~0 % 256; {9577#true} is VALID [2022-02-20 18:28:53,608 INFO L290 TraceCheckUtils]: 7: Hoare triple {9577#true} assume ~id2~0 >= 0; {9577#true} is VALID [2022-02-20 18:28:53,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {9577#true} assume 0 == ~st2~0; {9577#true} is VALID [2022-02-20 18:28:53,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {9577#true} assume ~send2~0 == ~id2~0; {9577#true} is VALID [2022-02-20 18:28:53,609 INFO L290 TraceCheckUtils]: 10: Hoare triple {9577#true} assume 0 == ~mode2~0 % 256; {9577#true} is VALID [2022-02-20 18:28:53,609 INFO L290 TraceCheckUtils]: 11: Hoare triple {9577#true} assume ~id3~0 >= 0; {9577#true} is VALID [2022-02-20 18:28:53,609 INFO L290 TraceCheckUtils]: 12: Hoare triple {9577#true} assume 0 == ~st3~0; {9577#true} is VALID [2022-02-20 18:28:53,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {9577#true} assume ~send3~0 == ~id3~0; {9577#true} is VALID [2022-02-20 18:28:53,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {9577#true} assume 0 == ~mode3~0 % 256; {9577#true} is VALID [2022-02-20 18:28:53,609 INFO L290 TraceCheckUtils]: 15: Hoare triple {9577#true} assume ~id1~0 != ~id2~0; {9577#true} is VALID [2022-02-20 18:28:53,610 INFO L290 TraceCheckUtils]: 16: Hoare triple {9577#true} assume ~id1~0 != ~id3~0; {9577#true} is VALID [2022-02-20 18:28:53,610 INFO L290 TraceCheckUtils]: 17: Hoare triple {9577#true} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {9577#true} is VALID [2022-02-20 18:28:53,610 INFO L290 TraceCheckUtils]: 18: Hoare triple {9577#true} init_#res#1 := init_~tmp~0#1; {9577#true} is VALID [2022-02-20 18:28:53,610 INFO L290 TraceCheckUtils]: 19: Hoare triple {9577#true} main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret20#1 && main_#t~ret20#1 <= 2147483647;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {9577#true} is VALID [2022-02-20 18:28:53,610 INFO L290 TraceCheckUtils]: 20: Hoare triple {9577#true} assume !(0 == assume_abort_if_not_~cond#1); {9577#true} is VALID [2022-02-20 18:28:53,610 INFO L290 TraceCheckUtils]: 21: Hoare triple {9577#true} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {9577#true} is VALID [2022-02-20 18:28:53,610 INFO L290 TraceCheckUtils]: 22: Hoare triple {9577#true} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {9577#true} is VALID [2022-02-20 18:28:53,611 INFO L290 TraceCheckUtils]: 23: Hoare triple {9577#true} assume !(0 != ~mode1~0 % 256); {9577#true} is VALID [2022-02-20 18:28:53,611 INFO L290 TraceCheckUtils]: 24: Hoare triple {9577#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {9577#true} is VALID [2022-02-20 18:28:53,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {9577#true} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {9577#true} is VALID [2022-02-20 18:28:53,611 INFO L290 TraceCheckUtils]: 26: Hoare triple {9577#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {9577#true} is VALID [2022-02-20 18:28:53,611 INFO L290 TraceCheckUtils]: 27: Hoare triple {9577#true} assume !(0 != ~mode2~0 % 256); {9577#true} is VALID [2022-02-20 18:28:53,611 INFO L290 TraceCheckUtils]: 28: Hoare triple {9577#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {9577#true} is VALID [2022-02-20 18:28:53,611 INFO L290 TraceCheckUtils]: 29: Hoare triple {9577#true} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {9577#true} is VALID [2022-02-20 18:28:53,611 INFO L290 TraceCheckUtils]: 30: Hoare triple {9577#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {9577#true} is VALID [2022-02-20 18:28:53,612 INFO L290 TraceCheckUtils]: 31: Hoare triple {9577#true} assume !(0 != ~mode3~0 % 256); {9577#true} is VALID [2022-02-20 18:28:53,612 INFO L290 TraceCheckUtils]: 32: Hoare triple {9577#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {9577#true} is VALID [2022-02-20 18:28:53,612 INFO L290 TraceCheckUtils]: 33: Hoare triple {9577#true} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {9577#true} is VALID [2022-02-20 18:28:53,612 INFO L290 TraceCheckUtils]: 34: Hoare triple {9577#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; {9577#true} is VALID [2022-02-20 18:28:53,612 INFO L290 TraceCheckUtils]: 35: Hoare triple {9577#true} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {9577#true} is VALID [2022-02-20 18:28:53,612 INFO L290 TraceCheckUtils]: 36: Hoare triple {9577#true} assume !(~r1~0 % 256 >= 3); {9577#true} is VALID [2022-02-20 18:28:53,612 INFO L290 TraceCheckUtils]: 37: Hoare triple {9577#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {9577#true} is VALID [2022-02-20 18:28:53,613 INFO L290 TraceCheckUtils]: 38: Hoare triple {9577#true} assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; {9579#(= |ULTIMATE.start_check_~tmp~1#1| 1)} is VALID [2022-02-20 18:28:53,613 INFO L290 TraceCheckUtils]: 39: Hoare triple {9579#(= |ULTIMATE.start_check_~tmp~1#1| 1)} check_#res#1 := check_~tmp~1#1; {9580#(= 1 |ULTIMATE.start_check_#res#1|)} is VALID [2022-02-20 18:28:53,614 INFO L290 TraceCheckUtils]: 40: Hoare triple {9580#(= 1 |ULTIMATE.start_check_#res#1|)} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {9581#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} is VALID [2022-02-20 18:28:53,614 INFO L290 TraceCheckUtils]: 41: Hoare triple {9581#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} assume 0 == assert_~arg#1 % 256; {9578#false} is VALID [2022-02-20 18:28:53,614 INFO L290 TraceCheckUtils]: 42: Hoare triple {9578#false} assume !false; {9578#false} is VALID [2022-02-20 18:28:53,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:28:53,615 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:53,615 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644206570] [2022-02-20 18:28:53,615 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644206570] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:53,615 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:53,615 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:28:53,615 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661709181] [2022-02-20 18:28:53,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:53,616 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 18:28:53,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:53,616 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 18:28:53,636 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 18:28:53,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:28:53,637 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:53,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:28:53,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:28:53,637 INFO L87 Difference]: Start difference. First operand 452 states and 647 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 18:28:54,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:54,184 INFO L93 Difference]: Finished difference Result 786 states and 1119 transitions. [2022-02-20 18:28:54,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:28:54,184 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 18:28:54,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:54,185 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 18:28:54,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2022-02-20 18:28:54,186 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 18:28:54,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2022-02-20 18:28:54,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 144 transitions. [2022-02-20 18:28:54,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:54,290 INFO L225 Difference]: With dead ends: 786 [2022-02-20 18:28:54,291 INFO L226 Difference]: Without dead ends: 784 [2022-02-20 18:28:54,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:28:54,292 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 147 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:28:54,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 362 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:54,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2022-02-20 18:28:54,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 476. [2022-02-20 18:28:54,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:54,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 784 states. Second operand has 476 states, 475 states have (on average 1.4042105263157896) internal successors, (667), 475 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:54,509 INFO L74 IsIncluded]: Start isIncluded. First operand 784 states. Second operand has 476 states, 475 states have (on average 1.4042105263157896) internal successors, (667), 475 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:54,509 INFO L87 Difference]: Start difference. First operand 784 states. Second operand has 476 states, 475 states have (on average 1.4042105263157896) internal successors, (667), 475 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:54,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:54,531 INFO L93 Difference]: Finished difference Result 784 states and 1106 transitions. [2022-02-20 18:28:54,531 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1106 transitions. [2022-02-20 18:28:54,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:54,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:54,533 INFO L74 IsIncluded]: Start isIncluded. First operand has 476 states, 475 states have (on average 1.4042105263157896) internal successors, (667), 475 states have internal predecessors, (667), 0 states have call successors, (0), 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 784 states. [2022-02-20 18:28:54,534 INFO L87 Difference]: Start difference. First operand has 476 states, 475 states have (on average 1.4042105263157896) internal successors, (667), 475 states have internal predecessors, (667), 0 states have call successors, (0), 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 784 states. [2022-02-20 18:28:54,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:54,556 INFO L93 Difference]: Finished difference Result 784 states and 1106 transitions. [2022-02-20 18:28:54,557 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1106 transitions. [2022-02-20 18:28:54,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:54,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:54,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:54,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:54,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 475 states have (on average 1.4042105263157896) internal successors, (667), 475 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:54,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 667 transitions. [2022-02-20 18:28:54,569 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 667 transitions. Word has length 43 [2022-02-20 18:28:54,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:54,570 INFO L470 AbstractCegarLoop]: Abstraction has 476 states and 667 transitions. [2022-02-20 18:28:54,570 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 18:28:54,570 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 667 transitions. [2022-02-20 18:28:54,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-20 18:28:54,571 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:54,571 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 18:28:54,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:28:54,571 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:54,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:54,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1022832678, now seen corresponding path program 1 times [2022-02-20 18:28:54,572 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:54,572 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537021069] [2022-02-20 18:28:54,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:54,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:54,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:54,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {12699#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(34, 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; {12699#true} is VALID [2022-02-20 18:28:54,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {12699#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1, main_#t~ret21#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -128 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 127;~id1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~st1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~send1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~mode1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {12699#true} is VALID [2022-02-20 18:28:54,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {12699#true} assume 0 == ~r1~0 % 256; {12699#true} is VALID [2022-02-20 18:28:54,601 INFO L290 TraceCheckUtils]: 3: Hoare triple {12699#true} assume ~id1~0 >= 0; {12699#true} is VALID [2022-02-20 18:28:54,601 INFO L290 TraceCheckUtils]: 4: Hoare triple {12699#true} assume 0 == ~st1~0; {12699#true} is VALID [2022-02-20 18:28:54,601 INFO L290 TraceCheckUtils]: 5: Hoare triple {12699#true} assume ~send1~0 == ~id1~0; {12699#true} is VALID [2022-02-20 18:28:54,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {12699#true} assume 0 == ~mode1~0 % 256; {12701#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:54,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {12701#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {12701#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:54,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {12701#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {12701#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:54,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {12701#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {12701#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:54,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {12701#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {12701#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:54,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {12701#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {12701#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:54,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {12701#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {12701#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:54,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {12701#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {12701#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:54,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {12701#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {12701#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:54,605 INFO L290 TraceCheckUtils]: 15: Hoare triple {12701#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {12701#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:54,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {12701#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {12701#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:54,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {12701#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {12701#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:54,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {12701#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {12701#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:54,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {12701#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret20#1 && main_#t~ret20#1 <= 2147483647;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {12701#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:54,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {12701#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {12701#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:54,607 INFO L290 TraceCheckUtils]: 21: Hoare triple {12701#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {12701#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:54,608 INFO L290 TraceCheckUtils]: 22: Hoare triple {12701#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {12701#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:54,608 INFO L290 TraceCheckUtils]: 23: Hoare triple {12701#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256; {12700#false} is VALID [2022-02-20 18:28:54,608 INFO L290 TraceCheckUtils]: 24: Hoare triple {12700#false} assume !(255 == ~r1~0 % 256); {12700#false} is VALID [2022-02-20 18:28:54,608 INFO L290 TraceCheckUtils]: 25: Hoare triple {12700#false} ~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {12700#false} is VALID [2022-02-20 18:28:54,609 INFO L290 TraceCheckUtils]: 26: Hoare triple {12700#false} assume node1_~m1~0#1 != ~nomsg~0; {12700#false} is VALID [2022-02-20 18:28:54,609 INFO L290 TraceCheckUtils]: 27: Hoare triple {12700#false} assume !(node1_~m1~0#1 > ~id1~0); {12700#false} is VALID [2022-02-20 18:28:54,609 INFO L290 TraceCheckUtils]: 28: Hoare triple {12700#false} assume node1_~m1~0#1 == ~id1~0;~st1~0 := 1; {12700#false} is VALID [2022-02-20 18:28:54,609 INFO L290 TraceCheckUtils]: 29: Hoare triple {12700#false} ~mode1~0 := 0; {12700#false} is VALID [2022-02-20 18:28:54,609 INFO L290 TraceCheckUtils]: 30: Hoare triple {12700#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {12700#false} is VALID [2022-02-20 18:28:54,609 INFO L290 TraceCheckUtils]: 31: Hoare triple {12700#false} assume !(0 != ~mode2~0 % 256); {12700#false} is VALID [2022-02-20 18:28:54,609 INFO L290 TraceCheckUtils]: 32: Hoare triple {12700#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {12700#false} is VALID [2022-02-20 18:28:54,610 INFO L290 TraceCheckUtils]: 33: Hoare triple {12700#false} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {12700#false} is VALID [2022-02-20 18:28:54,610 INFO L290 TraceCheckUtils]: 34: Hoare triple {12700#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {12700#false} is VALID [2022-02-20 18:28:54,610 INFO L290 TraceCheckUtils]: 35: Hoare triple {12700#false} assume !(0 != ~mode3~0 % 256); {12700#false} is VALID [2022-02-20 18:28:54,610 INFO L290 TraceCheckUtils]: 36: Hoare triple {12700#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {12700#false} is VALID [2022-02-20 18:28:54,610 INFO L290 TraceCheckUtils]: 37: Hoare triple {12700#false} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {12700#false} is VALID [2022-02-20 18:28:54,610 INFO L290 TraceCheckUtils]: 38: Hoare triple {12700#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; {12700#false} is VALID [2022-02-20 18:28:54,610 INFO L290 TraceCheckUtils]: 39: Hoare triple {12700#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {12700#false} is VALID [2022-02-20 18:28:54,611 INFO L290 TraceCheckUtils]: 40: Hoare triple {12700#false} check_#res#1 := check_~tmp~1#1; {12700#false} is VALID [2022-02-20 18:28:54,611 INFO L290 TraceCheckUtils]: 41: Hoare triple {12700#false} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {12700#false} is VALID [2022-02-20 18:28:54,611 INFO L290 TraceCheckUtils]: 42: Hoare triple {12700#false} assume 0 == assert_~arg#1 % 256; {12700#false} is VALID [2022-02-20 18:28:54,611 INFO L290 TraceCheckUtils]: 43: Hoare triple {12700#false} assume !false; {12700#false} is VALID [2022-02-20 18:28:54,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:28:54,611 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:54,612 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537021069] [2022-02-20 18:28:54,612 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537021069] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:54,612 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:54,612 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:28:54,612 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501653617] [2022-02-20 18:28:54,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:54,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 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 18:28:54,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:54,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 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 18:28:54,636 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 18:28:54,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:28:54,636 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:54,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:28:54,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:54,637 INFO L87 Difference]: Start difference. First operand 476 states and 667 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 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 18:28:55,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:55,057 INFO L93 Difference]: Finished difference Result 947 states and 1345 transitions. [2022-02-20 18:28:55,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:28:55,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 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 18:28:55,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:55,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 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 18:28:55,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2022-02-20 18:28:55,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 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 18:28:55,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2022-02-20 18:28:55,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 186 transitions. [2022-02-20 18:28:55,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:55,184 INFO L225 Difference]: With dead ends: 947 [2022-02-20 18:28:55,184 INFO L226 Difference]: Without dead ends: 680 [2022-02-20 18:28:55,185 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:55,187 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 46 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:28:55,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 176 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:55,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2022-02-20 18:28:55,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 678. [2022-02-20 18:28:55,505 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:55,506 INFO L82 GeneralOperation]: Start isEquivalent. First operand 680 states. Second operand has 678 states, 677 states have (on average 1.395864106351551) internal successors, (945), 677 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:55,507 INFO L74 IsIncluded]: Start isIncluded. First operand 680 states. Second operand has 678 states, 677 states have (on average 1.395864106351551) internal successors, (945), 677 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:55,518 INFO L87 Difference]: Start difference. First operand 680 states. Second operand has 678 states, 677 states have (on average 1.395864106351551) internal successors, (945), 677 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:55,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:55,533 INFO L93 Difference]: Finished difference Result 680 states and 946 transitions. [2022-02-20 18:28:55,533 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 946 transitions. [2022-02-20 18:28:55,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:55,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:55,535 INFO L74 IsIncluded]: Start isIncluded. First operand has 678 states, 677 states have (on average 1.395864106351551) internal successors, (945), 677 states have internal predecessors, (945), 0 states have call successors, (0), 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 680 states. [2022-02-20 18:28:55,536 INFO L87 Difference]: Start difference. First operand has 678 states, 677 states have (on average 1.395864106351551) internal successors, (945), 677 states have internal predecessors, (945), 0 states have call successors, (0), 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 680 states. [2022-02-20 18:28:55,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:55,551 INFO L93 Difference]: Finished difference Result 680 states and 946 transitions. [2022-02-20 18:28:55,551 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 946 transitions. [2022-02-20 18:28:55,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:55,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:55,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:55,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:55,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 677 states have (on average 1.395864106351551) internal successors, (945), 677 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:55,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 945 transitions. [2022-02-20 18:28:55,570 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 945 transitions. Word has length 44 [2022-02-20 18:28:55,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:55,570 INFO L470 AbstractCegarLoop]: Abstraction has 678 states and 945 transitions. [2022-02-20 18:28:55,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 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 18:28:55,571 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 945 transitions. [2022-02-20 18:28:55,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:28:55,571 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:55,571 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:28:55,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:28:55,572 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:55,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:55,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1290367787, now seen corresponding path program 1 times [2022-02-20 18:28:55,572 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:55,572 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022898442] [2022-02-20 18:28:55,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:55,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:55,672 INFO L290 TraceCheckUtils]: 0: Hoare triple {16061#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(34, 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; {16061#true} is VALID [2022-02-20 18:28:55,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {16061#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1, main_#t~ret21#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -128 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 127;~id1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~st1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~send1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~mode1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {16061#true} is VALID [2022-02-20 18:28:55,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {16061#true} assume 0 == ~r1~0 % 256; {16061#true} is VALID [2022-02-20 18:28:55,675 INFO L290 TraceCheckUtils]: 3: Hoare triple {16061#true} assume ~id1~0 >= 0; {16061#true} is VALID [2022-02-20 18:28:55,676 INFO L290 TraceCheckUtils]: 4: Hoare triple {16061#true} assume 0 == ~st1~0; {16063#(<= ~st1~0 0)} is VALID [2022-02-20 18:28:55,676 INFO L290 TraceCheckUtils]: 5: Hoare triple {16063#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {16063#(<= ~st1~0 0)} is VALID [2022-02-20 18:28:55,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {16063#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {16063#(<= ~st1~0 0)} is VALID [2022-02-20 18:28:55,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {16063#(<= ~st1~0 0)} assume ~id2~0 >= 0; {16063#(<= ~st1~0 0)} is VALID [2022-02-20 18:28:55,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {16063#(<= ~st1~0 0)} assume 0 == ~st2~0; {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,677 INFO L290 TraceCheckUtils]: 10: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,678 INFO L290 TraceCheckUtils]: 11: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,678 INFO L290 TraceCheckUtils]: 12: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,679 INFO L290 TraceCheckUtils]: 15: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,679 INFO L290 TraceCheckUtils]: 16: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,679 INFO L290 TraceCheckUtils]: 17: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,680 INFO L290 TraceCheckUtils]: 18: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,680 INFO L290 TraceCheckUtils]: 19: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret20#1 && main_#t~ret20#1 <= 2147483647;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,680 INFO L290 TraceCheckUtils]: 20: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,681 INFO L290 TraceCheckUtils]: 21: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,681 INFO L290 TraceCheckUtils]: 22: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,681 INFO L290 TraceCheckUtils]: 23: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,682 INFO L290 TraceCheckUtils]: 24: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,682 INFO L290 TraceCheckUtils]: 25: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,683 INFO L290 TraceCheckUtils]: 26: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,683 INFO L290 TraceCheckUtils]: 27: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,684 INFO L290 TraceCheckUtils]: 28: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,685 INFO L290 TraceCheckUtils]: 29: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,685 INFO L290 TraceCheckUtils]: 30: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,686 INFO L290 TraceCheckUtils]: 31: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,686 INFO L290 TraceCheckUtils]: 32: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,688 INFO L290 TraceCheckUtils]: 33: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,689 INFO L290 TraceCheckUtils]: 34: Hoare triple {16064#(<= (+ ~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; {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,690 INFO L290 TraceCheckUtils]: 35: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,691 INFO L290 TraceCheckUtils]: 36: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~r1~0 % 256 >= 3); {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,691 INFO L290 TraceCheckUtils]: 37: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,691 INFO L290 TraceCheckUtils]: 38: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,692 INFO L290 TraceCheckUtils]: 39: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} check_#res#1 := check_~tmp~1#1; {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,693 INFO L290 TraceCheckUtils]: 40: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,694 INFO L290 TraceCheckUtils]: 41: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == assert_~arg#1 % 256); {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,696 INFO L290 TraceCheckUtils]: 42: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} assume { :end_inline_assert } true; {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,697 INFO L290 TraceCheckUtils]: 43: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,698 INFO L290 TraceCheckUtils]: 44: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,699 INFO L290 TraceCheckUtils]: 45: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,699 INFO L290 TraceCheckUtils]: 46: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,699 INFO L290 TraceCheckUtils]: 47: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,700 INFO L290 TraceCheckUtils]: 48: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,700 INFO L290 TraceCheckUtils]: 49: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} assume !(node2_~m2~0#1 != ~nomsg~0); {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,700 INFO L290 TraceCheckUtils]: 50: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} ~mode2~0 := 0; {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,700 INFO L290 TraceCheckUtils]: 51: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,701 INFO L290 TraceCheckUtils]: 52: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,701 INFO L290 TraceCheckUtils]: 53: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} assume node3_~m3~0#1 != ~nomsg~0; {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,701 INFO L290 TraceCheckUtils]: 54: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} assume !(node3_~m3~0#1 > ~id3~0); {16064#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:55,702 INFO L290 TraceCheckUtils]: 55: Hoare triple {16064#(<= (+ ~st2~0 ~st1~0) 0)} assume node3_~m3~0#1 == ~id3~0;~st3~0 := 1; {16065#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:55,702 INFO L290 TraceCheckUtils]: 56: Hoare triple {16065#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} ~mode3~0 := 0; {16065#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:55,702 INFO L290 TraceCheckUtils]: 57: Hoare triple {16065#(and (= (+ (- 1) ~st3~0) 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; {16065#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:28:55,703 INFO L290 TraceCheckUtils]: 58: Hoare triple {16065#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {16062#false} is VALID [2022-02-20 18:28:55,703 INFO L290 TraceCheckUtils]: 59: Hoare triple {16062#false} check_#res#1 := check_~tmp~1#1; {16062#false} is VALID [2022-02-20 18:28:55,703 INFO L290 TraceCheckUtils]: 60: Hoare triple {16062#false} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {16062#false} is VALID [2022-02-20 18:28:55,703 INFO L290 TraceCheckUtils]: 61: Hoare triple {16062#false} assume 0 == assert_~arg#1 % 256; {16062#false} is VALID [2022-02-20 18:28:55,703 INFO L290 TraceCheckUtils]: 62: Hoare triple {16062#false} assume !false; {16062#false} is VALID [2022-02-20 18:28:55,704 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 18:28:55,705 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:55,705 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022898442] [2022-02-20 18:28:55,705 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022898442] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:55,705 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:55,705 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:28:55,705 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895357648] [2022-02-20 18:28:55,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:55,706 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-02-20 18:28:55,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:55,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:55,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:55,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:28:55,736 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:55,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:28:55,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:28:55,737 INFO L87 Difference]: Start difference. First operand 678 states and 945 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:57,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:57,466 INFO L93 Difference]: Finished difference Result 2782 states and 3897 transitions. [2022-02-20 18:28:57,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:28:57,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-02-20 18:28:57,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:57,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:57,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 314 transitions. [2022-02-20 18:28:57,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:57,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 314 transitions. [2022-02-20 18:28:57,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 314 transitions. [2022-02-20 18:28:57,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 314 edges. 314 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:57,839 INFO L225 Difference]: With dead ends: 2782 [2022-02-20 18:28:57,839 INFO L226 Difference]: Without dead ends: 2128 [2022-02-20 18:28:57,840 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:28:57,841 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 210 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:28:57,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [210 Valid, 318 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:57,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2128 states. [2022-02-20 18:28:58,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2128 to 1330. [2022-02-20 18:28:58,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:58,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2128 states. Second operand has 1330 states, 1329 states have (on average 1.3942814145974416) internal successors, (1853), 1329 states have internal predecessors, (1853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:58,690 INFO L74 IsIncluded]: Start isIncluded. First operand 2128 states. Second operand has 1330 states, 1329 states have (on average 1.3942814145974416) internal successors, (1853), 1329 states have internal predecessors, (1853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:58,692 INFO L87 Difference]: Start difference. First operand 2128 states. Second operand has 1330 states, 1329 states have (on average 1.3942814145974416) internal successors, (1853), 1329 states have internal predecessors, (1853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:58,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:58,812 INFO L93 Difference]: Finished difference Result 2128 states and 2964 transitions. [2022-02-20 18:28:58,813 INFO L276 IsEmpty]: Start isEmpty. Operand 2128 states and 2964 transitions. [2022-02-20 18:28:58,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:58,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:58,818 INFO L74 IsIncluded]: Start isIncluded. First operand has 1330 states, 1329 states have (on average 1.3942814145974416) internal successors, (1853), 1329 states have internal predecessors, (1853), 0 states have call successors, (0), 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 2128 states. [2022-02-20 18:28:58,819 INFO L87 Difference]: Start difference. First operand has 1330 states, 1329 states have (on average 1.3942814145974416) internal successors, (1853), 1329 states have internal predecessors, (1853), 0 states have call successors, (0), 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 2128 states. [2022-02-20 18:28:58,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:58,941 INFO L93 Difference]: Finished difference Result 2128 states and 2964 transitions. [2022-02-20 18:28:58,941 INFO L276 IsEmpty]: Start isEmpty. Operand 2128 states and 2964 transitions. [2022-02-20 18:28:58,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:58,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:58,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:58,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:58,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 1329 states have (on average 1.3942814145974416) internal successors, (1853), 1329 states have internal predecessors, (1853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:59,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1853 transitions. [2022-02-20 18:28:59,000 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1853 transitions. Word has length 63 [2022-02-20 18:28:59,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:59,001 INFO L470 AbstractCegarLoop]: Abstraction has 1330 states and 1853 transitions. [2022-02-20 18:28:59,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:59,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1853 transitions. [2022-02-20 18:28:59,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:28:59,002 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:59,002 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:28:59,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:28:59,002 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:59,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:59,002 INFO L85 PathProgramCache]: Analyzing trace with hash -478415029, now seen corresponding path program 1 times [2022-02-20 18:28:59,003 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:59,003 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304426015] [2022-02-20 18:28:59,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:59,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:59,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {25417#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(34, 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; {25417#true} is VALID [2022-02-20 18:28:59,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {25417#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1, main_#t~ret21#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -128 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 127;~id1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~st1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~send1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~mode1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {25417#true} is VALID [2022-02-20 18:28:59,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {25417#true} assume 0 == ~r1~0 % 256; {25417#true} is VALID [2022-02-20 18:28:59,050 INFO L290 TraceCheckUtils]: 3: Hoare triple {25417#true} assume ~id1~0 >= 0; {25417#true} is VALID [2022-02-20 18:28:59,050 INFO L290 TraceCheckUtils]: 4: Hoare triple {25417#true} assume 0 == ~st1~0; {25419#(<= ~st1~0 0)} is VALID [2022-02-20 18:28:59,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {25419#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {25419#(<= ~st1~0 0)} is VALID [2022-02-20 18:28:59,051 INFO L290 TraceCheckUtils]: 6: Hoare triple {25419#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {25419#(<= ~st1~0 0)} is VALID [2022-02-20 18:28:59,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {25419#(<= ~st1~0 0)} assume ~id2~0 >= 0; {25419#(<= ~st1~0 0)} is VALID [2022-02-20 18:28:59,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {25419#(<= ~st1~0 0)} assume 0 == ~st2~0; {25419#(<= ~st1~0 0)} is VALID [2022-02-20 18:28:59,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {25419#(<= ~st1~0 0)} assume ~send2~0 == ~id2~0; {25419#(<= ~st1~0 0)} is VALID [2022-02-20 18:28:59,052 INFO L290 TraceCheckUtils]: 10: Hoare triple {25419#(<= ~st1~0 0)} assume 0 == ~mode2~0 % 256; {25419#(<= ~st1~0 0)} is VALID [2022-02-20 18:28:59,052 INFO L290 TraceCheckUtils]: 11: Hoare triple {25419#(<= ~st1~0 0)} assume ~id3~0 >= 0; {25419#(<= ~st1~0 0)} is VALID [2022-02-20 18:28:59,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {25419#(<= ~st1~0 0)} assume 0 == ~st3~0; {25420#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:59,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {25420#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {25420#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:59,053 INFO L290 TraceCheckUtils]: 14: Hoare triple {25420#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {25420#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:59,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {25420#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {25420#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:59,054 INFO L290 TraceCheckUtils]: 16: Hoare triple {25420#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {25420#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:59,054 INFO L290 TraceCheckUtils]: 17: Hoare triple {25420#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {25420#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:59,054 INFO L290 TraceCheckUtils]: 18: Hoare triple {25420#(<= (+ ~st3~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {25420#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:59,055 INFO L290 TraceCheckUtils]: 19: Hoare triple {25420#(<= (+ ~st3~0 ~st1~0) 0)} main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret20#1 && main_#t~ret20#1 <= 2147483647;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {25420#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:59,055 INFO L290 TraceCheckUtils]: 20: Hoare triple {25420#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {25420#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:59,055 INFO L290 TraceCheckUtils]: 21: Hoare triple {25420#(<= (+ ~st3~0 ~st1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {25420#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:59,056 INFO L290 TraceCheckUtils]: 22: Hoare triple {25420#(<= (+ ~st3~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {25420#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:59,056 INFO L290 TraceCheckUtils]: 23: Hoare triple {25420#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {25420#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:59,056 INFO L290 TraceCheckUtils]: 24: Hoare triple {25420#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {25420#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:59,056 INFO L290 TraceCheckUtils]: 25: Hoare triple {25420#(<= (+ ~st3~0 ~st1~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {25420#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:59,057 INFO L290 TraceCheckUtils]: 26: Hoare triple {25420#(<= (+ ~st3~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {25420#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:59,057 INFO L290 TraceCheckUtils]: 27: Hoare triple {25420#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {25420#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:59,057 INFO L290 TraceCheckUtils]: 28: Hoare triple {25420#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {25420#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:59,058 INFO L290 TraceCheckUtils]: 29: Hoare triple {25420#(<= (+ ~st3~0 ~st1~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {25420#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:59,058 INFO L290 TraceCheckUtils]: 30: Hoare triple {25420#(<= (+ ~st3~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {25420#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:59,058 INFO L290 TraceCheckUtils]: 31: Hoare triple {25420#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {25420#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:59,058 INFO L290 TraceCheckUtils]: 32: Hoare triple {25420#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {25420#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:59,059 INFO L290 TraceCheckUtils]: 33: Hoare triple {25420#(<= (+ ~st3~0 ~st1~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {25420#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:59,059 INFO L290 TraceCheckUtils]: 34: Hoare triple {25420#(<= (+ ~st3~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; {25420#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:59,059 INFO L290 TraceCheckUtils]: 35: Hoare triple {25420#(<= (+ ~st3~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {25420#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:59,060 INFO L290 TraceCheckUtils]: 36: Hoare triple {25420#(<= (+ ~st3~0 ~st1~0) 0)} assume !(~r1~0 % 256 >= 3); {25420#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:59,060 INFO L290 TraceCheckUtils]: 37: Hoare triple {25420#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {25420#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:59,060 INFO L290 TraceCheckUtils]: 38: Hoare triple {25420#(<= (+ ~st3~0 ~st1~0) 0)} assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; {25420#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:59,060 INFO L290 TraceCheckUtils]: 39: Hoare triple {25420#(<= (+ ~st3~0 ~st1~0) 0)} check_#res#1 := check_~tmp~1#1; {25420#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:59,061 INFO L290 TraceCheckUtils]: 40: Hoare triple {25420#(<= (+ ~st3~0 ~st1~0) 0)} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {25420#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:59,061 INFO L290 TraceCheckUtils]: 41: Hoare triple {25420#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == assert_~arg#1 % 256); {25420#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:59,061 INFO L290 TraceCheckUtils]: 42: Hoare triple {25420#(<= (+ ~st3~0 ~st1~0) 0)} assume { :end_inline_assert } true; {25420#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:59,062 INFO L290 TraceCheckUtils]: 43: Hoare triple {25420#(<= (+ ~st3~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {25420#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:59,062 INFO L290 TraceCheckUtils]: 44: Hoare triple {25420#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {25420#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:59,062 INFO L290 TraceCheckUtils]: 45: Hoare triple {25420#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {25420#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:59,062 INFO L290 TraceCheckUtils]: 46: Hoare triple {25420#(<= (+ ~st3~0 ~st1~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {25420#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:59,063 INFO L290 TraceCheckUtils]: 47: Hoare triple {25420#(<= (+ ~st3~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {25420#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:59,063 INFO L290 TraceCheckUtils]: 48: Hoare triple {25420#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {25420#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:59,063 INFO L290 TraceCheckUtils]: 49: Hoare triple {25420#(<= (+ ~st3~0 ~st1~0) 0)} assume node2_~m2~0#1 != ~nomsg~0; {25420#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:59,064 INFO L290 TraceCheckUtils]: 50: Hoare triple {25420#(<= (+ ~st3~0 ~st1~0) 0)} assume !(node2_~m2~0#1 > ~id2~0); {25420#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:59,064 INFO L290 TraceCheckUtils]: 51: Hoare triple {25420#(<= (+ ~st3~0 ~st1~0) 0)} assume node2_~m2~0#1 == ~id2~0;~st2~0 := 1; {25421#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:28:59,064 INFO L290 TraceCheckUtils]: 52: Hoare triple {25421#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode2~0 := 0; {25421#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:28:59,065 INFO L290 TraceCheckUtils]: 53: Hoare triple {25421#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {25421#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:28:59,065 INFO L290 TraceCheckUtils]: 54: Hoare triple {25421#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {25421#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:28:59,065 INFO L290 TraceCheckUtils]: 55: Hoare triple {25421#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(node3_~m3~0#1 != ~nomsg~0); {25421#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:28:59,066 INFO L290 TraceCheckUtils]: 56: Hoare triple {25421#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode3~0 := 0; {25421#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:28:59,066 INFO L290 TraceCheckUtils]: 57: Hoare triple {25421#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~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; {25421#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:28:59,066 INFO L290 TraceCheckUtils]: 58: Hoare triple {25421#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {25418#false} is VALID [2022-02-20 18:28:59,067 INFO L290 TraceCheckUtils]: 59: Hoare triple {25418#false} check_#res#1 := check_~tmp~1#1; {25418#false} is VALID [2022-02-20 18:28:59,067 INFO L290 TraceCheckUtils]: 60: Hoare triple {25418#false} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {25418#false} is VALID [2022-02-20 18:28:59,067 INFO L290 TraceCheckUtils]: 61: Hoare triple {25418#false} assume 0 == assert_~arg#1 % 256; {25418#false} is VALID [2022-02-20 18:28:59,067 INFO L290 TraceCheckUtils]: 62: Hoare triple {25418#false} assume !false; {25418#false} is VALID [2022-02-20 18:28:59,067 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 18:28:59,067 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:59,068 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304426015] [2022-02-20 18:28:59,068 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304426015] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:59,068 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:59,068 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:28:59,068 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332014501] [2022-02-20 18:28:59,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:59,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-02-20 18:28:59,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:59,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:59,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:59,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:28:59,104 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:59,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:28:59,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:28:59,105 INFO L87 Difference]: Start difference. First operand 1330 states and 1853 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:01,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:01,488 INFO L93 Difference]: Finished difference Result 3434 states and 4805 transitions. [2022-02-20 18:29:01,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:29:01,489 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-02-20 18:29:01,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:01,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:01,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 314 transitions. [2022-02-20 18:29:01,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:01,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 314 transitions. [2022-02-20 18:29:01,492 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 314 transitions. [2022-02-20 18:29:01,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 314 edges. 314 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:01,892 INFO L225 Difference]: With dead ends: 3434 [2022-02-20 18:29:01,893 INFO L226 Difference]: Without dead ends: 2780 [2022-02-20 18:29:01,894 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:29:01,894 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 204 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:29:01,894 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 331 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:29:01,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2780 states. [2022-02-20 18:29:03,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2780 to 2310. [2022-02-20 18:29:03,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:03,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2780 states. Second operand has 2310 states, 2309 states have (on average 1.3880467734950195) internal successors, (3205), 2309 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:03,484 INFO L74 IsIncluded]: Start isIncluded. First operand 2780 states. Second operand has 2310 states, 2309 states have (on average 1.3880467734950195) internal successors, (3205), 2309 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:03,486 INFO L87 Difference]: Start difference. First operand 2780 states. Second operand has 2310 states, 2309 states have (on average 1.3880467734950195) internal successors, (3205), 2309 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:03,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:03,676 INFO L93 Difference]: Finished difference Result 2780 states and 3872 transitions. [2022-02-20 18:29:03,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2780 states and 3872 transitions. [2022-02-20 18:29:03,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:03,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:03,681 INFO L74 IsIncluded]: Start isIncluded. First operand has 2310 states, 2309 states have (on average 1.3880467734950195) internal successors, (3205), 2309 states have internal predecessors, (3205), 0 states have call successors, (0), 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 2780 states. [2022-02-20 18:29:03,682 INFO L87 Difference]: Start difference. First operand has 2310 states, 2309 states have (on average 1.3880467734950195) internal successors, (3205), 2309 states have internal predecessors, (3205), 0 states have call successors, (0), 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 2780 states. [2022-02-20 18:29:03,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:03,874 INFO L93 Difference]: Finished difference Result 2780 states and 3872 transitions. [2022-02-20 18:29:03,874 INFO L276 IsEmpty]: Start isEmpty. Operand 2780 states and 3872 transitions. [2022-02-20 18:29:03,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:03,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:03,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:03,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:03,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2310 states, 2309 states have (on average 1.3880467734950195) internal successors, (3205), 2309 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:04,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2310 states to 2310 states and 3205 transitions. [2022-02-20 18:29:04,048 INFO L78 Accepts]: Start accepts. Automaton has 2310 states and 3205 transitions. Word has length 63 [2022-02-20 18:29:04,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:04,048 INFO L470 AbstractCegarLoop]: Abstraction has 2310 states and 3205 transitions. [2022-02-20 18:29:04,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:04,048 INFO L276 IsEmpty]: Start isEmpty. Operand 2310 states and 3205 transitions. [2022-02-20 18:29:04,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:29:04,050 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:04,050 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:29:04,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:29:04,050 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:04,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:04,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1743655043, now seen corresponding path program 1 times [2022-02-20 18:29:04,051 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:04,051 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934784005] [2022-02-20 18:29:04,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:04,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:04,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {38101#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(34, 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; {38101#true} is VALID [2022-02-20 18:29:04,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {38101#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1, main_#t~ret21#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -128 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 127;~id1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~st1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~send1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~mode1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {38101#true} is VALID [2022-02-20 18:29:04,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {38101#true} assume 0 == ~r1~0 % 256; {38101#true} is VALID [2022-02-20 18:29:04,083 INFO L290 TraceCheckUtils]: 3: Hoare triple {38101#true} assume ~id1~0 >= 0; {38101#true} is VALID [2022-02-20 18:29:04,083 INFO L290 TraceCheckUtils]: 4: Hoare triple {38101#true} assume 0 == ~st1~0; {38101#true} is VALID [2022-02-20 18:29:04,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {38101#true} assume ~send1~0 == ~id1~0; {38101#true} is VALID [2022-02-20 18:29:04,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {38101#true} assume 0 == ~mode1~0 % 256; {38101#true} is VALID [2022-02-20 18:29:04,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {38101#true} assume ~id2~0 >= 0; {38101#true} is VALID [2022-02-20 18:29:04,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {38101#true} assume 0 == ~st2~0; {38101#true} is VALID [2022-02-20 18:29:04,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {38101#true} assume ~send2~0 == ~id2~0; {38101#true} is VALID [2022-02-20 18:29:04,084 INFO L290 TraceCheckUtils]: 10: Hoare triple {38101#true} assume 0 == ~mode2~0 % 256; {38101#true} is VALID [2022-02-20 18:29:04,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {38101#true} assume ~id3~0 >= 0; {38101#true} is VALID [2022-02-20 18:29:04,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {38101#true} assume 0 == ~st3~0; {38101#true} is VALID [2022-02-20 18:29:04,085 INFO L290 TraceCheckUtils]: 13: Hoare triple {38101#true} assume ~send3~0 == ~id3~0; {38101#true} is VALID [2022-02-20 18:29:04,085 INFO L290 TraceCheckUtils]: 14: Hoare triple {38101#true} assume 0 == ~mode3~0 % 256; {38101#true} is VALID [2022-02-20 18:29:04,085 INFO L290 TraceCheckUtils]: 15: Hoare triple {38101#true} assume ~id1~0 != ~id2~0; {38101#true} is VALID [2022-02-20 18:29:04,085 INFO L290 TraceCheckUtils]: 16: Hoare triple {38101#true} assume ~id1~0 != ~id3~0; {38101#true} is VALID [2022-02-20 18:29:04,085 INFO L290 TraceCheckUtils]: 17: Hoare triple {38101#true} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {38101#true} is VALID [2022-02-20 18:29:04,085 INFO L290 TraceCheckUtils]: 18: Hoare triple {38101#true} init_#res#1 := init_~tmp~0#1; {38101#true} is VALID [2022-02-20 18:29:04,085 INFO L290 TraceCheckUtils]: 19: Hoare triple {38101#true} main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret20#1 && main_#t~ret20#1 <= 2147483647;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {38101#true} is VALID [2022-02-20 18:29:04,085 INFO L290 TraceCheckUtils]: 20: Hoare triple {38101#true} assume !(0 == assume_abort_if_not_~cond#1); {38101#true} is VALID [2022-02-20 18:29:04,085 INFO L290 TraceCheckUtils]: 21: Hoare triple {38101#true} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {38101#true} is VALID [2022-02-20 18:29:04,086 INFO L290 TraceCheckUtils]: 22: Hoare triple {38101#true} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {38101#true} is VALID [2022-02-20 18:29:04,086 INFO L290 TraceCheckUtils]: 23: Hoare triple {38101#true} assume !(0 != ~mode1~0 % 256); {38101#true} is VALID [2022-02-20 18:29:04,086 INFO L290 TraceCheckUtils]: 24: Hoare triple {38101#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {38101#true} is VALID [2022-02-20 18:29:04,086 INFO L290 TraceCheckUtils]: 25: Hoare triple {38101#true} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {38103#(= (+ (- 1) ~mode1~0) 0)} is VALID [2022-02-20 18:29:04,086 INFO L290 TraceCheckUtils]: 26: Hoare triple {38103#(= (+ (- 1) ~mode1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {38103#(= (+ (- 1) ~mode1~0) 0)} is VALID [2022-02-20 18:29:04,087 INFO L290 TraceCheckUtils]: 27: Hoare triple {38103#(= (+ (- 1) ~mode1~0) 0)} assume !(0 != ~mode2~0 % 256); {38103#(= (+ (- 1) ~mode1~0) 0)} is VALID [2022-02-20 18:29:04,087 INFO L290 TraceCheckUtils]: 28: Hoare triple {38103#(= (+ (- 1) ~mode1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {38103#(= (+ (- 1) ~mode1~0) 0)} is VALID [2022-02-20 18:29:04,087 INFO L290 TraceCheckUtils]: 29: Hoare triple {38103#(= (+ (- 1) ~mode1~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {38103#(= (+ (- 1) ~mode1~0) 0)} is VALID [2022-02-20 18:29:04,088 INFO L290 TraceCheckUtils]: 30: Hoare triple {38103#(= (+ (- 1) ~mode1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {38103#(= (+ (- 1) ~mode1~0) 0)} is VALID [2022-02-20 18:29:04,088 INFO L290 TraceCheckUtils]: 31: Hoare triple {38103#(= (+ (- 1) ~mode1~0) 0)} assume !(0 != ~mode3~0 % 256); {38103#(= (+ (- 1) ~mode1~0) 0)} is VALID [2022-02-20 18:29:04,088 INFO L290 TraceCheckUtils]: 32: Hoare triple {38103#(= (+ (- 1) ~mode1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {38103#(= (+ (- 1) ~mode1~0) 0)} is VALID [2022-02-20 18:29:04,088 INFO L290 TraceCheckUtils]: 33: Hoare triple {38103#(= (+ (- 1) ~mode1~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {38103#(= (+ (- 1) ~mode1~0) 0)} is VALID [2022-02-20 18:29:04,089 INFO L290 TraceCheckUtils]: 34: Hoare triple {38103#(= (+ (- 1) ~mode1~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; {38103#(= (+ (- 1) ~mode1~0) 0)} is VALID [2022-02-20 18:29:04,089 INFO L290 TraceCheckUtils]: 35: Hoare triple {38103#(= (+ (- 1) ~mode1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {38103#(= (+ (- 1) ~mode1~0) 0)} is VALID [2022-02-20 18:29:04,089 INFO L290 TraceCheckUtils]: 36: Hoare triple {38103#(= (+ (- 1) ~mode1~0) 0)} assume !(~r1~0 % 256 >= 3); {38103#(= (+ (- 1) ~mode1~0) 0)} is VALID [2022-02-20 18:29:04,089 INFO L290 TraceCheckUtils]: 37: Hoare triple {38103#(= (+ (- 1) ~mode1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {38103#(= (+ (- 1) ~mode1~0) 0)} is VALID [2022-02-20 18:29:04,090 INFO L290 TraceCheckUtils]: 38: Hoare triple {38103#(= (+ (- 1) ~mode1~0) 0)} assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; {38103#(= (+ (- 1) ~mode1~0) 0)} is VALID [2022-02-20 18:29:04,090 INFO L290 TraceCheckUtils]: 39: Hoare triple {38103#(= (+ (- 1) ~mode1~0) 0)} check_#res#1 := check_~tmp~1#1; {38103#(= (+ (- 1) ~mode1~0) 0)} is VALID [2022-02-20 18:29:04,090 INFO L290 TraceCheckUtils]: 40: Hoare triple {38103#(= (+ (- 1) ~mode1~0) 0)} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {38103#(= (+ (- 1) ~mode1~0) 0)} is VALID [2022-02-20 18:29:04,091 INFO L290 TraceCheckUtils]: 41: Hoare triple {38103#(= (+ (- 1) ~mode1~0) 0)} assume !(0 == assert_~arg#1 % 256); {38103#(= (+ (- 1) ~mode1~0) 0)} is VALID [2022-02-20 18:29:04,091 INFO L290 TraceCheckUtils]: 42: Hoare triple {38103#(= (+ (- 1) ~mode1~0) 0)} assume { :end_inline_assert } true; {38103#(= (+ (- 1) ~mode1~0) 0)} is VALID [2022-02-20 18:29:04,091 INFO L290 TraceCheckUtils]: 43: Hoare triple {38103#(= (+ (- 1) ~mode1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {38103#(= (+ (- 1) ~mode1~0) 0)} is VALID [2022-02-20 18:29:04,091 INFO L290 TraceCheckUtils]: 44: Hoare triple {38103#(= (+ (- 1) ~mode1~0) 0)} assume !(0 != ~mode1~0 % 256); {38102#false} is VALID [2022-02-20 18:29:04,092 INFO L290 TraceCheckUtils]: 45: Hoare triple {38102#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {38102#false} is VALID [2022-02-20 18:29:04,092 INFO L290 TraceCheckUtils]: 46: Hoare triple {38102#false} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {38102#false} is VALID [2022-02-20 18:29:04,092 INFO L290 TraceCheckUtils]: 47: Hoare triple {38102#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {38102#false} is VALID [2022-02-20 18:29:04,092 INFO L290 TraceCheckUtils]: 48: Hoare triple {38102#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {38102#false} is VALID [2022-02-20 18:29:04,092 INFO L290 TraceCheckUtils]: 49: Hoare triple {38102#false} assume !(node2_~m2~0#1 != ~nomsg~0); {38102#false} is VALID [2022-02-20 18:29:04,092 INFO L290 TraceCheckUtils]: 50: Hoare triple {38102#false} ~mode2~0 := 0; {38102#false} is VALID [2022-02-20 18:29:04,092 INFO L290 TraceCheckUtils]: 51: Hoare triple {38102#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {38102#false} is VALID [2022-02-20 18:29:04,092 INFO L290 TraceCheckUtils]: 52: Hoare triple {38102#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {38102#false} is VALID [2022-02-20 18:29:04,092 INFO L290 TraceCheckUtils]: 53: Hoare triple {38102#false} assume node3_~m3~0#1 != ~nomsg~0; {38102#false} is VALID [2022-02-20 18:29:04,093 INFO L290 TraceCheckUtils]: 54: Hoare triple {38102#false} assume !(node3_~m3~0#1 > ~id3~0); {38102#false} is VALID [2022-02-20 18:29:04,093 INFO L290 TraceCheckUtils]: 55: Hoare triple {38102#false} assume node3_~m3~0#1 == ~id3~0;~st3~0 := 1; {38102#false} is VALID [2022-02-20 18:29:04,093 INFO L290 TraceCheckUtils]: 56: Hoare triple {38102#false} ~mode3~0 := 0; {38102#false} is VALID [2022-02-20 18:29:04,093 INFO L290 TraceCheckUtils]: 57: Hoare triple {38102#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; {38102#false} is VALID [2022-02-20 18:29:04,093 INFO L290 TraceCheckUtils]: 58: Hoare triple {38102#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {38102#false} is VALID [2022-02-20 18:29:04,093 INFO L290 TraceCheckUtils]: 59: Hoare triple {38102#false} assume !(~r1~0 % 256 >= 3); {38102#false} is VALID [2022-02-20 18:29:04,093 INFO L290 TraceCheckUtils]: 60: Hoare triple {38102#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);check_~tmp~1#1 := 0; {38102#false} is VALID [2022-02-20 18:29:04,093 INFO L290 TraceCheckUtils]: 61: Hoare triple {38102#false} check_#res#1 := check_~tmp~1#1; {38102#false} is VALID [2022-02-20 18:29:04,093 INFO L290 TraceCheckUtils]: 62: Hoare triple {38102#false} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {38102#false} is VALID [2022-02-20 18:29:04,094 INFO L290 TraceCheckUtils]: 63: Hoare triple {38102#false} assume 0 == assert_~arg#1 % 256; {38102#false} is VALID [2022-02-20 18:29:04,094 INFO L290 TraceCheckUtils]: 64: Hoare triple {38102#false} assume !false; {38102#false} is VALID [2022-02-20 18:29:04,094 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:29:04,094 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:04,094 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934784005] [2022-02-20 18:29:04,094 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934784005] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:04,094 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:04,095 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:29:04,095 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686073921] [2022-02-20 18:29:04,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:04,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:29:04,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:04,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:04,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:04,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:29:04,125 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:04,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:29:04,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:29:04,126 INFO L87 Difference]: Start difference. First operand 2310 states and 3205 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:05,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:05,398 INFO L93 Difference]: Finished difference Result 3960 states and 5529 transitions. [2022-02-20 18:29:05,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:29:05,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:29:05,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:05,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:05,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2022-02-20 18:29:05,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:05,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2022-02-20 18:29:05,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 185 transitions. [2022-02-20 18:29:05,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:05,586 INFO L225 Difference]: With dead ends: 3960 [2022-02-20 18:29:05,586 INFO L226 Difference]: Without dead ends: 1674 [2022-02-20 18:29:05,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:29:05,588 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 36 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:29:05,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 170 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:29:05,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2022-02-20 18:29:06,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 1672. [2022-02-20 18:29:06,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:06,418 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1674 states. Second operand has 1672 states, 1671 states have (on average 1.3871932974266905) internal successors, (2318), 1671 states have internal predecessors, (2318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:06,419 INFO L74 IsIncluded]: Start isIncluded. First operand 1674 states. Second operand has 1672 states, 1671 states have (on average 1.3871932974266905) internal successors, (2318), 1671 states have internal predecessors, (2318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:06,420 INFO L87 Difference]: Start difference. First operand 1674 states. Second operand has 1672 states, 1671 states have (on average 1.3871932974266905) internal successors, (2318), 1671 states have internal predecessors, (2318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:06,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:06,499 INFO L93 Difference]: Finished difference Result 1674 states and 2319 transitions. [2022-02-20 18:29:06,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2319 transitions. [2022-02-20 18:29:06,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:06,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:06,505 INFO L74 IsIncluded]: Start isIncluded. First operand has 1672 states, 1671 states have (on average 1.3871932974266905) internal successors, (2318), 1671 states have internal predecessors, (2318), 0 states have call successors, (0), 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 1674 states. [2022-02-20 18:29:06,507 INFO L87 Difference]: Start difference. First operand has 1672 states, 1671 states have (on average 1.3871932974266905) internal successors, (2318), 1671 states have internal predecessors, (2318), 0 states have call successors, (0), 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 1674 states. [2022-02-20 18:29:06,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:06,585 INFO L93 Difference]: Finished difference Result 1674 states and 2319 transitions. [2022-02-20 18:29:06,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2319 transitions. [2022-02-20 18:29:06,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:06,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:06,587 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:06,587 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:06,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 1671 states have (on average 1.3871932974266905) internal successors, (2318), 1671 states have internal predecessors, (2318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:06,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2318 transitions. [2022-02-20 18:29:06,681 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2318 transitions. Word has length 65 [2022-02-20 18:29:06,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:06,682 INFO L470 AbstractCegarLoop]: Abstraction has 1672 states and 2318 transitions. [2022-02-20 18:29:06,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:06,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2318 transitions. [2022-02-20 18:29:06,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:29:06,683 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:06,683 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:29:06,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 18:29:06,683 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:06,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:06,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1575580592, now seen corresponding path program 1 times [2022-02-20 18:29:06,684 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:06,684 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887002029] [2022-02-20 18:29:06,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:06,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:06,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:06,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {48434#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(34, 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; {48434#true} is VALID [2022-02-20 18:29:06,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {48434#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1, main_#t~ret21#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -128 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 127;~id1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~st1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~send1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~mode1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {48434#true} is VALID [2022-02-20 18:29:06,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {48434#true} assume 0 == ~r1~0 % 256; {48434#true} is VALID [2022-02-20 18:29:06,754 INFO L290 TraceCheckUtils]: 3: Hoare triple {48434#true} assume ~id1~0 >= 0; {48434#true} is VALID [2022-02-20 18:29:06,754 INFO L290 TraceCheckUtils]: 4: Hoare triple {48434#true} assume 0 == ~st1~0; {48434#true} is VALID [2022-02-20 18:29:06,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {48434#true} assume ~send1~0 == ~id1~0; {48434#true} is VALID [2022-02-20 18:29:06,755 INFO L290 TraceCheckUtils]: 6: Hoare triple {48434#true} assume 0 == ~mode1~0 % 256; {48434#true} is VALID [2022-02-20 18:29:06,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {48434#true} assume ~id2~0 >= 0; {48434#true} is VALID [2022-02-20 18:29:06,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {48434#true} assume 0 == ~st2~0; {48436#(<= ~st2~0 0)} is VALID [2022-02-20 18:29:06,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {48436#(<= ~st2~0 0)} assume ~send2~0 == ~id2~0; {48436#(<= ~st2~0 0)} is VALID [2022-02-20 18:29:06,756 INFO L290 TraceCheckUtils]: 10: Hoare triple {48436#(<= ~st2~0 0)} assume 0 == ~mode2~0 % 256; {48436#(<= ~st2~0 0)} is VALID [2022-02-20 18:29:06,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {48436#(<= ~st2~0 0)} assume ~id3~0 >= 0; {48436#(<= ~st2~0 0)} is VALID [2022-02-20 18:29:06,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {48436#(<= ~st2~0 0)} assume 0 == ~st3~0; {48437#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:06,757 INFO L290 TraceCheckUtils]: 13: Hoare triple {48437#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send3~0 == ~id3~0; {48437#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:06,757 INFO L290 TraceCheckUtils]: 14: Hoare triple {48437#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256; {48437#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:06,757 INFO L290 TraceCheckUtils]: 15: Hoare triple {48437#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id2~0; {48437#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:06,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {48437#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id3~0; {48437#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:06,758 INFO L290 TraceCheckUtils]: 17: Hoare triple {48437#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {48437#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:06,758 INFO L290 TraceCheckUtils]: 18: Hoare triple {48437#(<= (+ ~st3~0 ~st2~0) 0)} init_#res#1 := init_~tmp~0#1; {48437#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:06,758 INFO L290 TraceCheckUtils]: 19: Hoare triple {48437#(<= (+ ~st3~0 ~st2~0) 0)} main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret20#1 && main_#t~ret20#1 <= 2147483647;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {48437#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:06,758 INFO L290 TraceCheckUtils]: 20: Hoare triple {48437#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {48437#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:06,759 INFO L290 TraceCheckUtils]: 21: Hoare triple {48437#(<= (+ ~st3~0 ~st2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {48437#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:06,759 INFO L290 TraceCheckUtils]: 22: Hoare triple {48437#(<= (+ ~st3~0 ~st2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {48437#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:06,759 INFO L290 TraceCheckUtils]: 23: Hoare triple {48437#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 != ~mode1~0 % 256); {48437#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:06,760 INFO L290 TraceCheckUtils]: 24: Hoare triple {48437#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {48437#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:06,760 INFO L290 TraceCheckUtils]: 25: Hoare triple {48437#(<= (+ ~st3~0 ~st2~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {48437#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:06,760 INFO L290 TraceCheckUtils]: 26: Hoare triple {48437#(<= (+ ~st3~0 ~st2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {48437#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:06,760 INFO L290 TraceCheckUtils]: 27: Hoare triple {48437#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 != ~mode2~0 % 256); {48437#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:06,761 INFO L290 TraceCheckUtils]: 28: Hoare triple {48437#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {48437#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:06,761 INFO L290 TraceCheckUtils]: 29: Hoare triple {48437#(<= (+ ~st3~0 ~st2~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {48437#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:06,761 INFO L290 TraceCheckUtils]: 30: Hoare triple {48437#(<= (+ ~st3~0 ~st2~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {48437#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:06,762 INFO L290 TraceCheckUtils]: 31: Hoare triple {48437#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 != ~mode3~0 % 256); {48437#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:06,762 INFO L290 TraceCheckUtils]: 32: Hoare triple {48437#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {48437#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:06,762 INFO L290 TraceCheckUtils]: 33: Hoare triple {48437#(<= (+ ~st3~0 ~st2~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {48437#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:06,762 INFO L290 TraceCheckUtils]: 34: Hoare triple {48437#(<= (+ ~st3~0 ~st2~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; {48437#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:06,763 INFO L290 TraceCheckUtils]: 35: Hoare triple {48437#(<= (+ ~st3~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {48437#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:06,763 INFO L290 TraceCheckUtils]: 36: Hoare triple {48437#(<= (+ ~st3~0 ~st2~0) 0)} assume !(~r1~0 % 256 >= 3); {48437#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:06,763 INFO L290 TraceCheckUtils]: 37: Hoare triple {48437#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {48437#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:06,764 INFO L290 TraceCheckUtils]: 38: Hoare triple {48437#(<= (+ ~st3~0 ~st2~0) 0)} assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; {48437#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:06,764 INFO L290 TraceCheckUtils]: 39: Hoare triple {48437#(<= (+ ~st3~0 ~st2~0) 0)} check_#res#1 := check_~tmp~1#1; {48437#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:06,764 INFO L290 TraceCheckUtils]: 40: Hoare triple {48437#(<= (+ ~st3~0 ~st2~0) 0)} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {48437#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:06,765 INFO L290 TraceCheckUtils]: 41: Hoare triple {48437#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 == assert_~arg#1 % 256); {48437#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:06,765 INFO L290 TraceCheckUtils]: 42: Hoare triple {48437#(<= (+ ~st3~0 ~st2~0) 0)} assume { :end_inline_assert } true; {48437#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:06,765 INFO L290 TraceCheckUtils]: 43: Hoare triple {48437#(<= (+ ~st3~0 ~st2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {48437#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:06,765 INFO L290 TraceCheckUtils]: 44: Hoare triple {48437#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 != ~mode1~0 % 256; {48437#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:06,766 INFO L290 TraceCheckUtils]: 45: Hoare triple {48437#(<= (+ ~st3~0 ~st2~0) 0)} assume !(255 == ~r1~0 % 256); {48437#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:06,766 INFO L290 TraceCheckUtils]: 46: Hoare triple {48437#(<= (+ ~st3~0 ~st2~0) 0)} ~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {48437#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:06,766 INFO L290 TraceCheckUtils]: 47: Hoare triple {48437#(<= (+ ~st3~0 ~st2~0) 0)} assume node1_~m1~0#1 != ~nomsg~0; {48437#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:06,767 INFO L290 TraceCheckUtils]: 48: Hoare triple {48437#(<= (+ ~st3~0 ~st2~0) 0)} assume !(node1_~m1~0#1 > ~id1~0); {48437#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:29:06,767 INFO L290 TraceCheckUtils]: 49: Hoare triple {48437#(<= (+ ~st3~0 ~st2~0) 0)} assume node1_~m1~0#1 == ~id1~0;~st1~0 := 1; {48438#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:29:06,767 INFO L290 TraceCheckUtils]: 50: Hoare triple {48438#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} ~mode1~0 := 0; {48438#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:29:06,768 INFO L290 TraceCheckUtils]: 51: Hoare triple {48438#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {48438#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:29:06,768 INFO L290 TraceCheckUtils]: 52: Hoare triple {48438#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {48438#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:29:06,768 INFO L290 TraceCheckUtils]: 53: Hoare triple {48438#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(node2_~m2~0#1 != ~nomsg~0); {48438#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:29:06,769 INFO L290 TraceCheckUtils]: 54: Hoare triple {48438#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} ~mode2~0 := 0; {48438#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:29:06,769 INFO L290 TraceCheckUtils]: 55: Hoare triple {48438#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {48438#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:29:06,770 INFO L290 TraceCheckUtils]: 56: Hoare triple {48438#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {48438#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:29:06,770 INFO L290 TraceCheckUtils]: 57: Hoare triple {48438#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(node3_~m3~0#1 != ~nomsg~0); {48438#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:29:06,770 INFO L290 TraceCheckUtils]: 58: Hoare triple {48438#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} ~mode3~0 := 0; {48438#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:29:06,771 INFO L290 TraceCheckUtils]: 59: Hoare triple {48438#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~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; {48438#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:29:06,771 INFO L290 TraceCheckUtils]: 60: Hoare triple {48438#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {48435#false} is VALID [2022-02-20 18:29:06,771 INFO L290 TraceCheckUtils]: 61: Hoare triple {48435#false} check_#res#1 := check_~tmp~1#1; {48435#false} is VALID [2022-02-20 18:29:06,771 INFO L290 TraceCheckUtils]: 62: Hoare triple {48435#false} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {48435#false} is VALID [2022-02-20 18:29:06,771 INFO L290 TraceCheckUtils]: 63: Hoare triple {48435#false} assume 0 == assert_~arg#1 % 256; {48435#false} is VALID [2022-02-20 18:29:06,771 INFO L290 TraceCheckUtils]: 64: Hoare triple {48435#false} assume !false; {48435#false} is VALID [2022-02-20 18:29:06,772 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 18:29:06,772 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:06,772 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887002029] [2022-02-20 18:29:06,772 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887002029] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:06,772 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:06,772 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:29:06,773 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420606296] [2022-02-20 18:29:06,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:06,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:29:06,773 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:06,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:06,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:06,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:29:06,807 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:06,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:29:06,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:29:06,807 INFO L87 Difference]: Start difference. First operand 1672 states and 2318 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:09,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:09,042 INFO L93 Difference]: Finished difference Result 3072 states and 4290 transitions. [2022-02-20 18:29:09,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:29:09,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:29:09,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:09,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:09,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 314 transitions. [2022-02-20 18:29:09,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:09,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 314 transitions. [2022-02-20 18:29:09,045 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 314 transitions. [2022-02-20 18:29:09,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 314 edges. 314 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:09,454 INFO L225 Difference]: With dead ends: 3072 [2022-02-20 18:29:09,454 INFO L226 Difference]: Without dead ends: 2606 [2022-02-20 18:29:09,455 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:29:09,455 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 199 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:29:09,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 318 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:29:09,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2606 states. [2022-02-20 18:29:11,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2606 to 2136. [2022-02-20 18:29:11,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:11,145 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2606 states. Second operand has 2136 states, 2135 states have (on average 1.3892271662763467) internal successors, (2966), 2135 states have internal predecessors, (2966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:11,146 INFO L74 IsIncluded]: Start isIncluded. First operand 2606 states. Second operand has 2136 states, 2135 states have (on average 1.3892271662763467) internal successors, (2966), 2135 states have internal predecessors, (2966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:11,147 INFO L87 Difference]: Start difference. First operand 2606 states. Second operand has 2136 states, 2135 states have (on average 1.3892271662763467) internal successors, (2966), 2135 states have internal predecessors, (2966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:11,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:11,317 INFO L93 Difference]: Finished difference Result 2606 states and 3625 transitions. [2022-02-20 18:29:11,317 INFO L276 IsEmpty]: Start isEmpty. Operand 2606 states and 3625 transitions. [2022-02-20 18:29:11,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:11,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:11,321 INFO L74 IsIncluded]: Start isIncluded. First operand has 2136 states, 2135 states have (on average 1.3892271662763467) internal successors, (2966), 2135 states have internal predecessors, (2966), 0 states have call successors, (0), 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 2606 states. [2022-02-20 18:29:11,322 INFO L87 Difference]: Start difference. First operand has 2136 states, 2135 states have (on average 1.3892271662763467) internal successors, (2966), 2135 states have internal predecessors, (2966), 0 states have call successors, (0), 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 2606 states. [2022-02-20 18:29:11,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:11,492 INFO L93 Difference]: Finished difference Result 2606 states and 3625 transitions. [2022-02-20 18:29:11,492 INFO L276 IsEmpty]: Start isEmpty. Operand 2606 states and 3625 transitions. [2022-02-20 18:29:11,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:11,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:11,494 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:11,494 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:11,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2136 states, 2135 states have (on average 1.3892271662763467) internal successors, (2966), 2135 states have internal predecessors, (2966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:11,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 2966 transitions. [2022-02-20 18:29:11,640 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 2966 transitions. Word has length 65 [2022-02-20 18:29:11,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:11,640 INFO L470 AbstractCegarLoop]: Abstraction has 2136 states and 2966 transitions. [2022-02-20 18:29:11,640 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:11,640 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 2966 transitions. [2022-02-20 18:29:11,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:29:11,641 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:11,641 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:29:11,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 18:29:11,641 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:11,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:11,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1779322747, now seen corresponding path program 1 times [2022-02-20 18:29:11,642 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:11,642 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273239282] [2022-02-20 18:29:11,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:11,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:11,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {60114#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(34, 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; {60116#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:29:11,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {60116#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1, main_#t~ret21#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -128 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 127;~id1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~st1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~send1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~mode1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {60117#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:29:11,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {60117#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~r1~0 % 256; {60117#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:29:11,871 INFO L290 TraceCheckUtils]: 3: Hoare triple {60117#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id1~0 >= 0; {60117#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:29:11,872 INFO L290 TraceCheckUtils]: 4: Hoare triple {60117#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~st1~0; {60117#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:29:11,872 INFO L290 TraceCheckUtils]: 5: Hoare triple {60117#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~send1~0 == ~id1~0; {60117#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:29:11,873 INFO L290 TraceCheckUtils]: 6: Hoare triple {60117#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~mode1~0 % 256; {60117#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:29:11,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {60117#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id2~0 >= 0; {60118#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} is VALID [2022-02-20 18:29:11,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {60118#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} assume 0 == ~st2~0; {60118#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} is VALID [2022-02-20 18:29:11,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {60118#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} assume ~send2~0 == ~id2~0; {60119#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:29:11,874 INFO L290 TraceCheckUtils]: 10: Hoare triple {60119#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {60119#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:29:11,875 INFO L290 TraceCheckUtils]: 11: Hoare triple {60119#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {60119#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:29:11,875 INFO L290 TraceCheckUtils]: 12: Hoare triple {60119#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st3~0; {60119#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:29:11,876 INFO L290 TraceCheckUtils]: 13: Hoare triple {60119#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 == ~id3~0; {60119#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:29:11,876 INFO L290 TraceCheckUtils]: 14: Hoare triple {60119#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode3~0 % 256; {60119#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:29:11,877 INFO L290 TraceCheckUtils]: 15: Hoare triple {60119#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id2~0; {60119#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:29:11,877 INFO L290 TraceCheckUtils]: 16: Hoare triple {60119#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id3~0; {60119#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:29:11,877 INFO L290 TraceCheckUtils]: 17: Hoare triple {60119#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {60119#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:29:11,878 INFO L290 TraceCheckUtils]: 18: Hoare triple {60119#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} init_#res#1 := init_~tmp~0#1; {60119#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:29:11,878 INFO L290 TraceCheckUtils]: 19: Hoare triple {60119#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret20#1 && main_#t~ret20#1 <= 2147483647;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {60119#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:29:11,879 INFO L290 TraceCheckUtils]: 20: Hoare triple {60119#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !(0 == assume_abort_if_not_~cond#1); {60119#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:29:11,879 INFO L290 TraceCheckUtils]: 21: Hoare triple {60119#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {60119#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:29:11,880 INFO L290 TraceCheckUtils]: 22: Hoare triple {60119#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {60119#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:29:11,880 INFO L290 TraceCheckUtils]: 23: Hoare triple {60119#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !(0 != ~mode1~0 % 256); {60119#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:29:11,881 INFO L290 TraceCheckUtils]: 24: Hoare triple {60119#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {60119#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:29:11,881 INFO L290 TraceCheckUtils]: 25: Hoare triple {60119#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {60119#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:29:11,882 INFO L290 TraceCheckUtils]: 26: Hoare triple {60119#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {60119#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:29:11,882 INFO L290 TraceCheckUtils]: 27: Hoare triple {60119#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !(0 != ~mode2~0 % 256); {60119#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:29:11,883 INFO L290 TraceCheckUtils]: 28: Hoare triple {60119#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {60120#(and (<= (+ ~nomsg~0 1) 0) (not (<= (+ 1 (div |ULTIMATE.start_node2_#t~ite5#1| 256)) 0)) (<= |ULTIMATE.start_node2_#t~ite5#1| 127))} is VALID [2022-02-20 18:29:11,883 INFO L290 TraceCheckUtils]: 29: Hoare triple {60120#(and (<= (+ ~nomsg~0 1) 0) (not (<= (+ 1 (div |ULTIMATE.start_node2_#t~ite5#1| 256)) 0)) (<= |ULTIMATE.start_node2_#t~ite5#1| 127))} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {60121#(<= (+ ~nomsg~0 1) ~p2_new~0)} is VALID [2022-02-20 18:29:11,884 INFO L290 TraceCheckUtils]: 30: Hoare triple {60121#(<= (+ ~nomsg~0 1) ~p2_new~0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {60121#(<= (+ ~nomsg~0 1) ~p2_new~0)} is VALID [2022-02-20 18:29:11,884 INFO L290 TraceCheckUtils]: 31: Hoare triple {60121#(<= (+ ~nomsg~0 1) ~p2_new~0)} assume !(0 != ~mode3~0 % 256); {60121#(<= (+ ~nomsg~0 1) ~p2_new~0)} is VALID [2022-02-20 18:29:11,885 INFO L290 TraceCheckUtils]: 32: Hoare triple {60121#(<= (+ ~nomsg~0 1) ~p2_new~0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {60122#(or (and (or (not (<= |ULTIMATE.start_node3_#t~ite6#1| (+ (* (div |ULTIMATE.start_node3_#t~ite6#1| 256) 256) 127))) (not (= (+ (* (div |ULTIMATE.start_node3_#t~ite6#1| 256) (- 256)) |ULTIMATE.start_node3_#t~ite6#1|) ~p2_new~0))) (or (not (= (+ (- 256) (* (div |ULTIMATE.start_node3_#t~ite6#1| 256) (- 256)) |ULTIMATE.start_node3_#t~ite6#1|) ~p2_new~0)) (<= |ULTIMATE.start_node3_#t~ite6#1| (+ (* (div |ULTIMATE.start_node3_#t~ite6#1| 256) 256) 127)))) (and (not (= (+ ~nomsg~0 (* (div |ULTIMATE.start_node3_#t~ite6#1| 256) 256) 256 (* (- 1) |ULTIMATE.start_node3_#t~ite6#1|)) 0)) (or (not (<= |ULTIMATE.start_node3_#t~ite6#1| (+ (* (div |ULTIMATE.start_node3_#t~ite6#1| 256) 256) 127))) (not (= (+ ~nomsg~0 (* (div |ULTIMATE.start_node3_#t~ite6#1| 256) 256) (* (- 1) |ULTIMATE.start_node3_#t~ite6#1|)) 0)))) (and (<= (+ ~nomsg~0 (* (div |ULTIMATE.start_node3_#t~ite6#1| 256) 256) 1) |ULTIMATE.start_node3_#t~ite6#1|) (<= |ULTIMATE.start_node3_#t~ite6#1| (+ (* (div |ULTIMATE.start_node3_#t~ite6#1| 256) 256) 127))))} is VALID [2022-02-20 18:29:11,886 INFO L290 TraceCheckUtils]: 33: Hoare triple {60122#(or (and (or (not (<= |ULTIMATE.start_node3_#t~ite6#1| (+ (* (div |ULTIMATE.start_node3_#t~ite6#1| 256) 256) 127))) (not (= (+ (* (div |ULTIMATE.start_node3_#t~ite6#1| 256) (- 256)) |ULTIMATE.start_node3_#t~ite6#1|) ~p2_new~0))) (or (not (= (+ (- 256) (* (div |ULTIMATE.start_node3_#t~ite6#1| 256) (- 256)) |ULTIMATE.start_node3_#t~ite6#1|) ~p2_new~0)) (<= |ULTIMATE.start_node3_#t~ite6#1| (+ (* (div |ULTIMATE.start_node3_#t~ite6#1| 256) 256) 127)))) (and (not (= (+ ~nomsg~0 (* (div |ULTIMATE.start_node3_#t~ite6#1| 256) 256) 256 (* (- 1) |ULTIMATE.start_node3_#t~ite6#1|)) 0)) (or (not (<= |ULTIMATE.start_node3_#t~ite6#1| (+ (* (div |ULTIMATE.start_node3_#t~ite6#1| 256) 256) 127))) (not (= (+ ~nomsg~0 (* (div |ULTIMATE.start_node3_#t~ite6#1| 256) 256) (* (- 1) |ULTIMATE.start_node3_#t~ite6#1|)) 0)))) (and (<= (+ ~nomsg~0 (* (div |ULTIMATE.start_node3_#t~ite6#1| 256) 256) 1) |ULTIMATE.start_node3_#t~ite6#1|) (<= |ULTIMATE.start_node3_#t~ite6#1| (+ (* (div |ULTIMATE.start_node3_#t~ite6#1| 256) 256) 127))))} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {60123#(or (not (= ~p3_new~0 ~p2_new~0)) (not (= ~p3_new~0 ~nomsg~0)))} is VALID [2022-02-20 18:29:11,887 INFO L290 TraceCheckUtils]: 34: Hoare triple {60123#(or (not (= ~p3_new~0 ~p2_new~0)) (not (= ~p3_new~0 ~nomsg~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; {60124#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} is VALID [2022-02-20 18:29:11,887 INFO L290 TraceCheckUtils]: 35: Hoare triple {60124#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {60124#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} is VALID [2022-02-20 18:29:11,888 INFO L290 TraceCheckUtils]: 36: Hoare triple {60124#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} assume !(~r1~0 % 256 >= 3); {60124#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} is VALID [2022-02-20 18:29:11,888 INFO L290 TraceCheckUtils]: 37: Hoare triple {60124#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {60124#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} is VALID [2022-02-20 18:29:11,888 INFO L290 TraceCheckUtils]: 38: Hoare triple {60124#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; {60124#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} is VALID [2022-02-20 18:29:11,889 INFO L290 TraceCheckUtils]: 39: Hoare triple {60124#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} check_#res#1 := check_~tmp~1#1; {60124#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} is VALID [2022-02-20 18:29:11,889 INFO L290 TraceCheckUtils]: 40: Hoare triple {60124#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {60124#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} is VALID [2022-02-20 18:29:11,890 INFO L290 TraceCheckUtils]: 41: Hoare triple {60124#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} assume !(0 == assert_~arg#1 % 256); {60124#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} is VALID [2022-02-20 18:29:11,890 INFO L290 TraceCheckUtils]: 42: Hoare triple {60124#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} assume { :end_inline_assert } true; {60124#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} is VALID [2022-02-20 18:29:11,890 INFO L290 TraceCheckUtils]: 43: Hoare triple {60124#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {60124#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} is VALID [2022-02-20 18:29:11,891 INFO L290 TraceCheckUtils]: 44: Hoare triple {60124#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} assume 0 != ~mode1~0 % 256; {60124#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} is VALID [2022-02-20 18:29:11,891 INFO L290 TraceCheckUtils]: 45: Hoare triple {60124#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} assume !(255 == ~r1~0 % 256); {60124#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} is VALID [2022-02-20 18:29:11,892 INFO L290 TraceCheckUtils]: 46: Hoare triple {60124#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} ~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {60125#(or (not (= ~nomsg~0 |ULTIMATE.start_node1_~m1~0#1|)) (not (= |ULTIMATE.start_node1_~m1~0#1| ~p2_old~0)))} is VALID [2022-02-20 18:29:11,892 INFO L290 TraceCheckUtils]: 47: Hoare triple {60125#(or (not (= ~nomsg~0 |ULTIMATE.start_node1_~m1~0#1|)) (not (= |ULTIMATE.start_node1_~m1~0#1| ~p2_old~0)))} assume !(node1_~m1~0#1 != ~nomsg~0); {60126#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:29:11,892 INFO L290 TraceCheckUtils]: 48: Hoare triple {60126#(not (= ~nomsg~0 ~p2_old~0))} ~mode1~0 := 0; {60126#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:29:11,893 INFO L290 TraceCheckUtils]: 49: Hoare triple {60126#(not (= ~nomsg~0 ~p2_old~0))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {60126#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:29:11,893 INFO L290 TraceCheckUtils]: 50: Hoare triple {60126#(not (= ~nomsg~0 ~p2_old~0))} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {60126#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:29:11,893 INFO L290 TraceCheckUtils]: 51: Hoare triple {60126#(not (= ~nomsg~0 ~p2_old~0))} assume !(node2_~m2~0#1 != ~nomsg~0); {60126#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:29:11,894 INFO L290 TraceCheckUtils]: 52: Hoare triple {60126#(not (= ~nomsg~0 ~p2_old~0))} ~mode2~0 := 0; {60126#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:29:11,894 INFO L290 TraceCheckUtils]: 53: Hoare triple {60126#(not (= ~nomsg~0 ~p2_old~0))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {60126#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:29:11,895 INFO L290 TraceCheckUtils]: 54: Hoare triple {60126#(not (= ~nomsg~0 ~p2_old~0))} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {60127#(not (= ~nomsg~0 |ULTIMATE.start_node3_~m3~0#1|))} is VALID [2022-02-20 18:29:11,895 INFO L290 TraceCheckUtils]: 55: Hoare triple {60127#(not (= ~nomsg~0 |ULTIMATE.start_node3_~m3~0#1|))} assume !(node3_~m3~0#1 != ~nomsg~0); {60115#false} is VALID [2022-02-20 18:29:11,895 INFO L290 TraceCheckUtils]: 56: Hoare triple {60115#false} ~mode3~0 := 0; {60115#false} is VALID [2022-02-20 18:29:11,895 INFO L290 TraceCheckUtils]: 57: Hoare triple {60115#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; {60115#false} is VALID [2022-02-20 18:29:11,895 INFO L290 TraceCheckUtils]: 58: Hoare triple {60115#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {60115#false} is VALID [2022-02-20 18:29:11,895 INFO L290 TraceCheckUtils]: 59: Hoare triple {60115#false} assume ~r1~0 % 256 >= 3; {60115#false} is VALID [2022-02-20 18:29:11,896 INFO L290 TraceCheckUtils]: 60: Hoare triple {60115#false} assume !(~r1~0 % 256 < 3); {60115#false} is VALID [2022-02-20 18:29:11,896 INFO L290 TraceCheckUtils]: 61: Hoare triple {60115#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0);check_~tmp~1#1 := 0; {60115#false} is VALID [2022-02-20 18:29:11,896 INFO L290 TraceCheckUtils]: 62: Hoare triple {60115#false} check_#res#1 := check_~tmp~1#1; {60115#false} is VALID [2022-02-20 18:29:11,896 INFO L290 TraceCheckUtils]: 63: Hoare triple {60115#false} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {60115#false} is VALID [2022-02-20 18:29:11,896 INFO L290 TraceCheckUtils]: 64: Hoare triple {60115#false} assume 0 == assert_~arg#1 % 256; {60115#false} is VALID [2022-02-20 18:29:11,896 INFO L290 TraceCheckUtils]: 65: Hoare triple {60115#false} assume !false; {60115#false} is VALID [2022-02-20 18:29:11,897 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:29:11,897 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:11,897 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273239282] [2022-02-20 18:29:11,897 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273239282] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:29:11,897 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133055597] [2022-02-20 18:29:11,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:11,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:29:11,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:29:11,899 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 18:29:11,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 18:29:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:11,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 18:29:11,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:12,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:29:13,351 INFO L290 TraceCheckUtils]: 0: Hoare triple {60114#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(34, 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; {60114#true} is VALID [2022-02-20 18:29:13,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {60114#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1, main_#t~ret21#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -128 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 127;~id1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~st1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~send1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~mode1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {60114#true} is VALID [2022-02-20 18:29:13,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {60114#true} assume 0 == ~r1~0 % 256; {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,352 INFO L290 TraceCheckUtils]: 3: Hoare triple {60137#(<= (mod ~r1~0 256) 0)} assume ~id1~0 >= 0; {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,352 INFO L290 TraceCheckUtils]: 4: Hoare triple {60137#(<= (mod ~r1~0 256) 0)} assume 0 == ~st1~0; {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {60137#(<= (mod ~r1~0 256) 0)} assume ~send1~0 == ~id1~0; {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {60137#(<= (mod ~r1~0 256) 0)} assume 0 == ~mode1~0 % 256; {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {60137#(<= (mod ~r1~0 256) 0)} assume ~id2~0 >= 0; {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {60137#(<= (mod ~r1~0 256) 0)} assume 0 == ~st2~0; {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {60137#(<= (mod ~r1~0 256) 0)} assume ~send2~0 == ~id2~0; {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {60137#(<= (mod ~r1~0 256) 0)} assume 0 == ~mode2~0 % 256; {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {60137#(<= (mod ~r1~0 256) 0)} assume ~id3~0 >= 0; {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,355 INFO L290 TraceCheckUtils]: 12: Hoare triple {60137#(<= (mod ~r1~0 256) 0)} assume 0 == ~st3~0; {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {60137#(<= (mod ~r1~0 256) 0)} assume ~send3~0 == ~id3~0; {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {60137#(<= (mod ~r1~0 256) 0)} assume 0 == ~mode3~0 % 256; {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,356 INFO L290 TraceCheckUtils]: 15: Hoare triple {60137#(<= (mod ~r1~0 256) 0)} assume ~id1~0 != ~id2~0; {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {60137#(<= (mod ~r1~0 256) 0)} assume ~id1~0 != ~id3~0; {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,356 INFO L290 TraceCheckUtils]: 17: Hoare triple {60137#(<= (mod ~r1~0 256) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,356 INFO L290 TraceCheckUtils]: 18: Hoare triple {60137#(<= (mod ~r1~0 256) 0)} init_#res#1 := init_~tmp~0#1; {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,357 INFO L290 TraceCheckUtils]: 19: Hoare triple {60137#(<= (mod ~r1~0 256) 0)} main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret20#1 && main_#t~ret20#1 <= 2147483647;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,357 INFO L290 TraceCheckUtils]: 20: Hoare triple {60137#(<= (mod ~r1~0 256) 0)} assume !(0 == assume_abort_if_not_~cond#1); {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,357 INFO L290 TraceCheckUtils]: 21: Hoare triple {60137#(<= (mod ~r1~0 256) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,360 INFO L290 TraceCheckUtils]: 22: Hoare triple {60137#(<= (mod ~r1~0 256) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,360 INFO L290 TraceCheckUtils]: 23: Hoare triple {60137#(<= (mod ~r1~0 256) 0)} assume !(0 != ~mode1~0 % 256); {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,360 INFO L290 TraceCheckUtils]: 24: Hoare triple {60137#(<= (mod ~r1~0 256) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,361 INFO L290 TraceCheckUtils]: 25: Hoare triple {60137#(<= (mod ~r1~0 256) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,361 INFO L290 TraceCheckUtils]: 26: Hoare triple {60137#(<= (mod ~r1~0 256) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,361 INFO L290 TraceCheckUtils]: 27: Hoare triple {60137#(<= (mod ~r1~0 256) 0)} assume !(0 != ~mode2~0 % 256); {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,361 INFO L290 TraceCheckUtils]: 28: Hoare triple {60137#(<= (mod ~r1~0 256) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,362 INFO L290 TraceCheckUtils]: 29: Hoare triple {60137#(<= (mod ~r1~0 256) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,362 INFO L290 TraceCheckUtils]: 30: Hoare triple {60137#(<= (mod ~r1~0 256) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,362 INFO L290 TraceCheckUtils]: 31: Hoare triple {60137#(<= (mod ~r1~0 256) 0)} assume !(0 != ~mode3~0 % 256); {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,362 INFO L290 TraceCheckUtils]: 32: Hoare triple {60137#(<= (mod ~r1~0 256) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,363 INFO L290 TraceCheckUtils]: 33: Hoare triple {60137#(<= (mod ~r1~0 256) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,363 INFO L290 TraceCheckUtils]: 34: Hoare triple {60137#(<= (mod ~r1~0 256) 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; {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,363 INFO L290 TraceCheckUtils]: 35: Hoare triple {60137#(<= (mod ~r1~0 256) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,364 INFO L290 TraceCheckUtils]: 36: Hoare triple {60137#(<= (mod ~r1~0 256) 0)} assume !(~r1~0 % 256 >= 3); {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,364 INFO L290 TraceCheckUtils]: 37: Hoare triple {60137#(<= (mod ~r1~0 256) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,364 INFO L290 TraceCheckUtils]: 38: Hoare triple {60137#(<= (mod ~r1~0 256) 0)} assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,364 INFO L290 TraceCheckUtils]: 39: Hoare triple {60137#(<= (mod ~r1~0 256) 0)} check_#res#1 := check_~tmp~1#1; {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,365 INFO L290 TraceCheckUtils]: 40: Hoare triple {60137#(<= (mod ~r1~0 256) 0)} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,365 INFO L290 TraceCheckUtils]: 41: Hoare triple {60137#(<= (mod ~r1~0 256) 0)} assume !(0 == assert_~arg#1 % 256); {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,365 INFO L290 TraceCheckUtils]: 42: Hoare triple {60137#(<= (mod ~r1~0 256) 0)} assume { :end_inline_assert } true; {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,365 INFO L290 TraceCheckUtils]: 43: Hoare triple {60137#(<= (mod ~r1~0 256) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,366 INFO L290 TraceCheckUtils]: 44: Hoare triple {60137#(<= (mod ~r1~0 256) 0)} assume 0 != ~mode1~0 % 256; {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,366 INFO L290 TraceCheckUtils]: 45: Hoare triple {60137#(<= (mod ~r1~0 256) 0)} assume !(255 == ~r1~0 % 256); {60137#(<= (mod ~r1~0 256) 0)} is VALID [2022-02-20 18:29:13,367 INFO L290 TraceCheckUtils]: 46: Hoare triple {60137#(<= (mod ~r1~0 256) 0)} ~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {60270#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} is VALID [2022-02-20 18:29:13,367 INFO L290 TraceCheckUtils]: 47: Hoare triple {60270#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} assume !(node1_~m1~0#1 != ~nomsg~0); {60270#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} is VALID [2022-02-20 18:29:13,368 INFO L290 TraceCheckUtils]: 48: Hoare triple {60270#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} ~mode1~0 := 0; {60270#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} is VALID [2022-02-20 18:29:13,368 INFO L290 TraceCheckUtils]: 49: Hoare triple {60270#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {60270#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} is VALID [2022-02-20 18:29:13,380 INFO L290 TraceCheckUtils]: 50: Hoare triple {60270#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {60270#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} is VALID [2022-02-20 18:29:13,391 INFO L290 TraceCheckUtils]: 51: Hoare triple {60270#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} assume !(node2_~m2~0#1 != ~nomsg~0); {60270#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} is VALID [2022-02-20 18:29:13,391 INFO L290 TraceCheckUtils]: 52: Hoare triple {60270#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} ~mode2~0 := 0; {60270#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} is VALID [2022-02-20 18:29:13,392 INFO L290 TraceCheckUtils]: 53: Hoare triple {60270#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {60270#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} is VALID [2022-02-20 18:29:13,392 INFO L290 TraceCheckUtils]: 54: Hoare triple {60270#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {60270#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} is VALID [2022-02-20 18:29:13,393 INFO L290 TraceCheckUtils]: 55: Hoare triple {60270#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} assume !(node3_~m3~0#1 != ~nomsg~0); {60270#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} is VALID [2022-02-20 18:29:13,393 INFO L290 TraceCheckUtils]: 56: Hoare triple {60270#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} ~mode3~0 := 0; {60270#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} is VALID [2022-02-20 18:29:13,393 INFO L290 TraceCheckUtils]: 57: Hoare triple {60270#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} 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; {60270#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} is VALID [2022-02-20 18:29:13,394 INFO L290 TraceCheckUtils]: 58: Hoare triple {60270#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {60270#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} is VALID [2022-02-20 18:29:13,395 INFO L290 TraceCheckUtils]: 59: Hoare triple {60270#(and (<= 1 ~r1~0) (<= (div (+ (- 1) ~r1~0) (- 256)) (div (+ (* (- 1) ~r1~0) 1) 256)) (< ~r1~0 257))} assume ~r1~0 % 256 >= 3; {60115#false} is VALID [2022-02-20 18:29:13,395 INFO L290 TraceCheckUtils]: 60: Hoare triple {60115#false} assume !(~r1~0 % 256 < 3); {60115#false} is VALID [2022-02-20 18:29:13,395 INFO L290 TraceCheckUtils]: 61: Hoare triple {60115#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0);check_~tmp~1#1 := 0; {60115#false} is VALID [2022-02-20 18:29:13,395 INFO L290 TraceCheckUtils]: 62: Hoare triple {60115#false} check_#res#1 := check_~tmp~1#1; {60115#false} is VALID [2022-02-20 18:29:13,395 INFO L290 TraceCheckUtils]: 63: Hoare triple {60115#false} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {60115#false} is VALID [2022-02-20 18:29:13,395 INFO L290 TraceCheckUtils]: 64: Hoare triple {60115#false} assume 0 == assert_~arg#1 % 256; {60115#false} is VALID [2022-02-20 18:29:13,395 INFO L290 TraceCheckUtils]: 65: Hoare triple {60115#false} assume !false; {60115#false} is VALID [2022-02-20 18:29:13,395 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 18:29:13,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:29:19,224 INFO L290 TraceCheckUtils]: 65: Hoare triple {60115#false} assume !false; {60115#false} is VALID [2022-02-20 18:29:19,224 INFO L290 TraceCheckUtils]: 64: Hoare triple {60115#false} assume 0 == assert_~arg#1 % 256; {60115#false} is VALID [2022-02-20 18:29:19,224 INFO L290 TraceCheckUtils]: 63: Hoare triple {60115#false} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {60115#false} is VALID [2022-02-20 18:29:19,224 INFO L290 TraceCheckUtils]: 62: Hoare triple {60115#false} check_#res#1 := check_~tmp~1#1; {60115#false} is VALID [2022-02-20 18:29:19,224 INFO L290 TraceCheckUtils]: 61: Hoare triple {60115#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0);check_~tmp~1#1 := 0; {60115#false} is VALID [2022-02-20 18:29:19,225 INFO L290 TraceCheckUtils]: 60: Hoare triple {60115#false} assume !(~r1~0 % 256 < 3); {60115#false} is VALID [2022-02-20 18:29:19,225 INFO L290 TraceCheckUtils]: 59: Hoare triple {60346#(not (<= 3 (mod ~r1~0 256)))} assume ~r1~0 % 256 >= 3; {60115#false} is VALID [2022-02-20 18:29:19,225 INFO L290 TraceCheckUtils]: 58: Hoare triple {60346#(not (<= 3 (mod ~r1~0 256)))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {60346#(not (<= 3 (mod ~r1~0 256)))} is VALID [2022-02-20 18:29:19,225 INFO L290 TraceCheckUtils]: 57: Hoare triple {60346#(not (<= 3 (mod ~r1~0 256)))} 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; {60346#(not (<= 3 (mod ~r1~0 256)))} is VALID [2022-02-20 18:29:19,226 INFO L290 TraceCheckUtils]: 56: Hoare triple {60346#(not (<= 3 (mod ~r1~0 256)))} ~mode3~0 := 0; {60346#(not (<= 3 (mod ~r1~0 256)))} is VALID [2022-02-20 18:29:19,226 INFO L290 TraceCheckUtils]: 55: Hoare triple {60346#(not (<= 3 (mod ~r1~0 256)))} assume !(node3_~m3~0#1 != ~nomsg~0); {60346#(not (<= 3 (mod ~r1~0 256)))} is VALID [2022-02-20 18:29:19,226 INFO L290 TraceCheckUtils]: 54: Hoare triple {60346#(not (<= 3 (mod ~r1~0 256)))} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {60346#(not (<= 3 (mod ~r1~0 256)))} is VALID [2022-02-20 18:29:19,227 INFO L290 TraceCheckUtils]: 53: Hoare triple {60346#(not (<= 3 (mod ~r1~0 256)))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {60346#(not (<= 3 (mod ~r1~0 256)))} is VALID [2022-02-20 18:29:19,227 INFO L290 TraceCheckUtils]: 52: Hoare triple {60346#(not (<= 3 (mod ~r1~0 256)))} ~mode2~0 := 0; {60346#(not (<= 3 (mod ~r1~0 256)))} is VALID [2022-02-20 18:29:19,227 INFO L290 TraceCheckUtils]: 51: Hoare triple {60346#(not (<= 3 (mod ~r1~0 256)))} assume !(node2_~m2~0#1 != ~nomsg~0); {60346#(not (<= 3 (mod ~r1~0 256)))} is VALID [2022-02-20 18:29:19,227 INFO L290 TraceCheckUtils]: 50: Hoare triple {60346#(not (<= 3 (mod ~r1~0 256)))} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {60346#(not (<= 3 (mod ~r1~0 256)))} is VALID [2022-02-20 18:29:19,228 INFO L290 TraceCheckUtils]: 49: Hoare triple {60346#(not (<= 3 (mod ~r1~0 256)))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {60346#(not (<= 3 (mod ~r1~0 256)))} is VALID [2022-02-20 18:29:19,228 INFO L290 TraceCheckUtils]: 48: Hoare triple {60346#(not (<= 3 (mod ~r1~0 256)))} ~mode1~0 := 0; {60346#(not (<= 3 (mod ~r1~0 256)))} is VALID [2022-02-20 18:29:19,228 INFO L290 TraceCheckUtils]: 47: Hoare triple {60346#(not (<= 3 (mod ~r1~0 256)))} assume !(node1_~m1~0#1 != ~nomsg~0); {60346#(not (<= 3 (mod ~r1~0 256)))} is VALID [2022-02-20 18:29:19,229 INFO L290 TraceCheckUtils]: 46: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} ~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {60346#(not (<= 3 (mod ~r1~0 256)))} is VALID [2022-02-20 18:29:19,229 INFO L290 TraceCheckUtils]: 45: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} assume !(255 == ~r1~0 % 256); {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,229 INFO L290 TraceCheckUtils]: 44: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} assume 0 != ~mode1~0 % 256; {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,230 INFO L290 TraceCheckUtils]: 43: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,230 INFO L290 TraceCheckUtils]: 42: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} assume { :end_inline_assert } true; {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,230 INFO L290 TraceCheckUtils]: 41: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} assume !(0 == assert_~arg#1 % 256); {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,231 INFO L290 TraceCheckUtils]: 40: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret21#1 && main_#t~ret21#1 <= 2147483647;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,231 INFO L290 TraceCheckUtils]: 39: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} check_#res#1 := check_~tmp~1#1; {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,231 INFO L290 TraceCheckUtils]: 38: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,231 INFO L290 TraceCheckUtils]: 37: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,232 INFO L290 TraceCheckUtils]: 36: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} assume !(~r1~0 % 256 >= 3); {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,232 INFO L290 TraceCheckUtils]: 35: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,232 INFO L290 TraceCheckUtils]: 34: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} 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; {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,233 INFO L290 TraceCheckUtils]: 33: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,233 INFO L290 TraceCheckUtils]: 32: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,233 INFO L290 TraceCheckUtils]: 31: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} assume !(0 != ~mode3~0 % 256); {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,233 INFO L290 TraceCheckUtils]: 30: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,234 INFO L290 TraceCheckUtils]: 29: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,234 INFO L290 TraceCheckUtils]: 28: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,234 INFO L290 TraceCheckUtils]: 27: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} assume !(0 != ~mode2~0 % 256); {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,235 INFO L290 TraceCheckUtils]: 26: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,235 INFO L290 TraceCheckUtils]: 25: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,235 INFO L290 TraceCheckUtils]: 24: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,235 INFO L290 TraceCheckUtils]: 23: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} assume !(0 != ~mode1~0 % 256); {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,236 INFO L290 TraceCheckUtils]: 22: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,236 INFO L290 TraceCheckUtils]: 21: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,236 INFO L290 TraceCheckUtils]: 20: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} assume !(0 == assume_abort_if_not_~cond#1); {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret20#1 && main_#t~ret20#1 <= 2147483647;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,237 INFO L290 TraceCheckUtils]: 18: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} init_#res#1 := init_~tmp~0#1; {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,237 INFO L290 TraceCheckUtils]: 17: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,237 INFO L290 TraceCheckUtils]: 16: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} assume ~id1~0 != ~id3~0; {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,238 INFO L290 TraceCheckUtils]: 15: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} assume ~id1~0 != ~id2~0; {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} assume 0 == ~mode3~0 % 256; {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} assume ~send3~0 == ~id3~0; {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} assume 0 == ~st3~0; {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,239 INFO L290 TraceCheckUtils]: 11: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} assume ~id3~0 >= 0; {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,239 INFO L290 TraceCheckUtils]: 10: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} assume 0 == ~mode2~0 % 256; {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} assume ~send2~0 == ~id2~0; {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} assume 0 == ~st2~0; {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} assume ~id2~0 >= 0; {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,240 INFO L290 TraceCheckUtils]: 6: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} assume 0 == ~mode1~0 % 256; {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} assume ~send1~0 == ~id1~0; {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,241 INFO L290 TraceCheckUtils]: 4: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} assume 0 == ~st1~0; {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,241 INFO L290 TraceCheckUtils]: 3: Hoare triple {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} assume ~id1~0 >= 0; {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {60114#true} assume 0 == ~r1~0 % 256; {60386#(not (<= 3 (mod (+ (mod ~r1~0 256) 1) 256)))} is VALID [2022-02-20 18:29:19,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {60114#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1, main_#t~ret21#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -128 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 127;~id1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~st1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~send1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~mode1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {60114#true} is VALID [2022-02-20 18:29:19,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {60114#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(34, 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; {60114#true} is VALID [2022-02-20 18:29:19,242 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 18:29:19,242 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133055597] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:29:19,242 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:29:19,242 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 4, 4] total 18 [2022-02-20 18:29:19,242 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721639874] [2022-02-20 18:29:19,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:29:19,243 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 10.11111111111111) internal successors, (182), 18 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 18:29:19,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:19,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 10.11111111111111) internal successors, (182), 18 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:19,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:19,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-20 18:29:19,361 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:19,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-20 18:29:19,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-02-20 18:29:19,362 INFO L87 Difference]: Start difference. First operand 2136 states and 2966 transitions. Second operand has 18 states, 18 states have (on average 10.11111111111111) internal successors, (182), 18 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)