./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ccd7de77f49c6b9ff6e2bd62edbddc630c5186aa67a4c3123f05914f38eca6d7 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:46:26,585 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:46:26,587 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:46:26,626 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:46:26,627 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:46:26,630 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:46:26,631 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:46:26,634 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:46:26,636 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:46:26,640 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:46:26,641 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:46:26,642 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:46:26,642 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:46:26,644 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:46:26,645 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:46:26,648 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:46:26,649 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:46:26,650 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:46:26,652 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:46:26,657 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:46:26,658 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:46:26,659 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:46:26,660 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:46:26,661 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:46:26,662 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:46:26,663 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:46:26,663 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:46:26,664 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:46:26,664 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:46:26,665 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:46:26,665 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:46:26,666 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:46:26,667 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:46:26,668 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:46:26,668 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:46:26,669 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:46:26,669 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:46:26,669 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:46:26,669 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:46:26,670 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:46:26,670 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:46:26,671 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:46:26,695 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:46:26,696 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:46:26,696 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:46:26,696 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:46:26,697 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:46:26,697 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:46:26,697 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:46:26,698 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:46:26,698 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:46:26,698 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:46:26,698 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:46:26,699 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:46:26,699 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:46:26,699 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:46:26,699 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:46:26,699 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:46:26,699 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:46:26,699 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:46:26,700 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:46:26,700 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:46:26,700 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:46:26,700 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:46:26,700 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:46:26,700 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:46:26,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:46:26,701 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:46:26,701 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:46:26,702 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:46:26,702 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:46:26,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:46:26,702 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:46:26,702 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:46:26,702 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:46:26,703 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 -> ccd7de77f49c6b9ff6e2bd62edbddc630c5186aa67a4c3123f05914f38eca6d7 [2022-02-20 18:46:26,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:46:26,876 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:46:26,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:46:26,878 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:46:26,879 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:46:26,880 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:46:26,916 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56f02005e/407545cb8fe94c949f66e3bb35400657/FLAGe34175337 [2022-02-20 18:46:27,289 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:46:27,289 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:46:27,295 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56f02005e/407545cb8fe94c949f66e3bb35400657/FLAGe34175337 [2022-02-20 18:46:27,713 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56f02005e/407545cb8fe94c949f66e3bb35400657 [2022-02-20 18:46:27,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:46:27,716 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:46:27,717 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:46:27,717 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:46:27,720 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:46:27,721 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:46:27" (1/1) ... [2022-02-20 18:46:27,722 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c101616 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:27, skipping insertion in model container [2022-02-20 18:46:27,722 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:46:27" (1/1) ... [2022-02-20 18:46:27,727 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:46:27,748 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:46:27,916 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[5377,5390] [2022-02-20 18:46:27,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:46:27,966 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:46:27,999 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[5377,5390] [2022-02-20 18:46:28,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:46:28,021 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:46:28,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:28 WrapperNode [2022-02-20 18:46:28,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:46:28,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:46:28,023 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:46:28,023 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:46:28,031 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:46:28" (1/1) ... [2022-02-20 18:46:28,040 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:46:28" (1/1) ... [2022-02-20 18:46:28,075 INFO L137 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 410 [2022-02-20 18:46:28,075 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:46:28,076 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:46:28,076 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:46:28,076 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:46:28,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:28" (1/1) ... [2022-02-20 18:46:28,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:28" (1/1) ... [2022-02-20 18:46:28,084 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:28" (1/1) ... [2022-02-20 18:46:28,084 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:28" (1/1) ... [2022-02-20 18:46:28,104 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:28" (1/1) ... [2022-02-20 18:46:28,107 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:28" (1/1) ... [2022-02-20 18:46:28,110 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:28" (1/1) ... [2022-02-20 18:46:28,112 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:46:28,118 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:46:28,118 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:46:28,118 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:46:28,119 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:28" (1/1) ... [2022-02-20 18:46:28,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:46:28,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:46:28,148 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:46:28,152 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:46:28,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:46:28,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:46:28,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:46:28,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:46:28,236 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:46:28,237 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:46:28,582 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:46:28,587 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:46:28,587 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:46:28,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:46:28 BoogieIcfgContainer [2022-02-20 18:46:28,589 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:46:28,590 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:46:28,590 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:46:28,593 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:46:28,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:46:27" (1/3) ... [2022-02-20 18:46:28,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cc27cfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:46:28, skipping insertion in model container [2022-02-20 18:46:28,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:46:28" (2/3) ... [2022-02-20 18:46:28,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cc27cfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:46:28, skipping insertion in model container [2022-02-20 18:46:28,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:46:28" (3/3) ... [2022-02-20 18:46:28,595 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:46:28,598 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:46:28,598 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:46:28,632 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:46:28,636 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:46:28,636 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:46:28,660 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 105 states have (on average 1.6857142857142857) internal successors, (177), 106 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:28,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 18:46:28,667 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:46:28,667 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] [2022-02-20 18:46:28,668 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:46:28,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:46:28,671 INFO L85 PathProgramCache]: Analyzing trace with hash -656787439, now seen corresponding path program 1 times [2022-02-20 18:46:28,677 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:46:28,677 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690666892] [2022-02-20 18:46:28,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:46:28,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:46:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:46:28,931 INFO L290 TraceCheckUtils]: 0: Hoare triple {110#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(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_10566~0 := 0;~__return_10692~0 := 0; {110#true} is VALID [2022-02-20 18:46:28,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {110#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {110#true} is VALID [2022-02-20 18:46:28,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {110#true} assume 0 == ~r1~0 % 256; {110#true} is VALID [2022-02-20 18:46:28,932 INFO L290 TraceCheckUtils]: 3: Hoare triple {110#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {110#true} is VALID [2022-02-20 18:46:28,932 INFO L290 TraceCheckUtils]: 4: Hoare triple {110#true} assume ~id1~0 >= 0; {110#true} is VALID [2022-02-20 18:46:28,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {110#true} assume 0 == ~st1~0; {110#true} is VALID [2022-02-20 18:46:28,933 INFO L290 TraceCheckUtils]: 6: Hoare triple {110#true} assume ~send1~0 == ~id1~0; {110#true} is VALID [2022-02-20 18:46:28,933 INFO L290 TraceCheckUtils]: 7: Hoare triple {110#true} assume 0 == ~mode1~0 % 256; {110#true} is VALID [2022-02-20 18:46:28,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {110#true} assume ~id2~0 >= 0; {110#true} is VALID [2022-02-20 18:46:28,934 INFO L290 TraceCheckUtils]: 9: Hoare triple {110#true} assume 0 == ~st2~0; {110#true} is VALID [2022-02-20 18:46:28,934 INFO L290 TraceCheckUtils]: 10: Hoare triple {110#true} assume ~send2~0 == ~id2~0; {110#true} is VALID [2022-02-20 18:46:28,935 INFO L290 TraceCheckUtils]: 11: Hoare triple {110#true} assume 0 == ~mode2~0 % 256; {112#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:46:28,935 INFO L290 TraceCheckUtils]: 12: Hoare triple {112#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {112#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:46:28,939 INFO L290 TraceCheckUtils]: 13: Hoare triple {112#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {112#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:46:28,940 INFO L290 TraceCheckUtils]: 14: Hoare triple {112#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {112#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:46:28,941 INFO L290 TraceCheckUtils]: 15: Hoare triple {112#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {112#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:46:28,941 INFO L290 TraceCheckUtils]: 16: Hoare triple {112#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {112#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:46:28,942 INFO L290 TraceCheckUtils]: 17: Hoare triple {112#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {112#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:46:28,943 INFO L290 TraceCheckUtils]: 18: Hoare triple {112#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {112#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:46:28,944 INFO L290 TraceCheckUtils]: 19: Hoare triple {112#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {112#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:46:28,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {112#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {112#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:46:28,950 INFO L290 TraceCheckUtils]: 21: Hoare triple {112#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {112#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:46:28,951 INFO L290 TraceCheckUtils]: 22: Hoare triple {112#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {112#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:46:28,952 INFO L290 TraceCheckUtils]: 23: Hoare triple {112#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {112#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:46:28,953 INFO L290 TraceCheckUtils]: 24: Hoare triple {112#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {112#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:46:28,954 INFO L290 TraceCheckUtils]: 25: Hoare triple {112#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_10566~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_10566~0; {112#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:46:28,954 INFO L290 TraceCheckUtils]: 26: Hoare triple {112#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {112#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:46:28,955 INFO L290 TraceCheckUtils]: 27: Hoare triple {112#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {112#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:46:28,956 INFO L290 TraceCheckUtils]: 28: Hoare triple {112#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~mode1~0 % 256); {112#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:46:28,957 INFO L290 TraceCheckUtils]: 29: Hoare triple {112#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~alive1~0 % 256); {112#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:46:28,957 INFO L290 TraceCheckUtils]: 30: Hoare triple {112#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {112#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:46:28,959 INFO L290 TraceCheckUtils]: 31: Hoare triple {112#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {112#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:46:28,960 INFO L290 TraceCheckUtils]: 32: Hoare triple {112#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {111#false} is VALID [2022-02-20 18:46:28,960 INFO L290 TraceCheckUtils]: 33: Hoare triple {111#false} assume !(main_~node2__m2~0#1 != ~nomsg~0); {111#false} is VALID [2022-02-20 18:46:28,960 INFO L290 TraceCheckUtils]: 34: Hoare triple {111#false} ~mode2~0 := 0; {111#false} is VALID [2022-02-20 18:46:28,961 INFO L290 TraceCheckUtils]: 35: Hoare triple {111#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {111#false} is VALID [2022-02-20 18:46:28,961 INFO L290 TraceCheckUtils]: 36: Hoare triple {111#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {111#false} is VALID [2022-02-20 18:46:28,961 INFO L290 TraceCheckUtils]: 37: Hoare triple {111#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {111#false} is VALID [2022-02-20 18:46:28,961 INFO L290 TraceCheckUtils]: 38: Hoare triple {111#false} ~mode3~0 := 0; {111#false} is VALID [2022-02-20 18:46:28,961 INFO L290 TraceCheckUtils]: 39: Hoare triple {111#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {111#false} is VALID [2022-02-20 18:46:28,962 INFO L290 TraceCheckUtils]: 40: Hoare triple {111#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {111#false} is VALID [2022-02-20 18:46:28,962 INFO L290 TraceCheckUtils]: 41: Hoare triple {111#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {111#false} is VALID [2022-02-20 18:46:28,962 INFO L290 TraceCheckUtils]: 42: Hoare triple {111#false} ~mode4~0 := 0; {111#false} is VALID [2022-02-20 18:46:28,962 INFO L290 TraceCheckUtils]: 43: Hoare triple {111#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {111#false} is VALID [2022-02-20 18:46:28,962 INFO L290 TraceCheckUtils]: 44: Hoare triple {111#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~0#1 := 0; {111#false} is VALID [2022-02-20 18:46:28,963 INFO L290 TraceCheckUtils]: 45: Hoare triple {111#false} ~__return_10692~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_10692~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {111#false} is VALID [2022-02-20 18:46:28,963 INFO L290 TraceCheckUtils]: 46: Hoare triple {111#false} assume 0 == main_~assert__arg~0#1 % 256; {111#false} is VALID [2022-02-20 18:46:28,963 INFO L290 TraceCheckUtils]: 47: Hoare triple {111#false} assume !false; {111#false} is VALID [2022-02-20 18:46:28,965 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:46:28,966 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:46:28,966 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690666892] [2022-02-20 18:46:28,967 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690666892] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:46:28,967 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:46:28,967 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:46:28,969 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809502557] [2022-02-20 18:46:28,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:46:28,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2022-02-20 18:46:28,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:46:28,979 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:29,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:46:29,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:46:29,029 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:46:29,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:46:29,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:46:29,049 INFO L87 Difference]: Start difference. First operand has 107 states, 105 states have (on average 1.6857142857142857) internal successors, (177), 106 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:29,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:29,320 INFO L93 Difference]: Finished difference Result 251 states and 401 transitions. [2022-02-20 18:46:29,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:46:29,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2022-02-20 18:46:29,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:46:29,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:29,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2022-02-20 18:46:29,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:29,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2022-02-20 18:46:29,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 401 transitions. [2022-02-20 18:46:29,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 401 edges. 401 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:46:29,694 INFO L225 Difference]: With dead ends: 251 [2022-02-20 18:46:29,694 INFO L226 Difference]: Without dead ends: 165 [2022-02-20 18:46:29,697 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:46:29,699 INFO L933 BasicCegarLoop]: 246 mSDtfsCounter, 123 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:46:29,699 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 368 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:46:29,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-02-20 18:46:29,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2022-02-20 18:46:29,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:46:29,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 163 states, 162 states have (on average 1.5) internal successors, (243), 162 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:29,728 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 163 states, 162 states have (on average 1.5) internal successors, (243), 162 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:29,728 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 163 states, 162 states have (on average 1.5) internal successors, (243), 162 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:29,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:29,734 INFO L93 Difference]: Finished difference Result 165 states and 244 transitions. [2022-02-20 18:46:29,734 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2022-02-20 18:46:29,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:46:29,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:46:29,735 INFO L74 IsIncluded]: Start isIncluded. First operand has 163 states, 162 states have (on average 1.5) internal successors, (243), 162 states have internal predecessors, (243), 0 states have call successors, (0), 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 165 states. [2022-02-20 18:46:29,736 INFO L87 Difference]: Start difference. First operand has 163 states, 162 states have (on average 1.5) internal successors, (243), 162 states have internal predecessors, (243), 0 states have call successors, (0), 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 165 states. [2022-02-20 18:46:29,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:29,740 INFO L93 Difference]: Finished difference Result 165 states and 244 transitions. [2022-02-20 18:46:29,740 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2022-02-20 18:46:29,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:46:29,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:46:29,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:46:29,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:46:29,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.5) internal successors, (243), 162 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:29,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 243 transitions. [2022-02-20 18:46:29,747 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 243 transitions. Word has length 48 [2022-02-20 18:46:29,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:46:29,748 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 243 transitions. [2022-02-20 18:46:29,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:29,748 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 243 transitions. [2022-02-20 18:46:29,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-20 18:46:29,749 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:46:29,749 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] [2022-02-20 18:46:29,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:46:29,750 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:46:29,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:46:29,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1525314343, now seen corresponding path program 1 times [2022-02-20 18:46:29,751 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:46:29,751 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981931609] [2022-02-20 18:46:29,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:46:29,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:46:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:46:29,817 INFO L290 TraceCheckUtils]: 0: Hoare triple {995#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(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_10566~0 := 0;~__return_10692~0 := 0; {995#true} is VALID [2022-02-20 18:46:29,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {995#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {995#true} is VALID [2022-02-20 18:46:29,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {995#true} assume 0 == ~r1~0 % 256; {995#true} is VALID [2022-02-20 18:46:29,818 INFO L290 TraceCheckUtils]: 3: Hoare triple {995#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {995#true} is VALID [2022-02-20 18:46:29,818 INFO L290 TraceCheckUtils]: 4: Hoare triple {995#true} assume ~id1~0 >= 0; {995#true} is VALID [2022-02-20 18:46:29,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {995#true} assume 0 == ~st1~0; {995#true} is VALID [2022-02-20 18:46:29,818 INFO L290 TraceCheckUtils]: 6: Hoare triple {995#true} assume ~send1~0 == ~id1~0; {995#true} is VALID [2022-02-20 18:46:29,818 INFO L290 TraceCheckUtils]: 7: Hoare triple {995#true} assume 0 == ~mode1~0 % 256; {995#true} is VALID [2022-02-20 18:46:29,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {995#true} assume ~id2~0 >= 0; {995#true} is VALID [2022-02-20 18:46:29,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {995#true} assume 0 == ~st2~0; {995#true} is VALID [2022-02-20 18:46:29,819 INFO L290 TraceCheckUtils]: 10: Hoare triple {995#true} assume ~send2~0 == ~id2~0; {995#true} is VALID [2022-02-20 18:46:29,819 INFO L290 TraceCheckUtils]: 11: Hoare triple {995#true} assume 0 == ~mode2~0 % 256; {995#true} is VALID [2022-02-20 18:46:29,819 INFO L290 TraceCheckUtils]: 12: Hoare triple {995#true} assume ~id3~0 >= 0; {995#true} is VALID [2022-02-20 18:46:29,820 INFO L290 TraceCheckUtils]: 13: Hoare triple {995#true} assume 0 == ~st3~0; {995#true} is VALID [2022-02-20 18:46:29,820 INFO L290 TraceCheckUtils]: 14: Hoare triple {995#true} assume ~send3~0 == ~id3~0; {995#true} is VALID [2022-02-20 18:46:29,820 INFO L290 TraceCheckUtils]: 15: Hoare triple {995#true} assume 0 == ~mode3~0 % 256; {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:29,821 INFO L290 TraceCheckUtils]: 16: Hoare triple {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:29,821 INFO L290 TraceCheckUtils]: 17: Hoare triple {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:29,822 INFO L290 TraceCheckUtils]: 18: Hoare triple {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:29,822 INFO L290 TraceCheckUtils]: 19: Hoare triple {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:29,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:29,823 INFO L290 TraceCheckUtils]: 21: Hoare triple {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:29,823 INFO L290 TraceCheckUtils]: 22: Hoare triple {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:29,824 INFO L290 TraceCheckUtils]: 23: Hoare triple {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:29,824 INFO L290 TraceCheckUtils]: 24: Hoare triple {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:29,825 INFO L290 TraceCheckUtils]: 25: Hoare triple {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_10566~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_10566~0; {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:29,825 INFO L290 TraceCheckUtils]: 26: Hoare triple {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:29,826 INFO L290 TraceCheckUtils]: 27: Hoare triple {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:29,826 INFO L290 TraceCheckUtils]: 28: Hoare triple {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode1~0 % 256); {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:29,827 INFO L290 TraceCheckUtils]: 29: Hoare triple {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~alive1~0 % 256); {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:29,827 INFO L290 TraceCheckUtils]: 30: Hoare triple {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:29,828 INFO L290 TraceCheckUtils]: 31: Hoare triple {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:29,828 INFO L290 TraceCheckUtils]: 32: Hoare triple {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode2~0 % 256); {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:29,828 INFO L290 TraceCheckUtils]: 33: Hoare triple {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~alive2~0 % 256); {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:29,829 INFO L290 TraceCheckUtils]: 34: Hoare triple {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send2~0 != ~id2~0); {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:29,829 INFO L290 TraceCheckUtils]: 35: Hoare triple {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:29,830 INFO L290 TraceCheckUtils]: 36: Hoare triple {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:46:29,830 INFO L290 TraceCheckUtils]: 37: Hoare triple {997#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {996#false} is VALID [2022-02-20 18:46:29,830 INFO L290 TraceCheckUtils]: 38: Hoare triple {996#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {996#false} is VALID [2022-02-20 18:46:29,831 INFO L290 TraceCheckUtils]: 39: Hoare triple {996#false} ~mode3~0 := 0; {996#false} is VALID [2022-02-20 18:46:29,831 INFO L290 TraceCheckUtils]: 40: Hoare triple {996#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {996#false} is VALID [2022-02-20 18:46:29,831 INFO L290 TraceCheckUtils]: 41: Hoare triple {996#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {996#false} is VALID [2022-02-20 18:46:29,831 INFO L290 TraceCheckUtils]: 42: Hoare triple {996#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {996#false} is VALID [2022-02-20 18:46:29,831 INFO L290 TraceCheckUtils]: 43: Hoare triple {996#false} ~mode4~0 := 0; {996#false} is VALID [2022-02-20 18:46:29,832 INFO L290 TraceCheckUtils]: 44: Hoare triple {996#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {996#false} is VALID [2022-02-20 18:46:29,832 INFO L290 TraceCheckUtils]: 45: Hoare triple {996#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~0#1 := 0; {996#false} is VALID [2022-02-20 18:46:29,832 INFO L290 TraceCheckUtils]: 46: Hoare triple {996#false} ~__return_10692~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_10692~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {996#false} is VALID [2022-02-20 18:46:29,832 INFO L290 TraceCheckUtils]: 47: Hoare triple {996#false} assume 0 == main_~assert__arg~0#1 % 256; {996#false} is VALID [2022-02-20 18:46:29,832 INFO L290 TraceCheckUtils]: 48: Hoare triple {996#false} assume !false; {996#false} is VALID [2022-02-20 18:46:29,833 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:46:29,833 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:46:29,833 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981931609] [2022-02-20 18:46:29,833 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981931609] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:46:29,833 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:46:29,834 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:46:29,834 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897376606] [2022-02-20 18:46:29,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:46:29,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2022-02-20 18:46:29,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:46:29,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:29,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:46:29,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:46:29,867 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:46:29,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:46:29,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:46:29,868 INFO L87 Difference]: Start difference. First operand 163 states and 243 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:30,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:30,068 INFO L93 Difference]: Finished difference Result 403 states and 623 transitions. [2022-02-20 18:46:30,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:46:30,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2022-02-20 18:46:30,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:46:30,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:30,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2022-02-20 18:46:30,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:30,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2022-02-20 18:46:30,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 367 transitions. [2022-02-20 18:46:30,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 367 edges. 367 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:46:30,312 INFO L225 Difference]: With dead ends: 403 [2022-02-20 18:46:30,312 INFO L226 Difference]: Without dead ends: 267 [2022-02-20 18:46:30,313 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:46:30,314 INFO L933 BasicCegarLoop]: 198 mSDtfsCounter, 101 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 313 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:46:30,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 313 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:46:30,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-02-20 18:46:30,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2022-02-20 18:46:30,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:46:30,329 INFO L82 GeneralOperation]: Start isEquivalent. First operand 267 states. Second operand has 265 states, 264 states have (on average 1.5303030303030303) internal successors, (404), 264 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:30,330 INFO L74 IsIncluded]: Start isIncluded. First operand 267 states. Second operand has 265 states, 264 states have (on average 1.5303030303030303) internal successors, (404), 264 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:30,330 INFO L87 Difference]: Start difference. First operand 267 states. Second operand has 265 states, 264 states have (on average 1.5303030303030303) internal successors, (404), 264 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:30,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:30,338 INFO L93 Difference]: Finished difference Result 267 states and 405 transitions. [2022-02-20 18:46:30,338 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 405 transitions. [2022-02-20 18:46:30,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:46:30,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:46:30,340 INFO L74 IsIncluded]: Start isIncluded. First operand has 265 states, 264 states have (on average 1.5303030303030303) internal successors, (404), 264 states have internal predecessors, (404), 0 states have call successors, (0), 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 267 states. [2022-02-20 18:46:30,340 INFO L87 Difference]: Start difference. First operand has 265 states, 264 states have (on average 1.5303030303030303) internal successors, (404), 264 states have internal predecessors, (404), 0 states have call successors, (0), 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 267 states. [2022-02-20 18:46:30,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:30,348 INFO L93 Difference]: Finished difference Result 267 states and 405 transitions. [2022-02-20 18:46:30,348 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 405 transitions. [2022-02-20 18:46:30,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:46:30,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:46:30,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:46:30,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:46:30,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 1.5303030303030303) internal successors, (404), 264 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:30,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 404 transitions. [2022-02-20 18:46:30,358 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 404 transitions. Word has length 49 [2022-02-20 18:46:30,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:46:30,358 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 404 transitions. [2022-02-20 18:46:30,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:30,359 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 404 transitions. [2022-02-20 18:46:30,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 18:46:30,359 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:46:30,359 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] [2022-02-20 18:46:30,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:46:30,360 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:46:30,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:46:30,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1721693138, now seen corresponding path program 1 times [2022-02-20 18:46:30,361 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:46:30,361 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536922698] [2022-02-20 18:46:30,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:46:30,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:46:30,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:46:30,419 INFO L290 TraceCheckUtils]: 0: Hoare triple {2438#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(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_10566~0 := 0;~__return_10692~0 := 0; {2438#true} is VALID [2022-02-20 18:46:30,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {2438#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {2438#true} is VALID [2022-02-20 18:46:30,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {2438#true} assume 0 == ~r1~0 % 256; {2438#true} is VALID [2022-02-20 18:46:30,419 INFO L290 TraceCheckUtils]: 3: Hoare triple {2438#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {2438#true} is VALID [2022-02-20 18:46:30,420 INFO L290 TraceCheckUtils]: 4: Hoare triple {2438#true} assume ~id1~0 >= 0; {2438#true} is VALID [2022-02-20 18:46:30,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {2438#true} assume 0 == ~st1~0; {2438#true} is VALID [2022-02-20 18:46:30,420 INFO L290 TraceCheckUtils]: 6: Hoare triple {2438#true} assume ~send1~0 == ~id1~0; {2438#true} is VALID [2022-02-20 18:46:30,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {2438#true} assume 0 == ~mode1~0 % 256; {2438#true} is VALID [2022-02-20 18:46:30,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {2438#true} assume ~id2~0 >= 0; {2438#true} is VALID [2022-02-20 18:46:30,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {2438#true} assume 0 == ~st2~0; {2438#true} is VALID [2022-02-20 18:46:30,421 INFO L290 TraceCheckUtils]: 10: Hoare triple {2438#true} assume ~send2~0 == ~id2~0; {2438#true} is VALID [2022-02-20 18:46:30,421 INFO L290 TraceCheckUtils]: 11: Hoare triple {2438#true} assume 0 == ~mode2~0 % 256; {2438#true} is VALID [2022-02-20 18:46:30,421 INFO L290 TraceCheckUtils]: 12: Hoare triple {2438#true} assume ~id3~0 >= 0; {2438#true} is VALID [2022-02-20 18:46:30,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {2438#true} assume 0 == ~st3~0; {2438#true} is VALID [2022-02-20 18:46:30,421 INFO L290 TraceCheckUtils]: 14: Hoare triple {2438#true} assume ~send3~0 == ~id3~0; {2438#true} is VALID [2022-02-20 18:46:30,421 INFO L290 TraceCheckUtils]: 15: Hoare triple {2438#true} assume 0 == ~mode3~0 % 256; {2438#true} is VALID [2022-02-20 18:46:30,422 INFO L290 TraceCheckUtils]: 16: Hoare triple {2438#true} assume ~id4~0 >= 0; {2438#true} is VALID [2022-02-20 18:46:30,422 INFO L290 TraceCheckUtils]: 17: Hoare triple {2438#true} assume 0 == ~st4~0; {2438#true} is VALID [2022-02-20 18:46:30,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {2438#true} assume ~send4~0 == ~id4~0; {2438#true} is VALID [2022-02-20 18:46:30,422 INFO L290 TraceCheckUtils]: 19: Hoare triple {2438#true} assume 0 == ~mode4~0 % 256; {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:30,423 INFO L290 TraceCheckUtils]: 20: Hoare triple {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:30,423 INFO L290 TraceCheckUtils]: 21: Hoare triple {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:30,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:30,424 INFO L290 TraceCheckUtils]: 23: Hoare triple {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:30,425 INFO L290 TraceCheckUtils]: 24: Hoare triple {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:30,425 INFO L290 TraceCheckUtils]: 25: Hoare triple {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_10566~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_10566~0; {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:30,425 INFO L290 TraceCheckUtils]: 26: Hoare triple {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:30,426 INFO L290 TraceCheckUtils]: 27: Hoare triple {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:30,426 INFO L290 TraceCheckUtils]: 28: Hoare triple {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode1~0 % 256); {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:30,427 INFO L290 TraceCheckUtils]: 29: Hoare triple {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~alive1~0 % 256); {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:30,427 INFO L290 TraceCheckUtils]: 30: Hoare triple {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode1~0 := 1; {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:30,428 INFO L290 TraceCheckUtils]: 31: Hoare triple {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:30,428 INFO L290 TraceCheckUtils]: 32: Hoare triple {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode2~0 % 256); {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:30,428 INFO L290 TraceCheckUtils]: 33: Hoare triple {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~alive2~0 % 256); {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:30,429 INFO L290 TraceCheckUtils]: 34: Hoare triple {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send2~0 != ~id2~0); {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:30,429 INFO L290 TraceCheckUtils]: 35: Hoare triple {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode2~0 := 1; {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:30,430 INFO L290 TraceCheckUtils]: 36: Hoare triple {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:30,430 INFO L290 TraceCheckUtils]: 37: Hoare triple {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode3~0 % 256); {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:30,430 INFO L290 TraceCheckUtils]: 38: Hoare triple {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~alive3~0 % 256); {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:30,431 INFO L290 TraceCheckUtils]: 39: Hoare triple {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send3~0 != ~id3~0); {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:30,431 INFO L290 TraceCheckUtils]: 40: Hoare triple {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode3~0 := 1; {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:30,432 INFO L290 TraceCheckUtils]: 41: Hoare triple {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:46:30,432 INFO L290 TraceCheckUtils]: 42: Hoare triple {2440#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2439#false} is VALID [2022-02-20 18:46:30,432 INFO L290 TraceCheckUtils]: 43: Hoare triple {2439#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {2439#false} is VALID [2022-02-20 18:46:30,433 INFO L290 TraceCheckUtils]: 44: Hoare triple {2439#false} ~mode4~0 := 0; {2439#false} is VALID [2022-02-20 18:46:30,433 INFO L290 TraceCheckUtils]: 45: Hoare triple {2439#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {2439#false} is VALID [2022-02-20 18:46:30,433 INFO L290 TraceCheckUtils]: 46: Hoare triple {2439#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~0#1 := 0; {2439#false} is VALID [2022-02-20 18:46:30,433 INFO L290 TraceCheckUtils]: 47: Hoare triple {2439#false} ~__return_10692~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_10692~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {2439#false} is VALID [2022-02-20 18:46:30,433 INFO L290 TraceCheckUtils]: 48: Hoare triple {2439#false} assume 0 == main_~assert__arg~0#1 % 256; {2439#false} is VALID [2022-02-20 18:46:30,433 INFO L290 TraceCheckUtils]: 49: Hoare triple {2439#false} assume !false; {2439#false} is VALID [2022-02-20 18:46:30,434 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:46:30,434 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:46:30,434 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536922698] [2022-02-20 18:46:30,434 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536922698] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:46:30,434 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:46:30,435 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:46:30,435 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235961021] [2022-02-20 18:46:30,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:46:30,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2022-02-20 18:46:30,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:46:30,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:30,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:46:30,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:46:30,472 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:46:30,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:46:30,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:46:30,473 INFO L87 Difference]: Start difference. First operand 265 states and 404 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:30,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:30,676 INFO L93 Difference]: Finished difference Result 677 states and 1054 transitions. [2022-02-20 18:46:30,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:46:30,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2022-02-20 18:46:30,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:46:30,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:30,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2022-02-20 18:46:30,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:30,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2022-02-20 18:46:30,683 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 367 transitions. [2022-02-20 18:46:30,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 367 edges. 367 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:46:30,913 INFO L225 Difference]: With dead ends: 677 [2022-02-20 18:46:30,913 INFO L226 Difference]: Without dead ends: 439 [2022-02-20 18:46:30,914 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:46:30,915 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 96 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 298 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:46:30,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 298 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:46:30,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2022-02-20 18:46:30,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 437. [2022-02-20 18:46:30,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:46:30,935 INFO L82 GeneralOperation]: Start isEquivalent. First operand 439 states. Second operand has 437 states, 436 states have (on average 1.5412844036697249) internal successors, (672), 436 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:30,936 INFO L74 IsIncluded]: Start isIncluded. First operand 439 states. Second operand has 437 states, 436 states have (on average 1.5412844036697249) internal successors, (672), 436 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:30,936 INFO L87 Difference]: Start difference. First operand 439 states. Second operand has 437 states, 436 states have (on average 1.5412844036697249) internal successors, (672), 436 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:30,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:30,948 INFO L93 Difference]: Finished difference Result 439 states and 673 transitions. [2022-02-20 18:46:30,948 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 673 transitions. [2022-02-20 18:46:30,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:46:30,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:46:30,950 INFO L74 IsIncluded]: Start isIncluded. First operand has 437 states, 436 states have (on average 1.5412844036697249) internal successors, (672), 436 states have internal predecessors, (672), 0 states have call successors, (0), 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 439 states. [2022-02-20 18:46:30,950 INFO L87 Difference]: Start difference. First operand has 437 states, 436 states have (on average 1.5412844036697249) internal successors, (672), 436 states have internal predecessors, (672), 0 states have call successors, (0), 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 439 states. [2022-02-20 18:46:30,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:30,962 INFO L93 Difference]: Finished difference Result 439 states and 673 transitions. [2022-02-20 18:46:30,962 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 673 transitions. [2022-02-20 18:46:30,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:46:30,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:46:30,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:46:30,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:46:30,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 436 states have (on average 1.5412844036697249) internal successors, (672), 436 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:30,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 672 transitions. [2022-02-20 18:46:30,987 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 672 transitions. Word has length 50 [2022-02-20 18:46:30,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:46:30,987 INFO L470 AbstractCegarLoop]: Abstraction has 437 states and 672 transitions. [2022-02-20 18:46:30,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:30,988 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 672 transitions. [2022-02-20 18:46:30,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:46:30,988 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:46:30,988 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] [2022-02-20 18:46:30,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:46:30,989 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:46:30,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:46:30,989 INFO L85 PathProgramCache]: Analyzing trace with hash -2073243904, now seen corresponding path program 1 times [2022-02-20 18:46:30,989 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:46:30,990 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285700993] [2022-02-20 18:46:30,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:46:30,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:46:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:46:31,063 INFO L290 TraceCheckUtils]: 0: Hoare triple {4847#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(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_10566~0 := 0;~__return_10692~0 := 0; {4847#true} is VALID [2022-02-20 18:46:31,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {4847#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {4847#true} is VALID [2022-02-20 18:46:31,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {4847#true} assume 0 == ~r1~0 % 256; {4847#true} is VALID [2022-02-20 18:46:31,064 INFO L290 TraceCheckUtils]: 3: Hoare triple {4847#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {4847#true} is VALID [2022-02-20 18:46:31,064 INFO L290 TraceCheckUtils]: 4: Hoare triple {4847#true} assume ~id1~0 >= 0; {4847#true} is VALID [2022-02-20 18:46:31,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {4847#true} assume 0 == ~st1~0; {4849#(<= ~st1~0 0)} is VALID [2022-02-20 18:46:31,065 INFO L290 TraceCheckUtils]: 6: Hoare triple {4849#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {4849#(<= ~st1~0 0)} is VALID [2022-02-20 18:46:31,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {4849#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {4849#(<= ~st1~0 0)} is VALID [2022-02-20 18:46:31,066 INFO L290 TraceCheckUtils]: 8: Hoare triple {4849#(<= ~st1~0 0)} assume ~id2~0 >= 0; {4849#(<= ~st1~0 0)} is VALID [2022-02-20 18:46:31,066 INFO L290 TraceCheckUtils]: 9: Hoare triple {4849#(<= ~st1~0 0)} assume 0 == ~st2~0; {4850#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:31,066 INFO L290 TraceCheckUtils]: 10: Hoare triple {4850#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {4850#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:31,067 INFO L290 TraceCheckUtils]: 11: Hoare triple {4850#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {4850#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:31,067 INFO L290 TraceCheckUtils]: 12: Hoare triple {4850#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {4850#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:31,067 INFO L290 TraceCheckUtils]: 13: Hoare triple {4850#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {4851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:31,068 INFO L290 TraceCheckUtils]: 14: Hoare triple {4851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {4851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:31,068 INFO L290 TraceCheckUtils]: 15: Hoare triple {4851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {4851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:31,068 INFO L290 TraceCheckUtils]: 16: Hoare triple {4851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {4851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:31,069 INFO L290 TraceCheckUtils]: 17: Hoare triple {4851#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:31,069 INFO L290 TraceCheckUtils]: 18: Hoare triple {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:31,070 INFO L290 TraceCheckUtils]: 19: Hoare triple {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:31,070 INFO L290 TraceCheckUtils]: 20: Hoare triple {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:31,070 INFO L290 TraceCheckUtils]: 21: Hoare triple {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:31,071 INFO L290 TraceCheckUtils]: 22: Hoare triple {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:31,071 INFO L290 TraceCheckUtils]: 23: Hoare triple {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:31,071 INFO L290 TraceCheckUtils]: 24: Hoare triple {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:31,072 INFO L290 TraceCheckUtils]: 25: Hoare triple {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_10566~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_10566~0; {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:31,072 INFO L290 TraceCheckUtils]: 26: Hoare triple {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:31,073 INFO L290 TraceCheckUtils]: 27: Hoare triple {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:31,073 INFO L290 TraceCheckUtils]: 28: Hoare triple {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:31,073 INFO L290 TraceCheckUtils]: 29: Hoare triple {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive1~0 % 256); {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:31,074 INFO L290 TraceCheckUtils]: 30: Hoare triple {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:31,074 INFO L290 TraceCheckUtils]: 31: Hoare triple {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:31,074 INFO L290 TraceCheckUtils]: 32: Hoare triple {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:31,075 INFO L290 TraceCheckUtils]: 33: Hoare triple {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive2~0 % 256); {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:31,075 INFO L290 TraceCheckUtils]: 34: Hoare triple {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~id2~0); {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:31,075 INFO L290 TraceCheckUtils]: 35: Hoare triple {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:31,076 INFO L290 TraceCheckUtils]: 36: Hoare triple {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:31,076 INFO L290 TraceCheckUtils]: 37: Hoare triple {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:31,077 INFO L290 TraceCheckUtils]: 38: Hoare triple {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive3~0 % 256); {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:31,077 INFO L290 TraceCheckUtils]: 39: Hoare triple {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~id3~0); {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:31,077 INFO L290 TraceCheckUtils]: 40: Hoare triple {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:31,078 INFO L290 TraceCheckUtils]: 41: Hoare triple {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:31,078 INFO L290 TraceCheckUtils]: 42: Hoare triple {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256); {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:31,078 INFO L290 TraceCheckUtils]: 43: Hoare triple {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive4~0 % 256); {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:31,079 INFO L290 TraceCheckUtils]: 44: Hoare triple {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~id4~0); {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:31,079 INFO L290 TraceCheckUtils]: 45: Hoare triple {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode4~0 := 1; {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:31,080 INFO L290 TraceCheckUtils]: 46: Hoare triple {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:46:31,080 INFO L290 TraceCheckUtils]: 47: Hoare triple {4852#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~0#1 := 0; {4848#false} is VALID [2022-02-20 18:46:31,080 INFO L290 TraceCheckUtils]: 48: Hoare triple {4848#false} ~__return_10692~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_10692~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {4848#false} is VALID [2022-02-20 18:46:31,080 INFO L290 TraceCheckUtils]: 49: Hoare triple {4848#false} assume 0 == main_~assert__arg~0#1 % 256; {4848#false} is VALID [2022-02-20 18:46:31,080 INFO L290 TraceCheckUtils]: 50: Hoare triple {4848#false} assume !false; {4848#false} is VALID [2022-02-20 18:46:31,081 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:46:31,081 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:46:31,081 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285700993] [2022-02-20 18:46:31,081 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285700993] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:46:31,081 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:46:31,082 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:46:31,082 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017793492] [2022-02-20 18:46:31,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:46:31,082 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2022-02-20 18:46:31,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:46:31,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:31,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:46:31,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:46:31,114 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:46:31,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:46:31,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:46:31,115 INFO L87 Difference]: Start difference. First operand 437 states and 672 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:32,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:32,792 INFO L93 Difference]: Finished difference Result 2487 states and 3897 transitions. [2022-02-20 18:46:32,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:46:32,793 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2022-02-20 18:46:32,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:46:32,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:32,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 759 transitions. [2022-02-20 18:46:32,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:32,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 759 transitions. [2022-02-20 18:46:32,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 759 transitions. [2022-02-20 18:46:33,171 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 759 edges. 759 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:46:33,412 INFO L225 Difference]: With dead ends: 2487 [2022-02-20 18:46:33,412 INFO L226 Difference]: Without dead ends: 2077 [2022-02-20 18:46:33,414 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:46:33,415 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 953 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:46:33,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [953 Valid, 1086 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:46:33,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2077 states. [2022-02-20 18:46:33,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2077 to 845. [2022-02-20 18:46:33,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:46:33,896 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2077 states. Second operand has 845 states, 844 states have (on average 1.5402843601895735) internal successors, (1300), 844 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:33,897 INFO L74 IsIncluded]: Start isIncluded. First operand 2077 states. Second operand has 845 states, 844 states have (on average 1.5402843601895735) internal successors, (1300), 844 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:33,898 INFO L87 Difference]: Start difference. First operand 2077 states. Second operand has 845 states, 844 states have (on average 1.5402843601895735) internal successors, (1300), 844 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:34,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:34,032 INFO L93 Difference]: Finished difference Result 2077 states and 3236 transitions. [2022-02-20 18:46:34,032 INFO L276 IsEmpty]: Start isEmpty. Operand 2077 states and 3236 transitions. [2022-02-20 18:46:34,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:46:34,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:46:34,037 INFO L74 IsIncluded]: Start isIncluded. First operand has 845 states, 844 states have (on average 1.5402843601895735) internal successors, (1300), 844 states have internal predecessors, (1300), 0 states have call successors, (0), 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 2077 states. [2022-02-20 18:46:34,038 INFO L87 Difference]: Start difference. First operand has 845 states, 844 states have (on average 1.5402843601895735) internal successors, (1300), 844 states have internal predecessors, (1300), 0 states have call successors, (0), 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 2077 states. [2022-02-20 18:46:34,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:34,175 INFO L93 Difference]: Finished difference Result 2077 states and 3236 transitions. [2022-02-20 18:46:34,175 INFO L276 IsEmpty]: Start isEmpty. Operand 2077 states and 3236 transitions. [2022-02-20 18:46:34,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:46:34,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:46:34,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:46:34,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:46:34,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 844 states have (on average 1.5402843601895735) internal successors, (1300), 844 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:34,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1300 transitions. [2022-02-20 18:46:34,217 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1300 transitions. Word has length 51 [2022-02-20 18:46:34,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:46:34,218 INFO L470 AbstractCegarLoop]: Abstraction has 845 states and 1300 transitions. [2022-02-20 18:46:34,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:34,218 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1300 transitions. [2022-02-20 18:46:34,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:46:34,219 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:46:34,219 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:46:34,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:46:34,220 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:46:34,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:46:34,220 INFO L85 PathProgramCache]: Analyzing trace with hash 134492139, now seen corresponding path program 1 times [2022-02-20 18:46:34,220 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:46:34,220 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416380552] [2022-02-20 18:46:34,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:46:34,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:46:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:46:34,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {13628#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(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_10566~0 := 0;~__return_10692~0 := 0; {13628#true} is VALID [2022-02-20 18:46:34,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {13628#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {13628#true} is VALID [2022-02-20 18:46:34,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {13628#true} assume 0 == ~r1~0 % 256; {13628#true} is VALID [2022-02-20 18:46:34,316 INFO L290 TraceCheckUtils]: 3: Hoare triple {13628#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {13630#(<= (+ (* (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:46:34,317 INFO L290 TraceCheckUtils]: 4: Hoare triple {13630#(<= (+ (* (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; {13630#(<= (+ (* (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:46:34,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {13630#(<= (+ (* (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; {13630#(<= (+ (* (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:46:34,320 INFO L290 TraceCheckUtils]: 6: Hoare triple {13630#(<= (+ (* (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; {13630#(<= (+ (* (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:46:34,320 INFO L290 TraceCheckUtils]: 7: Hoare triple {13630#(<= (+ (* (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; {13630#(<= (+ (* (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:46:34,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {13630#(<= (+ (* (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; {13630#(<= (+ (* (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:46:34,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {13630#(<= (+ (* (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; {13630#(<= (+ (* (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:46:34,322 INFO L290 TraceCheckUtils]: 10: Hoare triple {13630#(<= (+ (* (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; {13630#(<= (+ (* (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:46:34,322 INFO L290 TraceCheckUtils]: 11: Hoare triple {13630#(<= (+ (* (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; {13630#(<= (+ (* (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:46:34,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {13630#(<= (+ (* (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; {13630#(<= (+ (* (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:46:34,323 INFO L290 TraceCheckUtils]: 13: Hoare triple {13630#(<= (+ (* (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; {13630#(<= (+ (* (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:46:34,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {13630#(<= (+ (* (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; {13630#(<= (+ (* (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:46:34,324 INFO L290 TraceCheckUtils]: 15: Hoare triple {13630#(<= (+ (* (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; {13630#(<= (+ (* (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:46:34,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {13630#(<= (+ (* (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; {13630#(<= (+ (* (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:46:34,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {13630#(<= (+ (* (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; {13630#(<= (+ (* (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:46:34,325 INFO L290 TraceCheckUtils]: 18: Hoare triple {13630#(<= (+ (* (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; {13630#(<= (+ (* (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:46:34,326 INFO L290 TraceCheckUtils]: 19: Hoare triple {13630#(<= (+ (* (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; {13630#(<= (+ (* (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:46:34,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {13630#(<= (+ (* (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; {13630#(<= (+ (* (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:46:34,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {13630#(<= (+ (* (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; {13630#(<= (+ (* (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:46:34,327 INFO L290 TraceCheckUtils]: 22: Hoare triple {13630#(<= (+ (* (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; {13630#(<= (+ (* (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:46:34,327 INFO L290 TraceCheckUtils]: 23: Hoare triple {13630#(<= (+ (* (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; {13630#(<= (+ (* (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:46:34,328 INFO L290 TraceCheckUtils]: 24: Hoare triple {13630#(<= (+ (* (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; {13630#(<= (+ (* (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:46:34,328 INFO L290 TraceCheckUtils]: 25: Hoare triple {13630#(<= (+ (* (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;main_~init__tmp~0#1 := 1;~__return_10566~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_10566~0; {13630#(<= (+ (* (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:46:34,329 INFO L290 TraceCheckUtils]: 26: Hoare triple {13630#(<= (+ (* (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 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {13630#(<= (+ (* (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:46:34,329 INFO L290 TraceCheckUtils]: 27: Hoare triple {13630#(<= (+ (* (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))} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {13630#(<= (+ (* (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:46:34,329 INFO L290 TraceCheckUtils]: 28: Hoare triple {13630#(<= (+ (* (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); {13630#(<= (+ (* (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:46:34,330 INFO L290 TraceCheckUtils]: 29: Hoare triple {13630#(<= (+ (* (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); {13631#(<= (+ (* (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:46:34,331 INFO L290 TraceCheckUtils]: 30: Hoare triple {13631#(<= (+ (* (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; {13631#(<= (+ (* (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:46:34,331 INFO L290 TraceCheckUtils]: 31: Hoare triple {13631#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) 1) (+ ~alive4~0 ~alive3~0 ~alive2~0))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {13631#(<= (+ (* (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:46:34,331 INFO L290 TraceCheckUtils]: 32: Hoare triple {13631#(<= (+ (* (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); {13631#(<= (+ (* (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:46:34,332 INFO L290 TraceCheckUtils]: 33: Hoare triple {13631#(<= (+ (* (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); {13632#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:46:34,332 INFO L290 TraceCheckUtils]: 34: Hoare triple {13632#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} assume !(~send2~0 != ~id2~0); {13632#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:46:34,333 INFO L290 TraceCheckUtils]: 35: Hoare triple {13632#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} ~mode2~0 := 1; {13632#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:46:34,333 INFO L290 TraceCheckUtils]: 36: Hoare triple {13632#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {13632#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:46:34,333 INFO L290 TraceCheckUtils]: 37: Hoare triple {13632#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} assume !!(0 == ~mode3~0 % 256); {13632#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:46:34,334 INFO L290 TraceCheckUtils]: 38: Hoare triple {13632#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) 1) (+ ~alive4~0 ~alive3~0))} assume !!(0 == ~alive3~0 % 256); {13633#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:46:34,334 INFO L290 TraceCheckUtils]: 39: Hoare triple {13633#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} assume !(~send3~0 != ~id3~0); {13633#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:46:34,335 INFO L290 TraceCheckUtils]: 40: Hoare triple {13633#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} ~mode3~0 := 1; {13633#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:46:34,335 INFO L290 TraceCheckUtils]: 41: Hoare triple {13633#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {13633#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:46:34,335 INFO L290 TraceCheckUtils]: 42: Hoare triple {13633#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} assume !!(0 == ~mode4~0 % 256); {13633#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} is VALID [2022-02-20 18:46:34,336 INFO L290 TraceCheckUtils]: 43: Hoare triple {13633#(<= (+ (* 256 (div ~alive4~0 256)) 1) ~alive4~0)} assume !!(0 == ~alive4~0 % 256); {13629#false} is VALID [2022-02-20 18:46:34,336 INFO L290 TraceCheckUtils]: 44: Hoare triple {13629#false} assume !(~send4~0 != ~id4~0); {13629#false} is VALID [2022-02-20 18:46:34,336 INFO L290 TraceCheckUtils]: 45: Hoare triple {13629#false} ~mode4~0 := 1; {13629#false} is VALID [2022-02-20 18:46:34,336 INFO L290 TraceCheckUtils]: 46: Hoare triple {13629#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {13629#false} is VALID [2022-02-20 18:46:34,336 INFO L290 TraceCheckUtils]: 47: Hoare triple {13629#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {13629#false} is VALID [2022-02-20 18:46:34,336 INFO L290 TraceCheckUtils]: 48: Hoare triple {13629#false} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1; {13629#false} is VALID [2022-02-20 18:46:34,336 INFO L290 TraceCheckUtils]: 49: Hoare triple {13629#false} ~__return_10692~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_10692~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {13629#false} is VALID [2022-02-20 18:46:34,337 INFO L290 TraceCheckUtils]: 50: Hoare triple {13629#false} assume 0 == main_~assert__arg~0#1 % 256; {13629#false} is VALID [2022-02-20 18:46:34,337 INFO L290 TraceCheckUtils]: 51: Hoare triple {13629#false} assume !false; {13629#false} is VALID [2022-02-20 18:46:34,337 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:46:34,337 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:46:34,337 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416380552] [2022-02-20 18:46:34,338 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416380552] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:46:34,338 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:46:34,338 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:46:34,338 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137873453] [2022-02-20 18:46:34,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:46:34,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 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:46:34,339 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:46:34,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 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:46:34,374 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:46:34,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:46:34,375 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:46:34,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:46:34,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:46:34,376 INFO L87 Difference]: Start difference. First operand 845 states and 1300 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 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:46:38,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:38,535 INFO L93 Difference]: Finished difference Result 3709 states and 5720 transitions. [2022-02-20 18:46:38,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:46:38,535 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 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:46:38,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:46:38,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 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:46:38,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 553 transitions. [2022-02-20 18:46:38,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 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:46:38,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 553 transitions. [2022-02-20 18:46:38,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 553 transitions. [2022-02-20 18:46:38,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 553 edges. 553 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:46:39,292 INFO L225 Difference]: With dead ends: 3709 [2022-02-20 18:46:39,292 INFO L226 Difference]: Without dead ends: 2891 [2022-02-20 18:46:39,294 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:46:39,294 INFO L933 BasicCegarLoop]: 337 mSDtfsCounter, 421 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:46:39,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [421 Valid, 695 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:46:39,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2891 states. [2022-02-20 18:46:41,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2891 to 2885. [2022-02-20 18:46:41,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:46:41,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2891 states. Second operand has 2885 states, 2884 states have (on average 1.535367545076283) internal successors, (4428), 2884 states have internal predecessors, (4428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:41,774 INFO L74 IsIncluded]: Start isIncluded. First operand 2891 states. Second operand has 2885 states, 2884 states have (on average 1.535367545076283) internal successors, (4428), 2884 states have internal predecessors, (4428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:41,779 INFO L87 Difference]: Start difference. First operand 2891 states. Second operand has 2885 states, 2884 states have (on average 1.535367545076283) internal successors, (4428), 2884 states have internal predecessors, (4428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:42,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:42,022 INFO L93 Difference]: Finished difference Result 2891 states and 4431 transitions. [2022-02-20 18:46:42,022 INFO L276 IsEmpty]: Start isEmpty. Operand 2891 states and 4431 transitions. [2022-02-20 18:46:42,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:46:42,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:46:42,029 INFO L74 IsIncluded]: Start isIncluded. First operand has 2885 states, 2884 states have (on average 1.535367545076283) internal successors, (4428), 2884 states have internal predecessors, (4428), 0 states have call successors, (0), 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 2891 states. [2022-02-20 18:46:42,043 INFO L87 Difference]: Start difference. First operand has 2885 states, 2884 states have (on average 1.535367545076283) internal successors, (4428), 2884 states have internal predecessors, (4428), 0 states have call successors, (0), 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 2891 states. [2022-02-20 18:46:42,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:42,279 INFO L93 Difference]: Finished difference Result 2891 states and 4431 transitions. [2022-02-20 18:46:42,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2891 states and 4431 transitions. [2022-02-20 18:46:42,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:46:42,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:46:42,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:46:42,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:46:42,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2885 states, 2884 states have (on average 1.535367545076283) internal successors, (4428), 2884 states have internal predecessors, (4428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:42,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2885 states to 2885 states and 4428 transitions. [2022-02-20 18:46:42,643 INFO L78 Accepts]: Start accepts. Automaton has 2885 states and 4428 transitions. Word has length 52 [2022-02-20 18:46:42,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:46:42,643 INFO L470 AbstractCegarLoop]: Abstraction has 2885 states and 4428 transitions. [2022-02-20 18:46:42,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 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:46:42,643 INFO L276 IsEmpty]: Start isEmpty. Operand 2885 states and 4428 transitions. [2022-02-20 18:46:42,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:46:42,644 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:46:42,644 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:46:42,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:46:42,645 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:46:42,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:46:42,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1774851107, now seen corresponding path program 1 times [2022-02-20 18:46:42,645 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:46:42,645 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753953230] [2022-02-20 18:46:42,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:46:42,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:46:42,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:46:42,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {28604#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(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_10566~0 := 0;~__return_10692~0 := 0; {28604#true} is VALID [2022-02-20 18:46:42,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {28604#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {28604#true} is VALID [2022-02-20 18:46:42,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {28604#true} assume 0 == ~r1~0 % 256; {28604#true} is VALID [2022-02-20 18:46:42,684 INFO L290 TraceCheckUtils]: 3: Hoare triple {28604#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {28604#true} is VALID [2022-02-20 18:46:42,684 INFO L290 TraceCheckUtils]: 4: Hoare triple {28604#true} assume ~id1~0 >= 0; {28604#true} is VALID [2022-02-20 18:46:42,684 INFO L290 TraceCheckUtils]: 5: Hoare triple {28604#true} assume 0 == ~st1~0; {28604#true} is VALID [2022-02-20 18:46:42,684 INFO L290 TraceCheckUtils]: 6: Hoare triple {28604#true} assume ~send1~0 == ~id1~0; {28604#true} is VALID [2022-02-20 18:46:42,685 INFO L290 TraceCheckUtils]: 7: Hoare triple {28604#true} assume 0 == ~mode1~0 % 256; {28606#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:46:42,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {28606#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {28606#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:46:42,686 INFO L290 TraceCheckUtils]: 9: Hoare triple {28606#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {28606#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:46:42,686 INFO L290 TraceCheckUtils]: 10: Hoare triple {28606#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {28606#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:46:42,686 INFO L290 TraceCheckUtils]: 11: Hoare triple {28606#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {28606#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:46:42,687 INFO L290 TraceCheckUtils]: 12: Hoare triple {28606#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {28606#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:46:42,687 INFO L290 TraceCheckUtils]: 13: Hoare triple {28606#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {28606#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:46:42,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {28606#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {28606#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:46:42,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {28606#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {28606#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:46:42,688 INFO L290 TraceCheckUtils]: 16: Hoare triple {28606#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {28606#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:46:42,688 INFO L290 TraceCheckUtils]: 17: Hoare triple {28606#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {28606#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:46:42,689 INFO L290 TraceCheckUtils]: 18: Hoare triple {28606#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {28606#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:46:42,689 INFO L290 TraceCheckUtils]: 19: Hoare triple {28606#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {28606#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:46:42,690 INFO L290 TraceCheckUtils]: 20: Hoare triple {28606#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {28606#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:46:42,690 INFO L290 TraceCheckUtils]: 21: Hoare triple {28606#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {28606#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:46:42,690 INFO L290 TraceCheckUtils]: 22: Hoare triple {28606#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {28606#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:46:42,691 INFO L290 TraceCheckUtils]: 23: Hoare triple {28606#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {28606#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:46:42,691 INFO L290 TraceCheckUtils]: 24: Hoare triple {28606#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {28606#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:46:42,691 INFO L290 TraceCheckUtils]: 25: Hoare triple {28606#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_10566~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_10566~0; {28606#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:46:42,692 INFO L290 TraceCheckUtils]: 26: Hoare triple {28606#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {28606#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:46:42,692 INFO L290 TraceCheckUtils]: 27: Hoare triple {28606#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {28606#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:46:42,693 INFO L290 TraceCheckUtils]: 28: Hoare triple {28606#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~mode1~0 % 256); {28605#false} is VALID [2022-02-20 18:46:42,693 INFO L290 TraceCheckUtils]: 29: Hoare triple {28605#false} assume 255 == ~r1~0 % 256;~r1~0 := 3; {28605#false} is VALID [2022-02-20 18:46:42,693 INFO L290 TraceCheckUtils]: 30: Hoare triple {28605#false} ~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {28605#false} is VALID [2022-02-20 18:46:42,693 INFO L290 TraceCheckUtils]: 31: Hoare triple {28605#false} assume !(main_~node1__m1~0#1 != ~nomsg~0); {28605#false} is VALID [2022-02-20 18:46:42,693 INFO L290 TraceCheckUtils]: 32: Hoare triple {28605#false} ~mode1~0 := 0; {28605#false} is VALID [2022-02-20 18:46:42,693 INFO L290 TraceCheckUtils]: 33: Hoare triple {28605#false} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {28605#false} is VALID [2022-02-20 18:46:42,694 INFO L290 TraceCheckUtils]: 34: Hoare triple {28605#false} assume !!(0 == ~mode2~0 % 256); {28605#false} is VALID [2022-02-20 18:46:42,694 INFO L290 TraceCheckUtils]: 35: Hoare triple {28605#false} assume !!(0 == ~alive2~0 % 256); {28605#false} is VALID [2022-02-20 18:46:42,694 INFO L290 TraceCheckUtils]: 36: Hoare triple {28605#false} assume !(~send2~0 != ~id2~0); {28605#false} is VALID [2022-02-20 18:46:42,694 INFO L290 TraceCheckUtils]: 37: Hoare triple {28605#false} ~mode2~0 := 1; {28605#false} is VALID [2022-02-20 18:46:42,694 INFO L290 TraceCheckUtils]: 38: Hoare triple {28605#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {28605#false} is VALID [2022-02-20 18:46:42,694 INFO L290 TraceCheckUtils]: 39: Hoare triple {28605#false} assume !!(0 == ~mode3~0 % 256); {28605#false} is VALID [2022-02-20 18:46:42,694 INFO L290 TraceCheckUtils]: 40: Hoare triple {28605#false} assume !!(0 == ~alive3~0 % 256); {28605#false} is VALID [2022-02-20 18:46:42,694 INFO L290 TraceCheckUtils]: 41: Hoare triple {28605#false} assume !(~send3~0 != ~id3~0); {28605#false} is VALID [2022-02-20 18:46:42,695 INFO L290 TraceCheckUtils]: 42: Hoare triple {28605#false} ~mode3~0 := 1; {28605#false} is VALID [2022-02-20 18:46:42,695 INFO L290 TraceCheckUtils]: 43: Hoare triple {28605#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {28605#false} is VALID [2022-02-20 18:46:42,695 INFO L290 TraceCheckUtils]: 44: Hoare triple {28605#false} assume !!(0 == ~mode4~0 % 256); {28605#false} is VALID [2022-02-20 18:46:42,695 INFO L290 TraceCheckUtils]: 45: Hoare triple {28605#false} assume !!(0 == ~alive4~0 % 256); {28605#false} is VALID [2022-02-20 18:46:42,695 INFO L290 TraceCheckUtils]: 46: Hoare triple {28605#false} assume !(~send4~0 != ~id4~0); {28605#false} is VALID [2022-02-20 18:46:42,695 INFO L290 TraceCheckUtils]: 47: Hoare triple {28605#false} ~mode4~0 := 1; {28605#false} is VALID [2022-02-20 18:46:42,695 INFO L290 TraceCheckUtils]: 48: Hoare triple {28605#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {28605#false} is VALID [2022-02-20 18:46:42,696 INFO L290 TraceCheckUtils]: 49: Hoare triple {28605#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {28605#false} is VALID [2022-02-20 18:46:42,696 INFO L290 TraceCheckUtils]: 50: Hoare triple {28605#false} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1; {28605#false} is VALID [2022-02-20 18:46:42,696 INFO L290 TraceCheckUtils]: 51: Hoare triple {28605#false} ~__return_10692~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_10692~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {28605#false} is VALID [2022-02-20 18:46:42,696 INFO L290 TraceCheckUtils]: 52: Hoare triple {28605#false} assume 0 == main_~assert__arg~0#1 % 256; {28605#false} is VALID [2022-02-20 18:46:42,696 INFO L290 TraceCheckUtils]: 53: Hoare triple {28605#false} assume !false; {28605#false} is VALID [2022-02-20 18:46:42,696 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:46:42,697 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:46:42,697 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753953230] [2022-02-20 18:46:42,697 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753953230] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:46:42,697 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:46:42,697 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:46:42,697 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605618696] [2022-02-20 18:46:42,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:46:42,698 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:46:42,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:46:42,698 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:46:42,739 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:46:42,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:46:42,739 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:46:42,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:46:42,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:46:42,740 INFO L87 Difference]: Start difference. First operand 2885 states and 4428 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:46:50,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:50,683 INFO L93 Difference]: Finished difference Result 7769 states and 11886 transitions. [2022-02-20 18:46:50,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:46:50,683 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:46:50,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:46:50,683 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:46:50,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2022-02-20 18:46:50,685 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:46:50,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2022-02-20 18:46:50,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 372 transitions. [2022-02-20 18:46:50,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 372 edges. 372 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:46:51,985 INFO L225 Difference]: With dead ends: 7769 [2022-02-20 18:46:51,985 INFO L226 Difference]: Without dead ends: 4911 [2022-02-20 18:46:52,012 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:46:52,016 INFO L933 BasicCegarLoop]: 246 mSDtfsCounter, 107 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 361 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:46:52,018 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 361 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:46:52,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4911 states. [2022-02-20 18:46:56,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4911 to 4909. [2022-02-20 18:46:56,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:46:56,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4911 states. Second operand has 4909 states, 4908 states have (on average 1.5118174409127954) internal successors, (7420), 4908 states have internal predecessors, (7420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:56,156 INFO L74 IsIncluded]: Start isIncluded. First operand 4911 states. Second operand has 4909 states, 4908 states have (on average 1.5118174409127954) internal successors, (7420), 4908 states have internal predecessors, (7420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:56,160 INFO L87 Difference]: Start difference. First operand 4911 states. Second operand has 4909 states, 4908 states have (on average 1.5118174409127954) internal successors, (7420), 4908 states have internal predecessors, (7420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:56,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:56,977 INFO L93 Difference]: Finished difference Result 4911 states and 7421 transitions. [2022-02-20 18:46:56,977 INFO L276 IsEmpty]: Start isEmpty. Operand 4911 states and 7421 transitions. [2022-02-20 18:46:56,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:46:56,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:46:57,001 INFO L74 IsIncluded]: Start isIncluded. First operand has 4909 states, 4908 states have (on average 1.5118174409127954) internal successors, (7420), 4908 states have internal predecessors, (7420), 0 states have call successors, (0), 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 4911 states. [2022-02-20 18:46:57,020 INFO L87 Difference]: Start difference. First operand has 4909 states, 4908 states have (on average 1.5118174409127954) internal successors, (7420), 4908 states have internal predecessors, (7420), 0 states have call successors, (0), 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 4911 states. [2022-02-20 18:46:57,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:46:57,815 INFO L93 Difference]: Finished difference Result 4911 states and 7421 transitions. [2022-02-20 18:46:57,815 INFO L276 IsEmpty]: Start isEmpty. Operand 4911 states and 7421 transitions. [2022-02-20 18:46:57,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:46:57,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:46:57,820 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:46:57,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:46:57,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4909 states, 4908 states have (on average 1.5118174409127954) internal successors, (7420), 4908 states have internal predecessors, (7420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:46:58,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4909 states to 4909 states and 7420 transitions. [2022-02-20 18:46:58,989 INFO L78 Accepts]: Start accepts. Automaton has 4909 states and 7420 transitions. Word has length 54 [2022-02-20 18:46:58,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:46:58,989 INFO L470 AbstractCegarLoop]: Abstraction has 4909 states and 7420 transitions. [2022-02-20 18:46:58,990 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:46:58,990 INFO L276 IsEmpty]: Start isEmpty. Operand 4909 states and 7420 transitions. [2022-02-20 18:46:58,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:46:58,990 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:46:58,990 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:46:58,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:46:58,991 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:46:58,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:46:58,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1725687444, now seen corresponding path program 1 times [2022-02-20 18:46:58,991 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:46:58,992 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18517504] [2022-02-20 18:46:58,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:46:58,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:46:59,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:46:59,047 INFO L290 TraceCheckUtils]: 0: Hoare triple {56149#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(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_10566~0 := 0;~__return_10692~0 := 0; {56151#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:59,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {56151#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {56151#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:59,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {56151#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {56151#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:59,049 INFO L290 TraceCheckUtils]: 3: Hoare triple {56151#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {56151#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:59,049 INFO L290 TraceCheckUtils]: 4: Hoare triple {56151#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {56151#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:59,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {56151#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {56151#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:59,050 INFO L290 TraceCheckUtils]: 6: Hoare triple {56151#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {56151#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:59,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {56151#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {56151#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:46:59,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {56151#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {56152#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:46:59,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {56152#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {56152#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:46:59,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {56152#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {56153#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:59,051 INFO L290 TraceCheckUtils]: 11: Hoare triple {56153#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {56153#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:59,052 INFO L290 TraceCheckUtils]: 12: Hoare triple {56153#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {56153#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:59,052 INFO L290 TraceCheckUtils]: 13: Hoare triple {56153#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {56153#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:59,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {56153#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {56153#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:59,053 INFO L290 TraceCheckUtils]: 15: Hoare triple {56153#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {56153#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:59,053 INFO L290 TraceCheckUtils]: 16: Hoare triple {56153#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id4~0 >= 0; {56153#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:59,053 INFO L290 TraceCheckUtils]: 17: Hoare triple {56153#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st4~0; {56153#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:59,054 INFO L290 TraceCheckUtils]: 18: Hoare triple {56153#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send4~0 == ~id4~0; {56153#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:59,054 INFO L290 TraceCheckUtils]: 19: Hoare triple {56153#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode4~0 % 256; {56153#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:59,054 INFO L290 TraceCheckUtils]: 20: Hoare triple {56153#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {56153#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:59,055 INFO L290 TraceCheckUtils]: 21: Hoare triple {56153#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {56153#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:59,055 INFO L290 TraceCheckUtils]: 22: Hoare triple {56153#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id4~0; {56153#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:59,055 INFO L290 TraceCheckUtils]: 23: Hoare triple {56153#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0; {56153#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:59,056 INFO L290 TraceCheckUtils]: 24: Hoare triple {56153#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id4~0; {56153#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:59,056 INFO L290 TraceCheckUtils]: 25: Hoare triple {56153#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_10566~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_10566~0; {56153#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:59,056 INFO L290 TraceCheckUtils]: 26: Hoare triple {56153#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {56153#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:59,057 INFO L290 TraceCheckUtils]: 27: Hoare triple {56153#(<= (+ ~nomsg~0 1) ~send2~0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {56153#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:59,057 INFO L290 TraceCheckUtils]: 28: Hoare triple {56153#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256); {56153#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:59,057 INFO L290 TraceCheckUtils]: 29: Hoare triple {56153#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~alive1~0 % 256); {56153#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:59,058 INFO L290 TraceCheckUtils]: 30: Hoare triple {56153#(<= (+ ~nomsg~0 1) ~send2~0)} ~mode1~0 := 1; {56153#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:59,058 INFO L290 TraceCheckUtils]: 31: Hoare triple {56153#(<= (+ ~nomsg~0 1) ~send2~0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {56153#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:59,058 INFO L290 TraceCheckUtils]: 32: Hoare triple {56153#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256); {56153#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:59,059 INFO L290 TraceCheckUtils]: 33: Hoare triple {56153#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {56153#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:46:59,059 INFO L290 TraceCheckUtils]: 34: Hoare triple {56153#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0); {56150#false} is VALID [2022-02-20 18:46:59,059 INFO L290 TraceCheckUtils]: 35: Hoare triple {56150#false} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {56150#false} is VALID [2022-02-20 18:46:59,059 INFO L290 TraceCheckUtils]: 36: Hoare triple {56150#false} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256); {56150#false} is VALID [2022-02-20 18:46:59,060 INFO L290 TraceCheckUtils]: 37: Hoare triple {56150#false} ~mode2~0 := 1; {56150#false} is VALID [2022-02-20 18:46:59,060 INFO L290 TraceCheckUtils]: 38: Hoare triple {56150#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {56150#false} is VALID [2022-02-20 18:46:59,060 INFO L290 TraceCheckUtils]: 39: Hoare triple {56150#false} assume !!(0 == ~mode3~0 % 256); {56150#false} is VALID [2022-02-20 18:46:59,060 INFO L290 TraceCheckUtils]: 40: Hoare triple {56150#false} assume !!(0 == ~alive3~0 % 256); {56150#false} is VALID [2022-02-20 18:46:59,060 INFO L290 TraceCheckUtils]: 41: Hoare triple {56150#false} assume !(~send3~0 != ~id3~0); {56150#false} is VALID [2022-02-20 18:46:59,060 INFO L290 TraceCheckUtils]: 42: Hoare triple {56150#false} ~mode3~0 := 1; {56150#false} is VALID [2022-02-20 18:46:59,060 INFO L290 TraceCheckUtils]: 43: Hoare triple {56150#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {56150#false} is VALID [2022-02-20 18:46:59,061 INFO L290 TraceCheckUtils]: 44: Hoare triple {56150#false} assume !!(0 == ~mode4~0 % 256); {56150#false} is VALID [2022-02-20 18:46:59,061 INFO L290 TraceCheckUtils]: 45: Hoare triple {56150#false} assume !!(0 == ~alive4~0 % 256); {56150#false} is VALID [2022-02-20 18:46:59,061 INFO L290 TraceCheckUtils]: 46: Hoare triple {56150#false} assume !(~send4~0 != ~id4~0); {56150#false} is VALID [2022-02-20 18:46:59,061 INFO L290 TraceCheckUtils]: 47: Hoare triple {56150#false} ~mode4~0 := 1; {56150#false} is VALID [2022-02-20 18:46:59,061 INFO L290 TraceCheckUtils]: 48: Hoare triple {56150#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {56150#false} is VALID [2022-02-20 18:46:59,061 INFO L290 TraceCheckUtils]: 49: Hoare triple {56150#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {56150#false} is VALID [2022-02-20 18:46:59,062 INFO L290 TraceCheckUtils]: 50: Hoare triple {56150#false} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1; {56150#false} is VALID [2022-02-20 18:46:59,062 INFO L290 TraceCheckUtils]: 51: Hoare triple {56150#false} ~__return_10692~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_10692~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {56150#false} is VALID [2022-02-20 18:46:59,062 INFO L290 TraceCheckUtils]: 52: Hoare triple {56150#false} assume 0 == main_~assert__arg~0#1 % 256; {56150#false} is VALID [2022-02-20 18:46:59,062 INFO L290 TraceCheckUtils]: 53: Hoare triple {56150#false} assume !false; {56150#false} is VALID [2022-02-20 18:46:59,062 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:46:59,063 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:46:59,063 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18517504] [2022-02-20 18:46:59,063 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18517504] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:46:59,063 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:46:59,063 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:46:59,063 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919139393] [2022-02-20 18:46:59,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:46:59,064 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 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:46:59,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:46:59,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 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:46:59,094 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:46:59,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:46:59,094 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:46:59,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:46:59,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:46:59,095 INFO L87 Difference]: Start difference. First operand 4909 states and 7420 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 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:47:20,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:20,987 INFO L93 Difference]: Finished difference Result 14673 states and 22206 transitions. [2022-02-20 18:47:20,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:47:20,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 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:47:20,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:47:20,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 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:47:20,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 393 transitions. [2022-02-20 18:47:20,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 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:47:20,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 393 transitions. [2022-02-20 18:47:20,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 393 transitions. [2022-02-20 18:47:21,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 393 edges. 393 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:47:25,470 INFO L225 Difference]: With dead ends: 14673 [2022-02-20 18:47:25,486 INFO L226 Difference]: Without dead ends: 9791 [2022-02-20 18:47:25,491 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:47:25,499 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 629 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:47:25,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [629 Valid, 177 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:47:25,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9791 states. [2022-02-20 18:47:34,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9791 to 9789. [2022-02-20 18:47:34,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:47:34,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9791 states. Second operand has 9789 states, 9788 states have (on average 1.5034736411932978) internal successors, (14716), 9788 states have internal predecessors, (14716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:34,868 INFO L74 IsIncluded]: Start isIncluded. First operand 9791 states. Second operand has 9789 states, 9788 states have (on average 1.5034736411932978) internal successors, (14716), 9788 states have internal predecessors, (14716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:34,876 INFO L87 Difference]: Start difference. First operand 9791 states. Second operand has 9789 states, 9788 states have (on average 1.5034736411932978) internal successors, (14716), 9788 states have internal predecessors, (14716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:47:37,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:37,938 INFO L93 Difference]: Finished difference Result 9791 states and 14717 transitions. [2022-02-20 18:47:37,938 INFO L276 IsEmpty]: Start isEmpty. Operand 9791 states and 14717 transitions. [2022-02-20 18:47:37,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:47:37,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:47:37,957 INFO L74 IsIncluded]: Start isIncluded. First operand has 9789 states, 9788 states have (on average 1.5034736411932978) internal successors, (14716), 9788 states have internal predecessors, (14716), 0 states have call successors, (0), 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 9791 states. [2022-02-20 18:47:37,964 INFO L87 Difference]: Start difference. First operand has 9789 states, 9788 states have (on average 1.5034736411932978) internal successors, (14716), 9788 states have internal predecessors, (14716), 0 states have call successors, (0), 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 9791 states. [2022-02-20 18:47:40,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:47:40,996 INFO L93 Difference]: Finished difference Result 9791 states and 14717 transitions. [2022-02-20 18:47:40,996 INFO L276 IsEmpty]: Start isEmpty. Operand 9791 states and 14717 transitions. [2022-02-20 18:47:41,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:47:41,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:47:41,006 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:47:41,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:47:41,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9789 states, 9788 states have (on average 1.5034736411932978) internal successors, (14716), 9788 states have internal predecessors, (14716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)