./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.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-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.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 d33c1f18af8463c39a69fa160e98d9892e84f7d8b10911d6b0c55a462978880c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:50:26,779 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:50:26,781 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:50:26,812 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:50:26,813 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:50:26,815 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:50:26,816 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:50:26,817 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:50:26,819 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:50:26,823 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:50:26,824 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:50:26,825 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:50:26,825 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:50:26,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:50:26,828 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:50:26,831 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:50:26,832 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:50:26,832 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:50:26,834 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:50:26,837 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:50:26,838 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:50:26,839 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:50:26,840 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:50:26,841 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:50:26,846 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:50:26,847 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:50:26,847 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:50:26,848 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:50:26,848 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:50:26,849 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:50:26,849 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:50:26,850 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:50:26,851 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:50:26,852 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:50:26,852 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:50:26,853 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:50:26,853 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:50:26,853 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:50:26,853 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:50:26,854 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:50:26,854 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:50:26,855 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:50:26,876 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:50:26,877 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:50:26,877 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:50:26,877 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:50:26,877 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:50:26,877 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:50:26,878 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:50:26,878 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:50:26,878 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:50:26,878 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:50:26,878 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:50:26,878 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:50:26,879 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:50:26,879 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:50:26,879 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:50:26,879 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:50:26,879 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:50:26,879 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:50:26,879 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:50:26,880 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:50:26,880 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:50:26,880 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:50:26,880 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:50:26,880 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:50:26,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:50:26,881 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:50:26,881 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:50:26,882 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:50:26,882 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:50:26,882 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:50:26,882 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:50:26,882 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:50:26,883 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:50:26,883 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 -> d33c1f18af8463c39a69fa160e98d9892e84f7d8b10911d6b0c55a462978880c [2022-02-20 18:50:27,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:50:27,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:50:27,058 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:50:27,058 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:50:27,059 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:50:27,060 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:50:27,119 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52f93c7ee/5e11863da6434afe8a117e94a2ae27a7/FLAGeb2dc67d8 [2022-02-20 18:50:27,481 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:50:27,481 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:50:27,486 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52f93c7ee/5e11863da6434afe8a117e94a2ae27a7/FLAGeb2dc67d8 [2022-02-20 18:50:27,494 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52f93c7ee/5e11863da6434afe8a117e94a2ae27a7 [2022-02-20 18:50:27,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:50:27,496 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:50:27,499 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:50:27,499 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:50:27,501 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:50:27,502 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:50:27" (1/1) ... [2022-02-20 18:50:27,502 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6918863c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:27, skipping insertion in model container [2022-02-20 18:50:27,502 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:50:27" (1/1) ... [2022-02-20 18:50:27,506 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:50:27,526 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:50:27,655 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-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4107,4120] [2022-02-20 18:50:27,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:50:27,673 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:50:27,699 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-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4107,4120] [2022-02-20 18:50:27,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:50:27,725 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:50:27,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:27 WrapperNode [2022-02-20 18:50:27,725 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:50:27,726 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:50:27,726 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:50:27,730 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:50:27,735 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:50:27" (1/1) ... [2022-02-20 18:50:27,740 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:50:27" (1/1) ... [2022-02-20 18:50:27,761 INFO L137 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 267 [2022-02-20 18:50:27,764 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:50:27,765 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:50:27,765 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:50:27,765 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:50:27,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:27" (1/1) ... [2022-02-20 18:50:27,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:27" (1/1) ... [2022-02-20 18:50:27,772 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:27" (1/1) ... [2022-02-20 18:50:27,772 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:27" (1/1) ... [2022-02-20 18:50:27,776 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:27" (1/1) ... [2022-02-20 18:50:27,779 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:27" (1/1) ... [2022-02-20 18:50:27,780 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:27" (1/1) ... [2022-02-20 18:50:27,781 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:50:27,782 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:50:27,782 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:50:27,782 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:50:27,783 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:27" (1/1) ... [2022-02-20 18:50:27,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:50:27,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:50:27,812 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:50:27,814 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:50:27,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:50:27,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:50:27,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:50:27,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:50:27,898 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:50:27,899 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:50:28,176 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:50:28,181 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:50:28,181 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:50:28,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:50:28 BoogieIcfgContainer [2022-02-20 18:50:28,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:50:28,183 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:50:28,184 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:50:28,186 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:50:28,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:50:27" (1/3) ... [2022-02-20 18:50:28,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68db4be8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:50:28, skipping insertion in model container [2022-02-20 18:50:28,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:27" (2/3) ... [2022-02-20 18:50:28,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68db4be8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:50:28, skipping insertion in model container [2022-02-20 18:50:28,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:50:28" (3/3) ... [2022-02-20 18:50:28,188 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:50:28,191 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:50:28,192 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:50:28,219 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:50:28,224 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:50:28,224 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:50:28,235 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 62 states have (on average 1.6935483870967742) internal successors, (105), 63 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:28,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:50:28,239 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:28,240 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:28,240 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:28,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:28,244 INFO L85 PathProgramCache]: Analyzing trace with hash -976687966, now seen corresponding path program 1 times [2022-02-20 18:50:28,250 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:28,250 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952914279] [2022-02-20 18:50:28,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:28,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:28,502 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(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1394~0 := 0;~__return_1470~0 := 0; {67#true} is VALID [2022-02-20 18:50:28,502 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~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, 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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {67#true} is VALID [2022-02-20 18:50:28,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {67#true} assume 0 == ~r1~0 % 256; {67#true} is VALID [2022-02-20 18:50:28,503 INFO L290 TraceCheckUtils]: 3: Hoare triple {67#true} assume ~id1~0 >= 0; {67#true} is VALID [2022-02-20 18:50:28,503 INFO L290 TraceCheckUtils]: 4: Hoare triple {67#true} assume 0 == ~st1~0; {67#true} is VALID [2022-02-20 18:50:28,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {67#true} assume ~send1~0 == ~id1~0; {67#true} is VALID [2022-02-20 18:50:28,503 INFO L290 TraceCheckUtils]: 6: Hoare triple {67#true} assume 0 == ~mode1~0 % 256; {67#true} is VALID [2022-02-20 18:50:28,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {67#true} assume ~id2~0 >= 0; {67#true} is VALID [2022-02-20 18:50:28,504 INFO L290 TraceCheckUtils]: 8: Hoare triple {67#true} assume 0 == ~st2~0; {67#true} is VALID [2022-02-20 18:50:28,504 INFO L290 TraceCheckUtils]: 9: Hoare triple {67#true} assume ~send2~0 == ~id2~0; {67#true} is VALID [2022-02-20 18:50:28,505 INFO L290 TraceCheckUtils]: 10: Hoare triple {67#true} assume 0 == ~mode2~0 % 256; {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:28,506 INFO L290 TraceCheckUtils]: 11: Hoare triple {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:28,506 INFO L290 TraceCheckUtils]: 12: Hoare triple {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:28,507 INFO L290 TraceCheckUtils]: 13: Hoare triple {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:28,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:28,509 INFO L290 TraceCheckUtils]: 15: Hoare triple {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:28,518 INFO L290 TraceCheckUtils]: 16: Hoare triple {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:28,519 INFO L290 TraceCheckUtils]: 17: Hoare triple {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1394~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1394~0; {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:28,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != main_~main__i2~0#1;~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_~main__i2~0#1 := 0; {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:28,523 INFO L290 TraceCheckUtils]: 19: Hoare triple {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:28,525 INFO L290 TraceCheckUtils]: 20: Hoare triple {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:28,527 INFO L290 TraceCheckUtils]: 21: Hoare triple {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(~send1~0 != ~nomsg~0); {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:28,528 INFO L290 TraceCheckUtils]: 22: Hoare triple {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:28,528 INFO L290 TraceCheckUtils]: 23: Hoare triple {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:28,531 INFO L290 TraceCheckUtils]: 24: Hoare triple {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:28,538 INFO L290 TraceCheckUtils]: 25: Hoare triple {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {68#false} is VALID [2022-02-20 18:50:28,539 INFO L290 TraceCheckUtils]: 26: Hoare triple {68#false} assume !(main_~node2__m2~0#1 != ~nomsg~0); {68#false} is VALID [2022-02-20 18:50:28,539 INFO L290 TraceCheckUtils]: 27: Hoare triple {68#false} ~mode2~0 := 0; {68#false} is VALID [2022-02-20 18:50:28,539 INFO L290 TraceCheckUtils]: 28: Hoare triple {68#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {68#false} is VALID [2022-02-20 18:50:28,539 INFO L290 TraceCheckUtils]: 29: Hoare triple {68#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {68#false} is VALID [2022-02-20 18:50:28,540 INFO L290 TraceCheckUtils]: 30: Hoare triple {68#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {68#false} is VALID [2022-02-20 18:50:28,540 INFO L290 TraceCheckUtils]: 31: Hoare triple {68#false} ~mode3~0 := 0; {68#false} is VALID [2022-02-20 18:50:28,540 INFO L290 TraceCheckUtils]: 32: Hoare triple {68#false} ~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;havoc main_~check__tmp~0#1; {68#false} is VALID [2022-02-20 18:50:28,541 INFO L290 TraceCheckUtils]: 33: Hoare triple {68#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {68#false} is VALID [2022-02-20 18:50:28,541 INFO L290 TraceCheckUtils]: 34: Hoare triple {68#false} ~__return_1470~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1470~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {68#false} is VALID [2022-02-20 18:50:28,541 INFO L290 TraceCheckUtils]: 35: Hoare triple {68#false} assume 0 == main_~assert__arg~0#1 % 256; {68#false} is VALID [2022-02-20 18:50:28,542 INFO L290 TraceCheckUtils]: 36: Hoare triple {68#false} assume !false; {68#false} is VALID [2022-02-20 18:50:28,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:50:28,543 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:28,544 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952914279] [2022-02-20 18:50:28,544 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952914279] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:28,544 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:28,545 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:50:28,546 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183591922] [2022-02-20 18:50:28,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:28,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-02-20 18:50:28,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:28,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:28,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:28,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:50:28,600 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:28,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:50:28,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:50:28,619 INFO L87 Difference]: Start difference. First operand has 64 states, 62 states have (on average 1.6935483870967742) internal successors, (105), 63 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:28,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:28,846 INFO L93 Difference]: Finished difference Result 146 states and 230 transitions. [2022-02-20 18:50:28,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:50:28,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-02-20 18:50:28,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:28,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:28,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2022-02-20 18:50:28,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:28,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2022-02-20 18:50:28,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 230 transitions. [2022-02-20 18:50:29,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 230 edges. 230 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:29,040 INFO L225 Difference]: With dead ends: 146 [2022-02-20 18:50:29,041 INFO L226 Difference]: Without dead ends: 95 [2022-02-20 18:50:29,043 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:50:29,045 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 61 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:29,046 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 211 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:50:29,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-02-20 18:50:29,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2022-02-20 18:50:29,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:29,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 93 states, 92 states have (on average 1.4782608695652173) internal successors, (136), 92 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:29,080 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 93 states, 92 states have (on average 1.4782608695652173) internal successors, (136), 92 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:29,080 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 93 states, 92 states have (on average 1.4782608695652173) internal successors, (136), 92 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:29,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:29,084 INFO L93 Difference]: Finished difference Result 95 states and 137 transitions. [2022-02-20 18:50:29,084 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2022-02-20 18:50:29,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:29,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:29,085 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 92 states have (on average 1.4782608695652173) internal successors, (136), 92 states have internal predecessors, (136), 0 states have call successors, (0), 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 95 states. [2022-02-20 18:50:29,086 INFO L87 Difference]: Start difference. First operand has 93 states, 92 states have (on average 1.4782608695652173) internal successors, (136), 92 states have internal predecessors, (136), 0 states have call successors, (0), 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 95 states. [2022-02-20 18:50:29,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:29,089 INFO L93 Difference]: Finished difference Result 95 states and 137 transitions. [2022-02-20 18:50:29,089 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2022-02-20 18:50:29,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:29,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:29,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:29,090 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:29,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.4782608695652173) internal successors, (136), 92 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:29,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 136 transitions. [2022-02-20 18:50:29,094 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 136 transitions. Word has length 37 [2022-02-20 18:50:29,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:29,094 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 136 transitions. [2022-02-20 18:50:29,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:29,094 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 136 transitions. [2022-02-20 18:50:29,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 18:50:29,095 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:29,095 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] [2022-02-20 18:50:29,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:50:29,096 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:29,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:29,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1572742836, now seen corresponding path program 1 times [2022-02-20 18:50:29,097 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:29,097 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565430272] [2022-02-20 18:50:29,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:29,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:29,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:29,170 INFO L290 TraceCheckUtils]: 0: Hoare triple {578#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(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1394~0 := 0;~__return_1470~0 := 0; {578#true} is VALID [2022-02-20 18:50:29,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {578#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, 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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {578#true} is VALID [2022-02-20 18:50:29,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {578#true} assume 0 == ~r1~0 % 256; {578#true} is VALID [2022-02-20 18:50:29,171 INFO L290 TraceCheckUtils]: 3: Hoare triple {578#true} assume ~id1~0 >= 0; {578#true} is VALID [2022-02-20 18:50:29,171 INFO L290 TraceCheckUtils]: 4: Hoare triple {578#true} assume 0 == ~st1~0; {578#true} is VALID [2022-02-20 18:50:29,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {578#true} assume ~send1~0 == ~id1~0; {578#true} is VALID [2022-02-20 18:50:29,172 INFO L290 TraceCheckUtils]: 6: Hoare triple {578#true} assume 0 == ~mode1~0 % 256; {578#true} is VALID [2022-02-20 18:50:29,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {578#true} assume ~id2~0 >= 0; {578#true} is VALID [2022-02-20 18:50:29,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {578#true} assume 0 == ~st2~0; {578#true} is VALID [2022-02-20 18:50:29,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {578#true} assume ~send2~0 == ~id2~0; {578#true} is VALID [2022-02-20 18:50:29,173 INFO L290 TraceCheckUtils]: 10: Hoare triple {578#true} assume 0 == ~mode2~0 % 256; {578#true} is VALID [2022-02-20 18:50:29,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {578#true} assume ~id3~0 >= 0; {578#true} is VALID [2022-02-20 18:50:29,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {578#true} assume 0 == ~st3~0; {578#true} is VALID [2022-02-20 18:50:29,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {578#true} assume ~send3~0 == ~id3~0; {578#true} is VALID [2022-02-20 18:50:29,174 INFO L290 TraceCheckUtils]: 14: Hoare triple {578#true} assume 0 == ~mode3~0 % 256; {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:29,174 INFO L290 TraceCheckUtils]: 15: Hoare triple {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:29,175 INFO L290 TraceCheckUtils]: 16: Hoare triple {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:29,175 INFO L290 TraceCheckUtils]: 17: Hoare triple {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1394~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1394~0; {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:29,176 INFO L290 TraceCheckUtils]: 18: Hoare triple {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != main_~main__i2~0#1;~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_~main__i2~0#1 := 0; {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:29,176 INFO L290 TraceCheckUtils]: 19: Hoare triple {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:29,177 INFO L290 TraceCheckUtils]: 20: Hoare triple {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:29,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send1~0 != ~nomsg~0); {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:29,178 INFO L290 TraceCheckUtils]: 22: Hoare triple {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:29,178 INFO L290 TraceCheckUtils]: 23: Hoare triple {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:29,178 INFO L290 TraceCheckUtils]: 24: Hoare triple {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:29,179 INFO L290 TraceCheckUtils]: 25: Hoare triple {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:29,179 INFO L290 TraceCheckUtils]: 26: Hoare triple {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send2~0 != ~nomsg~0); {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:29,180 INFO L290 TraceCheckUtils]: 27: Hoare triple {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:29,180 INFO L290 TraceCheckUtils]: 28: Hoare triple {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:29,181 INFO L290 TraceCheckUtils]: 29: Hoare triple {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:29,181 INFO L290 TraceCheckUtils]: 30: Hoare triple {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {579#false} is VALID [2022-02-20 18:50:29,182 INFO L290 TraceCheckUtils]: 31: Hoare triple {579#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {579#false} is VALID [2022-02-20 18:50:29,182 INFO L290 TraceCheckUtils]: 32: Hoare triple {579#false} ~mode3~0 := 0; {579#false} is VALID [2022-02-20 18:50:29,182 INFO L290 TraceCheckUtils]: 33: Hoare triple {579#false} ~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;havoc main_~check__tmp~0#1; {579#false} is VALID [2022-02-20 18:50:29,182 INFO L290 TraceCheckUtils]: 34: Hoare triple {579#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {579#false} is VALID [2022-02-20 18:50:29,182 INFO L290 TraceCheckUtils]: 35: Hoare triple {579#false} ~__return_1470~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1470~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {579#false} is VALID [2022-02-20 18:50:29,183 INFO L290 TraceCheckUtils]: 36: Hoare triple {579#false} assume 0 == main_~assert__arg~0#1 % 256; {579#false} is VALID [2022-02-20 18:50:29,183 INFO L290 TraceCheckUtils]: 37: Hoare triple {579#false} assume !false; {579#false} is VALID [2022-02-20 18:50:29,183 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:50:29,183 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:29,184 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565430272] [2022-02-20 18:50:29,184 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565430272] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:29,184 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:29,184 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:50:29,184 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411769389] [2022-02-20 18:50:29,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:29,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2022-02-20 18:50:29,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:29,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:29,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:29,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:50:29,211 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:29,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:50:29,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:50:29,212 INFO L87 Difference]: Start difference. First operand 93 states and 136 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:29,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:29,351 INFO L93 Difference]: Finished difference Result 225 states and 344 transitions. [2022-02-20 18:50:29,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:50:29,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2022-02-20 18:50:29,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:29,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:29,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2022-02-20 18:50:29,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:29,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2022-02-20 18:50:29,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 204 transitions. [2022-02-20 18:50:29,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:29,518 INFO L225 Difference]: With dead ends: 225 [2022-02-20 18:50:29,518 INFO L226 Difference]: Without dead ends: 151 [2022-02-20 18:50:29,518 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:50:29,519 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 46 mSDsluCounter, 69 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:50:29,520 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:50:29,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-02-20 18:50:29,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2022-02-20 18:50:29,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:29,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand has 149 states, 148 states have (on average 1.5135135135135136) internal successors, (224), 148 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:29,529 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand has 149 states, 148 states have (on average 1.5135135135135136) internal successors, (224), 148 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:29,530 INFO L87 Difference]: Start difference. First operand 151 states. Second operand has 149 states, 148 states have (on average 1.5135135135135136) internal successors, (224), 148 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:29,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:29,533 INFO L93 Difference]: Finished difference Result 151 states and 225 transitions. [2022-02-20 18:50:29,533 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 225 transitions. [2022-02-20 18:50:29,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:29,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:29,535 INFO L74 IsIncluded]: Start isIncluded. First operand has 149 states, 148 states have (on average 1.5135135135135136) internal successors, (224), 148 states have internal predecessors, (224), 0 states have call successors, (0), 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 151 states. [2022-02-20 18:50:29,535 INFO L87 Difference]: Start difference. First operand has 149 states, 148 states have (on average 1.5135135135135136) internal successors, (224), 148 states have internal predecessors, (224), 0 states have call successors, (0), 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 151 states. [2022-02-20 18:50:29,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:29,539 INFO L93 Difference]: Finished difference Result 151 states and 225 transitions. [2022-02-20 18:50:29,539 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 225 transitions. [2022-02-20 18:50:29,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:29,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:29,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:29,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:29,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 1.5135135135135136) internal successors, (224), 148 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:29,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 224 transitions. [2022-02-20 18:50:29,544 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 224 transitions. Word has length 38 [2022-02-20 18:50:29,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:29,544 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 224 transitions. [2022-02-20 18:50:29,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:29,544 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 224 transitions. [2022-02-20 18:50:29,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 18:50:29,545 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:29,545 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] [2022-02-20 18:50:29,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:50:29,546 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:29,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:29,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1624580866, now seen corresponding path program 1 times [2022-02-20 18:50:29,546 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:29,547 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520619599] [2022-02-20 18:50:29,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:29,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:29,604 INFO L290 TraceCheckUtils]: 0: Hoare triple {1392#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(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1394~0 := 0;~__return_1470~0 := 0; {1392#true} is VALID [2022-02-20 18:50:29,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {1392#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, 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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {1392#true} is VALID [2022-02-20 18:50:29,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {1392#true} assume 0 == ~r1~0 % 256; {1392#true} is VALID [2022-02-20 18:50:29,605 INFO L290 TraceCheckUtils]: 3: Hoare triple {1392#true} assume ~id1~0 >= 0; {1392#true} is VALID [2022-02-20 18:50:29,606 INFO L290 TraceCheckUtils]: 4: Hoare triple {1392#true} assume 0 == ~st1~0; {1394#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:29,606 INFO L290 TraceCheckUtils]: 5: Hoare triple {1394#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {1394#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:29,606 INFO L290 TraceCheckUtils]: 6: Hoare triple {1394#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {1394#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:29,607 INFO L290 TraceCheckUtils]: 7: Hoare triple {1394#(<= ~st1~0 0)} assume ~id2~0 >= 0; {1394#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:29,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {1394#(<= ~st1~0 0)} assume 0 == ~st2~0; {1395#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:29,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {1395#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {1395#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:29,608 INFO L290 TraceCheckUtils]: 10: Hoare triple {1395#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {1395#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:29,608 INFO L290 TraceCheckUtils]: 11: Hoare triple {1395#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {1395#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:29,608 INFO L290 TraceCheckUtils]: 12: Hoare triple {1395#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:29,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:29,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:29,609 INFO L290 TraceCheckUtils]: 15: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:29,610 INFO L290 TraceCheckUtils]: 16: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:29,610 INFO L290 TraceCheckUtils]: 17: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1394~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1394~0; {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:29,610 INFO L290 TraceCheckUtils]: 18: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~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_~main__i2~0#1 := 0; {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:29,611 INFO L290 TraceCheckUtils]: 19: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:29,611 INFO L290 TraceCheckUtils]: 20: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:29,611 INFO L290 TraceCheckUtils]: 21: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0); {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:29,612 INFO L290 TraceCheckUtils]: 22: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:29,612 INFO L290 TraceCheckUtils]: 23: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:29,612 INFO L290 TraceCheckUtils]: 24: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:29,613 INFO L290 TraceCheckUtils]: 25: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:29,613 INFO L290 TraceCheckUtils]: 26: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0); {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:29,613 INFO L290 TraceCheckUtils]: 27: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:29,614 INFO L290 TraceCheckUtils]: 28: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:29,614 INFO L290 TraceCheckUtils]: 29: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:29,614 INFO L290 TraceCheckUtils]: 30: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:29,615 INFO L290 TraceCheckUtils]: 31: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0; {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:29,615 INFO L290 TraceCheckUtils]: 32: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:29,615 INFO L290 TraceCheckUtils]: 33: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:29,616 INFO L290 TraceCheckUtils]: 34: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~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;havoc main_~check__tmp~0#1; {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:29,616 INFO L290 TraceCheckUtils]: 35: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {1393#false} is VALID [2022-02-20 18:50:29,617 INFO L290 TraceCheckUtils]: 36: Hoare triple {1393#false} ~__return_1470~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1470~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {1393#false} is VALID [2022-02-20 18:50:29,617 INFO L290 TraceCheckUtils]: 37: Hoare triple {1393#false} assume 0 == main_~assert__arg~0#1 % 256; {1393#false} is VALID [2022-02-20 18:50:29,617 INFO L290 TraceCheckUtils]: 38: Hoare triple {1393#false} assume !false; {1393#false} is VALID [2022-02-20 18:50:29,617 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:50:29,617 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:29,618 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520619599] [2022-02-20 18:50:29,618 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520619599] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:29,618 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:29,618 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:50:29,618 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069420019] [2022-02-20 18:50:29,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:29,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2022-02-20 18:50:29,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:29,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:29,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:29,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:29,641 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:29,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:29,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:29,642 INFO L87 Difference]: Start difference. First operand 149 states and 224 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:30,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:30,352 INFO L93 Difference]: Finished difference Result 929 states and 1454 transitions. [2022-02-20 18:50:30,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:50:30,352 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2022-02-20 18:50:30,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:30,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:30,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 481 transitions. [2022-02-20 18:50:30,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:30,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 481 transitions. [2022-02-20 18:50:30,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 481 transitions. [2022-02-20 18:50:30,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 481 edges. 481 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:30,676 INFO L225 Difference]: With dead ends: 929 [2022-02-20 18:50:30,676 INFO L226 Difference]: Without dead ends: 799 [2022-02-20 18:50:30,677 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:50:30,678 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 410 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 575 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:50:30,678 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [410 Valid, 575 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:50:30,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2022-02-20 18:50:30,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 277. [2022-02-20 18:50:30,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:30,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 799 states. Second operand has 277 states, 276 states have (on average 1.5217391304347827) internal successors, (420), 276 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:30,790 INFO L74 IsIncluded]: Start isIncluded. First operand 799 states. Second operand has 277 states, 276 states have (on average 1.5217391304347827) internal successors, (420), 276 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:30,791 INFO L87 Difference]: Start difference. First operand 799 states. Second operand has 277 states, 276 states have (on average 1.5217391304347827) internal successors, (420), 276 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:30,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:30,818 INFO L93 Difference]: Finished difference Result 799 states and 1225 transitions. [2022-02-20 18:50:30,818 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1225 transitions. [2022-02-20 18:50:30,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:30,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:30,820 INFO L74 IsIncluded]: Start isIncluded. First operand has 277 states, 276 states have (on average 1.5217391304347827) internal successors, (420), 276 states have internal predecessors, (420), 0 states have call successors, (0), 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 799 states. [2022-02-20 18:50:30,821 INFO L87 Difference]: Start difference. First operand has 277 states, 276 states have (on average 1.5217391304347827) internal successors, (420), 276 states have internal predecessors, (420), 0 states have call successors, (0), 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 799 states. [2022-02-20 18:50:30,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:30,850 INFO L93 Difference]: Finished difference Result 799 states and 1225 transitions. [2022-02-20 18:50:30,850 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1225 transitions. [2022-02-20 18:50:30,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:30,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:30,851 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:30,851 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:30,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.5217391304347827) internal successors, (420), 276 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:30,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 420 transitions. [2022-02-20 18:50:30,858 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 420 transitions. Word has length 39 [2022-02-20 18:50:30,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:30,858 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 420 transitions. [2022-02-20 18:50:30,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:30,859 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 420 transitions. [2022-02-20 18:50:30,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 18:50:30,859 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:30,860 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:30,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:50:30,860 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:30,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:30,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1224060410, now seen corresponding path program 1 times [2022-02-20 18:50:30,861 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:30,861 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711728645] [2022-02-20 18:50:30,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:30,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:30,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:30,929 INFO L290 TraceCheckUtils]: 0: Hoare triple {4678#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(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1394~0 := 0;~__return_1470~0 := 0; {4678#true} is VALID [2022-02-20 18:50:30,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {4678#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, 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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {4678#true} is VALID [2022-02-20 18:50:30,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {4678#true} assume 0 == ~r1~0 % 256; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:30,931 INFO L290 TraceCheckUtils]: 3: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 >= 0; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:30,931 INFO L290 TraceCheckUtils]: 4: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:30,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 == ~id1~0; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:30,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:30,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 >= 0; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:30,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:30,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 == ~id2~0; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:30,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:30,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 >= 0; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:30,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:30,944 INFO L290 TraceCheckUtils]: 13: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 == ~id3~0; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:30,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:30,947 INFO L290 TraceCheckUtils]: 15: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id2~0; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:30,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id3~0; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:30,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1394~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1394~0; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:30,948 INFO L290 TraceCheckUtils]: 18: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != main_~main__i2~0#1;~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_~main__i2~0#1 := 0; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:30,949 INFO L290 TraceCheckUtils]: 19: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:30,949 INFO L290 TraceCheckUtils]: 20: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:30,949 INFO L290 TraceCheckUtils]: 21: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~send1~0 != ~nomsg~0); {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:30,950 INFO L290 TraceCheckUtils]: 22: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:30,950 INFO L290 TraceCheckUtils]: 23: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:30,950 INFO L290 TraceCheckUtils]: 24: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:30,951 INFO L290 TraceCheckUtils]: 25: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:30,951 INFO L290 TraceCheckUtils]: 26: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~send2~0 != ~nomsg~0); {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:30,951 INFO L290 TraceCheckUtils]: 27: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:30,952 INFO L290 TraceCheckUtils]: 28: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:30,952 INFO L290 TraceCheckUtils]: 29: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:30,952 INFO L290 TraceCheckUtils]: 30: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:30,953 INFO L290 TraceCheckUtils]: 31: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 != ~nomsg~0; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:30,953 INFO L290 TraceCheckUtils]: 32: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:30,953 INFO L290 TraceCheckUtils]: 33: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:30,953 INFO L290 TraceCheckUtils]: 34: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~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;havoc main_~check__tmp~0#1; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:30,954 INFO L290 TraceCheckUtils]: 35: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:30,954 INFO L290 TraceCheckUtils]: 36: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~r1~0 % 256 >= 3; {4679#false} is VALID [2022-02-20 18:50:30,954 INFO L290 TraceCheckUtils]: 37: Hoare triple {4679#false} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1; {4679#false} is VALID [2022-02-20 18:50:30,955 INFO L290 TraceCheckUtils]: 38: Hoare triple {4679#false} ~__return_1470~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1470~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {4679#false} is VALID [2022-02-20 18:50:30,955 INFO L290 TraceCheckUtils]: 39: Hoare triple {4679#false} assume 0 == main_~assert__arg~0#1 % 256; {4679#false} is VALID [2022-02-20 18:50:30,955 INFO L290 TraceCheckUtils]: 40: Hoare triple {4679#false} assume !false; {4679#false} is VALID [2022-02-20 18:50:30,955 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:50:30,955 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:30,956 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711728645] [2022-02-20 18:50:30,956 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711728645] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:30,956 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:30,956 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:50:30,956 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090628647] [2022-02-20 18:50:30,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:30,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 18:50:30,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:30,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:30,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:30,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:50:30,980 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:30,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:50:30,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:50:30,981 INFO L87 Difference]: Start difference. First operand 277 states and 420 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:31,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:31,383 INFO L93 Difference]: Finished difference Result 749 states and 1146 transitions. [2022-02-20 18:50:31,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:50:31,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 18:50:31,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:31,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:31,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 208 transitions. [2022-02-20 18:50:31,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:31,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 208 transitions. [2022-02-20 18:50:31,387 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 208 transitions. [2022-02-20 18:50:31,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:31,518 INFO L225 Difference]: With dead ends: 749 [2022-02-20 18:50:31,518 INFO L226 Difference]: Without dead ends: 491 [2022-02-20 18:50:31,521 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:50:31,528 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 36 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 141 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:50:31,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 141 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:50:31,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2022-02-20 18:50:31,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 481. [2022-02-20 18:50:31,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:31,757 INFO L82 GeneralOperation]: Start isEquivalent. First operand 491 states. Second operand has 481 states, 480 states have (on average 1.4916666666666667) internal successors, (716), 480 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:31,758 INFO L74 IsIncluded]: Start isIncluded. First operand 491 states. Second operand has 481 states, 480 states have (on average 1.4916666666666667) internal successors, (716), 480 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:31,759 INFO L87 Difference]: Start difference. First operand 491 states. Second operand has 481 states, 480 states have (on average 1.4916666666666667) internal successors, (716), 480 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:31,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:31,769 INFO L93 Difference]: Finished difference Result 491 states and 725 transitions. [2022-02-20 18:50:31,769 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 725 transitions. [2022-02-20 18:50:31,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:31,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:31,771 INFO L74 IsIncluded]: Start isIncluded. First operand has 481 states, 480 states have (on average 1.4916666666666667) internal successors, (716), 480 states have internal predecessors, (716), 0 states have call successors, (0), 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 491 states. [2022-02-20 18:50:31,772 INFO L87 Difference]: Start difference. First operand has 481 states, 480 states have (on average 1.4916666666666667) internal successors, (716), 480 states have internal predecessors, (716), 0 states have call successors, (0), 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 491 states. [2022-02-20 18:50:31,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:31,782 INFO L93 Difference]: Finished difference Result 491 states and 725 transitions. [2022-02-20 18:50:31,783 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 725 transitions. [2022-02-20 18:50:31,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:31,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:31,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:31,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:31,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 480 states have (on average 1.4916666666666667) internal successors, (716), 480 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:31,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 716 transitions. [2022-02-20 18:50:31,796 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 716 transitions. Word has length 41 [2022-02-20 18:50:31,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:31,797 INFO L470 AbstractCegarLoop]: Abstraction has 481 states and 716 transitions. [2022-02-20 18:50:31,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:31,797 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 716 transitions. [2022-02-20 18:50:31,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 18:50:31,798 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:31,798 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:31,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:50:31,798 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:31,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:31,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1245063065, now seen corresponding path program 1 times [2022-02-20 18:50:31,799 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:31,799 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511874091] [2022-02-20 18:50:31,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:31,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:31,934 INFO L290 TraceCheckUtils]: 0: Hoare triple {7383#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(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1394~0 := 0;~__return_1470~0 := 0; {7383#true} is VALID [2022-02-20 18:50:31,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {7383#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, 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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {7383#true} is VALID [2022-02-20 18:50:31,935 INFO L290 TraceCheckUtils]: 2: Hoare triple {7383#true} assume 0 == ~r1~0 % 256; {7383#true} is VALID [2022-02-20 18:50:31,935 INFO L290 TraceCheckUtils]: 3: Hoare triple {7383#true} assume ~id1~0 >= 0; {7383#true} is VALID [2022-02-20 18:50:31,935 INFO L290 TraceCheckUtils]: 4: Hoare triple {7383#true} assume 0 == ~st1~0; {7385#(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:50:31,936 INFO L290 TraceCheckUtils]: 5: Hoare triple {7385#(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; {7385#(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:50:31,936 INFO L290 TraceCheckUtils]: 6: Hoare triple {7385#(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; {7385#(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:50:31,937 INFO L290 TraceCheckUtils]: 7: Hoare triple {7385#(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; {7385#(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:50:31,937 INFO L290 TraceCheckUtils]: 8: Hoare triple {7385#(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; {7386#(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:50:31,938 INFO L290 TraceCheckUtils]: 9: Hoare triple {7386#(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; {7386#(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:50:31,938 INFO L290 TraceCheckUtils]: 10: Hoare triple {7386#(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; {7386#(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:50:31,938 INFO L290 TraceCheckUtils]: 11: Hoare triple {7386#(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; {7386#(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:50:31,939 INFO L290 TraceCheckUtils]: 12: Hoare triple {7386#(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; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:31,939 INFO L290 TraceCheckUtils]: 13: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send3~0 == ~id3~0; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:31,940 INFO L290 TraceCheckUtils]: 14: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume 0 == ~mode3~0 % 256; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:31,940 INFO L290 TraceCheckUtils]: 15: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id2~0; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:31,940 INFO L290 TraceCheckUtils]: 16: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id3~0; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:31,941 INFO L290 TraceCheckUtils]: 17: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1394~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1394~0; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:31,941 INFO L290 TraceCheckUtils]: 18: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume 0 != main_~main__i2~0#1;~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_~main__i2~0#1 := 0; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:31,942 INFO L290 TraceCheckUtils]: 19: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:31,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:31,945 INFO L290 TraceCheckUtils]: 21: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~send1~0 != ~nomsg~0); {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:31,945 INFO L290 TraceCheckUtils]: 22: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:31,946 INFO L290 TraceCheckUtils]: 23: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:31,946 INFO L290 TraceCheckUtils]: 24: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:31,947 INFO L290 TraceCheckUtils]: 25: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:31,947 INFO L290 TraceCheckUtils]: 26: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~send2~0 != ~nomsg~0); {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:31,947 INFO L290 TraceCheckUtils]: 27: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:31,951 INFO L290 TraceCheckUtils]: 28: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:31,952 INFO L290 TraceCheckUtils]: 29: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:31,953 INFO L290 TraceCheckUtils]: 30: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:31,954 INFO L290 TraceCheckUtils]: 31: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send3~0 != ~nomsg~0; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:31,954 INFO L290 TraceCheckUtils]: 32: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:31,955 INFO L290 TraceCheckUtils]: 33: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:31,955 INFO L290 TraceCheckUtils]: 34: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} ~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;havoc main_~check__tmp~0#1; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:31,956 INFO L290 TraceCheckUtils]: 35: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:31,956 INFO L290 TraceCheckUtils]: 36: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~r1~0 % 256 >= 3); {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:31,956 INFO L290 TraceCheckUtils]: 37: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~0#1 := 0; {7384#false} is VALID [2022-02-20 18:50:31,957 INFO L290 TraceCheckUtils]: 38: Hoare triple {7384#false} ~__return_1470~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1470~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {7384#false} is VALID [2022-02-20 18:50:31,957 INFO L290 TraceCheckUtils]: 39: Hoare triple {7384#false} assume 0 == main_~assert__arg~0#1 % 256; {7384#false} is VALID [2022-02-20 18:50:31,957 INFO L290 TraceCheckUtils]: 40: Hoare triple {7384#false} assume !false; {7384#false} is VALID [2022-02-20 18:50:31,957 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:50:31,958 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:31,958 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511874091] [2022-02-20 18:50:31,958 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511874091] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:31,958 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:31,958 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:50:31,958 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367794608] [2022-02-20 18:50:31,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:31,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 18:50:31,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:31,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:31,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:31,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:31,985 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:31,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:31,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:31,986 INFO L87 Difference]: Start difference. First operand 481 states and 716 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:32,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:32,537 INFO L93 Difference]: Finished difference Result 945 states and 1414 transitions. [2022-02-20 18:50:32,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:32,537 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 18:50:32,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:32,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:32,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 215 transitions. [2022-02-20 18:50:32,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:32,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 215 transitions. [2022-02-20 18:50:32,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 215 transitions. [2022-02-20 18:50:32,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 215 edges. 215 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:32,669 INFO L225 Difference]: With dead ends: 945 [2022-02-20 18:50:32,669 INFO L226 Difference]: Without dead ends: 483 [2022-02-20 18:50:32,670 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:50:32,670 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 180 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:32,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 204 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:50:32,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2022-02-20 18:50:32,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 481. [2022-02-20 18:50:32,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:32,927 INFO L82 GeneralOperation]: Start isEquivalent. First operand 483 states. Second operand has 481 states, 480 states have (on average 1.475) internal successors, (708), 480 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:32,928 INFO L74 IsIncluded]: Start isIncluded. First operand 483 states. Second operand has 481 states, 480 states have (on average 1.475) internal successors, (708), 480 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:32,929 INFO L87 Difference]: Start difference. First operand 483 states. Second operand has 481 states, 480 states have (on average 1.475) internal successors, (708), 480 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:32,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:32,938 INFO L93 Difference]: Finished difference Result 483 states and 709 transitions. [2022-02-20 18:50:32,938 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 709 transitions. [2022-02-20 18:50:32,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:32,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:32,939 INFO L74 IsIncluded]: Start isIncluded. First operand has 481 states, 480 states have (on average 1.475) internal successors, (708), 480 states have internal predecessors, (708), 0 states have call successors, (0), 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 483 states. [2022-02-20 18:50:32,940 INFO L87 Difference]: Start difference. First operand has 481 states, 480 states have (on average 1.475) internal successors, (708), 480 states have internal predecessors, (708), 0 states have call successors, (0), 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 483 states. [2022-02-20 18:50:32,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:32,950 INFO L93 Difference]: Finished difference Result 483 states and 709 transitions. [2022-02-20 18:50:32,950 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 709 transitions. [2022-02-20 18:50:32,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:32,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:32,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:32,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:32,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 480 states have (on average 1.475) internal successors, (708), 480 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:32,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 708 transitions. [2022-02-20 18:50:32,962 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 708 transitions. Word has length 41 [2022-02-20 18:50:32,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:32,962 INFO L470 AbstractCegarLoop]: Abstraction has 481 states and 708 transitions. [2022-02-20 18:50:32,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:32,962 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 708 transitions. [2022-02-20 18:50:32,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 18:50:32,963 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:32,963 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:32,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:50:32,963 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:32,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:32,964 INFO L85 PathProgramCache]: Analyzing trace with hash -59660072, now seen corresponding path program 1 times [2022-02-20 18:50:32,964 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:32,964 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115705201] [2022-02-20 18:50:32,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:32,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:33,009 INFO L290 TraceCheckUtils]: 0: Hoare triple {10348#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(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1394~0 := 0;~__return_1470~0 := 0; {10350#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:33,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {10350#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, 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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {10350#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:33,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {10350#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {10350#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:33,010 INFO L290 TraceCheckUtils]: 3: Hoare triple {10350#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {10351#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:50:33,010 INFO L290 TraceCheckUtils]: 4: Hoare triple {10351#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {10351#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:50:33,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {10351#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {10352#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:33,011 INFO L290 TraceCheckUtils]: 6: Hoare triple {10352#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {10352#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:33,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {10352#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {10352#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:33,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {10352#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {10352#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:33,012 INFO L290 TraceCheckUtils]: 9: Hoare triple {10352#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {10352#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:33,012 INFO L290 TraceCheckUtils]: 10: Hoare triple {10352#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {10352#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:33,013 INFO L290 TraceCheckUtils]: 11: Hoare triple {10352#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {10352#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:33,013 INFO L290 TraceCheckUtils]: 12: Hoare triple {10352#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {10352#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:33,013 INFO L290 TraceCheckUtils]: 13: Hoare triple {10352#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {10352#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:33,013 INFO L290 TraceCheckUtils]: 14: Hoare triple {10352#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {10352#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:33,014 INFO L290 TraceCheckUtils]: 15: Hoare triple {10352#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {10352#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:33,014 INFO L290 TraceCheckUtils]: 16: Hoare triple {10352#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {10352#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:33,014 INFO L290 TraceCheckUtils]: 17: Hoare triple {10352#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1394~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1394~0; {10352#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:33,015 INFO L290 TraceCheckUtils]: 18: Hoare triple {10352#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 != main_~main__i2~0#1;~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_~main__i2~0#1 := 0; {10352#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:33,015 INFO L290 TraceCheckUtils]: 19: Hoare triple {10352#(<= (+ ~nomsg~0 1) ~send1~0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {10352#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:33,015 INFO L290 TraceCheckUtils]: 20: Hoare triple {10352#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {10352#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:33,015 INFO L290 TraceCheckUtils]: 21: Hoare triple {10352#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(~send1~0 != ~nomsg~0); {10349#false} is VALID [2022-02-20 18:50:33,016 INFO L290 TraceCheckUtils]: 22: Hoare triple {10349#false} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {10349#false} is VALID [2022-02-20 18:50:33,016 INFO L290 TraceCheckUtils]: 23: Hoare triple {10349#false} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {10349#false} is VALID [2022-02-20 18:50:33,016 INFO L290 TraceCheckUtils]: 24: Hoare triple {10349#false} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {10349#false} is VALID [2022-02-20 18:50:33,016 INFO L290 TraceCheckUtils]: 25: Hoare triple {10349#false} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {10349#false} is VALID [2022-02-20 18:50:33,016 INFO L290 TraceCheckUtils]: 26: Hoare triple {10349#false} assume !(~send2~0 != ~nomsg~0); {10349#false} is VALID [2022-02-20 18:50:33,016 INFO L290 TraceCheckUtils]: 27: Hoare triple {10349#false} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {10349#false} is VALID [2022-02-20 18:50:33,016 INFO L290 TraceCheckUtils]: 28: Hoare triple {10349#false} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {10349#false} is VALID [2022-02-20 18:50:33,017 INFO L290 TraceCheckUtils]: 29: Hoare triple {10349#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {10349#false} is VALID [2022-02-20 18:50:33,017 INFO L290 TraceCheckUtils]: 30: Hoare triple {10349#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {10349#false} is VALID [2022-02-20 18:50:33,017 INFO L290 TraceCheckUtils]: 31: Hoare triple {10349#false} assume ~send3~0 != ~nomsg~0; {10349#false} is VALID [2022-02-20 18:50:33,017 INFO L290 TraceCheckUtils]: 32: Hoare triple {10349#false} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {10349#false} is VALID [2022-02-20 18:50:33,017 INFO L290 TraceCheckUtils]: 33: Hoare triple {10349#false} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {10349#false} is VALID [2022-02-20 18:50:33,017 INFO L290 TraceCheckUtils]: 34: Hoare triple {10349#false} ~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;havoc main_~check__tmp~0#1; {10349#false} is VALID [2022-02-20 18:50:33,017 INFO L290 TraceCheckUtils]: 35: Hoare triple {10349#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {10349#false} is VALID [2022-02-20 18:50:33,018 INFO L290 TraceCheckUtils]: 36: Hoare triple {10349#false} assume !(~r1~0 % 256 >= 3); {10349#false} is VALID [2022-02-20 18:50:33,018 INFO L290 TraceCheckUtils]: 37: Hoare triple {10349#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {10349#false} is VALID [2022-02-20 18:50:33,018 INFO L290 TraceCheckUtils]: 38: Hoare triple {10349#false} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1; {10349#false} is VALID [2022-02-20 18:50:33,018 INFO L290 TraceCheckUtils]: 39: Hoare triple {10349#false} ~__return_1470~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1470~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {10349#false} is VALID [2022-02-20 18:50:33,018 INFO L290 TraceCheckUtils]: 40: Hoare triple {10349#false} assume 0 == main_~assert__arg~0#1 % 256; {10349#false} is VALID [2022-02-20 18:50:33,018 INFO L290 TraceCheckUtils]: 41: Hoare triple {10349#false} assume !false; {10349#false} is VALID [2022-02-20 18:50:33,018 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:50:33,019 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:33,019 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115705201] [2022-02-20 18:50:33,019 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115705201] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:33,019 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:33,019 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:50:33,019 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103400365] [2022-02-20 18:50:33,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:33,020 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 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:50:33,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:33,020 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), 4 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:50:33,042 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:50:33,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:33,042 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:33,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:33,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:33,043 INFO L87 Difference]: Start difference. First operand 481 states and 708 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 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:50:34,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:34,009 INFO L93 Difference]: Finished difference Result 1201 states and 1794 transitions. [2022-02-20 18:50:34,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:34,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 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:50:34,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:34,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 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:50:34,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 217 transitions. [2022-02-20 18:50:34,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 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:50:34,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 217 transitions. [2022-02-20 18:50:34,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 217 transitions. [2022-02-20 18:50:34,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 217 edges. 217 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:34,176 INFO L225 Difference]: With dead ends: 1201 [2022-02-20 18:50:34,177 INFO L226 Difference]: Without dead ends: 739 [2022-02-20 18:50:34,177 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:50:34,178 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 349 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:34,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [349 Valid, 93 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:50:34,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2022-02-20 18:50:34,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 737. [2022-02-20 18:50:34,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:34,911 INFO L82 GeneralOperation]: Start isEquivalent. First operand 739 states. Second operand has 737 states, 736 states have (on average 1.4782608695652173) internal successors, (1088), 736 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:34,912 INFO L74 IsIncluded]: Start isIncluded. First operand 739 states. Second operand has 737 states, 736 states have (on average 1.4782608695652173) internal successors, (1088), 736 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:34,913 INFO L87 Difference]: Start difference. First operand 739 states. Second operand has 737 states, 736 states have (on average 1.4782608695652173) internal successors, (1088), 736 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:34,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:34,930 INFO L93 Difference]: Finished difference Result 739 states and 1089 transitions. [2022-02-20 18:50:34,931 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1089 transitions. [2022-02-20 18:50:34,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:34,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:34,933 INFO L74 IsIncluded]: Start isIncluded. First operand has 737 states, 736 states have (on average 1.4782608695652173) internal successors, (1088), 736 states have internal predecessors, (1088), 0 states have call successors, (0), 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 739 states. [2022-02-20 18:50:34,934 INFO L87 Difference]: Start difference. First operand has 737 states, 736 states have (on average 1.4782608695652173) internal successors, (1088), 736 states have internal predecessors, (1088), 0 states have call successors, (0), 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 739 states. [2022-02-20 18:50:34,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:34,950 INFO L93 Difference]: Finished difference Result 739 states and 1089 transitions. [2022-02-20 18:50:34,951 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1089 transitions. [2022-02-20 18:50:34,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:34,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:34,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:34,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:34,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 736 states have (on average 1.4782608695652173) internal successors, (1088), 736 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:34,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1088 transitions. [2022-02-20 18:50:34,973 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1088 transitions. Word has length 42 [2022-02-20 18:50:34,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:34,973 INFO L470 AbstractCegarLoop]: Abstraction has 737 states and 1088 transitions. [2022-02-20 18:50:34,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 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:50:34,974 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1088 transitions. [2022-02-20 18:50:34,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 18:50:34,975 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:34,975 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:50:34,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:50:34,975 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:34,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:34,976 INFO L85 PathProgramCache]: Analyzing trace with hash 68425235, now seen corresponding path program 1 times [2022-02-20 18:50:34,976 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:34,977 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383790176] [2022-02-20 18:50:34,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:34,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:35,021 INFO L290 TraceCheckUtils]: 0: Hoare triple {14547#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(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1394~0 := 0;~__return_1470~0 := 0; {14549#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:35,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {14549#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, 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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {14549#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:35,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {14549#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {14549#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:35,022 INFO L290 TraceCheckUtils]: 3: Hoare triple {14549#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {14549#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:35,023 INFO L290 TraceCheckUtils]: 4: Hoare triple {14549#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {14549#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:35,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {14549#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {14549#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:35,023 INFO L290 TraceCheckUtils]: 6: Hoare triple {14549#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {14549#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:35,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {14549#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {14550#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:50:35,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {14550#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {14550#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:50:35,024 INFO L290 TraceCheckUtils]: 9: Hoare triple {14550#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {14551#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:35,024 INFO L290 TraceCheckUtils]: 10: Hoare triple {14551#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {14551#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:35,025 INFO L290 TraceCheckUtils]: 11: Hoare triple {14551#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {14551#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:35,025 INFO L290 TraceCheckUtils]: 12: Hoare triple {14551#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {14551#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:35,025 INFO L290 TraceCheckUtils]: 13: Hoare triple {14551#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {14551#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:35,026 INFO L290 TraceCheckUtils]: 14: Hoare triple {14551#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {14551#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:35,026 INFO L290 TraceCheckUtils]: 15: Hoare triple {14551#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {14551#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:35,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {14551#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {14551#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:35,026 INFO L290 TraceCheckUtils]: 17: Hoare triple {14551#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1394~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1394~0; {14551#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:35,027 INFO L290 TraceCheckUtils]: 18: Hoare triple {14551#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 != main_~main__i2~0#1;~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_~main__i2~0#1 := 0; {14551#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:35,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {14551#(<= (+ ~nomsg~0 1) ~send2~0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {14551#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:35,027 INFO L290 TraceCheckUtils]: 20: Hoare triple {14551#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {14551#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:35,028 INFO L290 TraceCheckUtils]: 21: Hoare triple {14551#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send1~0 != ~nomsg~0; {14551#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:35,028 INFO L290 TraceCheckUtils]: 22: Hoare triple {14551#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {14551#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:35,028 INFO L290 TraceCheckUtils]: 23: Hoare triple {14551#(<= (+ ~nomsg~0 1) ~send2~0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {14551#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:35,028 INFO L290 TraceCheckUtils]: 24: Hoare triple {14551#(<= (+ ~nomsg~0 1) ~send2~0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {14551#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:35,029 INFO L290 TraceCheckUtils]: 25: Hoare triple {14551#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {14551#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:35,029 INFO L290 TraceCheckUtils]: 26: Hoare triple {14551#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0); {14548#false} is VALID [2022-02-20 18:50:35,029 INFO L290 TraceCheckUtils]: 27: Hoare triple {14548#false} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {14548#false} is VALID [2022-02-20 18:50:35,029 INFO L290 TraceCheckUtils]: 28: Hoare triple {14548#false} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {14548#false} is VALID [2022-02-20 18:50:35,030 INFO L290 TraceCheckUtils]: 29: Hoare triple {14548#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {14548#false} is VALID [2022-02-20 18:50:35,030 INFO L290 TraceCheckUtils]: 30: Hoare triple {14548#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {14548#false} is VALID [2022-02-20 18:50:35,030 INFO L290 TraceCheckUtils]: 31: Hoare triple {14548#false} assume ~send3~0 != ~nomsg~0; {14548#false} is VALID [2022-02-20 18:50:35,030 INFO L290 TraceCheckUtils]: 32: Hoare triple {14548#false} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {14548#false} is VALID [2022-02-20 18:50:35,030 INFO L290 TraceCheckUtils]: 33: Hoare triple {14548#false} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {14548#false} is VALID [2022-02-20 18:50:35,030 INFO L290 TraceCheckUtils]: 34: Hoare triple {14548#false} ~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;havoc main_~check__tmp~0#1; {14548#false} is VALID [2022-02-20 18:50:35,030 INFO L290 TraceCheckUtils]: 35: Hoare triple {14548#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {14548#false} is VALID [2022-02-20 18:50:35,030 INFO L290 TraceCheckUtils]: 36: Hoare triple {14548#false} assume !(~r1~0 % 256 >= 3); {14548#false} is VALID [2022-02-20 18:50:35,031 INFO L290 TraceCheckUtils]: 37: Hoare triple {14548#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {14548#false} is VALID [2022-02-20 18:50:35,031 INFO L290 TraceCheckUtils]: 38: Hoare triple {14548#false} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1; {14548#false} is VALID [2022-02-20 18:50:35,031 INFO L290 TraceCheckUtils]: 39: Hoare triple {14548#false} ~__return_1470~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1470~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {14548#false} is VALID [2022-02-20 18:50:35,031 INFO L290 TraceCheckUtils]: 40: Hoare triple {14548#false} assume 0 == main_~assert__arg~0#1 % 256; {14548#false} is VALID [2022-02-20 18:50:35,031 INFO L290 TraceCheckUtils]: 41: Hoare triple {14548#false} assume !false; {14548#false} is VALID [2022-02-20 18:50:35,031 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:50:35,032 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:35,032 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383790176] [2022-02-20 18:50:35,032 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383790176] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:35,032 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:35,032 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:50:35,032 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430581145] [2022-02-20 18:50:35,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:35,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 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:50:35,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:35,033 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), 4 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:50:35,054 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:50:35,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:35,055 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:35,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:35,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:35,055 INFO L87 Difference]: Start difference. First operand 737 states and 1088 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 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:50:36,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:36,250 INFO L93 Difference]: Finished difference Result 1455 states and 2157 transitions. [2022-02-20 18:50:36,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:36,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 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:50:36,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:36,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 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:50:36,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 151 transitions. [2022-02-20 18:50:36,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 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:50:36,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 151 transitions. [2022-02-20 18:50:36,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 151 transitions. [2022-02-20 18:50:36,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:36,375 INFO L225 Difference]: With dead ends: 1455 [2022-02-20 18:50:36,375 INFO L226 Difference]: Without dead ends: 737 [2022-02-20 18:50:36,376 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:50:36,376 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 207 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:36,376 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 64 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:50:36,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2022-02-20 18:50:37,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 737. [2022-02-20 18:50:37,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:37,373 INFO L82 GeneralOperation]: Start isEquivalent. First operand 737 states. Second operand has 737 states, 736 states have (on average 1.4619565217391304) internal successors, (1076), 736 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:37,374 INFO L74 IsIncluded]: Start isIncluded. First operand 737 states. Second operand has 737 states, 736 states have (on average 1.4619565217391304) internal successors, (1076), 736 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:37,375 INFO L87 Difference]: Start difference. First operand 737 states. Second operand has 737 states, 736 states have (on average 1.4619565217391304) internal successors, (1076), 736 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:37,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:37,391 INFO L93 Difference]: Finished difference Result 737 states and 1076 transitions. [2022-02-20 18:50:37,391 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1076 transitions. [2022-02-20 18:50:37,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:37,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:37,393 INFO L74 IsIncluded]: Start isIncluded. First operand has 737 states, 736 states have (on average 1.4619565217391304) internal successors, (1076), 736 states have internal predecessors, (1076), 0 states have call successors, (0), 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 737 states. [2022-02-20 18:50:37,394 INFO L87 Difference]: Start difference. First operand has 737 states, 736 states have (on average 1.4619565217391304) internal successors, (1076), 736 states have internal predecessors, (1076), 0 states have call successors, (0), 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 737 states. [2022-02-20 18:50:37,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:37,411 INFO L93 Difference]: Finished difference Result 737 states and 1076 transitions. [2022-02-20 18:50:37,411 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1076 transitions. [2022-02-20 18:50:37,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:37,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:37,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:37,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:37,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 736 states have (on average 1.4619565217391304) internal successors, (1076), 736 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:37,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1076 transitions. [2022-02-20 18:50:37,435 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1076 transitions. Word has length 42 [2022-02-20 18:50:37,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:37,435 INFO L470 AbstractCegarLoop]: Abstraction has 737 states and 1076 transitions. [2022-02-20 18:50:37,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 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:50:37,436 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1076 transitions. [2022-02-20 18:50:37,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 18:50:37,436 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:37,436 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:50:37,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:50:37,437 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:37,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:37,437 INFO L85 PathProgramCache]: Analyzing trace with hash 933957624, now seen corresponding path program 1 times [2022-02-20 18:50:37,437 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:37,437 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804040097] [2022-02-20 18:50:37,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:37,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:37,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:37,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {19100#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(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1394~0 := 0;~__return_1470~0 := 0; {19100#true} is VALID [2022-02-20 18:50:37,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {19100#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, 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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {19100#true} is VALID [2022-02-20 18:50:37,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {19100#true} assume 0 == ~r1~0 % 256; {19100#true} is VALID [2022-02-20 18:50:37,519 INFO L290 TraceCheckUtils]: 3: Hoare triple {19100#true} assume ~id1~0 >= 0; {19100#true} is VALID [2022-02-20 18:50:37,519 INFO L290 TraceCheckUtils]: 4: Hoare triple {19100#true} assume 0 == ~st1~0; {19100#true} is VALID [2022-02-20 18:50:37,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {19100#true} assume ~send1~0 == ~id1~0; {19100#true} is VALID [2022-02-20 18:50:37,520 INFO L290 TraceCheckUtils]: 6: Hoare triple {19100#true} assume 0 == ~mode1~0 % 256; {19100#true} is VALID [2022-02-20 18:50:37,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {19100#true} assume ~id2~0 >= 0; {19100#true} is VALID [2022-02-20 18:50:37,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {19100#true} assume 0 == ~st2~0; {19100#true} is VALID [2022-02-20 18:50:37,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {19100#true} assume ~send2~0 == ~id2~0; {19100#true} is VALID [2022-02-20 18:50:37,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {19100#true} assume 0 == ~mode2~0 % 256; {19100#true} is VALID [2022-02-20 18:50:37,520 INFO L290 TraceCheckUtils]: 11: Hoare triple {19100#true} assume ~id3~0 >= 0; {19100#true} is VALID [2022-02-20 18:50:37,521 INFO L290 TraceCheckUtils]: 12: Hoare triple {19100#true} assume 0 == ~st3~0; {19100#true} is VALID [2022-02-20 18:50:37,521 INFO L290 TraceCheckUtils]: 13: Hoare triple {19100#true} assume ~send3~0 == ~id3~0; {19100#true} is VALID [2022-02-20 18:50:37,521 INFO L290 TraceCheckUtils]: 14: Hoare triple {19100#true} assume 0 == ~mode3~0 % 256; {19100#true} is VALID [2022-02-20 18:50:37,521 INFO L290 TraceCheckUtils]: 15: Hoare triple {19100#true} assume ~id1~0 != ~id2~0; {19100#true} is VALID [2022-02-20 18:50:37,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {19100#true} assume ~id1~0 != ~id3~0; {19100#true} is VALID [2022-02-20 18:50:37,522 INFO L290 TraceCheckUtils]: 17: Hoare triple {19100#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1394~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1394~0; {19102#(= |ULTIMATE.start_main_~main__i2~0#1| 1)} is VALID [2022-02-20 18:50:37,522 INFO L290 TraceCheckUtils]: 18: Hoare triple {19102#(= |ULTIMATE.start_main_~main__i2~0#1| 1)} assume 0 != main_~main__i2~0#1;~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_~main__i2~0#1 := 0; {19100#true} is VALID [2022-02-20 18:50:37,522 INFO L290 TraceCheckUtils]: 19: Hoare triple {19100#true} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {19100#true} is VALID [2022-02-20 18:50:37,522 INFO L290 TraceCheckUtils]: 20: Hoare triple {19100#true} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {19100#true} is VALID [2022-02-20 18:50:37,522 INFO L290 TraceCheckUtils]: 21: Hoare triple {19100#true} assume ~send1~0 != ~nomsg~0; {19100#true} is VALID [2022-02-20 18:50:37,522 INFO L290 TraceCheckUtils]: 22: Hoare triple {19100#true} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {19100#true} is VALID [2022-02-20 18:50:37,522 INFO L290 TraceCheckUtils]: 23: Hoare triple {19100#true} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {19100#true} is VALID [2022-02-20 18:50:37,522 INFO L290 TraceCheckUtils]: 24: Hoare triple {19100#true} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {19100#true} is VALID [2022-02-20 18:50:37,523 INFO L290 TraceCheckUtils]: 25: Hoare triple {19100#true} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {19100#true} is VALID [2022-02-20 18:50:37,523 INFO L290 TraceCheckUtils]: 26: Hoare triple {19100#true} assume ~send2~0 != ~nomsg~0; {19100#true} is VALID [2022-02-20 18:50:37,523 INFO L290 TraceCheckUtils]: 27: Hoare triple {19100#true} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {19100#true} is VALID [2022-02-20 18:50:37,523 INFO L290 TraceCheckUtils]: 28: Hoare triple {19100#true} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {19100#true} is VALID [2022-02-20 18:50:37,523 INFO L290 TraceCheckUtils]: 29: Hoare triple {19100#true} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {19100#true} is VALID [2022-02-20 18:50:37,523 INFO L290 TraceCheckUtils]: 30: Hoare triple {19100#true} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {19100#true} is VALID [2022-02-20 18:50:37,523 INFO L290 TraceCheckUtils]: 31: Hoare triple {19100#true} assume ~send3~0 != ~nomsg~0; {19100#true} is VALID [2022-02-20 18:50:37,524 INFO L290 TraceCheckUtils]: 32: Hoare triple {19100#true} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {19100#true} is VALID [2022-02-20 18:50:37,524 INFO L290 TraceCheckUtils]: 33: Hoare triple {19100#true} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {19100#true} is VALID [2022-02-20 18:50:37,524 INFO L290 TraceCheckUtils]: 34: Hoare triple {19100#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;havoc main_~check__tmp~0#1; {19100#true} is VALID [2022-02-20 18:50:37,524 INFO L290 TraceCheckUtils]: 35: Hoare triple {19100#true} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {19100#true} is VALID [2022-02-20 18:50:37,524 INFO L290 TraceCheckUtils]: 36: Hoare triple {19100#true} assume !(~r1~0 % 256 >= 3); {19100#true} is VALID [2022-02-20 18:50:37,524 INFO L290 TraceCheckUtils]: 37: Hoare triple {19100#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {19100#true} is VALID [2022-02-20 18:50:37,525 INFO L290 TraceCheckUtils]: 38: Hoare triple {19100#true} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1; {19103#(not (= |ULTIMATE.start_main_~check__tmp~0#1| 0))} is VALID [2022-02-20 18:50:37,525 INFO L290 TraceCheckUtils]: 39: Hoare triple {19103#(not (= |ULTIMATE.start_main_~check__tmp~0#1| 0))} ~__return_1470~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1470~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {19104#(and (<= 1 |ULTIMATE.start_main_~assert__arg~0#1|) (<= (div |ULTIMATE.start_main_~assert__arg~0#1| 256) 0))} is VALID [2022-02-20 18:50:37,526 INFO L290 TraceCheckUtils]: 40: Hoare triple {19104#(and (<= 1 |ULTIMATE.start_main_~assert__arg~0#1|) (<= (div |ULTIMATE.start_main_~assert__arg~0#1| 256) 0))} assume 0 == main_~assert__arg~0#1 % 256; {19101#false} is VALID [2022-02-20 18:50:37,526 INFO L290 TraceCheckUtils]: 41: Hoare triple {19101#false} assume !false; {19101#false} is VALID [2022-02-20 18:50:37,526 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:50:37,526 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:37,526 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804040097] [2022-02-20 18:50:37,526 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804040097] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:37,526 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:37,527 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:50:37,527 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255458625] [2022-02-20 18:50:37,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:37,527 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:50:37,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:37,527 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:50:37,547 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:50:37,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:37,548 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:37,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:37,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:37,549 INFO L87 Difference]: Start difference. First operand 737 states and 1076 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:50:39,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:39,857 INFO L93 Difference]: Finished difference Result 1344 states and 1963 transitions. [2022-02-20 18:50:39,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:50:39,857 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:50:39,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:39,857 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:50:39,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2022-02-20 18:50:39,858 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:50:39,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2022-02-20 18:50:39,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 151 transitions. [2022-02-20 18:50:39,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:40,019 INFO L225 Difference]: With dead ends: 1344 [2022-02-20 18:50:40,019 INFO L226 Difference]: Without dead ends: 1342 [2022-02-20 18:50:40,020 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:50:40,020 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 114 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:40,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 407 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:50:40,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2022-02-20 18:50:41,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 769. [2022-02-20 18:50:41,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:41,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1342 states. Second operand has 769 states, 768 states have (on average 1.4375) internal successors, (1104), 768 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:41,220 INFO L74 IsIncluded]: Start isIncluded. First operand 1342 states. Second operand has 769 states, 768 states have (on average 1.4375) internal successors, (1104), 768 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:41,221 INFO L87 Difference]: Start difference. First operand 1342 states. Second operand has 769 states, 768 states have (on average 1.4375) internal successors, (1104), 768 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:41,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:41,267 INFO L93 Difference]: Finished difference Result 1342 states and 1942 transitions. [2022-02-20 18:50:41,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1942 transitions. [2022-02-20 18:50:41,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:41,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:41,279 INFO L74 IsIncluded]: Start isIncluded. First operand has 769 states, 768 states have (on average 1.4375) internal successors, (1104), 768 states have internal predecessors, (1104), 0 states have call successors, (0), 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 1342 states. [2022-02-20 18:50:41,281 INFO L87 Difference]: Start difference. First operand has 769 states, 768 states have (on average 1.4375) internal successors, (1104), 768 states have internal predecessors, (1104), 0 states have call successors, (0), 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 1342 states. [2022-02-20 18:50:41,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:41,327 INFO L93 Difference]: Finished difference Result 1342 states and 1942 transitions. [2022-02-20 18:50:41,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1942 transitions. [2022-02-20 18:50:41,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:41,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:41,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:41,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:41,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 768 states have (on average 1.4375) internal successors, (1104), 768 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:41,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1104 transitions. [2022-02-20 18:50:41,354 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1104 transitions. Word has length 42 [2022-02-20 18:50:41,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:41,354 INFO L470 AbstractCegarLoop]: Abstraction has 769 states and 1104 transitions. [2022-02-20 18:50:41,354 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:50:41,355 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1104 transitions. [2022-02-20 18:50:41,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 18:50:41,355 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:41,355 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:50:41,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:50:41,355 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:41,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:41,356 INFO L85 PathProgramCache]: Analyzing trace with hash 883353381, now seen corresponding path program 1 times [2022-02-20 18:50:41,356 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:41,356 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853268863] [2022-02-20 18:50:41,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:41,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:41,404 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#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(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1394~0 := 0;~__return_1470~0 := 0; {24779#true} is VALID [2022-02-20 18:50:41,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, 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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {24779#true} is VALID [2022-02-20 18:50:41,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume 0 == ~r1~0 % 256; {24779#true} is VALID [2022-02-20 18:50:41,405 INFO L290 TraceCheckUtils]: 3: Hoare triple {24779#true} assume ~id1~0 >= 0; {24779#true} is VALID [2022-02-20 18:50:41,405 INFO L290 TraceCheckUtils]: 4: Hoare triple {24779#true} assume 0 == ~st1~0; {24779#true} is VALID [2022-02-20 18:50:41,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {24779#true} assume ~send1~0 == ~id1~0; {24779#true} is VALID [2022-02-20 18:50:41,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {24779#true} assume 0 == ~mode1~0 % 256; {24781#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:50:41,406 INFO L290 TraceCheckUtils]: 7: Hoare triple {24781#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {24781#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:50:41,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {24781#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {24781#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:50:41,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {24781#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {24781#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:50:41,407 INFO L290 TraceCheckUtils]: 10: Hoare triple {24781#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {24781#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:50:41,407 INFO L290 TraceCheckUtils]: 11: Hoare triple {24781#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {24781#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:50:41,407 INFO L290 TraceCheckUtils]: 12: Hoare triple {24781#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {24781#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:50:41,408 INFO L290 TraceCheckUtils]: 13: Hoare triple {24781#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {24781#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:50:41,408 INFO L290 TraceCheckUtils]: 14: Hoare triple {24781#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {24781#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:50:41,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {24781#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {24781#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:50:41,409 INFO L290 TraceCheckUtils]: 16: Hoare triple {24781#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {24781#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:50:41,409 INFO L290 TraceCheckUtils]: 17: Hoare triple {24781#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1394~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1394~0; {24781#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:50:41,410 INFO L290 TraceCheckUtils]: 18: Hoare triple {24781#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != main_~main__i2~0#1;~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_~main__i2~0#1 := 0; {24781#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:50:41,410 INFO L290 TraceCheckUtils]: 19: Hoare triple {24781#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {24781#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:50:41,410 INFO L290 TraceCheckUtils]: 20: Hoare triple {24781#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~mode1~0 % 256); {24780#false} is VALID [2022-02-20 18:50:41,411 INFO L290 TraceCheckUtils]: 21: Hoare triple {24780#false} assume !(255 == ~r1~0 % 256); {24780#false} is VALID [2022-02-20 18:50:41,415 INFO L290 TraceCheckUtils]: 22: Hoare triple {24780#false} ~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {24780#false} is VALID [2022-02-20 18:50:41,415 INFO L290 TraceCheckUtils]: 23: Hoare triple {24780#false} assume main_~node1__m1~0#1 != ~nomsg~0; {24780#false} is VALID [2022-02-20 18:50:41,415 INFO L290 TraceCheckUtils]: 24: Hoare triple {24780#false} assume !(main_~node1__m1~0#1 > ~id1~0); {24780#false} is VALID [2022-02-20 18:50:41,415 INFO L290 TraceCheckUtils]: 25: Hoare triple {24780#false} assume main_~node1__m1~0#1 == ~id1~0;~st1~0 := 1; {24780#false} is VALID [2022-02-20 18:50:41,415 INFO L290 TraceCheckUtils]: 26: Hoare triple {24780#false} ~mode1~0 := 0; {24780#false} is VALID [2022-02-20 18:50:41,416 INFO L290 TraceCheckUtils]: 27: Hoare triple {24780#false} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {24780#false} is VALID [2022-02-20 18:50:41,416 INFO L290 TraceCheckUtils]: 28: Hoare triple {24780#false} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {24780#false} is VALID [2022-02-20 18:50:41,416 INFO L290 TraceCheckUtils]: 29: Hoare triple {24780#false} assume ~send2~0 != ~nomsg~0; {24780#false} is VALID [2022-02-20 18:50:41,416 INFO L290 TraceCheckUtils]: 30: Hoare triple {24780#false} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {24780#false} is VALID [2022-02-20 18:50:41,416 INFO L290 TraceCheckUtils]: 31: Hoare triple {24780#false} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {24780#false} is VALID [2022-02-20 18:50:41,416 INFO L290 TraceCheckUtils]: 32: Hoare triple {24780#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {24780#false} is VALID [2022-02-20 18:50:41,416 INFO L290 TraceCheckUtils]: 33: Hoare triple {24780#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {24780#false} is VALID [2022-02-20 18:50:41,416 INFO L290 TraceCheckUtils]: 34: Hoare triple {24780#false} assume ~send3~0 != ~nomsg~0; {24780#false} is VALID [2022-02-20 18:50:41,417 INFO L290 TraceCheckUtils]: 35: Hoare triple {24780#false} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {24780#false} is VALID [2022-02-20 18:50:41,417 INFO L290 TraceCheckUtils]: 36: Hoare triple {24780#false} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {24780#false} is VALID [2022-02-20 18:50:41,417 INFO L290 TraceCheckUtils]: 37: Hoare triple {24780#false} ~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;havoc main_~check__tmp~0#1; {24780#false} is VALID [2022-02-20 18:50:41,418 INFO L290 TraceCheckUtils]: 38: Hoare triple {24780#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {24780#false} is VALID [2022-02-20 18:50:41,418 INFO L290 TraceCheckUtils]: 39: Hoare triple {24780#false} ~__return_1470~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1470~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {24780#false} is VALID [2022-02-20 18:50:41,418 INFO L290 TraceCheckUtils]: 40: Hoare triple {24780#false} assume 0 == main_~assert__arg~0#1 % 256; {24780#false} is VALID [2022-02-20 18:50:41,418 INFO L290 TraceCheckUtils]: 41: Hoare triple {24780#false} assume !false; {24780#false} is VALID [2022-02-20 18:50:41,418 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:50:41,418 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:41,419 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853268863] [2022-02-20 18:50:41,419 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853268863] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:41,419 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:41,419 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:50:41,419 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230417350] [2022-02-20 18:50:41,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:41,420 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:50:41,420 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:41,420 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:50:41,442 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:50:41,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:50:41,442 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:41,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:50:41,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:50:41,443 INFO L87 Difference]: Start difference. First operand 769 states and 1104 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:50:43,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:43,388 INFO L93 Difference]: Finished difference Result 1704 states and 2478 transitions. [2022-02-20 18:50:43,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:50:43,388 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:50:43,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:43,388 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:50:43,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2022-02-20 18:50:43,389 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:50:43,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2022-02-20 18:50:43,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 198 transitions. [2022-02-20 18:50:43,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:43,562 INFO L225 Difference]: With dead ends: 1704 [2022-02-20 18:50:43,562 INFO L226 Difference]: Without dead ends: 1157 [2022-02-20 18:50:43,563 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:50:43,567 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 52 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 185 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:50:43,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 185 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:50:43,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2022-02-20 18:50:45,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1155. [2022-02-20 18:50:45,350 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:45,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1157 states. Second operand has 1155 states, 1154 states have (on average 1.4298093587521663) internal successors, (1650), 1154 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:45,352 INFO L74 IsIncluded]: Start isIncluded. First operand 1157 states. Second operand has 1155 states, 1154 states have (on average 1.4298093587521663) internal successors, (1650), 1154 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:45,353 INFO L87 Difference]: Start difference. First operand 1157 states. Second operand has 1155 states, 1154 states have (on average 1.4298093587521663) internal successors, (1650), 1154 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:45,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:45,389 INFO L93 Difference]: Finished difference Result 1157 states and 1651 transitions. [2022-02-20 18:50:45,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1651 transitions. [2022-02-20 18:50:45,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:45,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:45,392 INFO L74 IsIncluded]: Start isIncluded. First operand has 1155 states, 1154 states have (on average 1.4298093587521663) internal successors, (1650), 1154 states have internal predecessors, (1650), 0 states have call successors, (0), 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 1157 states. [2022-02-20 18:50:45,393 INFO L87 Difference]: Start difference. First operand has 1155 states, 1154 states have (on average 1.4298093587521663) internal successors, (1650), 1154 states have internal predecessors, (1650), 0 states have call successors, (0), 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 1157 states. [2022-02-20 18:50:45,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:45,430 INFO L93 Difference]: Finished difference Result 1157 states and 1651 transitions. [2022-02-20 18:50:45,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1651 transitions. [2022-02-20 18:50:45,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:45,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:45,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:45,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:45,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 1154 states have (on average 1.4298093587521663) internal successors, (1650), 1154 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:45,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1650 transitions. [2022-02-20 18:50:45,481 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1650 transitions. Word has length 42 [2022-02-20 18:50:45,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:45,481 INFO L470 AbstractCegarLoop]: Abstraction has 1155 states and 1650 transitions. [2022-02-20 18:50:45,481 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:50:45,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1650 transitions. [2022-02-20 18:50:45,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-20 18:50:45,482 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:45,482 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] [2022-02-20 18:50:45,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:50:45,482 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:45,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:45,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1515661308, now seen corresponding path program 1 times [2022-02-20 18:50:45,483 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:45,483 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838267537] [2022-02-20 18:50:45,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:45,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:45,533 INFO L290 TraceCheckUtils]: 0: Hoare triple {31119#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(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1394~0 := 0;~__return_1470~0 := 0; {31119#true} is VALID [2022-02-20 18:50:45,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {31119#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, 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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {31119#true} is VALID [2022-02-20 18:50:45,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {31119#true} assume 0 == ~r1~0 % 256; {31119#true} is VALID [2022-02-20 18:50:45,534 INFO L290 TraceCheckUtils]: 3: Hoare triple {31119#true} assume ~id1~0 >= 0; {31119#true} is VALID [2022-02-20 18:50:45,534 INFO L290 TraceCheckUtils]: 4: Hoare triple {31119#true} assume 0 == ~st1~0; {31121#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:45,535 INFO L290 TraceCheckUtils]: 5: Hoare triple {31121#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {31121#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:45,535 INFO L290 TraceCheckUtils]: 6: Hoare triple {31121#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {31121#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:45,535 INFO L290 TraceCheckUtils]: 7: Hoare triple {31121#(<= ~st1~0 0)} assume ~id2~0 >= 0; {31121#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:45,536 INFO L290 TraceCheckUtils]: 8: Hoare triple {31121#(<= ~st1~0 0)} assume 0 == ~st2~0; {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,536 INFO L290 TraceCheckUtils]: 9: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,536 INFO L290 TraceCheckUtils]: 10: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,538 INFO L290 TraceCheckUtils]: 15: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,538 INFO L290 TraceCheckUtils]: 16: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,538 INFO L290 TraceCheckUtils]: 17: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1394~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1394~0; {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~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_~main__i2~0#1 := 0; {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,539 INFO L290 TraceCheckUtils]: 19: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,539 INFO L290 TraceCheckUtils]: 20: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,539 INFO L290 TraceCheckUtils]: 21: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0; {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,540 INFO L290 TraceCheckUtils]: 22: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,540 INFO L290 TraceCheckUtils]: 23: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,540 INFO L290 TraceCheckUtils]: 24: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,541 INFO L290 TraceCheckUtils]: 25: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,541 INFO L290 TraceCheckUtils]: 26: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0; {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,541 INFO L290 TraceCheckUtils]: 27: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,541 INFO L290 TraceCheckUtils]: 28: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,542 INFO L290 TraceCheckUtils]: 29: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,542 INFO L290 TraceCheckUtils]: 30: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,542 INFO L290 TraceCheckUtils]: 31: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0; {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,542 INFO L290 TraceCheckUtils]: 32: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,543 INFO L290 TraceCheckUtils]: 33: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,543 INFO L290 TraceCheckUtils]: 34: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} ~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;havoc main_~check__tmp~0#1; {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,543 INFO L290 TraceCheckUtils]: 35: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,544 INFO L290 TraceCheckUtils]: 36: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~r1~0 % 256 >= 3); {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,544 INFO L290 TraceCheckUtils]: 37: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,544 INFO L290 TraceCheckUtils]: 38: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1; {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,544 INFO L290 TraceCheckUtils]: 39: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} ~__return_1470~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1470~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,545 INFO L290 TraceCheckUtils]: 40: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256); {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,545 INFO L290 TraceCheckUtils]: 41: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,545 INFO L290 TraceCheckUtils]: 42: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,545 INFO L290 TraceCheckUtils]: 43: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0; {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,546 INFO L290 TraceCheckUtils]: 44: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,546 INFO L290 TraceCheckUtils]: 45: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,546 INFO L290 TraceCheckUtils]: 46: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,547 INFO L290 TraceCheckUtils]: 47: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,547 INFO L290 TraceCheckUtils]: 48: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~0#1 != ~nomsg~0); {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,547 INFO L290 TraceCheckUtils]: 49: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} ~mode2~0 := 0; {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,547 INFO L290 TraceCheckUtils]: 50: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,548 INFO L290 TraceCheckUtils]: 51: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,548 INFO L290 TraceCheckUtils]: 52: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~node3__m3~0#1 != ~nomsg~0; {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,548 INFO L290 TraceCheckUtils]: 53: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~0#1 > ~id3~0); {31122#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:45,549 INFO L290 TraceCheckUtils]: 54: Hoare triple {31122#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~node3__m3~0#1 == ~id3~0;~st3~0 := 1; {31123#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:45,549 INFO L290 TraceCheckUtils]: 55: Hoare triple {31123#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} ~mode3~0 := 0; {31123#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:45,549 INFO L290 TraceCheckUtils]: 56: Hoare triple {31123#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} ~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;havoc main_~check__tmp~0#1; {31123#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:45,550 INFO L290 TraceCheckUtils]: 57: Hoare triple {31123#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {31120#false} is VALID [2022-02-20 18:50:45,550 INFO L290 TraceCheckUtils]: 58: Hoare triple {31120#false} ~__return_1470~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1470~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {31120#false} is VALID [2022-02-20 18:50:45,550 INFO L290 TraceCheckUtils]: 59: Hoare triple {31120#false} assume 0 == main_~assert__arg~0#1 % 256; {31120#false} is VALID [2022-02-20 18:50:45,550 INFO L290 TraceCheckUtils]: 60: Hoare triple {31120#false} assume !false; {31120#false} is VALID [2022-02-20 18:50:45,550 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-20 18:50:45,551 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:45,551 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838267537] [2022-02-20 18:50:45,551 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838267537] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:45,551 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:45,551 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:50:45,551 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492544350] [2022-02-20 18:50:45,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:45,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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 61 [2022-02-20 18:50:45,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:45,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:45,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:45,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:45,581 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:45,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:45,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:45,581 INFO L87 Difference]: Start difference. First operand 1155 states and 1650 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:52,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:52,681 INFO L93 Difference]: Finished difference Result 4923 states and 7048 transitions. [2022-02-20 18:50:52,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:52,681 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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 61 [2022-02-20 18:50:52,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:52,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:52,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 341 transitions. [2022-02-20 18:50:52,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:52,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 341 transitions. [2022-02-20 18:50:52,683 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 341 transitions. [2022-02-20 18:50:52,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 341 edges. 341 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:53,478 INFO L225 Difference]: With dead ends: 4923 [2022-02-20 18:50:53,479 INFO L226 Difference]: Without dead ends: 3789 [2022-02-20 18:50:53,480 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:50:53,481 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 226 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:53,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [226 Valid, 347 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:50:53,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3789 states. [2022-02-20 18:50:57,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3789 to 2287. [2022-02-20 18:50:57,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:57,151 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3789 states. Second operand has 2287 states, 2286 states have (on average 1.4251968503937007) internal successors, (3258), 2286 states have internal predecessors, (3258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:57,152 INFO L74 IsIncluded]: Start isIncluded. First operand 3789 states. Second operand has 2287 states, 2286 states have (on average 1.4251968503937007) internal successors, (3258), 2286 states have internal predecessors, (3258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:57,154 INFO L87 Difference]: Start difference. First operand 3789 states. Second operand has 2287 states, 2286 states have (on average 1.4251968503937007) internal successors, (3258), 2286 states have internal predecessors, (3258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:57,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:57,555 INFO L93 Difference]: Finished difference Result 3789 states and 5399 transitions. [2022-02-20 18:50:57,555 INFO L276 IsEmpty]: Start isEmpty. Operand 3789 states and 5399 transitions. [2022-02-20 18:50:57,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:57,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:57,562 INFO L74 IsIncluded]: Start isIncluded. First operand has 2287 states, 2286 states have (on average 1.4251968503937007) internal successors, (3258), 2286 states have internal predecessors, (3258), 0 states have call successors, (0), 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 3789 states. [2022-02-20 18:50:57,564 INFO L87 Difference]: Start difference. First operand has 2287 states, 2286 states have (on average 1.4251968503937007) internal successors, (3258), 2286 states have internal predecessors, (3258), 0 states have call successors, (0), 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 3789 states. [2022-02-20 18:50:57,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:57,938 INFO L93 Difference]: Finished difference Result 3789 states and 5399 transitions. [2022-02-20 18:50:57,939 INFO L276 IsEmpty]: Start isEmpty. Operand 3789 states and 5399 transitions. [2022-02-20 18:50:57,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:57,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:57,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:57,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:57,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2287 states, 2286 states have (on average 1.4251968503937007) internal successors, (3258), 2286 states have internal predecessors, (3258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:58,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2287 states to 2287 states and 3258 transitions. [2022-02-20 18:50:58,140 INFO L78 Accepts]: Start accepts. Automaton has 2287 states and 3258 transitions. Word has length 61 [2022-02-20 18:50:58,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:58,140 INFO L470 AbstractCegarLoop]: Abstraction has 2287 states and 3258 transitions. [2022-02-20 18:50:58,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:58,140 INFO L276 IsEmpty]: Start isEmpty. Operand 2287 states and 3258 transitions. [2022-02-20 18:50:58,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-20 18:50:58,141 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:58,141 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] [2022-02-20 18:50:58,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:50:58,141 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:58,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:58,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1625359882, now seen corresponding path program 1 times [2022-02-20 18:50:58,142 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:58,142 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119373656] [2022-02-20 18:50:58,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:58,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:58,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:58,199 INFO L290 TraceCheckUtils]: 0: Hoare triple {48881#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(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1394~0 := 0;~__return_1470~0 := 0; {48881#true} is VALID [2022-02-20 18:50:58,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {48881#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, 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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {48881#true} is VALID [2022-02-20 18:50:58,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {48881#true} assume 0 == ~r1~0 % 256; {48881#true} is VALID [2022-02-20 18:50:58,200 INFO L290 TraceCheckUtils]: 3: Hoare triple {48881#true} assume ~id1~0 >= 0; {48881#true} is VALID [2022-02-20 18:50:58,200 INFO L290 TraceCheckUtils]: 4: Hoare triple {48881#true} assume 0 == ~st1~0; {48883#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:58,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {48883#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {48883#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:58,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {48883#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {48883#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:58,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {48883#(<= ~st1~0 0)} assume ~id2~0 >= 0; {48883#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:58,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {48883#(<= ~st1~0 0)} assume 0 == ~st2~0; {48883#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:58,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {48883#(<= ~st1~0 0)} assume ~send2~0 == ~id2~0; {48883#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:58,202 INFO L290 TraceCheckUtils]: 10: Hoare triple {48883#(<= ~st1~0 0)} assume 0 == ~mode2~0 % 256; {48883#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:58,202 INFO L290 TraceCheckUtils]: 11: Hoare triple {48883#(<= ~st1~0 0)} assume ~id3~0 >= 0; {48883#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:58,203 INFO L290 TraceCheckUtils]: 12: Hoare triple {48883#(<= ~st1~0 0)} assume 0 == ~st3~0; {48884#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:58,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {48884#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {48884#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:58,203 INFO L290 TraceCheckUtils]: 14: Hoare triple {48884#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {48884#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:58,204 INFO L290 TraceCheckUtils]: 15: Hoare triple {48884#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {48884#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:58,204 INFO L290 TraceCheckUtils]: 16: Hoare triple {48884#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {48884#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:58,204 INFO L290 TraceCheckUtils]: 17: Hoare triple {48884#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1394~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1394~0; {48884#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:58,204 INFO L290 TraceCheckUtils]: 18: Hoare triple {48884#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~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_~main__i2~0#1 := 0; {48884#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:58,205 INFO L290 TraceCheckUtils]: 19: Hoare triple {48884#(<= (+ ~st3~0 ~st1~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {48884#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:58,205 INFO L290 TraceCheckUtils]: 20: Hoare triple {48884#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {48884#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:58,205 INFO L290 TraceCheckUtils]: 21: Hoare triple {48884#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0; {48884#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:58,206 INFO L290 TraceCheckUtils]: 22: Hoare triple {48884#(<= (+ ~st3~0 ~st1~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {48884#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:58,206 INFO L290 TraceCheckUtils]: 23: Hoare triple {48884#(<= (+ ~st3~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {48884#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:58,206 INFO L290 TraceCheckUtils]: 24: Hoare triple {48884#(<= (+ ~st3~0 ~st1~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {48884#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:58,207 INFO L290 TraceCheckUtils]: 25: Hoare triple {48884#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {48884#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:58,207 INFO L290 TraceCheckUtils]: 26: Hoare triple {48884#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0; {48884#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:58,207 INFO L290 TraceCheckUtils]: 27: Hoare triple {48884#(<= (+ ~st3~0 ~st1~0) 0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {48884#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:58,208 INFO L290 TraceCheckUtils]: 28: Hoare triple {48884#(<= (+ ~st3~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {48884#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:58,208 INFO L290 TraceCheckUtils]: 29: Hoare triple {48884#(<= (+ ~st3~0 ~st1~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {48884#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:58,208 INFO L290 TraceCheckUtils]: 30: Hoare triple {48884#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {48884#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:58,208 INFO L290 TraceCheckUtils]: 31: Hoare triple {48884#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0; {48884#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:58,209 INFO L290 TraceCheckUtils]: 32: Hoare triple {48884#(<= (+ ~st3~0 ~st1~0) 0)} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {48884#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:58,209 INFO L290 TraceCheckUtils]: 33: Hoare triple {48884#(<= (+ ~st3~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {48884#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:58,209 INFO L290 TraceCheckUtils]: 34: Hoare triple {48884#(<= (+ ~st3~0 ~st1~0) 0)} ~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;havoc main_~check__tmp~0#1; {48884#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:58,210 INFO L290 TraceCheckUtils]: 35: Hoare triple {48884#(<= (+ ~st3~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {48884#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:58,210 INFO L290 TraceCheckUtils]: 36: Hoare triple {48884#(<= (+ ~st3~0 ~st1~0) 0)} assume !(~r1~0 % 256 >= 3); {48884#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:58,210 INFO L290 TraceCheckUtils]: 37: Hoare triple {48884#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {48884#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:58,211 INFO L290 TraceCheckUtils]: 38: Hoare triple {48884#(<= (+ ~st3~0 ~st1~0) 0)} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1; {48884#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:58,211 INFO L290 TraceCheckUtils]: 39: Hoare triple {48884#(<= (+ ~st3~0 ~st1~0) 0)} ~__return_1470~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1470~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {48884#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:58,211 INFO L290 TraceCheckUtils]: 40: Hoare triple {48884#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256); {48884#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:58,212 INFO L290 TraceCheckUtils]: 41: Hoare triple {48884#(<= (+ ~st3~0 ~st1~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {48884#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:58,212 INFO L290 TraceCheckUtils]: 42: Hoare triple {48884#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {48884#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:58,212 INFO L290 TraceCheckUtils]: 43: Hoare triple {48884#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0; {48884#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:58,212 INFO L290 TraceCheckUtils]: 44: Hoare triple {48884#(<= (+ ~st3~0 ~st1~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {48884#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:58,213 INFO L290 TraceCheckUtils]: 45: Hoare triple {48884#(<= (+ ~st3~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {48884#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:58,213 INFO L290 TraceCheckUtils]: 46: Hoare triple {48884#(<= (+ ~st3~0 ~st1~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {48884#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:58,213 INFO L290 TraceCheckUtils]: 47: Hoare triple {48884#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {48884#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:58,214 INFO L290 TraceCheckUtils]: 48: Hoare triple {48884#(<= (+ ~st3~0 ~st1~0) 0)} assume main_~node2__m2~0#1 != ~nomsg~0; {48884#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:58,214 INFO L290 TraceCheckUtils]: 49: Hoare triple {48884#(<= (+ ~st3~0 ~st1~0) 0)} assume !(main_~node2__m2~0#1 > ~id2~0); {48884#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:58,214 INFO L290 TraceCheckUtils]: 50: Hoare triple {48884#(<= (+ ~st3~0 ~st1~0) 0)} assume main_~node2__m2~0#1 == ~id2~0;~st2~0 := 1; {48885#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:50:58,215 INFO L290 TraceCheckUtils]: 51: Hoare triple {48885#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode2~0 := 0; {48885#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:50:58,215 INFO L290 TraceCheckUtils]: 52: Hoare triple {48885#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {48885#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:50:58,215 INFO L290 TraceCheckUtils]: 53: Hoare triple {48885#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {48885#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:50:58,216 INFO L290 TraceCheckUtils]: 54: Hoare triple {48885#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(main_~node3__m3~0#1 != ~nomsg~0); {48885#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:50:58,216 INFO L290 TraceCheckUtils]: 55: Hoare triple {48885#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode3~0 := 0; {48885#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:50:58,216 INFO L290 TraceCheckUtils]: 56: Hoare triple {48885#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~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;havoc main_~check__tmp~0#1; {48885#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:50:58,217 INFO L290 TraceCheckUtils]: 57: Hoare triple {48885#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {48882#false} is VALID [2022-02-20 18:50:58,217 INFO L290 TraceCheckUtils]: 58: Hoare triple {48882#false} ~__return_1470~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1470~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {48882#false} is VALID [2022-02-20 18:50:58,217 INFO L290 TraceCheckUtils]: 59: Hoare triple {48882#false} assume 0 == main_~assert__arg~0#1 % 256; {48882#false} is VALID [2022-02-20 18:50:58,217 INFO L290 TraceCheckUtils]: 60: Hoare triple {48882#false} assume !false; {48882#false} is VALID [2022-02-20 18:50:58,217 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 18:50:58,218 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:58,218 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119373656] [2022-02-20 18:50:58,218 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119373656] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:58,218 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:58,218 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:50:58,218 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530314942] [2022-02-20 18:50:58,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:58,218 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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 61 [2022-02-20 18:50:58,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:58,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:58,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:58,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:58,249 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:58,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:58,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:58,249 INFO L87 Difference]: Start difference. First operand 2287 states and 3258 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:07,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:07,884 INFO L93 Difference]: Finished difference Result 6055 states and 8656 transitions. [2022-02-20 18:51:07,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:51:07,884 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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 61 [2022-02-20 18:51:07,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:07,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:07,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 341 transitions. [2022-02-20 18:51:07,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:07,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 341 transitions. [2022-02-20 18:51:07,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 341 transitions. [2022-02-20 18:51:08,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 341 edges. 341 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:09,096 INFO L225 Difference]: With dead ends: 6055 [2022-02-20 18:51:09,096 INFO L226 Difference]: Without dead ends: 4921 [2022-02-20 18:51:09,098 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:51:09,098 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 224 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 371 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:51:09,098 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 371 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:51:09,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4921 states. [2022-02-20 18:51:15,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4921 to 3987. [2022-02-20 18:51:15,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:15,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4921 states. Second operand has 3987 states, 3986 states have (on average 1.417962870045158) internal successors, (5652), 3986 states have internal predecessors, (5652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:15,816 INFO L74 IsIncluded]: Start isIncluded. First operand 4921 states. Second operand has 3987 states, 3986 states have (on average 1.417962870045158) internal successors, (5652), 3986 states have internal predecessors, (5652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:15,820 INFO L87 Difference]: Start difference. First operand 4921 states. Second operand has 3987 states, 3986 states have (on average 1.417962870045158) internal successors, (5652), 3986 states have internal predecessors, (5652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:16,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:16,440 INFO L93 Difference]: Finished difference Result 4921 states and 7007 transitions. [2022-02-20 18:51:16,440 INFO L276 IsEmpty]: Start isEmpty. Operand 4921 states and 7007 transitions. [2022-02-20 18:51:16,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:16,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:16,448 INFO L74 IsIncluded]: Start isIncluded. First operand has 3987 states, 3986 states have (on average 1.417962870045158) internal successors, (5652), 3986 states have internal predecessors, (5652), 0 states have call successors, (0), 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 4921 states. [2022-02-20 18:51:16,452 INFO L87 Difference]: Start difference. First operand has 3987 states, 3986 states have (on average 1.417962870045158) internal successors, (5652), 3986 states have internal predecessors, (5652), 0 states have call successors, (0), 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 4921 states. [2022-02-20 18:51:17,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:17,066 INFO L93 Difference]: Finished difference Result 4921 states and 7007 transitions. [2022-02-20 18:51:17,066 INFO L276 IsEmpty]: Start isEmpty. Operand 4921 states and 7007 transitions. [2022-02-20 18:51:17,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:17,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:17,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:17,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:17,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3987 states, 3986 states have (on average 1.417962870045158) internal successors, (5652), 3986 states have internal predecessors, (5652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:17,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3987 states to 3987 states and 5652 transitions. [2022-02-20 18:51:17,697 INFO L78 Accepts]: Start accepts. Automaton has 3987 states and 5652 transitions. Word has length 61 [2022-02-20 18:51:17,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:17,697 INFO L470 AbstractCegarLoop]: Abstraction has 3987 states and 5652 transitions. [2022-02-20 18:51:17,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:17,697 INFO L276 IsEmpty]: Start isEmpty. Operand 3987 states and 5652 transitions. [2022-02-20 18:51:17,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 18:51:17,698 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:17,698 INFO L514 BasicCegarLoop]: trace histogram [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:51:17,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:51:17,698 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:17,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:17,699 INFO L85 PathProgramCache]: Analyzing trace with hash -2114297975, now seen corresponding path program 1 times [2022-02-20 18:51:17,699 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:17,699 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094610939] [2022-02-20 18:51:17,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:17,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:17,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:17,761 INFO L290 TraceCheckUtils]: 0: Hoare triple {72911#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(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1394~0 := 0;~__return_1470~0 := 0; {72911#true} is VALID [2022-02-20 18:51:17,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {72911#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, 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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {72911#true} is VALID [2022-02-20 18:51:17,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {72911#true} assume 0 == ~r1~0 % 256; {72911#true} is VALID [2022-02-20 18:51:17,762 INFO L290 TraceCheckUtils]: 3: Hoare triple {72911#true} assume ~id1~0 >= 0; {72911#true} is VALID [2022-02-20 18:51:17,763 INFO L290 TraceCheckUtils]: 4: Hoare triple {72911#true} assume 0 == ~st1~0; {72911#true} is VALID [2022-02-20 18:51:17,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {72911#true} assume ~send1~0 == ~id1~0; {72911#true} is VALID [2022-02-20 18:51:17,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {72911#true} assume 0 == ~mode1~0 % 256; {72911#true} is VALID [2022-02-20 18:51:17,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {72911#true} assume ~id2~0 >= 0; {72911#true} is VALID [2022-02-20 18:51:17,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {72911#true} assume 0 == ~st2~0; {72913#(<= ~st2~0 0)} is VALID [2022-02-20 18:51:17,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {72913#(<= ~st2~0 0)} assume ~send2~0 == ~id2~0; {72913#(<= ~st2~0 0)} is VALID [2022-02-20 18:51:17,764 INFO L290 TraceCheckUtils]: 10: Hoare triple {72913#(<= ~st2~0 0)} assume 0 == ~mode2~0 % 256; {72913#(<= ~st2~0 0)} is VALID [2022-02-20 18:51:17,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {72913#(<= ~st2~0 0)} assume ~id3~0 >= 0; {72913#(<= ~st2~0 0)} is VALID [2022-02-20 18:51:17,765 INFO L290 TraceCheckUtils]: 12: Hoare triple {72913#(<= ~st2~0 0)} assume 0 == ~st3~0; {72914#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:17,769 INFO L290 TraceCheckUtils]: 13: Hoare triple {72914#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send3~0 == ~id3~0; {72914#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:17,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {72914#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256; {72914#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:17,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {72914#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id2~0; {72914#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:17,770 INFO L290 TraceCheckUtils]: 16: Hoare triple {72914#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id3~0; {72914#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:17,770 INFO L290 TraceCheckUtils]: 17: Hoare triple {72914#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1394~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1394~0; {72914#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:17,771 INFO L290 TraceCheckUtils]: 18: Hoare triple {72914#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 != main_~main__i2~0#1;~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_~main__i2~0#1 := 0; {72914#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:17,771 INFO L290 TraceCheckUtils]: 19: Hoare triple {72914#(<= (+ ~st3~0 ~st2~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {72914#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:17,771 INFO L290 TraceCheckUtils]: 20: Hoare triple {72914#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {72914#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:17,772 INFO L290 TraceCheckUtils]: 21: Hoare triple {72914#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send1~0 != ~nomsg~0; {72914#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:17,772 INFO L290 TraceCheckUtils]: 22: Hoare triple {72914#(<= (+ ~st3~0 ~st2~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {72914#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:17,772 INFO L290 TraceCheckUtils]: 23: Hoare triple {72914#(<= (+ ~st3~0 ~st2~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {72914#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:17,772 INFO L290 TraceCheckUtils]: 24: Hoare triple {72914#(<= (+ ~st3~0 ~st2~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {72914#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:17,773 INFO L290 TraceCheckUtils]: 25: Hoare triple {72914#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {72914#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:17,773 INFO L290 TraceCheckUtils]: 26: Hoare triple {72914#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send2~0 != ~nomsg~0; {72914#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:17,773 INFO L290 TraceCheckUtils]: 27: Hoare triple {72914#(<= (+ ~st3~0 ~st2~0) 0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {72914#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:17,774 INFO L290 TraceCheckUtils]: 28: Hoare triple {72914#(<= (+ ~st3~0 ~st2~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {72914#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:17,774 INFO L290 TraceCheckUtils]: 29: Hoare triple {72914#(<= (+ ~st3~0 ~st2~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {72914#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:17,774 INFO L290 TraceCheckUtils]: 30: Hoare triple {72914#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {72914#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:17,774 INFO L290 TraceCheckUtils]: 31: Hoare triple {72914#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send3~0 != ~nomsg~0; {72914#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:17,775 INFO L290 TraceCheckUtils]: 32: Hoare triple {72914#(<= (+ ~st3~0 ~st2~0) 0)} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {72914#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:17,775 INFO L290 TraceCheckUtils]: 33: Hoare triple {72914#(<= (+ ~st3~0 ~st2~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {72914#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:17,775 INFO L290 TraceCheckUtils]: 34: Hoare triple {72914#(<= (+ ~st3~0 ~st2~0) 0)} ~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;havoc main_~check__tmp~0#1; {72914#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:17,776 INFO L290 TraceCheckUtils]: 35: Hoare triple {72914#(<= (+ ~st3~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {72914#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:17,780 INFO L290 TraceCheckUtils]: 36: Hoare triple {72914#(<= (+ ~st3~0 ~st2~0) 0)} assume !(~r1~0 % 256 >= 3); {72914#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:17,780 INFO L290 TraceCheckUtils]: 37: Hoare triple {72914#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {72914#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:17,781 INFO L290 TraceCheckUtils]: 38: Hoare triple {72914#(<= (+ ~st3~0 ~st2~0) 0)} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1; {72914#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:17,781 INFO L290 TraceCheckUtils]: 39: Hoare triple {72914#(<= (+ ~st3~0 ~st2~0) 0)} ~__return_1470~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1470~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {72914#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:17,781 INFO L290 TraceCheckUtils]: 40: Hoare triple {72914#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256); {72914#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:17,781 INFO L290 TraceCheckUtils]: 41: Hoare triple {72914#(<= (+ ~st3~0 ~st2~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {72914#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:17,782 INFO L290 TraceCheckUtils]: 42: Hoare triple {72914#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 == ~mode1~0 % 256); {72914#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:17,782 INFO L290 TraceCheckUtils]: 43: Hoare triple {72914#(<= (+ ~st3~0 ~st2~0) 0)} assume !(255 == ~r1~0 % 256); {72914#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:17,782 INFO L290 TraceCheckUtils]: 44: Hoare triple {72914#(<= (+ ~st3~0 ~st2~0) 0)} ~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {72914#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:17,783 INFO L290 TraceCheckUtils]: 45: Hoare triple {72914#(<= (+ ~st3~0 ~st2~0) 0)} assume main_~node1__m1~0#1 != ~nomsg~0; {72914#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:17,783 INFO L290 TraceCheckUtils]: 46: Hoare triple {72914#(<= (+ ~st3~0 ~st2~0) 0)} assume !(main_~node1__m1~0#1 > ~id1~0); {72914#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:17,783 INFO L290 TraceCheckUtils]: 47: Hoare triple {72914#(<= (+ ~st3~0 ~st2~0) 0)} assume main_~node1__m1~0#1 == ~id1~0;~st1~0 := 1; {72915#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:17,784 INFO L290 TraceCheckUtils]: 48: Hoare triple {72915#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} ~mode1~0 := 0; {72915#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:17,784 INFO L290 TraceCheckUtils]: 49: Hoare triple {72915#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {72915#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:17,784 INFO L290 TraceCheckUtils]: 50: Hoare triple {72915#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {72915#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:17,785 INFO L290 TraceCheckUtils]: 51: Hoare triple {72915#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(main_~node2__m2~0#1 != ~nomsg~0); {72915#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:17,785 INFO L290 TraceCheckUtils]: 52: Hoare triple {72915#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} ~mode2~0 := 0; {72915#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:17,785 INFO L290 TraceCheckUtils]: 53: Hoare triple {72915#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {72915#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:17,786 INFO L290 TraceCheckUtils]: 54: Hoare triple {72915#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {72915#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:17,786 INFO L290 TraceCheckUtils]: 55: Hoare triple {72915#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(main_~node3__m3~0#1 != ~nomsg~0); {72915#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:17,787 INFO L290 TraceCheckUtils]: 56: Hoare triple {72915#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} ~mode3~0 := 0; {72915#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:17,787 INFO L290 TraceCheckUtils]: 57: Hoare triple {72915#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} ~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;havoc main_~check__tmp~0#1; {72915#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:17,787 INFO L290 TraceCheckUtils]: 58: Hoare triple {72915#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {72912#false} is VALID [2022-02-20 18:51:17,788 INFO L290 TraceCheckUtils]: 59: Hoare triple {72912#false} ~__return_1470~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1470~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {72912#false} is VALID [2022-02-20 18:51:17,788 INFO L290 TraceCheckUtils]: 60: Hoare triple {72912#false} assume 0 == main_~assert__arg~0#1 % 256; {72912#false} is VALID [2022-02-20 18:51:17,788 INFO L290 TraceCheckUtils]: 61: Hoare triple {72912#false} assume !false; {72912#false} is VALID [2022-02-20 18:51:17,788 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 18:51:17,790 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:17,790 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094610939] [2022-02-20 18:51:17,790 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094610939] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:17,790 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:17,790 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:51:17,790 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677136535] [2022-02-20 18:51:17,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:17,791 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-02-20 18:51:17,792 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:17,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:17,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:17,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:51:17,825 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:17,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:51:17,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:51:17,826 INFO L87 Difference]: Start difference. First operand 3987 states and 5652 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)