./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 927c21c2096a228a934a41e2a18844ff0d670b1b365a7d276a4e36116ab9babc --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:27:29,874 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:27:29,875 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:27:29,893 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:27:29,893 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:27:29,894 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:27:29,895 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:27:29,896 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:27:29,897 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:27:29,898 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:27:29,898 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:27:29,899 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:27:29,899 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:27:29,900 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:27:29,901 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:27:29,902 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:27:29,902 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:27:29,903 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:27:29,904 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:27:29,905 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:27:29,906 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:27:29,906 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:27:29,907 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:27:29,908 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:27:29,909 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:27:29,910 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:27:29,910 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:27:29,910 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:27:29,911 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:27:29,911 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:27:29,912 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:27:29,912 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:27:29,913 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:27:29,913 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:27:29,914 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:27:29,914 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:27:29,914 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:27:29,915 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:27:29,915 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:27:29,915 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:27:29,916 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:27:29,917 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:27:29,929 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:27:29,929 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:27:29,929 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:27:29,930 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:27:29,930 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:27:29,930 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:27:29,931 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:27:29,931 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:27:29,931 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:27:29,931 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:27:29,931 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:27:29,931 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:27:29,931 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:27:29,932 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:27:29,932 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:27:29,932 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:27:29,932 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:27:29,932 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:27:29,932 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:27:29,932 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:27:29,933 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:27:29,933 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:27:29,933 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:27:29,933 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:27:29,933 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:27:29,933 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:27:29,933 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:27:29,933 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:27:29,934 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:27:29,934 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:27:29,934 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:27:29,934 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:27:29,934 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:27:29,934 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 -> 927c21c2096a228a934a41e2a18844ff0d670b1b365a7d276a4e36116ab9babc [2022-02-20 18:27:30,129 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:27:30,147 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:27:30,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:27:30,150 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:27:30,150 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:27:30,151 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c [2022-02-20 18:27:30,209 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/226446e95/f4dccb0420f34a7ba72fb36fda27a6ca/FLAG8578e685b [2022-02-20 18:27:30,585 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:27:30,596 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c [2022-02-20 18:27:30,602 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/226446e95/f4dccb0420f34a7ba72fb36fda27a6ca/FLAG8578e685b [2022-02-20 18:27:30,611 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/226446e95/f4dccb0420f34a7ba72fb36fda27a6ca [2022-02-20 18:27:30,613 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:27:30,613 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:27:30,614 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:27:30,614 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:27:30,616 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:27:30,617 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:27:30" (1/1) ... [2022-02-20 18:27:30,618 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53e562f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:30, skipping insertion in model container [2022-02-20 18:27:30,618 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:27:30" (1/1) ... [2022-02-20 18:27:30,622 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:27:30,643 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:27:30,786 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c[9376,9389] [2022-02-20 18:27:30,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:27:30,794 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:27:30,859 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c[9376,9389] [2022-02-20 18:27:30,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:27:30,884 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:27:30,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:30 WrapperNode [2022-02-20 18:27:30,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:27:30,885 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:27:30,886 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:27:30,886 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:27:30,895 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:27:30" (1/1) ... [2022-02-20 18:27:30,901 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:27:30" (1/1) ... [2022-02-20 18:27:30,934 INFO L137 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 313 [2022-02-20 18:27:30,934 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:27:30,935 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:27:30,935 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:27:30,935 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:27:30,941 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:30" (1/1) ... [2022-02-20 18:27:30,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:30" (1/1) ... [2022-02-20 18:27:30,943 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:30" (1/1) ... [2022-02-20 18:27:30,943 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:30" (1/1) ... [2022-02-20 18:27:30,948 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:30" (1/1) ... [2022-02-20 18:27:30,952 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:30" (1/1) ... [2022-02-20 18:27:30,953 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:30" (1/1) ... [2022-02-20 18:27:30,955 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:27:30,956 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:27:30,956 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:27:30,956 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:27:30,957 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:30" (1/1) ... [2022-02-20 18:27:30,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:27:30,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:27:31,008 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:27:31,020 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:27:31,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:27:31,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:27:31,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:27:31,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:27:31,097 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:27:31,098 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:27:31,451 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:27:31,456 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:27:31,456 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 18:27:31,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:27:31 BoogieIcfgContainer [2022-02-20 18:27:31,457 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:27:31,458 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:27:31,458 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:27:31,480 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:27:31,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:27:30" (1/3) ... [2022-02-20 18:27:31,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75585921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:27:31, skipping insertion in model container [2022-02-20 18:27:31,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:30" (2/3) ... [2022-02-20 18:27:31,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75585921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:27:31, skipping insertion in model container [2022-02-20 18:27:31,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:27:31" (3/3) ... [2022-02-20 18:27:31,491 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c [2022-02-20 18:27:31,494 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:27:31,502 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:27:31,574 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:27:31,603 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:27:31,603 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:27:31,635 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 97 states have (on average 1.690721649484536) internal successors, (164), 98 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:31,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 18:27:31,639 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:31,643 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] [2022-02-20 18:27:31,643 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:31,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:31,647 INFO L85 PathProgramCache]: Analyzing trace with hash -107778019, now seen corresponding path program 1 times [2022-02-20 18:27:31,652 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:31,653 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701604610] [2022-02-20 18:27:31,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:31,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:31,828 INFO L290 TraceCheckUtils]: 0: Hoare triple {102#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(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~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;~alive2~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;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0; {102#true} is VALID [2022-02-20 18:27:31,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {102#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~alive1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {102#true} is VALID [2022-02-20 18:27:31,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {102#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {102#true} is VALID [2022-02-20 18:27:31,830 INFO L290 TraceCheckUtils]: 3: Hoare triple {102#true} init_#res#1 := init_~tmp~0#1; {102#true} is VALID [2022-02-20 18:27:31,830 INFO L290 TraceCheckUtils]: 4: Hoare triple {102#true} main_#t~ret32#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;main_~i2~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {102#true} is VALID [2022-02-20 18:27:31,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {102#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {103#false} is VALID [2022-02-20 18:27:31,831 INFO L290 TraceCheckUtils]: 6: Hoare triple {103#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {103#false} is VALID [2022-02-20 18:27:31,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {103#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {103#false} is VALID [2022-02-20 18:27:31,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {103#false} assume !(0 != ~mode1~0 % 256); {103#false} is VALID [2022-02-20 18:27:31,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {103#false} assume !(0 != ~alive1~0 % 256); {103#false} is VALID [2022-02-20 18:27:31,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {103#false} ~mode1~0 := 1; {103#false} is VALID [2022-02-20 18:27:31,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {103#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {103#false} is VALID [2022-02-20 18:27:31,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {103#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {103#false} is VALID [2022-02-20 18:27:31,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {103#false} assume !(node2_~m2~0#1 != ~nomsg~0); {103#false} is VALID [2022-02-20 18:27:31,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {103#false} ~mode2~0 := 0; {103#false} is VALID [2022-02-20 18:27:31,834 INFO L290 TraceCheckUtils]: 15: Hoare triple {103#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {103#false} is VALID [2022-02-20 18:27:31,834 INFO L290 TraceCheckUtils]: 16: Hoare triple {103#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {103#false} is VALID [2022-02-20 18:27:31,834 INFO L290 TraceCheckUtils]: 17: Hoare triple {103#false} assume !(node3_~m3~0#1 != ~nomsg~0); {103#false} is VALID [2022-02-20 18:27:31,835 INFO L290 TraceCheckUtils]: 18: Hoare triple {103#false} ~mode3~0 := 0; {103#false} is VALID [2022-02-20 18:27:31,835 INFO L290 TraceCheckUtils]: 19: Hoare triple {103#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {103#false} is VALID [2022-02-20 18:27:31,840 INFO L290 TraceCheckUtils]: 20: Hoare triple {103#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {103#false} is VALID [2022-02-20 18:27:31,840 INFO L290 TraceCheckUtils]: 21: Hoare triple {103#false} assume !(node4_~m4~0#1 != ~nomsg~0); {103#false} is VALID [2022-02-20 18:27:31,840 INFO L290 TraceCheckUtils]: 22: Hoare triple {103#false} ~mode4~0 := 0; {103#false} is VALID [2022-02-20 18:27:31,841 INFO L290 TraceCheckUtils]: 23: Hoare triple {103#false} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {103#false} is VALID [2022-02-20 18:27:31,843 INFO L290 TraceCheckUtils]: 24: Hoare triple {103#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {103#false} is VALID [2022-02-20 18:27:31,843 INFO L290 TraceCheckUtils]: 25: Hoare triple {103#false} check_#res#1 := check_~tmp~1#1; {103#false} is VALID [2022-02-20 18:27:31,844 INFO L290 TraceCheckUtils]: 26: Hoare triple {103#false} main_#t~ret33#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~c1~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {103#false} is VALID [2022-02-20 18:27:31,844 INFO L290 TraceCheckUtils]: 27: Hoare triple {103#false} assume 0 == assert_~arg#1 % 256; {103#false} is VALID [2022-02-20 18:27:31,844 INFO L290 TraceCheckUtils]: 28: Hoare triple {103#false} assume !false; {103#false} is VALID [2022-02-20 18:27:31,845 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:27:31,845 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:31,845 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701604610] [2022-02-20 18:27:31,846 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701604610] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:31,846 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:31,846 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:27:31,847 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884616918] [2022-02-20 18:27:31,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:31,851 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-02-20 18:27:31,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:31,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:31,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:31,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:27:31,895 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:31,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:27:31,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:27:31,912 INFO L87 Difference]: Start difference. First operand has 99 states, 97 states have (on average 1.690721649484536) internal successors, (164), 98 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:32,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:32,020 INFO L93 Difference]: Finished difference Result 165 states and 271 transitions. [2022-02-20 18:27:32,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:27:32,020 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-02-20 18:27:32,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:32,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:32,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 271 transitions. [2022-02-20 18:27:32,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:32,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 271 transitions. [2022-02-20 18:27:32,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 271 transitions. [2022-02-20 18:27:32,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 271 edges. 271 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:32,240 INFO L225 Difference]: With dead ends: 165 [2022-02-20 18:27:32,240 INFO L226 Difference]: Without dead ends: 95 [2022-02-20 18:27:32,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:27:32,244 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:27:32,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:32,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-02-20 18:27:32,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-02-20 18:27:32,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:32,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 95 states, 94 states have (on average 1.6702127659574468) internal successors, (157), 94 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:32,268 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 95 states, 94 states have (on average 1.6702127659574468) internal successors, (157), 94 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:32,268 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 95 states, 94 states have (on average 1.6702127659574468) internal successors, (157), 94 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:32,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:32,271 INFO L93 Difference]: Finished difference Result 95 states and 157 transitions. [2022-02-20 18:27:32,271 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 157 transitions. [2022-02-20 18:27:32,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:32,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:32,273 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 94 states have (on average 1.6702127659574468) internal successors, (157), 94 states have internal predecessors, (157), 0 states have call successors, (0), 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:27:32,273 INFO L87 Difference]: Start difference. First operand has 95 states, 94 states have (on average 1.6702127659574468) internal successors, (157), 94 states have internal predecessors, (157), 0 states have call successors, (0), 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:27:32,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:32,276 INFO L93 Difference]: Finished difference Result 95 states and 157 transitions. [2022-02-20 18:27:32,276 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 157 transitions. [2022-02-20 18:27:32,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:32,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:32,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:32,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:32,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.6702127659574468) internal successors, (157), 94 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:32,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 157 transitions. [2022-02-20 18:27:32,281 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 157 transitions. Word has length 29 [2022-02-20 18:27:32,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:32,281 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 157 transitions. [2022-02-20 18:27:32,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:32,281 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 157 transitions. [2022-02-20 18:27:32,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 18:27:32,289 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:32,289 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] [2022-02-20 18:27:32,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:27:32,289 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:32,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:32,290 INFO L85 PathProgramCache]: Analyzing trace with hash -241791525, now seen corresponding path program 1 times [2022-02-20 18:27:32,290 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:32,290 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808331121] [2022-02-20 18:27:32,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:32,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:32,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:32,366 INFO L290 TraceCheckUtils]: 0: Hoare triple {577#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(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~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;~alive2~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;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0; {577#true} is VALID [2022-02-20 18:27:32,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {577#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~alive1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {577#true} is VALID [2022-02-20 18:27:32,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {577#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {579#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 18:27:32,368 INFO L290 TraceCheckUtils]: 3: Hoare triple {579#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {580#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 18:27:32,368 INFO L290 TraceCheckUtils]: 4: Hoare triple {580#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret32#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;main_~i2~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {581#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 18:27:32,368 INFO L290 TraceCheckUtils]: 5: Hoare triple {581#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {578#false} is VALID [2022-02-20 18:27:32,369 INFO L290 TraceCheckUtils]: 6: Hoare triple {578#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {578#false} is VALID [2022-02-20 18:27:32,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {578#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {578#false} is VALID [2022-02-20 18:27:32,369 INFO L290 TraceCheckUtils]: 8: Hoare triple {578#false} assume !(0 != ~mode1~0 % 256); {578#false} is VALID [2022-02-20 18:27:32,369 INFO L290 TraceCheckUtils]: 9: Hoare triple {578#false} assume !(0 != ~alive1~0 % 256); {578#false} is VALID [2022-02-20 18:27:32,370 INFO L290 TraceCheckUtils]: 10: Hoare triple {578#false} ~mode1~0 := 1; {578#false} is VALID [2022-02-20 18:27:32,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {578#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {578#false} is VALID [2022-02-20 18:27:32,370 INFO L290 TraceCheckUtils]: 12: Hoare triple {578#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {578#false} is VALID [2022-02-20 18:27:32,370 INFO L290 TraceCheckUtils]: 13: Hoare triple {578#false} assume !(node2_~m2~0#1 != ~nomsg~0); {578#false} is VALID [2022-02-20 18:27:32,371 INFO L290 TraceCheckUtils]: 14: Hoare triple {578#false} ~mode2~0 := 0; {578#false} is VALID [2022-02-20 18:27:32,371 INFO L290 TraceCheckUtils]: 15: Hoare triple {578#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {578#false} is VALID [2022-02-20 18:27:32,371 INFO L290 TraceCheckUtils]: 16: Hoare triple {578#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {578#false} is VALID [2022-02-20 18:27:32,371 INFO L290 TraceCheckUtils]: 17: Hoare triple {578#false} assume !(node3_~m3~0#1 != ~nomsg~0); {578#false} is VALID [2022-02-20 18:27:32,371 INFO L290 TraceCheckUtils]: 18: Hoare triple {578#false} ~mode3~0 := 0; {578#false} is VALID [2022-02-20 18:27:32,372 INFO L290 TraceCheckUtils]: 19: Hoare triple {578#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {578#false} is VALID [2022-02-20 18:27:32,372 INFO L290 TraceCheckUtils]: 20: Hoare triple {578#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {578#false} is VALID [2022-02-20 18:27:32,374 INFO L290 TraceCheckUtils]: 21: Hoare triple {578#false} assume !(node4_~m4~0#1 != ~nomsg~0); {578#false} is VALID [2022-02-20 18:27:32,374 INFO L290 TraceCheckUtils]: 22: Hoare triple {578#false} ~mode4~0 := 0; {578#false} is VALID [2022-02-20 18:27:32,375 INFO L290 TraceCheckUtils]: 23: Hoare triple {578#false} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {578#false} is VALID [2022-02-20 18:27:32,375 INFO L290 TraceCheckUtils]: 24: Hoare triple {578#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {578#false} is VALID [2022-02-20 18:27:32,375 INFO L290 TraceCheckUtils]: 25: Hoare triple {578#false} check_#res#1 := check_~tmp~1#1; {578#false} is VALID [2022-02-20 18:27:32,376 INFO L290 TraceCheckUtils]: 26: Hoare triple {578#false} main_#t~ret33#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~c1~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {578#false} is VALID [2022-02-20 18:27:32,377 INFO L290 TraceCheckUtils]: 27: Hoare triple {578#false} assume 0 == assert_~arg#1 % 256; {578#false} is VALID [2022-02-20 18:27:32,377 INFO L290 TraceCheckUtils]: 28: Hoare triple {578#false} assume !false; {578#false} is VALID [2022-02-20 18:27:32,378 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:27:32,378 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:32,378 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808331121] [2022-02-20 18:27:32,378 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808331121] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:32,379 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:32,379 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:27:32,379 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271493848] [2022-02-20 18:27:32,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:32,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-02-20 18:27:32,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:32,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:32,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:32,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:27:32,398 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:32,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:27:32,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:27:32,400 INFO L87 Difference]: Start difference. First operand 95 states and 157 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:32,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:32,651 INFO L93 Difference]: Finished difference Result 164 states and 264 transitions. [2022-02-20 18:27:32,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:27:32,652 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-02-20 18:27:32,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:32,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:32,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 264 transitions. [2022-02-20 18:27:32,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:32,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 264 transitions. [2022-02-20 18:27:32,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 264 transitions. [2022-02-20 18:27:32,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 264 edges. 264 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:32,841 INFO L225 Difference]: With dead ends: 164 [2022-02-20 18:27:32,841 INFO L226 Difference]: Without dead ends: 95 [2022-02-20 18:27:32,842 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:27:32,842 INFO L933 BasicCegarLoop]: 155 mSDtfsCounter, 3 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:27:32,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 593 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:32,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-02-20 18:27:32,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-02-20 18:27:32,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:32,847 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 95 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 94 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:32,848 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 95 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 94 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:32,848 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 95 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 94 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:32,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:32,850 INFO L93 Difference]: Finished difference Result 95 states and 133 transitions. [2022-02-20 18:27:32,850 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 133 transitions. [2022-02-20 18:27:32,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:32,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:32,851 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 94 states have internal predecessors, (133), 0 states have call successors, (0), 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:27:32,852 INFO L87 Difference]: Start difference. First operand has 95 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 94 states have internal predecessors, (133), 0 states have call successors, (0), 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:27:32,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:32,854 INFO L93 Difference]: Finished difference Result 95 states and 133 transitions. [2022-02-20 18:27:32,854 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 133 transitions. [2022-02-20 18:27:32,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:32,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:32,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:32,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:32,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 94 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:32,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 133 transitions. [2022-02-20 18:27:32,864 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 133 transitions. Word has length 29 [2022-02-20 18:27:32,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:32,864 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 133 transitions. [2022-02-20 18:27:32,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:32,865 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 133 transitions. [2022-02-20 18:27:32,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:27:32,866 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:32,866 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:27:32,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:27:32,866 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:32,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:32,867 INFO L85 PathProgramCache]: Analyzing trace with hash 747245012, now seen corresponding path program 1 times [2022-02-20 18:27:32,867 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:32,867 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858520535] [2022-02-20 18:27:32,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:32,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:32,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:32,936 INFO L290 TraceCheckUtils]: 0: Hoare triple {1058#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(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~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;~alive2~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;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0; {1058#true} is VALID [2022-02-20 18:27:32,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {1058#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~alive1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1058#true} is VALID [2022-02-20 18:27:32,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {1058#true} assume 0 == ~r1~0 % 256; {1058#true} is VALID [2022-02-20 18:27:32,937 INFO L290 TraceCheckUtils]: 3: Hoare triple {1058#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {1058#true} is VALID [2022-02-20 18:27:32,937 INFO L290 TraceCheckUtils]: 4: Hoare triple {1058#true} assume ~id1~0 >= 0; {1058#true} is VALID [2022-02-20 18:27:32,937 INFO L290 TraceCheckUtils]: 5: Hoare triple {1058#true} assume 0 == ~st1~0; {1058#true} is VALID [2022-02-20 18:27:32,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {1058#true} assume ~send1~0 == ~id1~0; {1058#true} is VALID [2022-02-20 18:27:32,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {1058#true} assume 0 == ~mode1~0 % 256; {1058#true} is VALID [2022-02-20 18:27:32,938 INFO L290 TraceCheckUtils]: 8: Hoare triple {1058#true} assume ~id2~0 >= 0; {1058#true} is VALID [2022-02-20 18:27:32,938 INFO L290 TraceCheckUtils]: 9: Hoare triple {1058#true} assume 0 == ~st2~0; {1058#true} is VALID [2022-02-20 18:27:32,938 INFO L290 TraceCheckUtils]: 10: Hoare triple {1058#true} assume ~send2~0 == ~id2~0; {1058#true} is VALID [2022-02-20 18:27:32,939 INFO L290 TraceCheckUtils]: 11: Hoare triple {1058#true} assume 0 == ~mode2~0 % 256; {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:32,940 INFO L290 TraceCheckUtils]: 12: Hoare triple {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:32,940 INFO L290 TraceCheckUtils]: 13: Hoare triple {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:32,941 INFO L290 TraceCheckUtils]: 14: Hoare triple {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:32,941 INFO L290 TraceCheckUtils]: 15: Hoare triple {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:32,941 INFO L290 TraceCheckUtils]: 16: Hoare triple {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:32,942 INFO L290 TraceCheckUtils]: 17: Hoare triple {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:32,942 INFO L290 TraceCheckUtils]: 18: Hoare triple {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:32,943 INFO L290 TraceCheckUtils]: 19: Hoare triple {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:32,943 INFO L290 TraceCheckUtils]: 20: Hoare triple {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:32,944 INFO L290 TraceCheckUtils]: 21: Hoare triple {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:32,944 INFO L290 TraceCheckUtils]: 22: Hoare triple {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:32,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:32,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:32,946 INFO L290 TraceCheckUtils]: 25: Hoare triple {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:32,946 INFO L290 TraceCheckUtils]: 26: Hoare triple {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:32,947 INFO L290 TraceCheckUtils]: 27: Hoare triple {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_#t~ret32#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;main_~i2~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:32,947 INFO L290 TraceCheckUtils]: 28: Hoare triple {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:32,948 INFO L290 TraceCheckUtils]: 29: Hoare triple {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:32,948 INFO L290 TraceCheckUtils]: 30: Hoare triple {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:32,949 INFO L290 TraceCheckUtils]: 31: Hoare triple {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:32,949 INFO L290 TraceCheckUtils]: 32: Hoare triple {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~alive1~0 % 256); {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:32,950 INFO L290 TraceCheckUtils]: 33: Hoare triple {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:32,950 INFO L290 TraceCheckUtils]: 34: Hoare triple {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:32,951 INFO L290 TraceCheckUtils]: 35: Hoare triple {1060#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1059#false} is VALID [2022-02-20 18:27:32,951 INFO L290 TraceCheckUtils]: 36: Hoare triple {1059#false} assume !(node2_~m2~0#1 != ~nomsg~0); {1059#false} is VALID [2022-02-20 18:27:32,951 INFO L290 TraceCheckUtils]: 37: Hoare triple {1059#false} ~mode2~0 := 0; {1059#false} is VALID [2022-02-20 18:27:32,951 INFO L290 TraceCheckUtils]: 38: Hoare triple {1059#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1059#false} is VALID [2022-02-20 18:27:32,951 INFO L290 TraceCheckUtils]: 39: Hoare triple {1059#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1059#false} is VALID [2022-02-20 18:27:32,952 INFO L290 TraceCheckUtils]: 40: Hoare triple {1059#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1059#false} is VALID [2022-02-20 18:27:32,952 INFO L290 TraceCheckUtils]: 41: Hoare triple {1059#false} ~mode3~0 := 0; {1059#false} is VALID [2022-02-20 18:27:32,952 INFO L290 TraceCheckUtils]: 42: Hoare triple {1059#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1059#false} is VALID [2022-02-20 18:27:32,952 INFO L290 TraceCheckUtils]: 43: Hoare triple {1059#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1059#false} is VALID [2022-02-20 18:27:32,952 INFO L290 TraceCheckUtils]: 44: Hoare triple {1059#false} assume !(node4_~m4~0#1 != ~nomsg~0); {1059#false} is VALID [2022-02-20 18:27:32,953 INFO L290 TraceCheckUtils]: 45: Hoare triple {1059#false} ~mode4~0 := 0; {1059#false} is VALID [2022-02-20 18:27:32,953 INFO L290 TraceCheckUtils]: 46: Hoare triple {1059#false} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1059#false} is VALID [2022-02-20 18:27:32,953 INFO L290 TraceCheckUtils]: 47: Hoare triple {1059#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {1059#false} is VALID [2022-02-20 18:27:32,953 INFO L290 TraceCheckUtils]: 48: Hoare triple {1059#false} check_#res#1 := check_~tmp~1#1; {1059#false} is VALID [2022-02-20 18:27:32,953 INFO L290 TraceCheckUtils]: 49: Hoare triple {1059#false} main_#t~ret33#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~c1~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1059#false} is VALID [2022-02-20 18:27:32,954 INFO L290 TraceCheckUtils]: 50: Hoare triple {1059#false} assume 0 == assert_~arg#1 % 256; {1059#false} is VALID [2022-02-20 18:27:32,954 INFO L290 TraceCheckUtils]: 51: Hoare triple {1059#false} assume !false; {1059#false} is VALID [2022-02-20 18:27:32,954 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:27:32,955 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:32,955 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858520535] [2022-02-20 18:27:32,955 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858520535] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:32,955 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:32,955 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:27:32,956 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369264717] [2022-02-20 18:27:32,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:32,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 18:27:32,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:32,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:32,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:32,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:27:32,993 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:32,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:27:32,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:27:32,994 INFO L87 Difference]: Start difference. First operand 95 states and 133 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:33,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:33,151 INFO L93 Difference]: Finished difference Result 213 states and 319 transitions. [2022-02-20 18:27:33,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:27:33,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 18:27:33,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:33,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:33,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions. [2022-02-20 18:27:33,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:33,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions. [2022-02-20 18:27:33,157 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 319 transitions. [2022-02-20 18:27:33,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 319 edges. 319 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:33,356 INFO L225 Difference]: With dead ends: 213 [2022-02-20 18:27:33,356 INFO L226 Difference]: Without dead ends: 148 [2022-02-20 18:27:33,357 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:27:33,358 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 87 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 289 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:27:33,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 289 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:33,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-02-20 18:27:33,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2022-02-20 18:27:33,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:33,364 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand has 146 states, 145 states have (on average 1.4758620689655173) internal successors, (214), 145 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:33,364 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand has 146 states, 145 states have (on average 1.4758620689655173) internal successors, (214), 145 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:33,365 INFO L87 Difference]: Start difference. First operand 148 states. Second operand has 146 states, 145 states have (on average 1.4758620689655173) internal successors, (214), 145 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:33,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:33,383 INFO L93 Difference]: Finished difference Result 148 states and 215 transitions. [2022-02-20 18:27:33,383 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 215 transitions. [2022-02-20 18:27:33,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:33,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:33,384 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 145 states have (on average 1.4758620689655173) internal successors, (214), 145 states have internal predecessors, (214), 0 states have call successors, (0), 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 148 states. [2022-02-20 18:27:33,385 INFO L87 Difference]: Start difference. First operand has 146 states, 145 states have (on average 1.4758620689655173) internal successors, (214), 145 states have internal predecessors, (214), 0 states have call successors, (0), 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 148 states. [2022-02-20 18:27:33,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:33,388 INFO L93 Difference]: Finished difference Result 148 states and 215 transitions. [2022-02-20 18:27:33,388 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 215 transitions. [2022-02-20 18:27:33,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:33,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:33,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:33,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:33,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 1.4758620689655173) internal successors, (214), 145 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:33,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 214 transitions. [2022-02-20 18:27:33,396 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 214 transitions. Word has length 52 [2022-02-20 18:27:33,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:33,397 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 214 transitions. [2022-02-20 18:27:33,397 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:33,397 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 214 transitions. [2022-02-20 18:27:33,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:27:33,398 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:33,398 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:27:33,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:27:33,399 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:33,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:33,399 INFO L85 PathProgramCache]: Analyzing trace with hash 396878357, now seen corresponding path program 1 times [2022-02-20 18:27:33,399 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:33,400 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619782689] [2022-02-20 18:27:33,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:33,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:33,491 INFO L290 TraceCheckUtils]: 0: Hoare triple {1750#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(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~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;~alive2~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;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0; {1750#true} is VALID [2022-02-20 18:27:33,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {1750#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~alive1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1750#true} is VALID [2022-02-20 18:27:33,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {1750#true} assume 0 == ~r1~0 % 256; {1750#true} is VALID [2022-02-20 18:27:33,492 INFO L290 TraceCheckUtils]: 3: Hoare triple {1750#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {1750#true} is VALID [2022-02-20 18:27:33,492 INFO L290 TraceCheckUtils]: 4: Hoare triple {1750#true} assume ~id1~0 >= 0; {1750#true} is VALID [2022-02-20 18:27:33,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {1750#true} assume 0 == ~st1~0; {1750#true} is VALID [2022-02-20 18:27:33,493 INFO L290 TraceCheckUtils]: 6: Hoare triple {1750#true} assume ~send1~0 == ~id1~0; {1750#true} is VALID [2022-02-20 18:27:33,493 INFO L290 TraceCheckUtils]: 7: Hoare triple {1750#true} assume 0 == ~mode1~0 % 256; {1750#true} is VALID [2022-02-20 18:27:33,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {1750#true} assume ~id2~0 >= 0; {1750#true} is VALID [2022-02-20 18:27:33,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {1750#true} assume 0 == ~st2~0; {1750#true} is VALID [2022-02-20 18:27:33,495 INFO L290 TraceCheckUtils]: 10: Hoare triple {1750#true} assume ~send2~0 == ~id2~0; {1750#true} is VALID [2022-02-20 18:27:33,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {1750#true} assume 0 == ~mode2~0 % 256; {1750#true} is VALID [2022-02-20 18:27:33,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {1750#true} assume ~id3~0 >= 0; {1750#true} is VALID [2022-02-20 18:27:33,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {1750#true} assume 0 == ~st3~0; {1750#true} is VALID [2022-02-20 18:27:33,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {1750#true} assume ~send3~0 == ~id3~0; {1750#true} is VALID [2022-02-20 18:27:33,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {1750#true} assume 0 == ~mode3~0 % 256; {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:33,505 INFO L290 TraceCheckUtils]: 16: Hoare triple {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:33,505 INFO L290 TraceCheckUtils]: 17: Hoare triple {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:33,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:33,506 INFO L290 TraceCheckUtils]: 19: Hoare triple {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:33,506 INFO L290 TraceCheckUtils]: 20: Hoare triple {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:33,510 INFO L290 TraceCheckUtils]: 21: Hoare triple {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:33,510 INFO L290 TraceCheckUtils]: 22: Hoare triple {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:33,510 INFO L290 TraceCheckUtils]: 23: Hoare triple {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:33,511 INFO L290 TraceCheckUtils]: 24: Hoare triple {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:33,511 INFO L290 TraceCheckUtils]: 25: Hoare triple {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:33,512 INFO L290 TraceCheckUtils]: 26: Hoare triple {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:33,512 INFO L290 TraceCheckUtils]: 27: Hoare triple {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_#t~ret32#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;main_~i2~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:33,513 INFO L290 TraceCheckUtils]: 28: Hoare triple {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:33,513 INFO L290 TraceCheckUtils]: 29: Hoare triple {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:33,513 INFO L290 TraceCheckUtils]: 30: Hoare triple {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:33,514 INFO L290 TraceCheckUtils]: 31: Hoare triple {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:33,514 INFO L290 TraceCheckUtils]: 32: Hoare triple {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~alive1~0 % 256); {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:33,515 INFO L290 TraceCheckUtils]: 33: Hoare triple {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:33,515 INFO L290 TraceCheckUtils]: 34: Hoare triple {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:33,515 INFO L290 TraceCheckUtils]: 35: Hoare triple {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:33,516 INFO L290 TraceCheckUtils]: 36: Hoare triple {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~alive2~0 % 256); {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:33,516 INFO L290 TraceCheckUtils]: 37: Hoare triple {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send2~0 != ~id2~0); {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:33,517 INFO L290 TraceCheckUtils]: 38: Hoare triple {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:33,517 INFO L290 TraceCheckUtils]: 39: Hoare triple {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:33,518 INFO L290 TraceCheckUtils]: 40: Hoare triple {1752#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1751#false} is VALID [2022-02-20 18:27:33,518 INFO L290 TraceCheckUtils]: 41: Hoare triple {1751#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1751#false} is VALID [2022-02-20 18:27:33,518 INFO L290 TraceCheckUtils]: 42: Hoare triple {1751#false} ~mode3~0 := 0; {1751#false} is VALID [2022-02-20 18:27:33,518 INFO L290 TraceCheckUtils]: 43: Hoare triple {1751#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1751#false} is VALID [2022-02-20 18:27:33,518 INFO L290 TraceCheckUtils]: 44: Hoare triple {1751#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1751#false} is VALID [2022-02-20 18:27:33,518 INFO L290 TraceCheckUtils]: 45: Hoare triple {1751#false} assume !(node4_~m4~0#1 != ~nomsg~0); {1751#false} is VALID [2022-02-20 18:27:33,519 INFO L290 TraceCheckUtils]: 46: Hoare triple {1751#false} ~mode4~0 := 0; {1751#false} is VALID [2022-02-20 18:27:33,519 INFO L290 TraceCheckUtils]: 47: Hoare triple {1751#false} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1751#false} is VALID [2022-02-20 18:27:33,519 INFO L290 TraceCheckUtils]: 48: Hoare triple {1751#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {1751#false} is VALID [2022-02-20 18:27:33,519 INFO L290 TraceCheckUtils]: 49: Hoare triple {1751#false} check_#res#1 := check_~tmp~1#1; {1751#false} is VALID [2022-02-20 18:27:33,519 INFO L290 TraceCheckUtils]: 50: Hoare triple {1751#false} main_#t~ret33#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~c1~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1751#false} is VALID [2022-02-20 18:27:33,519 INFO L290 TraceCheckUtils]: 51: Hoare triple {1751#false} assume 0 == assert_~arg#1 % 256; {1751#false} is VALID [2022-02-20 18:27:33,519 INFO L290 TraceCheckUtils]: 52: Hoare triple {1751#false} assume !false; {1751#false} is VALID [2022-02-20 18:27:33,520 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:27:33,520 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:33,520 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619782689] [2022-02-20 18:27:33,520 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619782689] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:33,521 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:33,521 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:27:33,521 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737857626] [2022-02-20 18:27:33,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:33,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2022-02-20 18:27:33,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:33,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:33,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:33,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:27:33,566 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:33,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:27:33,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:27:33,568 INFO L87 Difference]: Start difference. First operand 146 states and 214 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:33,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:33,750 INFO L93 Difference]: Finished difference Result 354 states and 542 transitions. [2022-02-20 18:27:33,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:27:33,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2022-02-20 18:27:33,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:33,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:33,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions. [2022-02-20 18:27:33,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:33,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions. [2022-02-20 18:27:33,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 319 transitions. [2022-02-20 18:27:33,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 319 edges. 319 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:33,990 INFO L225 Difference]: With dead ends: 354 [2022-02-20 18:27:33,990 INFO L226 Difference]: Without dead ends: 238 [2022-02-20 18:27:33,993 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:27:34,000 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 82 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 280 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:27:34,001 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 280 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:34,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-02-20 18:27:34,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2022-02-20 18:27:34,016 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:34,017 INFO L82 GeneralOperation]: Start isEquivalent. First operand 238 states. Second operand has 236 states, 235 states have (on average 1.5106382978723405) internal successors, (355), 235 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:34,017 INFO L74 IsIncluded]: Start isIncluded. First operand 238 states. Second operand has 236 states, 235 states have (on average 1.5106382978723405) internal successors, (355), 235 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:34,018 INFO L87 Difference]: Start difference. First operand 238 states. Second operand has 236 states, 235 states have (on average 1.5106382978723405) internal successors, (355), 235 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:34,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:34,023 INFO L93 Difference]: Finished difference Result 238 states and 356 transitions. [2022-02-20 18:27:34,023 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 356 transitions. [2022-02-20 18:27:34,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:34,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:34,024 INFO L74 IsIncluded]: Start isIncluded. First operand has 236 states, 235 states have (on average 1.5106382978723405) internal successors, (355), 235 states have internal predecessors, (355), 0 states have call successors, (0), 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 238 states. [2022-02-20 18:27:34,025 INFO L87 Difference]: Start difference. First operand has 236 states, 235 states have (on average 1.5106382978723405) internal successors, (355), 235 states have internal predecessors, (355), 0 states have call successors, (0), 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 238 states. [2022-02-20 18:27:34,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:34,030 INFO L93 Difference]: Finished difference Result 238 states and 356 transitions. [2022-02-20 18:27:34,030 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 356 transitions. [2022-02-20 18:27:34,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:34,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:34,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:34,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:34,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 1.5106382978723405) internal successors, (355), 235 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:34,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 355 transitions. [2022-02-20 18:27:34,036 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 355 transitions. Word has length 53 [2022-02-20 18:27:34,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:34,038 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 355 transitions. [2022-02-20 18:27:34,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:34,039 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 355 transitions. [2022-02-20 18:27:34,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:27:34,039 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:34,039 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:27:34,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:27:34,040 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:34,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:34,041 INFO L85 PathProgramCache]: Analyzing trace with hash -778312060, now seen corresponding path program 1 times [2022-02-20 18:27:34,041 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:34,041 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603071642] [2022-02-20 18:27:34,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:34,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:34,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {2883#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(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~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;~alive2~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;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0; {2883#true} is VALID [2022-02-20 18:27:34,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {2883#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~alive1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {2883#true} is VALID [2022-02-20 18:27:34,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {2883#true} assume 0 == ~r1~0 % 256; {2883#true} is VALID [2022-02-20 18:27:34,107 INFO L290 TraceCheckUtils]: 3: Hoare triple {2883#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {2883#true} is VALID [2022-02-20 18:27:34,107 INFO L290 TraceCheckUtils]: 4: Hoare triple {2883#true} assume ~id1~0 >= 0; {2883#true} is VALID [2022-02-20 18:27:34,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {2883#true} assume 0 == ~st1~0; {2883#true} is VALID [2022-02-20 18:27:34,108 INFO L290 TraceCheckUtils]: 6: Hoare triple {2883#true} assume ~send1~0 == ~id1~0; {2883#true} is VALID [2022-02-20 18:27:34,108 INFO L290 TraceCheckUtils]: 7: Hoare triple {2883#true} assume 0 == ~mode1~0 % 256; {2883#true} is VALID [2022-02-20 18:27:34,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {2883#true} assume ~id2~0 >= 0; {2883#true} is VALID [2022-02-20 18:27:34,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {2883#true} assume 0 == ~st2~0; {2883#true} is VALID [2022-02-20 18:27:34,108 INFO L290 TraceCheckUtils]: 10: Hoare triple {2883#true} assume ~send2~0 == ~id2~0; {2883#true} is VALID [2022-02-20 18:27:34,108 INFO L290 TraceCheckUtils]: 11: Hoare triple {2883#true} assume 0 == ~mode2~0 % 256; {2883#true} is VALID [2022-02-20 18:27:34,109 INFO L290 TraceCheckUtils]: 12: Hoare triple {2883#true} assume ~id3~0 >= 0; {2883#true} is VALID [2022-02-20 18:27:34,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {2883#true} assume 0 == ~st3~0; {2883#true} is VALID [2022-02-20 18:27:34,109 INFO L290 TraceCheckUtils]: 14: Hoare triple {2883#true} assume ~send3~0 == ~id3~0; {2883#true} is VALID [2022-02-20 18:27:34,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {2883#true} assume 0 == ~mode3~0 % 256; {2883#true} is VALID [2022-02-20 18:27:34,109 INFO L290 TraceCheckUtils]: 16: Hoare triple {2883#true} assume ~id4~0 >= 0; {2883#true} is VALID [2022-02-20 18:27:34,109 INFO L290 TraceCheckUtils]: 17: Hoare triple {2883#true} assume 0 == ~st4~0; {2883#true} is VALID [2022-02-20 18:27:34,109 INFO L290 TraceCheckUtils]: 18: Hoare triple {2883#true} assume ~send4~0 == ~id4~0; {2883#true} is VALID [2022-02-20 18:27:34,110 INFO L290 TraceCheckUtils]: 19: Hoare triple {2883#true} assume 0 == ~mode4~0 % 256; {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:34,110 INFO L290 TraceCheckUtils]: 20: Hoare triple {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:34,111 INFO L290 TraceCheckUtils]: 21: Hoare triple {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:34,111 INFO L290 TraceCheckUtils]: 22: Hoare triple {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:34,112 INFO L290 TraceCheckUtils]: 23: Hoare triple {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:34,112 INFO L290 TraceCheckUtils]: 24: Hoare triple {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:34,112 INFO L290 TraceCheckUtils]: 25: Hoare triple {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:34,113 INFO L290 TraceCheckUtils]: 26: Hoare triple {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:34,113 INFO L290 TraceCheckUtils]: 27: Hoare triple {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_#t~ret32#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;main_~i2~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:34,114 INFO L290 TraceCheckUtils]: 28: Hoare triple {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:34,114 INFO L290 TraceCheckUtils]: 29: Hoare triple {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:34,114 INFO L290 TraceCheckUtils]: 30: Hoare triple {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:34,115 INFO L290 TraceCheckUtils]: 31: Hoare triple {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:34,115 INFO L290 TraceCheckUtils]: 32: Hoare triple {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~alive1~0 % 256); {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:34,116 INFO L290 TraceCheckUtils]: 33: Hoare triple {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode1~0 := 1; {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:34,116 INFO L290 TraceCheckUtils]: 34: Hoare triple {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:34,116 INFO L290 TraceCheckUtils]: 35: Hoare triple {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:34,117 INFO L290 TraceCheckUtils]: 36: Hoare triple {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~alive2~0 % 256); {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:34,117 INFO L290 TraceCheckUtils]: 37: Hoare triple {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send2~0 != ~id2~0); {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:34,118 INFO L290 TraceCheckUtils]: 38: Hoare triple {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode2~0 := 1; {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:34,118 INFO L290 TraceCheckUtils]: 39: Hoare triple {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:34,118 INFO L290 TraceCheckUtils]: 40: Hoare triple {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:34,119 INFO L290 TraceCheckUtils]: 41: Hoare triple {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~alive3~0 % 256); {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:34,119 INFO L290 TraceCheckUtils]: 42: Hoare triple {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send3~0 != ~id3~0); {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:34,120 INFO L290 TraceCheckUtils]: 43: Hoare triple {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode3~0 := 1; {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:34,120 INFO L290 TraceCheckUtils]: 44: Hoare triple {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:34,120 INFO L290 TraceCheckUtils]: 45: Hoare triple {2885#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2884#false} is VALID [2022-02-20 18:27:34,121 INFO L290 TraceCheckUtils]: 46: Hoare triple {2884#false} assume !(node4_~m4~0#1 != ~nomsg~0); {2884#false} is VALID [2022-02-20 18:27:34,121 INFO L290 TraceCheckUtils]: 47: Hoare triple {2884#false} ~mode4~0 := 0; {2884#false} is VALID [2022-02-20 18:27:34,121 INFO L290 TraceCheckUtils]: 48: Hoare triple {2884#false} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {2884#false} is VALID [2022-02-20 18:27:34,121 INFO L290 TraceCheckUtils]: 49: Hoare triple {2884#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {2884#false} is VALID [2022-02-20 18:27:34,121 INFO L290 TraceCheckUtils]: 50: Hoare triple {2884#false} check_#res#1 := check_~tmp~1#1; {2884#false} is VALID [2022-02-20 18:27:34,121 INFO L290 TraceCheckUtils]: 51: Hoare triple {2884#false} main_#t~ret33#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~c1~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {2884#false} is VALID [2022-02-20 18:27:34,121 INFO L290 TraceCheckUtils]: 52: Hoare triple {2884#false} assume 0 == assert_~arg#1 % 256; {2884#false} is VALID [2022-02-20 18:27:34,122 INFO L290 TraceCheckUtils]: 53: Hoare triple {2884#false} assume !false; {2884#false} is VALID [2022-02-20 18:27:34,122 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:27:34,122 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:34,122 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603071642] [2022-02-20 18:27:34,122 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603071642] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:34,122 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:34,122 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:27:34,123 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992339865] [2022-02-20 18:27:34,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:34,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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 54 [2022-02-20 18:27:34,123 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:34,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:27:34,166 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:27:34,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:27:34,167 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:34,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:27:34,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:27:34,167 INFO L87 Difference]: Start difference. First operand 236 states and 355 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:27:34,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:34,354 INFO L93 Difference]: Finished difference Result 600 states and 925 transitions. [2022-02-20 18:27:34,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:27:34,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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 54 [2022-02-20 18:27:34,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:34,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:27:34,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions. [2022-02-20 18:27:34,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:27:34,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions. [2022-02-20 18:27:34,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 319 transitions. [2022-02-20 18:27:34,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 319 edges. 319 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:34,595 INFO L225 Difference]: With dead ends: 600 [2022-02-20 18:27:34,595 INFO L226 Difference]: Without dead ends: 394 [2022-02-20 18:27:34,596 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:27:34,597 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 77 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 271 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:27:34,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 271 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:34,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-02-20 18:27:34,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 392. [2022-02-20 18:27:34,609 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:34,609 INFO L82 GeneralOperation]: Start isEquivalent. First operand 394 states. Second operand has 392 states, 391 states have (on average 1.5217391304347827) internal successors, (595), 391 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:34,610 INFO L74 IsIncluded]: Start isIncluded. First operand 394 states. Second operand has 392 states, 391 states have (on average 1.5217391304347827) internal successors, (595), 391 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:34,611 INFO L87 Difference]: Start difference. First operand 394 states. Second operand has 392 states, 391 states have (on average 1.5217391304347827) internal successors, (595), 391 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:34,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:34,620 INFO L93 Difference]: Finished difference Result 394 states and 596 transitions. [2022-02-20 18:27:34,620 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 596 transitions. [2022-02-20 18:27:34,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:34,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:34,621 INFO L74 IsIncluded]: Start isIncluded. First operand has 392 states, 391 states have (on average 1.5217391304347827) internal successors, (595), 391 states have internal predecessors, (595), 0 states have call successors, (0), 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 394 states. [2022-02-20 18:27:34,622 INFO L87 Difference]: Start difference. First operand has 392 states, 391 states have (on average 1.5217391304347827) internal successors, (595), 391 states have internal predecessors, (595), 0 states have call successors, (0), 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 394 states. [2022-02-20 18:27:34,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:34,630 INFO L93 Difference]: Finished difference Result 394 states and 596 transitions. [2022-02-20 18:27:34,630 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 596 transitions. [2022-02-20 18:27:34,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:34,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:34,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:34,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:34,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 391 states have (on average 1.5217391304347827) internal successors, (595), 391 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:34,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 595 transitions. [2022-02-20 18:27:34,648 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 595 transitions. Word has length 54 [2022-02-20 18:27:34,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:34,649 INFO L470 AbstractCegarLoop]: Abstraction has 392 states and 595 transitions. [2022-02-20 18:27:34,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:27:34,649 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 595 transitions. [2022-02-20 18:27:34,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-20 18:27:34,650 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:34,650 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:27:34,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:27:34,650 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:34,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:34,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1214154885, now seen corresponding path program 1 times [2022-02-20 18:27:34,651 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:34,651 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898619207] [2022-02-20 18:27:34,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:34,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:34,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:34,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {4790#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(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~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;~alive2~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;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0; {4790#true} is VALID [2022-02-20 18:27:34,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {4790#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~alive1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {4790#true} is VALID [2022-02-20 18:27:34,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {4790#true} assume 0 == ~r1~0 % 256; {4790#true} is VALID [2022-02-20 18:27:34,737 INFO L290 TraceCheckUtils]: 3: Hoare triple {4790#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {4790#true} is VALID [2022-02-20 18:27:34,737 INFO L290 TraceCheckUtils]: 4: Hoare triple {4790#true} assume ~id1~0 >= 0; {4790#true} is VALID [2022-02-20 18:27:34,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {4790#true} assume 0 == ~st1~0; {4792#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:34,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {4792#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {4792#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:34,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {4792#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {4792#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:34,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {4792#(<= ~st1~0 0)} assume ~id2~0 >= 0; {4792#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:34,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {4792#(<= ~st1~0 0)} assume 0 == ~st2~0; {4793#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:34,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {4793#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {4793#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:34,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {4793#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {4793#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:34,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {4793#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {4793#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:34,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {4793#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {4794#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:34,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {4794#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {4794#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:34,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {4794#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {4794#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:34,743 INFO L290 TraceCheckUtils]: 16: Hoare triple {4794#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {4794#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:34,743 INFO L290 TraceCheckUtils]: 17: Hoare triple {4794#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:34,744 INFO L290 TraceCheckUtils]: 18: Hoare triple {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:34,744 INFO L290 TraceCheckUtils]: 19: Hoare triple {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:34,744 INFO L290 TraceCheckUtils]: 20: Hoare triple {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:34,745 INFO L290 TraceCheckUtils]: 21: Hoare triple {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:34,745 INFO L290 TraceCheckUtils]: 22: Hoare triple {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:34,745 INFO L290 TraceCheckUtils]: 23: Hoare triple {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:34,747 INFO L290 TraceCheckUtils]: 24: Hoare triple {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:34,747 INFO L290 TraceCheckUtils]: 25: Hoare triple {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:34,753 INFO L290 TraceCheckUtils]: 26: Hoare triple {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:34,753 INFO L290 TraceCheckUtils]: 27: Hoare triple {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main_#t~ret32#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;main_~i2~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:34,754 INFO L290 TraceCheckUtils]: 28: Hoare triple {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:34,754 INFO L290 TraceCheckUtils]: 29: Hoare triple {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:34,755 INFO L290 TraceCheckUtils]: 30: Hoare triple {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:34,755 INFO L290 TraceCheckUtils]: 31: Hoare triple {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:34,755 INFO L290 TraceCheckUtils]: 32: Hoare triple {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~alive1~0 % 256); {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:34,756 INFO L290 TraceCheckUtils]: 33: Hoare triple {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:34,756 INFO L290 TraceCheckUtils]: 34: Hoare triple {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:34,756 INFO L290 TraceCheckUtils]: 35: Hoare triple {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:34,757 INFO L290 TraceCheckUtils]: 36: Hoare triple {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~alive2~0 % 256); {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:34,757 INFO L290 TraceCheckUtils]: 37: Hoare triple {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~id2~0); {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:34,757 INFO L290 TraceCheckUtils]: 38: Hoare triple {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:34,758 INFO L290 TraceCheckUtils]: 39: Hoare triple {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:34,758 INFO L290 TraceCheckUtils]: 40: Hoare triple {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:34,758 INFO L290 TraceCheckUtils]: 41: Hoare triple {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~alive3~0 % 256); {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:34,759 INFO L290 TraceCheckUtils]: 42: Hoare triple {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~id3~0); {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:34,759 INFO L290 TraceCheckUtils]: 43: Hoare triple {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:34,760 INFO L290 TraceCheckUtils]: 44: Hoare triple {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:34,760 INFO L290 TraceCheckUtils]: 45: Hoare triple {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:34,760 INFO L290 TraceCheckUtils]: 46: Hoare triple {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~alive4~0 % 256); {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:34,761 INFO L290 TraceCheckUtils]: 47: Hoare triple {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~id4~0); {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:34,761 INFO L290 TraceCheckUtils]: 48: Hoare triple {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode4~0 := 1; {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:34,761 INFO L290 TraceCheckUtils]: 49: Hoare triple {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:34,762 INFO L290 TraceCheckUtils]: 50: Hoare triple {4795#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {4791#false} is VALID [2022-02-20 18:27:34,762 INFO L290 TraceCheckUtils]: 51: Hoare triple {4791#false} check_#res#1 := check_~tmp~1#1; {4791#false} is VALID [2022-02-20 18:27:34,762 INFO L290 TraceCheckUtils]: 52: Hoare triple {4791#false} main_#t~ret33#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~c1~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {4791#false} is VALID [2022-02-20 18:27:34,762 INFO L290 TraceCheckUtils]: 53: Hoare triple {4791#false} assume 0 == assert_~arg#1 % 256; {4791#false} is VALID [2022-02-20 18:27:34,762 INFO L290 TraceCheckUtils]: 54: Hoare triple {4791#false} assume !false; {4791#false} is VALID [2022-02-20 18:27:34,763 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:27:34,763 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:34,763 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898619207] [2022-02-20 18:27:34,763 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898619207] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:34,763 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:34,763 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:27:34,763 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104866704] [2022-02-20 18:27:34,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:34,764 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 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 55 [2022-02-20 18:27:34,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:34,764 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 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:27:34,801 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:27:34,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:27:34,801 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:34,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:27:34,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:27:34,802 INFO L87 Difference]: Start difference. First operand 392 states and 595 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 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:27:35,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:35,854 INFO L93 Difference]: Finished difference Result 2202 states and 3420 transitions. [2022-02-20 18:27:35,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:27:35,854 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 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 55 [2022-02-20 18:27:35,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:35,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 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:27:35,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 648 transitions. [2022-02-20 18:27:35,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 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:27:35,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 648 transitions. [2022-02-20 18:27:35,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 648 transitions. [2022-02-20 18:27:36,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 648 edges. 648 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:36,379 INFO L225 Difference]: With dead ends: 2202 [2022-02-20 18:27:36,380 INFO L226 Difference]: Without dead ends: 1840 [2022-02-20 18:27:36,380 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:27:36,381 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 746 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:27:36,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [746 Valid, 1037 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:36,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2022-02-20 18:27:36,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 752. [2022-02-20 18:27:36,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:36,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1840 states. Second operand has 752 states, 751 states have (on average 1.521970705725699) internal successors, (1143), 751 states have internal predecessors, (1143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:36,535 INFO L74 IsIncluded]: Start isIncluded. First operand 1840 states. Second operand has 752 states, 751 states have (on average 1.521970705725699) internal successors, (1143), 751 states have internal predecessors, (1143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:36,536 INFO L87 Difference]: Start difference. First operand 1840 states. Second operand has 752 states, 751 states have (on average 1.521970705725699) internal successors, (1143), 751 states have internal predecessors, (1143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:36,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:36,645 INFO L93 Difference]: Finished difference Result 1840 states and 2839 transitions. [2022-02-20 18:27:36,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2839 transitions. [2022-02-20 18:27:36,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:36,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:36,649 INFO L74 IsIncluded]: Start isIncluded. First operand has 752 states, 751 states have (on average 1.521970705725699) internal successors, (1143), 751 states have internal predecessors, (1143), 0 states have call successors, (0), 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 1840 states. [2022-02-20 18:27:36,650 INFO L87 Difference]: Start difference. First operand has 752 states, 751 states have (on average 1.521970705725699) internal successors, (1143), 751 states have internal predecessors, (1143), 0 states have call successors, (0), 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 1840 states. [2022-02-20 18:27:36,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:36,757 INFO L93 Difference]: Finished difference Result 1840 states and 2839 transitions. [2022-02-20 18:27:36,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2839 transitions. [2022-02-20 18:27:36,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:36,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:36,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:36,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:36,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 752 states, 751 states have (on average 1.521970705725699) internal successors, (1143), 751 states have internal predecessors, (1143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:36,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1143 transitions. [2022-02-20 18:27:36,783 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1143 transitions. Word has length 55 [2022-02-20 18:27:36,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:36,783 INFO L470 AbstractCegarLoop]: Abstraction has 752 states and 1143 transitions. [2022-02-20 18:27:36,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 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:27:36,784 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1143 transitions. [2022-02-20 18:27:36,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-20 18:27:36,784 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:36,784 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:27:36,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:27:36,784 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:36,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:36,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1399227554, now seen corresponding path program 1 times [2022-02-20 18:27:36,785 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:36,785 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988971239] [2022-02-20 18:27:36,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:36,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:36,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:36,863 INFO L290 TraceCheckUtils]: 0: Hoare triple {11825#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(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~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;~alive2~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;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0; {11825#true} is VALID [2022-02-20 18:27:36,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {11825#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~alive1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {11825#true} is VALID [2022-02-20 18:27:36,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {11825#true} assume 0 == ~r1~0 % 256; {11825#true} is VALID [2022-02-20 18:27:36,864 INFO L290 TraceCheckUtils]: 3: Hoare triple {11825#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:36,864 INFO L290 TraceCheckUtils]: 4: Hoare triple {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 >= 0; {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:36,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st1~0; {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:36,865 INFO L290 TraceCheckUtils]: 6: Hoare triple {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send1~0 == ~id1~0; {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:36,866 INFO L290 TraceCheckUtils]: 7: Hoare triple {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode1~0 % 256; {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:36,866 INFO L290 TraceCheckUtils]: 8: Hoare triple {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 >= 0; {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:36,867 INFO L290 TraceCheckUtils]: 9: Hoare triple {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st2~0; {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:36,867 INFO L290 TraceCheckUtils]: 10: Hoare triple {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send2~0 == ~id2~0; {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:36,868 INFO L290 TraceCheckUtils]: 11: Hoare triple {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode2~0 % 256; {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:36,868 INFO L290 TraceCheckUtils]: 12: Hoare triple {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 >= 0; {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:36,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st3~0; {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:36,869 INFO L290 TraceCheckUtils]: 14: Hoare triple {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send3~0 == ~id3~0; {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:36,869 INFO L290 TraceCheckUtils]: 15: Hoare triple {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode3~0 % 256; {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:36,870 INFO L290 TraceCheckUtils]: 16: Hoare triple {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id4~0 >= 0; {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:36,870 INFO L290 TraceCheckUtils]: 17: Hoare triple {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st4~0; {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:36,871 INFO L290 TraceCheckUtils]: 18: Hoare triple {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send4~0 == ~id4~0; {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:36,871 INFO L290 TraceCheckUtils]: 19: Hoare triple {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode4~0 % 256; {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:36,871 INFO L290 TraceCheckUtils]: 20: Hoare triple {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id2~0; {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:36,872 INFO L290 TraceCheckUtils]: 21: Hoare triple {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id3~0; {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:36,872 INFO L290 TraceCheckUtils]: 22: Hoare triple {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id4~0; {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:36,873 INFO L290 TraceCheckUtils]: 23: Hoare triple {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id3~0; {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:36,873 INFO L290 TraceCheckUtils]: 24: Hoare triple {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id4~0; {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:36,873 INFO L290 TraceCheckUtils]: 25: Hoare triple {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:36,874 INFO L290 TraceCheckUtils]: 26: Hoare triple {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} init_#res#1 := init_~tmp~0#1; {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:36,874 INFO L290 TraceCheckUtils]: 27: Hoare triple {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} main_#t~ret32#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;main_~i2~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:36,875 INFO L290 TraceCheckUtils]: 28: Hoare triple {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !(0 == assume_abort_if_not_~cond#1); {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:36,875 INFO L290 TraceCheckUtils]: 29: Hoare triple {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:36,876 INFO L290 TraceCheckUtils]: 30: Hoare triple {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:36,876 INFO L290 TraceCheckUtils]: 31: Hoare triple {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !(0 != ~mode1~0 % 256); {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:27:36,877 INFO L290 TraceCheckUtils]: 32: Hoare triple {11827#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* 256 (div ~alive1~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !(0 != ~alive1~0 % 256); {11828#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:27:36,877 INFO L290 TraceCheckUtils]: 33: Hoare triple {11828#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} ~mode1~0 := 1; {11828#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:27:36,878 INFO L290 TraceCheckUtils]: 34: Hoare triple {11828#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {11828#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:27:36,879 INFO L290 TraceCheckUtils]: 35: Hoare triple {11828#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} assume !(0 != ~mode2~0 % 256); {11828#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:27:36,879 INFO L290 TraceCheckUtils]: 36: Hoare triple {11828#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} assume !(0 != ~alive2~0 % 256); {11829#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:27:36,880 INFO L290 TraceCheckUtils]: 37: Hoare triple {11829#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} assume !(~send2~0 != ~id2~0); {11829#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:27:36,880 INFO L290 TraceCheckUtils]: 38: Hoare triple {11829#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} ~mode2~0 := 1; {11829#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:27:36,880 INFO L290 TraceCheckUtils]: 39: Hoare triple {11829#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {11829#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:27:36,881 INFO L290 TraceCheckUtils]: 40: Hoare triple {11829#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} assume !(0 != ~mode3~0 % 256); {11829#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:27:36,881 INFO L290 TraceCheckUtils]: 41: Hoare triple {11829#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} assume !(0 != ~alive3~0 % 256); {11830#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:27:36,881 INFO L290 TraceCheckUtils]: 42: Hoare triple {11830#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} assume !(~send3~0 != ~id3~0); {11830#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:27:36,882 INFO L290 TraceCheckUtils]: 43: Hoare triple {11830#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} ~mode3~0 := 1; {11830#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:27:36,882 INFO L290 TraceCheckUtils]: 44: Hoare triple {11830#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {11830#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:27:36,882 INFO L290 TraceCheckUtils]: 45: Hoare triple {11830#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} assume !(0 != ~mode4~0 % 256); {11830#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:27:36,883 INFO L290 TraceCheckUtils]: 46: Hoare triple {11830#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} assume !(0 != ~alive4~0 % 256); {11826#false} is VALID [2022-02-20 18:27:36,883 INFO L290 TraceCheckUtils]: 47: Hoare triple {11826#false} assume !(~send4~0 != ~id4~0); {11826#false} is VALID [2022-02-20 18:27:36,883 INFO L290 TraceCheckUtils]: 48: Hoare triple {11826#false} ~mode4~0 := 1; {11826#false} is VALID [2022-02-20 18:27:36,883 INFO L290 TraceCheckUtils]: 49: Hoare triple {11826#false} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {11826#false} is VALID [2022-02-20 18:27:36,883 INFO L290 TraceCheckUtils]: 50: Hoare triple {11826#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {11826#false} is VALID [2022-02-20 18:27:36,883 INFO L290 TraceCheckUtils]: 51: Hoare triple {11826#false} assume ~r1~0 % 256 < 4;check_~tmp~1#1 := 1; {11826#false} is VALID [2022-02-20 18:27:36,884 INFO L290 TraceCheckUtils]: 52: Hoare triple {11826#false} check_#res#1 := check_~tmp~1#1; {11826#false} is VALID [2022-02-20 18:27:36,884 INFO L290 TraceCheckUtils]: 53: Hoare triple {11826#false} main_#t~ret33#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~c1~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {11826#false} is VALID [2022-02-20 18:27:36,884 INFO L290 TraceCheckUtils]: 54: Hoare triple {11826#false} assume 0 == assert_~arg#1 % 256; {11826#false} is VALID [2022-02-20 18:27:36,884 INFO L290 TraceCheckUtils]: 55: Hoare triple {11826#false} assume !false; {11826#false} is VALID [2022-02-20 18:27:36,884 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:27:36,884 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:36,885 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988971239] [2022-02-20 18:27:36,885 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988971239] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:36,885 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:36,885 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:27:36,885 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421238390] [2022-02-20 18:27:36,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:36,886 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2022-02-20 18:27:36,886 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:36,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:36,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:36,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:27:36,933 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:36,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:27:36,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:27:36,934 INFO L87 Difference]: Start difference. First operand 752 states and 1143 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:38,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:38,557 INFO L93 Difference]: Finished difference Result 3376 states and 5139 transitions. [2022-02-20 18:27:38,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:27:38,557 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2022-02-20 18:27:38,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:38,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:38,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 488 transitions. [2022-02-20 18:27:38,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:38,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 488 transitions. [2022-02-20 18:27:38,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 488 transitions. [2022-02-20 18:27:38,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 488 edges. 488 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:39,128 INFO L225 Difference]: With dead ends: 3376 [2022-02-20 18:27:39,128 INFO L226 Difference]: Without dead ends: 2654 [2022-02-20 18:27:39,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:27:39,130 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 427 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:27:39,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [427 Valid, 490 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:27:39,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2022-02-20 18:27:39,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 2648. [2022-02-20 18:27:39,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:39,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2654 states. Second operand has 2648 states, 2647 states have (on average 1.5137891953154514) internal successors, (4007), 2647 states have internal predecessors, (4007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:39,845 INFO L74 IsIncluded]: Start isIncluded. First operand 2654 states. Second operand has 2648 states, 2647 states have (on average 1.5137891953154514) internal successors, (4007), 2647 states have internal predecessors, (4007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:39,848 INFO L87 Difference]: Start difference. First operand 2654 states. Second operand has 2648 states, 2647 states have (on average 1.5137891953154514) internal successors, (4007), 2647 states have internal predecessors, (4007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:40,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:40,058 INFO L93 Difference]: Finished difference Result 2654 states and 4010 transitions. [2022-02-20 18:27:40,058 INFO L276 IsEmpty]: Start isEmpty. Operand 2654 states and 4010 transitions. [2022-02-20 18:27:40,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:40,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:40,065 INFO L74 IsIncluded]: Start isIncluded. First operand has 2648 states, 2647 states have (on average 1.5137891953154514) internal successors, (4007), 2647 states have internal predecessors, (4007), 0 states have call successors, (0), 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 2654 states. [2022-02-20 18:27:40,067 INFO L87 Difference]: Start difference. First operand has 2648 states, 2647 states have (on average 1.5137891953154514) internal successors, (4007), 2647 states have internal predecessors, (4007), 0 states have call successors, (0), 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 2654 states. [2022-02-20 18:27:40,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:40,278 INFO L93 Difference]: Finished difference Result 2654 states and 4010 transitions. [2022-02-20 18:27:40,278 INFO L276 IsEmpty]: Start isEmpty. Operand 2654 states and 4010 transitions. [2022-02-20 18:27:40,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:40,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:40,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:40,281 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:40,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2648 states, 2647 states have (on average 1.5137891953154514) internal successors, (4007), 2647 states have internal predecessors, (4007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:40,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2648 states to 2648 states and 4007 transitions. [2022-02-20 18:27:40,530 INFO L78 Accepts]: Start accepts. Automaton has 2648 states and 4007 transitions. Word has length 56 [2022-02-20 18:27:40,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:40,530 INFO L470 AbstractCegarLoop]: Abstraction has 2648 states and 4007 transitions. [2022-02-20 18:27:40,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:40,530 INFO L276 IsEmpty]: Start isEmpty. Operand 2648 states and 4007 transitions. [2022-02-20 18:27:40,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 18:27:40,531 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:40,531 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:27:40,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:27:40,532 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:40,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:40,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1806755418, now seen corresponding path program 1 times [2022-02-20 18:27:40,532 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:40,532 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252241910] [2022-02-20 18:27:40,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:40,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:40,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:40,611 INFO L290 TraceCheckUtils]: 0: Hoare triple {24031#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(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~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;~alive2~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;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0; {24031#true} is VALID [2022-02-20 18:27:40,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {24031#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~alive1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {24031#true} is VALID [2022-02-20 18:27:40,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {24031#true} assume 0 == ~r1~0 % 256; {24031#true} is VALID [2022-02-20 18:27:40,612 INFO L290 TraceCheckUtils]: 3: Hoare triple {24031#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {24031#true} is VALID [2022-02-20 18:27:40,612 INFO L290 TraceCheckUtils]: 4: Hoare triple {24031#true} assume ~id1~0 >= 0; {24031#true} is VALID [2022-02-20 18:27:40,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {24031#true} assume 0 == ~st1~0; {24031#true} is VALID [2022-02-20 18:27:40,612 INFO L290 TraceCheckUtils]: 6: Hoare triple {24031#true} assume ~send1~0 == ~id1~0; {24031#true} is VALID [2022-02-20 18:27:40,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {24031#true} assume 0 == ~mode1~0 % 256; {24031#true} is VALID [2022-02-20 18:27:40,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {24031#true} assume ~id2~0 >= 0; {24031#true} is VALID [2022-02-20 18:27:40,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {24031#true} assume 0 == ~st2~0; {24031#true} is VALID [2022-02-20 18:27:40,612 INFO L290 TraceCheckUtils]: 10: Hoare triple {24031#true} assume ~send2~0 == ~id2~0; {24031#true} is VALID [2022-02-20 18:27:40,613 INFO L290 TraceCheckUtils]: 11: Hoare triple {24031#true} assume 0 == ~mode2~0 % 256; {24031#true} is VALID [2022-02-20 18:27:40,613 INFO L290 TraceCheckUtils]: 12: Hoare triple {24031#true} assume ~id3~0 >= 0; {24031#true} is VALID [2022-02-20 18:27:40,613 INFO L290 TraceCheckUtils]: 13: Hoare triple {24031#true} assume 0 == ~st3~0; {24031#true} is VALID [2022-02-20 18:27:40,613 INFO L290 TraceCheckUtils]: 14: Hoare triple {24031#true} assume ~send3~0 == ~id3~0; {24031#true} is VALID [2022-02-20 18:27:40,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {24031#true} assume 0 == ~mode3~0 % 256; {24031#true} is VALID [2022-02-20 18:27:40,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {24031#true} assume ~id4~0 >= 0; {24031#true} is VALID [2022-02-20 18:27:40,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {24031#true} assume 0 == ~st4~0; {24031#true} is VALID [2022-02-20 18:27:40,614 INFO L290 TraceCheckUtils]: 18: Hoare triple {24031#true} assume ~send4~0 == ~id4~0; {24031#true} is VALID [2022-02-20 18:27:40,614 INFO L290 TraceCheckUtils]: 19: Hoare triple {24031#true} assume 0 == ~mode4~0 % 256; {24031#true} is VALID [2022-02-20 18:27:40,614 INFO L290 TraceCheckUtils]: 20: Hoare triple {24031#true} assume ~id1~0 != ~id2~0; {24031#true} is VALID [2022-02-20 18:27:40,614 INFO L290 TraceCheckUtils]: 21: Hoare triple {24031#true} assume ~id1~0 != ~id3~0; {24031#true} is VALID [2022-02-20 18:27:40,614 INFO L290 TraceCheckUtils]: 22: Hoare triple {24031#true} assume ~id1~0 != ~id4~0; {24031#true} is VALID [2022-02-20 18:27:40,614 INFO L290 TraceCheckUtils]: 23: Hoare triple {24031#true} assume ~id2~0 != ~id3~0; {24031#true} is VALID [2022-02-20 18:27:40,614 INFO L290 TraceCheckUtils]: 24: Hoare triple {24031#true} assume ~id2~0 != ~id4~0; {24031#true} is VALID [2022-02-20 18:27:40,614 INFO L290 TraceCheckUtils]: 25: Hoare triple {24031#true} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {24031#true} is VALID [2022-02-20 18:27:40,615 INFO L290 TraceCheckUtils]: 26: Hoare triple {24031#true} init_#res#1 := init_~tmp~0#1; {24031#true} is VALID [2022-02-20 18:27:40,615 INFO L290 TraceCheckUtils]: 27: Hoare triple {24031#true} main_#t~ret32#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;main_~i2~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {24031#true} is VALID [2022-02-20 18:27:40,615 INFO L290 TraceCheckUtils]: 28: Hoare triple {24031#true} assume !(0 == assume_abort_if_not_~cond#1); {24031#true} is VALID [2022-02-20 18:27:40,615 INFO L290 TraceCheckUtils]: 29: Hoare triple {24031#true} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {24031#true} is VALID [2022-02-20 18:27:40,615 INFO L290 TraceCheckUtils]: 30: Hoare triple {24031#true} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {24031#true} is VALID [2022-02-20 18:27:40,615 INFO L290 TraceCheckUtils]: 31: Hoare triple {24031#true} assume !(0 != ~mode1~0 % 256); {24031#true} is VALID [2022-02-20 18:27:40,615 INFO L290 TraceCheckUtils]: 32: Hoare triple {24031#true} assume !(0 != ~alive1~0 % 256); {24031#true} is VALID [2022-02-20 18:27:40,616 INFO L290 TraceCheckUtils]: 33: Hoare triple {24031#true} ~mode1~0 := 1; {24031#true} is VALID [2022-02-20 18:27:40,616 INFO L290 TraceCheckUtils]: 34: Hoare triple {24031#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {24031#true} is VALID [2022-02-20 18:27:40,616 INFO L290 TraceCheckUtils]: 35: Hoare triple {24031#true} assume !(0 != ~mode2~0 % 256); {24031#true} is VALID [2022-02-20 18:27:40,616 INFO L290 TraceCheckUtils]: 36: Hoare triple {24031#true} assume !(0 != ~alive2~0 % 256); {24031#true} is VALID [2022-02-20 18:27:40,616 INFO L290 TraceCheckUtils]: 37: Hoare triple {24031#true} assume !(~send2~0 != ~id2~0); {24031#true} is VALID [2022-02-20 18:27:40,616 INFO L290 TraceCheckUtils]: 38: Hoare triple {24031#true} ~mode2~0 := 1; {24031#true} is VALID [2022-02-20 18:27:40,616 INFO L290 TraceCheckUtils]: 39: Hoare triple {24031#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {24031#true} is VALID [2022-02-20 18:27:40,616 INFO L290 TraceCheckUtils]: 40: Hoare triple {24031#true} assume !(0 != ~mode3~0 % 256); {24031#true} is VALID [2022-02-20 18:27:40,617 INFO L290 TraceCheckUtils]: 41: Hoare triple {24031#true} assume 0 != ~alive3~0 % 256; {24031#true} is VALID [2022-02-20 18:27:40,617 INFO L290 TraceCheckUtils]: 42: Hoare triple {24031#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {24031#true} is VALID [2022-02-20 18:27:40,617 INFO L290 TraceCheckUtils]: 43: Hoare triple {24031#true} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1; {24031#true} is VALID [2022-02-20 18:27:40,617 INFO L290 TraceCheckUtils]: 44: Hoare triple {24031#true} ~mode3~0 := 1; {24031#true} is VALID [2022-02-20 18:27:40,617 INFO L290 TraceCheckUtils]: 45: Hoare triple {24031#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {24031#true} is VALID [2022-02-20 18:27:40,617 INFO L290 TraceCheckUtils]: 46: Hoare triple {24031#true} assume !(0 != ~mode4~0 % 256); {24031#true} is VALID [2022-02-20 18:27:40,617 INFO L290 TraceCheckUtils]: 47: Hoare triple {24031#true} assume !(0 != ~alive4~0 % 256); {24031#true} is VALID [2022-02-20 18:27:40,618 INFO L290 TraceCheckUtils]: 48: Hoare triple {24031#true} assume !(~send4~0 != ~id4~0); {24031#true} is VALID [2022-02-20 18:27:40,618 INFO L290 TraceCheckUtils]: 49: Hoare triple {24031#true} ~mode4~0 := 1; {24031#true} is VALID [2022-02-20 18:27:40,618 INFO L290 TraceCheckUtils]: 50: Hoare triple {24031#true} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {24031#true} is VALID [2022-02-20 18:27:40,618 INFO L290 TraceCheckUtils]: 51: Hoare triple {24031#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {24031#true} is VALID [2022-02-20 18:27:40,618 INFO L290 TraceCheckUtils]: 52: Hoare triple {24031#true} assume ~r1~0 % 256 < 4;check_~tmp~1#1 := 1; {24033#(= |ULTIMATE.start_check_~tmp~1#1| 1)} is VALID [2022-02-20 18:27:40,619 INFO L290 TraceCheckUtils]: 53: Hoare triple {24033#(= |ULTIMATE.start_check_~tmp~1#1| 1)} check_#res#1 := check_~tmp~1#1; {24034#(= 1 |ULTIMATE.start_check_#res#1|)} is VALID [2022-02-20 18:27:40,619 INFO L290 TraceCheckUtils]: 54: Hoare triple {24034#(= 1 |ULTIMATE.start_check_#res#1|)} main_#t~ret33#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~c1~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {24035#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} is VALID [2022-02-20 18:27:40,620 INFO L290 TraceCheckUtils]: 55: Hoare triple {24035#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} assume 0 == assert_~arg#1 % 256; {24032#false} is VALID [2022-02-20 18:27:40,620 INFO L290 TraceCheckUtils]: 56: Hoare triple {24032#false} assume !false; {24032#false} is VALID [2022-02-20 18:27:40,620 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:27:40,620 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:40,620 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252241910] [2022-02-20 18:27:40,620 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252241910] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:40,620 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:40,620 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:27:40,621 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199759505] [2022-02-20 18:27:40,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:40,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-02-20 18:27:40,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:40,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:40,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:40,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:27:40,652 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:40,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:27:40,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:27:40,652 INFO L87 Difference]: Start difference. First operand 2648 states and 4007 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:44,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:44,111 INFO L93 Difference]: Finished difference Result 5522 states and 8240 transitions. [2022-02-20 18:27:44,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:27:44,111 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-02-20 18:27:44,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:44,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:44,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 240 transitions. [2022-02-20 18:27:44,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:44,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 240 transitions. [2022-02-20 18:27:44,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 240 transitions. [2022-02-20 18:27:44,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 240 edges. 240 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:45,102 INFO L225 Difference]: With dead ends: 5522 [2022-02-20 18:27:45,102 INFO L226 Difference]: Without dead ends: 5520 [2022-02-20 18:27:45,103 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:27:45,105 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 288 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:27:45,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [288 Valid, 592 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:45,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5520 states. [2022-02-20 18:27:46,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5520 to 2840. [2022-02-20 18:27:46,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:46,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5520 states. Second operand has 2840 states, 2839 states have (on average 1.4790419161676647) internal successors, (4199), 2839 states have internal predecessors, (4199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:46,657 INFO L74 IsIncluded]: Start isIncluded. First operand 5520 states. Second operand has 2840 states, 2839 states have (on average 1.4790419161676647) internal successors, (4199), 2839 states have internal predecessors, (4199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:46,661 INFO L87 Difference]: Start difference. First operand 5520 states. Second operand has 2840 states, 2839 states have (on average 1.4790419161676647) internal successors, (4199), 2839 states have internal predecessors, (4199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:47,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:47,540 INFO L93 Difference]: Finished difference Result 5520 states and 8175 transitions. [2022-02-20 18:27:47,540 INFO L276 IsEmpty]: Start isEmpty. Operand 5520 states and 8175 transitions. [2022-02-20 18:27:47,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:47,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:47,549 INFO L74 IsIncluded]: Start isIncluded. First operand has 2840 states, 2839 states have (on average 1.4790419161676647) internal successors, (4199), 2839 states have internal predecessors, (4199), 0 states have call successors, (0), 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 5520 states. [2022-02-20 18:27:47,551 INFO L87 Difference]: Start difference. First operand has 2840 states, 2839 states have (on average 1.4790419161676647) internal successors, (4199), 2839 states have internal predecessors, (4199), 0 states have call successors, (0), 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 5520 states. [2022-02-20 18:27:48,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:48,444 INFO L93 Difference]: Finished difference Result 5520 states and 8175 transitions. [2022-02-20 18:27:48,444 INFO L276 IsEmpty]: Start isEmpty. Operand 5520 states and 8175 transitions. [2022-02-20 18:27:48,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:48,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:48,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:48,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:48,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2840 states, 2839 states have (on average 1.4790419161676647) internal successors, (4199), 2839 states have internal predecessors, (4199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:48,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2840 states to 2840 states and 4199 transitions. [2022-02-20 18:27:48,735 INFO L78 Accepts]: Start accepts. Automaton has 2840 states and 4199 transitions. Word has length 57 [2022-02-20 18:27:48,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:48,736 INFO L470 AbstractCegarLoop]: Abstraction has 2840 states and 4199 transitions. [2022-02-20 18:27:48,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:48,736 INFO L276 IsEmpty]: Start isEmpty. Operand 2840 states and 4199 transitions. [2022-02-20 18:27:48,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 18:27:48,737 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:48,737 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:27:48,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:27:48,737 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:48,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:48,738 INFO L85 PathProgramCache]: Analyzing trace with hash 227421697, now seen corresponding path program 1 times [2022-02-20 18:27:48,738 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:48,738 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018577043] [2022-02-20 18:27:48,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:48,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:48,780 INFO L290 TraceCheckUtils]: 0: Hoare triple {44793#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(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~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;~alive2~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;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0; {44793#true} is VALID [2022-02-20 18:27:48,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {44793#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~alive1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {44793#true} is VALID [2022-02-20 18:27:48,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {44793#true} assume 0 == ~r1~0 % 256; {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,781 INFO L290 TraceCheckUtils]: 3: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,781 INFO L290 TraceCheckUtils]: 4: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 >= 0; {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,781 INFO L290 TraceCheckUtils]: 6: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 == ~id1~0; {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,782 INFO L290 TraceCheckUtils]: 8: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 >= 0; {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,782 INFO L290 TraceCheckUtils]: 9: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,783 INFO L290 TraceCheckUtils]: 10: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 == ~id2~0; {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,783 INFO L290 TraceCheckUtils]: 11: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,783 INFO L290 TraceCheckUtils]: 12: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 >= 0; {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,784 INFO L290 TraceCheckUtils]: 14: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 == ~id3~0; {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,784 INFO L290 TraceCheckUtils]: 15: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,784 INFO L290 TraceCheckUtils]: 16: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id4~0 >= 0; {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,785 INFO L290 TraceCheckUtils]: 17: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st4~0; {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,785 INFO L290 TraceCheckUtils]: 18: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send4~0 == ~id4~0; {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,785 INFO L290 TraceCheckUtils]: 19: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode4~0 % 256; {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,785 INFO L290 TraceCheckUtils]: 20: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id2~0; {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,786 INFO L290 TraceCheckUtils]: 21: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id3~0; {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,786 INFO L290 TraceCheckUtils]: 22: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id4~0; {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,786 INFO L290 TraceCheckUtils]: 23: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id3~0; {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,787 INFO L290 TraceCheckUtils]: 24: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id4~0; {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,787 INFO L290 TraceCheckUtils]: 25: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,787 INFO L290 TraceCheckUtils]: 26: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} init_#res#1 := init_~tmp~0#1; {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,788 INFO L290 TraceCheckUtils]: 27: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} main_#t~ret32#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;main_~i2~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,788 INFO L290 TraceCheckUtils]: 28: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == assume_abort_if_not_~cond#1); {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,788 INFO L290 TraceCheckUtils]: 29: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,788 INFO L290 TraceCheckUtils]: 30: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,789 INFO L290 TraceCheckUtils]: 31: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode1~0 % 256); {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,789 INFO L290 TraceCheckUtils]: 32: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~alive1~0 % 256); {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,789 INFO L290 TraceCheckUtils]: 33: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~mode1~0 := 1; {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,790 INFO L290 TraceCheckUtils]: 34: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,790 INFO L290 TraceCheckUtils]: 35: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode2~0 % 256); {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,790 INFO L290 TraceCheckUtils]: 36: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~alive2~0 % 256); {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,790 INFO L290 TraceCheckUtils]: 37: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~send2~0 != ~id2~0); {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,791 INFO L290 TraceCheckUtils]: 38: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~mode2~0 := 1; {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,791 INFO L290 TraceCheckUtils]: 39: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,791 INFO L290 TraceCheckUtils]: 40: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode3~0 % 256); {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,792 INFO L290 TraceCheckUtils]: 41: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != ~alive3~0 % 256; {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,792 INFO L290 TraceCheckUtils]: 42: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,792 INFO L290 TraceCheckUtils]: 43: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1; {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,792 INFO L290 TraceCheckUtils]: 44: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~mode3~0 := 1; {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,793 INFO L290 TraceCheckUtils]: 45: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,793 INFO L290 TraceCheckUtils]: 46: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode4~0 % 256); {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,793 INFO L290 TraceCheckUtils]: 47: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~alive4~0 % 256); {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,794 INFO L290 TraceCheckUtils]: 48: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~send4~0 != ~id4~0); {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,794 INFO L290 TraceCheckUtils]: 49: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~mode4~0 := 1; {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,794 INFO L290 TraceCheckUtils]: 50: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,794 INFO L290 TraceCheckUtils]: 51: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:27:48,795 INFO L290 TraceCheckUtils]: 52: Hoare triple {44795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~r1~0 % 256 < 4); {44794#false} is VALID [2022-02-20 18:27:48,795 INFO L290 TraceCheckUtils]: 53: Hoare triple {44794#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);check_~tmp~1#1 := 0; {44794#false} is VALID [2022-02-20 18:27:48,795 INFO L290 TraceCheckUtils]: 54: Hoare triple {44794#false} check_#res#1 := check_~tmp~1#1; {44794#false} is VALID [2022-02-20 18:27:48,795 INFO L290 TraceCheckUtils]: 55: Hoare triple {44794#false} main_#t~ret33#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~c1~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {44794#false} is VALID [2022-02-20 18:27:48,795 INFO L290 TraceCheckUtils]: 56: Hoare triple {44794#false} assume 0 == assert_~arg#1 % 256; {44794#false} is VALID [2022-02-20 18:27:48,796 INFO L290 TraceCheckUtils]: 57: Hoare triple {44794#false} assume !false; {44794#false} is VALID [2022-02-20 18:27:48,796 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:27:48,796 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:48,796 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018577043] [2022-02-20 18:27:48,796 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018577043] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:48,796 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:48,796 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:27:48,797 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698361080] [2022-02-20 18:27:48,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:48,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-02-20 18:27:48,797 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:48,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:48,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:48,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:27:48,835 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:48,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:27:48,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:27:48,836 INFO L87 Difference]: Start difference. First operand 2840 states and 4199 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:53,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:53,515 INFO L93 Difference]: Finished difference Result 7692 states and 11321 transitions. [2022-02-20 18:27:53,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:27:53,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-02-20 18:27:53,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:53,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:53,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 328 transitions. [2022-02-20 18:27:53,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:53,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 328 transitions. [2022-02-20 18:27:53,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 328 transitions. [2022-02-20 18:27:53,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 328 edges. 328 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:54,399 INFO L225 Difference]: With dead ends: 7692 [2022-02-20 18:27:54,399 INFO L226 Difference]: Without dead ends: 4882 [2022-02-20 18:27:54,402 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:27:54,402 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 67 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:27:54,402 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 231 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:54,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4882 states. [2022-02-20 18:27:57,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4882 to 4824. [2022-02-20 18:27:57,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:57,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4882 states. Second operand has 4824 states, 4823 states have (on average 1.4478540327596932) internal successors, (6983), 4823 states have internal predecessors, (6983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:57,326 INFO L74 IsIncluded]: Start isIncluded. First operand 4882 states. Second operand has 4824 states, 4823 states have (on average 1.4478540327596932) internal successors, (6983), 4823 states have internal predecessors, (6983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:57,330 INFO L87 Difference]: Start difference. First operand 4882 states. Second operand has 4824 states, 4823 states have (on average 1.4478540327596932) internal successors, (6983), 4823 states have internal predecessors, (6983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:58,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:58,030 INFO L93 Difference]: Finished difference Result 4882 states and 7040 transitions. [2022-02-20 18:27:58,030 INFO L276 IsEmpty]: Start isEmpty. Operand 4882 states and 7040 transitions. [2022-02-20 18:27:58,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:58,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:58,039 INFO L74 IsIncluded]: Start isIncluded. First operand has 4824 states, 4823 states have (on average 1.4478540327596932) internal successors, (6983), 4823 states have internal predecessors, (6983), 0 states have call successors, (0), 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 4882 states. [2022-02-20 18:27:58,043 INFO L87 Difference]: Start difference. First operand has 4824 states, 4823 states have (on average 1.4478540327596932) internal successors, (6983), 4823 states have internal predecessors, (6983), 0 states have call successors, (0), 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 4882 states. [2022-02-20 18:27:58,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:58,777 INFO L93 Difference]: Finished difference Result 4882 states and 7040 transitions. [2022-02-20 18:27:58,777 INFO L276 IsEmpty]: Start isEmpty. Operand 4882 states and 7040 transitions. [2022-02-20 18:27:58,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:58,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:58,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:58,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:58,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4824 states, 4823 states have (on average 1.4478540327596932) internal successors, (6983), 4823 states have internal predecessors, (6983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:59,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4824 states to 4824 states and 6983 transitions. [2022-02-20 18:27:59,614 INFO L78 Accepts]: Start accepts. Automaton has 4824 states and 6983 transitions. Word has length 58 [2022-02-20 18:27:59,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:59,615 INFO L470 AbstractCegarLoop]: Abstraction has 4824 states and 6983 transitions. [2022-02-20 18:27:59,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:59,615 INFO L276 IsEmpty]: Start isEmpty. Operand 4824 states and 6983 transitions. [2022-02-20 18:27:59,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 18:27:59,616 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:59,616 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:27:59,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:27:59,616 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:59,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:59,617 INFO L85 PathProgramCache]: Analyzing trace with hash -2122531684, now seen corresponding path program 1 times [2022-02-20 18:27:59,617 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:59,617 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936316371] [2022-02-20 18:27:59,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:59,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:59,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:59,673 INFO L290 TraceCheckUtils]: 0: Hoare triple {69144#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(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~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;~alive2~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;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0; {69144#true} is VALID [2022-02-20 18:27:59,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {69144#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~alive1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {69144#true} is VALID [2022-02-20 18:27:59,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {69144#true} assume 0 == ~r1~0 % 256; {69144#true} is VALID [2022-02-20 18:27:59,673 INFO L290 TraceCheckUtils]: 3: Hoare triple {69144#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {69144#true} is VALID [2022-02-20 18:27:59,673 INFO L290 TraceCheckUtils]: 4: Hoare triple {69144#true} assume ~id1~0 >= 0; {69144#true} is VALID [2022-02-20 18:27:59,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {69144#true} assume 0 == ~st1~0; {69144#true} is VALID [2022-02-20 18:27:59,674 INFO L290 TraceCheckUtils]: 6: Hoare triple {69144#true} assume ~send1~0 == ~id1~0; {69144#true} is VALID [2022-02-20 18:27:59,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {69144#true} assume 0 == ~mode1~0 % 256; {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:59,674 INFO L290 TraceCheckUtils]: 8: Hoare triple {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:59,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:59,675 INFO L290 TraceCheckUtils]: 10: Hoare triple {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:59,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:59,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:59,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:59,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:59,677 INFO L290 TraceCheckUtils]: 15: Hoare triple {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:59,677 INFO L290 TraceCheckUtils]: 16: Hoare triple {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:59,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:59,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:59,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:59,679 INFO L290 TraceCheckUtils]: 20: Hoare triple {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:59,679 INFO L290 TraceCheckUtils]: 21: Hoare triple {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:59,679 INFO L290 TraceCheckUtils]: 22: Hoare triple {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:59,680 INFO L290 TraceCheckUtils]: 23: Hoare triple {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:59,680 INFO L290 TraceCheckUtils]: 24: Hoare triple {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:59,680 INFO L290 TraceCheckUtils]: 25: Hoare triple {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:59,681 INFO L290 TraceCheckUtils]: 26: Hoare triple {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:59,681 INFO L290 TraceCheckUtils]: 27: Hoare triple {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main_#t~ret32#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;main_~i2~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:59,682 INFO L290 TraceCheckUtils]: 28: Hoare triple {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:59,682 INFO L290 TraceCheckUtils]: 29: Hoare triple {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:59,682 INFO L290 TraceCheckUtils]: 30: Hoare triple {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:59,683 INFO L290 TraceCheckUtils]: 31: Hoare triple {69146#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256; {69145#false} is VALID [2022-02-20 18:27:59,683 INFO L290 TraceCheckUtils]: 32: Hoare triple {69145#false} assume !(255 == ~r1~0 % 256); {69145#false} is VALID [2022-02-20 18:27:59,683 INFO L290 TraceCheckUtils]: 33: Hoare triple {69145#false} ~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {69145#false} is VALID [2022-02-20 18:27:59,683 INFO L290 TraceCheckUtils]: 34: Hoare triple {69145#false} assume !(node1_~m1~0#1 != ~nomsg~0); {69145#false} is VALID [2022-02-20 18:27:59,683 INFO L290 TraceCheckUtils]: 35: Hoare triple {69145#false} ~mode1~0 := 0; {69145#false} is VALID [2022-02-20 18:27:59,684 INFO L290 TraceCheckUtils]: 36: Hoare triple {69145#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {69145#false} is VALID [2022-02-20 18:27:59,684 INFO L290 TraceCheckUtils]: 37: Hoare triple {69145#false} assume !(0 != ~mode2~0 % 256); {69145#false} is VALID [2022-02-20 18:27:59,684 INFO L290 TraceCheckUtils]: 38: Hoare triple {69145#false} assume !(0 != ~alive2~0 % 256); {69145#false} is VALID [2022-02-20 18:27:59,684 INFO L290 TraceCheckUtils]: 39: Hoare triple {69145#false} assume !(~send2~0 != ~id2~0); {69145#false} is VALID [2022-02-20 18:27:59,684 INFO L290 TraceCheckUtils]: 40: Hoare triple {69145#false} ~mode2~0 := 1; {69145#false} is VALID [2022-02-20 18:27:59,684 INFO L290 TraceCheckUtils]: 41: Hoare triple {69145#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {69145#false} is VALID [2022-02-20 18:27:59,684 INFO L290 TraceCheckUtils]: 42: Hoare triple {69145#false} assume !(0 != ~mode3~0 % 256); {69145#false} is VALID [2022-02-20 18:27:59,684 INFO L290 TraceCheckUtils]: 43: Hoare triple {69145#false} assume !(0 != ~alive3~0 % 256); {69145#false} is VALID [2022-02-20 18:27:59,685 INFO L290 TraceCheckUtils]: 44: Hoare triple {69145#false} assume !(~send3~0 != ~id3~0); {69145#false} is VALID [2022-02-20 18:27:59,685 INFO L290 TraceCheckUtils]: 45: Hoare triple {69145#false} ~mode3~0 := 1; {69145#false} is VALID [2022-02-20 18:27:59,685 INFO L290 TraceCheckUtils]: 46: Hoare triple {69145#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {69145#false} is VALID [2022-02-20 18:27:59,685 INFO L290 TraceCheckUtils]: 47: Hoare triple {69145#false} assume !(0 != ~mode4~0 % 256); {69145#false} is VALID [2022-02-20 18:27:59,685 INFO L290 TraceCheckUtils]: 48: Hoare triple {69145#false} assume !(0 != ~alive4~0 % 256); {69145#false} is VALID [2022-02-20 18:27:59,685 INFO L290 TraceCheckUtils]: 49: Hoare triple {69145#false} assume !(~send4~0 != ~id4~0); {69145#false} is VALID [2022-02-20 18:27:59,685 INFO L290 TraceCheckUtils]: 50: Hoare triple {69145#false} ~mode4~0 := 1; {69145#false} is VALID [2022-02-20 18:27:59,685 INFO L290 TraceCheckUtils]: 51: Hoare triple {69145#false} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {69145#false} is VALID [2022-02-20 18:27:59,686 INFO L290 TraceCheckUtils]: 52: Hoare triple {69145#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {69145#false} is VALID [2022-02-20 18:27:59,686 INFO L290 TraceCheckUtils]: 53: Hoare triple {69145#false} assume !(~r1~0 % 256 < 4); {69145#false} is VALID [2022-02-20 18:27:59,686 INFO L290 TraceCheckUtils]: 54: Hoare triple {69145#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);check_~tmp~1#1 := 0; {69145#false} is VALID [2022-02-20 18:27:59,686 INFO L290 TraceCheckUtils]: 55: Hoare triple {69145#false} check_#res#1 := check_~tmp~1#1; {69145#false} is VALID [2022-02-20 18:27:59,686 INFO L290 TraceCheckUtils]: 56: Hoare triple {69145#false} main_#t~ret33#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~c1~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {69145#false} is VALID [2022-02-20 18:27:59,687 INFO L290 TraceCheckUtils]: 57: Hoare triple {69145#false} assume 0 == assert_~arg#1 % 256; {69145#false} is VALID [2022-02-20 18:27:59,687 INFO L290 TraceCheckUtils]: 58: Hoare triple {69145#false} assume !false; {69145#false} is VALID [2022-02-20 18:27:59,687 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:27:59,687 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:59,688 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936316371] [2022-02-20 18:27:59,688 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936316371] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:59,688 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:59,688 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:27:59,688 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118455959] [2022-02-20 18:27:59,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:59,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-02-20 18:27:59,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:59,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:59,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:59,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:27:59,736 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:59,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:27:59,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:27:59,736 INFO L87 Difference]: Start difference. First operand 4824 states and 6983 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:06,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:06,370 INFO L93 Difference]: Finished difference Result 9743 states and 14173 transitions. [2022-02-20 18:28:06,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:28:06,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-02-20 18:28:06,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:06,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:06,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-02-20 18:28:06,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:06,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-02-20 18:28:06,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 321 transitions. [2022-02-20 18:28:06,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 321 edges. 321 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:08,148 INFO L225 Difference]: With dead ends: 9743 [2022-02-20 18:28:08,148 INFO L226 Difference]: Without dead ends: 6932 [2022-02-20 18:28:08,151 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:08,151 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 88 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:28:08,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 310 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:08,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6932 states. [2022-02-20 18:28:11,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6932 to 6930. [2022-02-20 18:28:11,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:11,928 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6932 states. Second operand has 6930 states, 6929 states have (on average 1.4341174772694472) internal successors, (9937), 6929 states have internal predecessors, (9937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:11,933 INFO L74 IsIncluded]: Start isIncluded. First operand 6932 states. Second operand has 6930 states, 6929 states have (on average 1.4341174772694472) internal successors, (9937), 6929 states have internal predecessors, (9937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:11,939 INFO L87 Difference]: Start difference. First operand 6932 states. Second operand has 6930 states, 6929 states have (on average 1.4341174772694472) internal successors, (9937), 6929 states have internal predecessors, (9937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:13,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:13,415 INFO L93 Difference]: Finished difference Result 6932 states and 9938 transitions. [2022-02-20 18:28:13,415 INFO L276 IsEmpty]: Start isEmpty. Operand 6932 states and 9938 transitions. [2022-02-20 18:28:13,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:13,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:13,427 INFO L74 IsIncluded]: Start isIncluded. First operand has 6930 states, 6929 states have (on average 1.4341174772694472) internal successors, (9937), 6929 states have internal predecessors, (9937), 0 states have call successors, (0), 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 6932 states. [2022-02-20 18:28:13,431 INFO L87 Difference]: Start difference. First operand has 6930 states, 6929 states have (on average 1.4341174772694472) internal successors, (9937), 6929 states have internal predecessors, (9937), 0 states have call successors, (0), 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 6932 states. [2022-02-20 18:28:15,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:15,021 INFO L93 Difference]: Finished difference Result 6932 states and 9938 transitions. [2022-02-20 18:28:15,021 INFO L276 IsEmpty]: Start isEmpty. Operand 6932 states and 9938 transitions. [2022-02-20 18:28:15,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:15,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:15,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:15,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:15,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6930 states, 6929 states have (on average 1.4341174772694472) internal successors, (9937), 6929 states have internal predecessors, (9937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:16,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6930 states to 6930 states and 9937 transitions. [2022-02-20 18:28:16,875 INFO L78 Accepts]: Start accepts. Automaton has 6930 states and 9937 transitions. Word has length 59 [2022-02-20 18:28:16,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:16,875 INFO L470 AbstractCegarLoop]: Abstraction has 6930 states and 9937 transitions. [2022-02-20 18:28:16,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:16,876 INFO L276 IsEmpty]: Start isEmpty. Operand 6930 states and 9937 transitions. [2022-02-20 18:28:16,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-20 18:28:16,878 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:16,878 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:28:16,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:28:16,878 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:16,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:16,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1504297558, now seen corresponding path program 1 times [2022-02-20 18:28:16,879 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:16,879 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853666743] [2022-02-20 18:28:16,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:16,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:16,931 INFO L290 TraceCheckUtils]: 0: Hoare triple {102650#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(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~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;~alive2~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;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0; {102650#true} is VALID [2022-02-20 18:28:16,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {102650#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~alive1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {102650#true} is VALID [2022-02-20 18:28:16,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {102650#true} assume 0 == ~r1~0 % 256; {102650#true} is VALID [2022-02-20 18:28:16,932 INFO L290 TraceCheckUtils]: 3: Hoare triple {102650#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {102650#true} is VALID [2022-02-20 18:28:16,932 INFO L290 TraceCheckUtils]: 4: Hoare triple {102650#true} assume ~id1~0 >= 0; {102650#true} is VALID [2022-02-20 18:28:16,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {102650#true} assume 0 == ~st1~0; {102650#true} is VALID [2022-02-20 18:28:16,932 INFO L290 TraceCheckUtils]: 6: Hoare triple {102650#true} assume ~send1~0 == ~id1~0; {102650#true} is VALID [2022-02-20 18:28:16,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {102650#true} assume 0 == ~mode1~0 % 256; {102650#true} is VALID [2022-02-20 18:28:16,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {102650#true} assume ~id2~0 >= 0; {102650#true} is VALID [2022-02-20 18:28:16,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {102650#true} assume 0 == ~st2~0; {102650#true} is VALID [2022-02-20 18:28:16,932 INFO L290 TraceCheckUtils]: 10: Hoare triple {102650#true} assume ~send2~0 == ~id2~0; {102650#true} is VALID [2022-02-20 18:28:16,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {102650#true} assume 0 == ~mode2~0 % 256; {102650#true} is VALID [2022-02-20 18:28:16,932 INFO L290 TraceCheckUtils]: 12: Hoare triple {102650#true} assume ~id3~0 >= 0; {102650#true} is VALID [2022-02-20 18:28:16,932 INFO L290 TraceCheckUtils]: 13: Hoare triple {102650#true} assume 0 == ~st3~0; {102650#true} is VALID [2022-02-20 18:28:16,933 INFO L290 TraceCheckUtils]: 14: Hoare triple {102650#true} assume ~send3~0 == ~id3~0; {102650#true} is VALID [2022-02-20 18:28:16,933 INFO L290 TraceCheckUtils]: 15: Hoare triple {102650#true} assume 0 == ~mode3~0 % 256; {102650#true} is VALID [2022-02-20 18:28:16,933 INFO L290 TraceCheckUtils]: 16: Hoare triple {102650#true} assume ~id4~0 >= 0; {102650#true} is VALID [2022-02-20 18:28:16,933 INFO L290 TraceCheckUtils]: 17: Hoare triple {102650#true} assume 0 == ~st4~0; {102650#true} is VALID [2022-02-20 18:28:16,933 INFO L290 TraceCheckUtils]: 18: Hoare triple {102650#true} assume ~send4~0 == ~id4~0; {102650#true} is VALID [2022-02-20 18:28:16,933 INFO L290 TraceCheckUtils]: 19: Hoare triple {102650#true} assume 0 == ~mode4~0 % 256; {102650#true} is VALID [2022-02-20 18:28:16,933 INFO L290 TraceCheckUtils]: 20: Hoare triple {102650#true} assume ~id1~0 != ~id2~0; {102650#true} is VALID [2022-02-20 18:28:16,933 INFO L290 TraceCheckUtils]: 21: Hoare triple {102650#true} assume ~id1~0 != ~id3~0; {102650#true} is VALID [2022-02-20 18:28:16,933 INFO L290 TraceCheckUtils]: 22: Hoare triple {102650#true} assume ~id1~0 != ~id4~0; {102650#true} is VALID [2022-02-20 18:28:16,933 INFO L290 TraceCheckUtils]: 23: Hoare triple {102650#true} assume ~id2~0 != ~id3~0; {102650#true} is VALID [2022-02-20 18:28:16,933 INFO L290 TraceCheckUtils]: 24: Hoare triple {102650#true} assume ~id2~0 != ~id4~0; {102650#true} is VALID [2022-02-20 18:28:16,933 INFO L290 TraceCheckUtils]: 25: Hoare triple {102650#true} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {102650#true} is VALID [2022-02-20 18:28:16,933 INFO L290 TraceCheckUtils]: 26: Hoare triple {102650#true} init_#res#1 := init_~tmp~0#1; {102650#true} is VALID [2022-02-20 18:28:16,933 INFO L290 TraceCheckUtils]: 27: Hoare triple {102650#true} main_#t~ret32#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;main_~i2~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {102650#true} is VALID [2022-02-20 18:28:16,933 INFO L290 TraceCheckUtils]: 28: Hoare triple {102650#true} assume !(0 == assume_abort_if_not_~cond#1); {102650#true} is VALID [2022-02-20 18:28:16,933 INFO L290 TraceCheckUtils]: 29: Hoare triple {102650#true} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {102650#true} is VALID [2022-02-20 18:28:16,934 INFO L290 TraceCheckUtils]: 30: Hoare triple {102650#true} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {102650#true} is VALID [2022-02-20 18:28:16,934 INFO L290 TraceCheckUtils]: 31: Hoare triple {102650#true} assume !(0 != ~mode1~0 % 256); {102650#true} is VALID [2022-02-20 18:28:16,934 INFO L290 TraceCheckUtils]: 32: Hoare triple {102650#true} assume !(0 != ~alive1~0 % 256); {102650#true} is VALID [2022-02-20 18:28:16,934 INFO L290 TraceCheckUtils]: 33: Hoare triple {102650#true} ~mode1~0 := 1; {102650#true} is VALID [2022-02-20 18:28:16,934 INFO L290 TraceCheckUtils]: 34: Hoare triple {102650#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {102650#true} is VALID [2022-02-20 18:28:16,934 INFO L290 TraceCheckUtils]: 35: Hoare triple {102650#true} assume !(0 != ~mode2~0 % 256); {102650#true} is VALID [2022-02-20 18:28:16,935 INFO L290 TraceCheckUtils]: 36: Hoare triple {102650#true} assume !(0 != ~alive2~0 % 256); {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:28:16,935 INFO L290 TraceCheckUtils]: 37: Hoare triple {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(~send2~0 != ~id2~0); {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:28:16,935 INFO L290 TraceCheckUtils]: 38: Hoare triple {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} ~mode2~0 := 1; {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:28:16,936 INFO L290 TraceCheckUtils]: 39: Hoare triple {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:28:16,936 INFO L290 TraceCheckUtils]: 40: Hoare triple {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(0 != ~mode3~0 % 256); {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:28:16,936 INFO L290 TraceCheckUtils]: 41: Hoare triple {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume 0 != ~alive3~0 % 256; {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:28:16,937 INFO L290 TraceCheckUtils]: 42: Hoare triple {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:28:16,937 INFO L290 TraceCheckUtils]: 43: Hoare triple {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1; {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:28:16,937 INFO L290 TraceCheckUtils]: 44: Hoare triple {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} ~mode3~0 := 1; {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:28:16,938 INFO L290 TraceCheckUtils]: 45: Hoare triple {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:28:16,938 INFO L290 TraceCheckUtils]: 46: Hoare triple {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(0 != ~mode4~0 % 256); {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:28:16,938 INFO L290 TraceCheckUtils]: 47: Hoare triple {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(0 != ~alive4~0 % 256); {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:28:16,939 INFO L290 TraceCheckUtils]: 48: Hoare triple {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(~send4~0 != ~id4~0); {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:28:16,939 INFO L290 TraceCheckUtils]: 49: Hoare triple {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} ~mode4~0 := 1; {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:28:16,940 INFO L290 TraceCheckUtils]: 50: Hoare triple {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:28:16,940 INFO L290 TraceCheckUtils]: 51: Hoare triple {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:28:16,940 INFO L290 TraceCheckUtils]: 52: Hoare triple {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume ~r1~0 % 256 < 4;check_~tmp~1#1 := 1; {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:28:16,941 INFO L290 TraceCheckUtils]: 53: Hoare triple {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} check_#res#1 := check_~tmp~1#1; {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:28:16,941 INFO L290 TraceCheckUtils]: 54: Hoare triple {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} main_#t~ret33#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~c1~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:28:16,941 INFO L290 TraceCheckUtils]: 55: Hoare triple {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(0 == assert_~arg#1 % 256); {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:28:16,942 INFO L290 TraceCheckUtils]: 56: Hoare triple {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume { :end_inline_assert } true; {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:28:16,942 INFO L290 TraceCheckUtils]: 57: Hoare triple {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:28:16,942 INFO L290 TraceCheckUtils]: 58: Hoare triple {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(0 != ~mode1~0 % 256); {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:28:16,943 INFO L290 TraceCheckUtils]: 59: Hoare triple {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(0 != ~alive1~0 % 256); {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:28:16,943 INFO L290 TraceCheckUtils]: 60: Hoare triple {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} ~mode1~0 := 1; {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:28:16,943 INFO L290 TraceCheckUtils]: 61: Hoare triple {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:28:16,944 INFO L290 TraceCheckUtils]: 62: Hoare triple {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:28:16,944 INFO L290 TraceCheckUtils]: 63: Hoare triple {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume node2_~m2~0#1 != ~nomsg~0; {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:28:16,945 INFO L290 TraceCheckUtils]: 64: Hoare triple {102652#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume 0 != ~alive2~0 % 256; {102651#false} is VALID [2022-02-20 18:28:16,945 INFO L290 TraceCheckUtils]: 65: Hoare triple {102651#false} assume !(node2_~m2~0#1 > ~id2~0); {102651#false} is VALID [2022-02-20 18:28:16,945 INFO L290 TraceCheckUtils]: 66: Hoare triple {102651#false} assume node2_~m2~0#1 == ~id2~0;~st2~0 := 1; {102651#false} is VALID [2022-02-20 18:28:16,945 INFO L290 TraceCheckUtils]: 67: Hoare triple {102651#false} ~mode2~0 := 0; {102651#false} is VALID [2022-02-20 18:28:16,946 INFO L290 TraceCheckUtils]: 68: Hoare triple {102651#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {102651#false} is VALID [2022-02-20 18:28:16,946 INFO L290 TraceCheckUtils]: 69: Hoare triple {102651#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {102651#false} is VALID [2022-02-20 18:28:16,946 INFO L290 TraceCheckUtils]: 70: Hoare triple {102651#false} assume !(node3_~m3~0#1 != ~nomsg~0); {102651#false} is VALID [2022-02-20 18:28:16,946 INFO L290 TraceCheckUtils]: 71: Hoare triple {102651#false} ~mode3~0 := 0; {102651#false} is VALID [2022-02-20 18:28:16,947 INFO L290 TraceCheckUtils]: 72: Hoare triple {102651#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {102651#false} is VALID [2022-02-20 18:28:16,947 INFO L290 TraceCheckUtils]: 73: Hoare triple {102651#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {102651#false} is VALID [2022-02-20 18:28:16,947 INFO L290 TraceCheckUtils]: 74: Hoare triple {102651#false} assume !(node4_~m4~0#1 != ~nomsg~0); {102651#false} is VALID [2022-02-20 18:28:16,947 INFO L290 TraceCheckUtils]: 75: Hoare triple {102651#false} ~mode4~0 := 0; {102651#false} is VALID [2022-02-20 18:28:16,948 INFO L290 TraceCheckUtils]: 76: Hoare triple {102651#false} assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {102651#false} is VALID [2022-02-20 18:28:16,948 INFO L290 TraceCheckUtils]: 77: Hoare triple {102651#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {102651#false} is VALID [2022-02-20 18:28:16,948 INFO L290 TraceCheckUtils]: 78: Hoare triple {102651#false} check_#res#1 := check_~tmp~1#1; {102651#false} is VALID [2022-02-20 18:28:16,948 INFO L290 TraceCheckUtils]: 79: Hoare triple {102651#false} main_#t~ret33#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret33#1 && main_#t~ret33#1 <= 2147483647;main_~c1~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {102651#false} is VALID [2022-02-20 18:28:16,948 INFO L290 TraceCheckUtils]: 80: Hoare triple {102651#false} assume 0 == assert_~arg#1 % 256; {102651#false} is VALID [2022-02-20 18:28:16,948 INFO L290 TraceCheckUtils]: 81: Hoare triple {102651#false} assume !false; {102651#false} is VALID [2022-02-20 18:28:16,948 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:28:16,949 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:16,949 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853666743] [2022-02-20 18:28:16,949 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853666743] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:16,949 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:16,949 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:28:16,949 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471109501] [2022-02-20 18:28:16,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:16,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2022-02-20 18:28:16,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:16,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:16,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:16,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:28:16,995 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:16,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:28:16,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:16,996 INFO L87 Difference]: Start difference. First operand 6930 states and 9937 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:32,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:32,025 INFO L93 Difference]: Finished difference Result 16593 states and 23741 transitions. [2022-02-20 18:28:32,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:28:32,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2022-02-20 18:28:32,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:32,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:32,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2022-02-20 18:28:32,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:32,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2022-02-20 18:28:32,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 327 transitions. [2022-02-20 18:28:32,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 327 edges. 327 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:36,087 INFO L225 Difference]: With dead ends: 16593 [2022-02-20 18:28:36,088 INFO L226 Difference]: Without dead ends: 11119 [2022-02-20 18:28:36,092 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:36,093 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 66 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:28:36,093 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 263 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:36,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11119 states. [2022-02-20 18:28:40,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11119 to 10545. [2022-02-20 18:28:40,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:41,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11119 states. Second operand has 10545 states, 10544 states have (on average 1.4164453717754173) internal successors, (14935), 10544 states have internal predecessors, (14935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:41,018 INFO L74 IsIncluded]: Start isIncluded. First operand 11119 states. Second operand has 10545 states, 10544 states have (on average 1.4164453717754173) internal successors, (14935), 10544 states have internal predecessors, (14935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:41,028 INFO L87 Difference]: Start difference. First operand 11119 states. Second operand has 10545 states, 10544 states have (on average 1.4164453717754173) internal successors, (14935), 10544 states have internal predecessors, (14935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)