./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.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 17c1b3adab900925d0968acf284c9fae9bc7d0ec39197e53dc7bd6b93c5a8558 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:50:47,945 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:50:47,946 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:50:47,971 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:50:47,971 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:50:47,972 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:50:47,974 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:50:47,976 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:50:47,977 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:50:47,978 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:50:47,979 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:50:47,980 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:50:47,981 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:50:47,982 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:50:47,983 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:50:47,984 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:50:47,984 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:50:47,985 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:50:47,987 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:50:47,989 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:50:47,990 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:50:47,991 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:50:47,996 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:50:47,997 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:50:47,999 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:50:48,002 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:50:48,002 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:50:48,003 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:50:48,004 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:50:48,005 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:50:48,005 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:50:48,006 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:50:48,007 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:50:48,008 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:50:48,009 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:50:48,009 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:50:48,010 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:50:48,011 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:50:48,011 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:50:48,012 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:50:48,013 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:50:48,014 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:50:48,043 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:50:48,046 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:50:48,046 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:50:48,046 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:50:48,047 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:50:48,047 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:50:48,048 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:50:48,048 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:50:48,048 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:50:48,048 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:50:48,049 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:50:48,050 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:50:48,050 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:50:48,050 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:50:48,050 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:50:48,050 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:50:48,050 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:50:48,051 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:50:48,051 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:50:48,051 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:50:48,051 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:50:48,051 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:50:48,052 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:50:48,052 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:50:48,052 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:50:48,052 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:50:48,052 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:50:48,053 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:50:48,053 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:50:48,053 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:50:48,053 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:50:48,053 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:50:48,054 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:50:48,054 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 -> 17c1b3adab900925d0968acf284c9fae9bc7d0ec39197e53dc7bd6b93c5a8558 [2022-02-20 18:50:48,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:50:48,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:50:48,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:50:48,326 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:50:48,326 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:50:48,328 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:50:48,393 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/879135d2d/d8f736d3d61c47e09a313441a5e246a9/FLAG80ffa051e [2022-02-20 18:50:48,794 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:50:48,794 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:50:48,804 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/879135d2d/d8f736d3d61c47e09a313441a5e246a9/FLAG80ffa051e [2022-02-20 18:50:49,196 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/879135d2d/d8f736d3d61c47e09a313441a5e246a9 [2022-02-20 18:50:49,198 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:50:49,199 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:50:49,202 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:50:49,202 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:50:49,205 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:50:49,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:50:49" (1/1) ... [2022-02-20 18:50:49,207 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27c20aad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:49, skipping insertion in model container [2022-02-20 18:50:49,207 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:50:49" (1/1) ... [2022-02-20 18:50:49,213 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:50:49,234 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:50:49,418 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4105,4118] [2022-02-20 18:50:49,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:50:49,447 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:50:49,503 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4105,4118] [2022-02-20 18:50:49,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:50:49,540 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:50:49,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:49 WrapperNode [2022-02-20 18:50:49,541 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:50:49,542 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:50:49,542 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:50:49,542 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:50:49,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:49" (1/1) ... [2022-02-20 18:50:49,555 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:49" (1/1) ... [2022-02-20 18:50:49,593 INFO L137 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 266 [2022-02-20 18:50:49,596 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:50:49,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:50:49,598 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:50:49,599 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:50:49,606 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:49" (1/1) ... [2022-02-20 18:50:49,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:49" (1/1) ... [2022-02-20 18:50:49,626 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:49" (1/1) ... [2022-02-20 18:50:49,627 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:49" (1/1) ... [2022-02-20 18:50:49,632 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:49" (1/1) ... [2022-02-20 18:50:49,643 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:49" (1/1) ... [2022-02-20 18:50:49,645 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:49" (1/1) ... [2022-02-20 18:50:49,647 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:50:49,659 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:50:49,660 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:50:49,660 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:50:49,661 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:49" (1/1) ... [2022-02-20 18:50:49,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:50:49,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:50:49,691 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:50:49,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:50:49,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:50:49,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:50:49,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:50:49,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:50:49,865 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:50:49,867 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:50:50,272 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:50:50,277 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:50:50,278 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:50:50,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:50:50 BoogieIcfgContainer [2022-02-20 18:50:50,280 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:50:50,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:50:50,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:50:50,284 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:50:50,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:50:49" (1/3) ... [2022-02-20 18:50:50,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51f7c930 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:50:50, skipping insertion in model container [2022-02-20 18:50:50,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:49" (2/3) ... [2022-02-20 18:50:50,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51f7c930 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:50:50, skipping insertion in model container [2022-02-20 18:50:50,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:50:50" (3/3) ... [2022-02-20 18:50:50,287 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:50:50,292 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:50:50,292 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:50:50,329 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:50:50,334 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:50:50,334 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:50:50,360 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 62 states have (on average 1.6935483870967742) internal successors, (105), 63 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:50,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:50:50,366 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:50,367 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:50,368 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:50,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:50,393 INFO L85 PathProgramCache]: Analyzing trace with hash -976687966, now seen corresponding path program 1 times [2022-02-20 18:50:50,401 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:50,401 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86646404] [2022-02-20 18:50:50,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:50,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:50,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:50,698 INFO L290 TraceCheckUtils]: 0: Hoare triple {67#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1389~0 := 0;~__return_1465~0 := 0; {67#true} is VALID [2022-02-20 18:50:50,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {67#true} is VALID [2022-02-20 18:50:50,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {67#true} assume 0 == ~r1~0 % 256; {67#true} is VALID [2022-02-20 18:50:50,699 INFO L290 TraceCheckUtils]: 3: Hoare triple {67#true} assume ~id1~0 >= 0; {67#true} is VALID [2022-02-20 18:50:50,699 INFO L290 TraceCheckUtils]: 4: Hoare triple {67#true} assume 0 == ~st1~0; {67#true} is VALID [2022-02-20 18:50:50,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {67#true} assume ~send1~0 == ~id1~0; {67#true} is VALID [2022-02-20 18:50:50,700 INFO L290 TraceCheckUtils]: 6: Hoare triple {67#true} assume 0 == ~mode1~0 % 256; {67#true} is VALID [2022-02-20 18:50:50,700 INFO L290 TraceCheckUtils]: 7: Hoare triple {67#true} assume ~id2~0 >= 0; {67#true} is VALID [2022-02-20 18:50:50,701 INFO L290 TraceCheckUtils]: 8: Hoare triple {67#true} assume 0 == ~st2~0; {67#true} is VALID [2022-02-20 18:50:50,701 INFO L290 TraceCheckUtils]: 9: Hoare triple {67#true} assume ~send2~0 == ~id2~0; {67#true} is VALID [2022-02-20 18:50:50,702 INFO L290 TraceCheckUtils]: 10: Hoare triple {67#true} assume 0 == ~mode2~0 % 256; {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:50,706 INFO L290 TraceCheckUtils]: 11: Hoare triple {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:50,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:50,708 INFO L290 TraceCheckUtils]: 13: Hoare triple {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:50,709 INFO L290 TraceCheckUtils]: 14: Hoare triple {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:50,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:50,711 INFO L290 TraceCheckUtils]: 16: Hoare triple {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:50,712 INFO L290 TraceCheckUtils]: 17: Hoare triple {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1389~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1389~0; {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:50,713 INFO L290 TraceCheckUtils]: 18: Hoare triple {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:50,715 INFO L290 TraceCheckUtils]: 19: Hoare triple {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:50,719 INFO L290 TraceCheckUtils]: 20: Hoare triple {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:50,721 INFO L290 TraceCheckUtils]: 21: Hoare triple {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(~send1~0 != ~nomsg~0); {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:50,722 INFO L290 TraceCheckUtils]: 22: Hoare triple {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:50,723 INFO L290 TraceCheckUtils]: 23: Hoare triple {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:50,725 INFO L290 TraceCheckUtils]: 24: Hoare triple {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:50:50,736 INFO L290 TraceCheckUtils]: 25: Hoare triple {69#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {68#false} is VALID [2022-02-20 18:50:50,737 INFO L290 TraceCheckUtils]: 26: Hoare triple {68#false} assume !(main_~node2__m2~0#1 != ~nomsg~0); {68#false} is VALID [2022-02-20 18:50:50,737 INFO L290 TraceCheckUtils]: 27: Hoare triple {68#false} ~mode2~0 := 0; {68#false} is VALID [2022-02-20 18:50:50,739 INFO L290 TraceCheckUtils]: 28: Hoare triple {68#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {68#false} is VALID [2022-02-20 18:50:50,739 INFO L290 TraceCheckUtils]: 29: Hoare triple {68#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {68#false} is VALID [2022-02-20 18:50:50,739 INFO L290 TraceCheckUtils]: 30: Hoare triple {68#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {68#false} is VALID [2022-02-20 18:50:50,740 INFO L290 TraceCheckUtils]: 31: Hoare triple {68#false} ~mode3~0 := 0; {68#false} is VALID [2022-02-20 18:50:50,740 INFO L290 TraceCheckUtils]: 32: Hoare triple {68#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {68#false} is VALID [2022-02-20 18:50:50,741 INFO L290 TraceCheckUtils]: 33: Hoare triple {68#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {68#false} is VALID [2022-02-20 18:50:50,741 INFO L290 TraceCheckUtils]: 34: Hoare triple {68#false} ~__return_1465~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1465~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {68#false} is VALID [2022-02-20 18:50:50,741 INFO L290 TraceCheckUtils]: 35: Hoare triple {68#false} assume 0 == main_~assert__arg~0#1 % 256; {68#false} is VALID [2022-02-20 18:50:50,742 INFO L290 TraceCheckUtils]: 36: Hoare triple {68#false} assume !false; {68#false} is VALID [2022-02-20 18:50:50,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:50:50,744 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:50,744 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86646404] [2022-02-20 18:50:50,744 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86646404] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:50,745 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:50,745 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:50:50,746 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027168240] [2022-02-20 18:50:50,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:50,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-02-20 18:50:50,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:50,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:50,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:50,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:50:50,804 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:50,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:50:50,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:50:50,832 INFO L87 Difference]: Start difference. First operand has 64 states, 62 states have (on average 1.6935483870967742) internal successors, (105), 63 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:51,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:51,081 INFO L93 Difference]: Finished difference Result 146 states and 230 transitions. [2022-02-20 18:50:51,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:50:51,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-02-20 18:50:51,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:51,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:51,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2022-02-20 18:50:51,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:51,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2022-02-20 18:50:51,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 230 transitions. [2022-02-20 18:50:51,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 230 edges. 230 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:51,339 INFO L225 Difference]: With dead ends: 146 [2022-02-20 18:50:51,340 INFO L226 Difference]: Without dead ends: 95 [2022-02-20 18:50:51,342 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:50:51,347 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 61 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:51,348 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 211 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:50:51,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-02-20 18:50:51,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2022-02-20 18:50:51,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:51,377 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 93 states, 92 states have (on average 1.4782608695652173) internal successors, (136), 92 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:51,378 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 93 states, 92 states have (on average 1.4782608695652173) internal successors, (136), 92 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:51,379 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 93 states, 92 states have (on average 1.4782608695652173) internal successors, (136), 92 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:51,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:51,384 INFO L93 Difference]: Finished difference Result 95 states and 137 transitions. [2022-02-20 18:50:51,384 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2022-02-20 18:50:51,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:51,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:51,386 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 92 states have (on average 1.4782608695652173) internal successors, (136), 92 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 95 states. [2022-02-20 18:50:51,387 INFO L87 Difference]: Start difference. First operand has 93 states, 92 states have (on average 1.4782608695652173) internal successors, (136), 92 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 95 states. [2022-02-20 18:50:51,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:51,392 INFO L93 Difference]: Finished difference Result 95 states and 137 transitions. [2022-02-20 18:50:51,392 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2022-02-20 18:50:51,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:51,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:51,393 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:51,394 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:51,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.4782608695652173) internal successors, (136), 92 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:51,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 136 transitions. [2022-02-20 18:50:51,400 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 136 transitions. Word has length 37 [2022-02-20 18:50:51,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:51,400 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 136 transitions. [2022-02-20 18:50:51,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:51,401 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 136 transitions. [2022-02-20 18:50:51,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 18:50:51,402 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:51,402 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:51,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:50:51,403 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:51,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:51,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1572742836, now seen corresponding path program 1 times [2022-02-20 18:50:51,404 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:51,404 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754189972] [2022-02-20 18:50:51,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:51,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:51,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {578#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1389~0 := 0;~__return_1465~0 := 0; {578#true} is VALID [2022-02-20 18:50:51,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {578#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {578#true} is VALID [2022-02-20 18:50:51,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {578#true} assume 0 == ~r1~0 % 256; {578#true} is VALID [2022-02-20 18:50:51,488 INFO L290 TraceCheckUtils]: 3: Hoare triple {578#true} assume ~id1~0 >= 0; {578#true} is VALID [2022-02-20 18:50:51,489 INFO L290 TraceCheckUtils]: 4: Hoare triple {578#true} assume 0 == ~st1~0; {578#true} is VALID [2022-02-20 18:50:51,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {578#true} assume ~send1~0 == ~id1~0; {578#true} is VALID [2022-02-20 18:50:51,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {578#true} assume 0 == ~mode1~0 % 256; {578#true} is VALID [2022-02-20 18:50:51,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {578#true} assume ~id2~0 >= 0; {578#true} is VALID [2022-02-20 18:50:51,490 INFO L290 TraceCheckUtils]: 8: Hoare triple {578#true} assume 0 == ~st2~0; {578#true} is VALID [2022-02-20 18:50:51,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {578#true} assume ~send2~0 == ~id2~0; {578#true} is VALID [2022-02-20 18:50:51,490 INFO L290 TraceCheckUtils]: 10: Hoare triple {578#true} assume 0 == ~mode2~0 % 256; {578#true} is VALID [2022-02-20 18:50:51,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {578#true} assume ~id3~0 >= 0; {578#true} is VALID [2022-02-20 18:50:51,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {578#true} assume 0 == ~st3~0; {578#true} is VALID [2022-02-20 18:50:51,491 INFO L290 TraceCheckUtils]: 13: Hoare triple {578#true} assume ~send3~0 == ~id3~0; {578#true} is VALID [2022-02-20 18:50:51,491 INFO L290 TraceCheckUtils]: 14: Hoare triple {578#true} assume 0 == ~mode3~0 % 256; {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:51,492 INFO L290 TraceCheckUtils]: 15: Hoare triple {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:51,493 INFO L290 TraceCheckUtils]: 16: Hoare triple {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:51,493 INFO L290 TraceCheckUtils]: 17: Hoare triple {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1389~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1389~0; {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:51,494 INFO L290 TraceCheckUtils]: 18: Hoare triple {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:51,494 INFO L290 TraceCheckUtils]: 19: Hoare triple {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:51,495 INFO L290 TraceCheckUtils]: 20: Hoare triple {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:51,496 INFO L290 TraceCheckUtils]: 21: Hoare triple {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send1~0 != ~nomsg~0); {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:51,496 INFO L290 TraceCheckUtils]: 22: Hoare triple {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:51,497 INFO L290 TraceCheckUtils]: 23: Hoare triple {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:51,497 INFO L290 TraceCheckUtils]: 24: Hoare triple {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:51,498 INFO L290 TraceCheckUtils]: 25: Hoare triple {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:51,499 INFO L290 TraceCheckUtils]: 26: Hoare triple {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send2~0 != ~nomsg~0); {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:51,499 INFO L290 TraceCheckUtils]: 27: Hoare triple {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:51,500 INFO L290 TraceCheckUtils]: 28: Hoare triple {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:51,500 INFO L290 TraceCheckUtils]: 29: Hoare triple {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:50:51,501 INFO L290 TraceCheckUtils]: 30: Hoare triple {580#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {579#false} is VALID [2022-02-20 18:50:51,501 INFO L290 TraceCheckUtils]: 31: Hoare triple {579#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {579#false} is VALID [2022-02-20 18:50:51,502 INFO L290 TraceCheckUtils]: 32: Hoare triple {579#false} ~mode3~0 := 0; {579#false} is VALID [2022-02-20 18:50:51,502 INFO L290 TraceCheckUtils]: 33: Hoare triple {579#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {579#false} is VALID [2022-02-20 18:50:51,502 INFO L290 TraceCheckUtils]: 34: Hoare triple {579#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {579#false} is VALID [2022-02-20 18:50:51,502 INFO L290 TraceCheckUtils]: 35: Hoare triple {579#false} ~__return_1465~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1465~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {579#false} is VALID [2022-02-20 18:50:51,502 INFO L290 TraceCheckUtils]: 36: Hoare triple {579#false} assume 0 == main_~assert__arg~0#1 % 256; {579#false} is VALID [2022-02-20 18:50:51,503 INFO L290 TraceCheckUtils]: 37: Hoare triple {579#false} assume !false; {579#false} is VALID [2022-02-20 18:50:51,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:50:51,503 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:51,504 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754189972] [2022-02-20 18:50:51,504 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754189972] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:51,504 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:51,504 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:50:51,505 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146232867] [2022-02-20 18:50:51,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:51,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-02-20 18:50:51,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:51,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:51,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:51,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:50:51,537 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:51,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:50:51,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:50:51,538 INFO L87 Difference]: Start difference. First operand 93 states and 136 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:51,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:51,716 INFO L93 Difference]: Finished difference Result 225 states and 344 transitions. [2022-02-20 18:50:51,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:50:51,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-02-20 18:50:51,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:51,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:51,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2022-02-20 18:50:51,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:51,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2022-02-20 18:50:51,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 204 transitions. [2022-02-20 18:50:51,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:51,903 INFO L225 Difference]: With dead ends: 225 [2022-02-20 18:50:51,903 INFO L226 Difference]: Without dead ends: 151 [2022-02-20 18:50:51,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:50:51,905 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 46 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:51,907 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 176 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:50:51,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-02-20 18:50:51,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2022-02-20 18:50:51,929 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:51,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand has 149 states, 148 states have (on average 1.5135135135135136) internal successors, (224), 148 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:51,932 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand has 149 states, 148 states have (on average 1.5135135135135136) internal successors, (224), 148 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:51,933 INFO L87 Difference]: Start difference. First operand 151 states. Second operand has 149 states, 148 states have (on average 1.5135135135135136) internal successors, (224), 148 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:51,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:51,940 INFO L93 Difference]: Finished difference Result 151 states and 225 transitions. [2022-02-20 18:50:51,940 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 225 transitions. [2022-02-20 18:50:51,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:51,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:51,945 INFO L74 IsIncluded]: Start isIncluded. First operand has 149 states, 148 states have (on average 1.5135135135135136) internal successors, (224), 148 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 151 states. [2022-02-20 18:50:51,946 INFO L87 Difference]: Start difference. First operand has 149 states, 148 states have (on average 1.5135135135135136) internal successors, (224), 148 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 151 states. [2022-02-20 18:50:51,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:51,952 INFO L93 Difference]: Finished difference Result 151 states and 225 transitions. [2022-02-20 18:50:51,953 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 225 transitions. [2022-02-20 18:50:51,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:51,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:51,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:51,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:51,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 1.5135135135135136) internal successors, (224), 148 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:51,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 224 transitions. [2022-02-20 18:50:51,961 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 224 transitions. Word has length 38 [2022-02-20 18:50:51,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:51,963 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 224 transitions. [2022-02-20 18:50:51,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:51,965 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 224 transitions. [2022-02-20 18:50:51,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 18:50:51,969 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:51,970 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:51,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:50:51,970 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:51,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:51,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1624580866, now seen corresponding path program 1 times [2022-02-20 18:50:51,971 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:51,971 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918423030] [2022-02-20 18:50:51,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:51,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:52,053 INFO L290 TraceCheckUtils]: 0: Hoare triple {1392#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1389~0 := 0;~__return_1465~0 := 0; {1392#true} is VALID [2022-02-20 18:50:52,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {1392#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {1392#true} is VALID [2022-02-20 18:50:52,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {1392#true} assume 0 == ~r1~0 % 256; {1392#true} is VALID [2022-02-20 18:50:52,054 INFO L290 TraceCheckUtils]: 3: Hoare triple {1392#true} assume ~id1~0 >= 0; {1392#true} is VALID [2022-02-20 18:50:52,054 INFO L290 TraceCheckUtils]: 4: Hoare triple {1392#true} assume 0 == ~st1~0; {1394#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:52,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {1394#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {1394#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:52,055 INFO L290 TraceCheckUtils]: 6: Hoare triple {1394#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {1394#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:52,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {1394#(<= ~st1~0 0)} assume ~id2~0 >= 0; {1394#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:52,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {1394#(<= ~st1~0 0)} assume 0 == ~st2~0; {1395#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:52,056 INFO L290 TraceCheckUtils]: 9: Hoare triple {1395#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {1395#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:52,057 INFO L290 TraceCheckUtils]: 10: Hoare triple {1395#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {1395#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:52,057 INFO L290 TraceCheckUtils]: 11: Hoare triple {1395#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {1395#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:52,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {1395#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:52,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:52,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:52,059 INFO L290 TraceCheckUtils]: 15: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:52,060 INFO L290 TraceCheckUtils]: 16: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:52,060 INFO L290 TraceCheckUtils]: 17: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1389~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1389~0; {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:52,061 INFO L290 TraceCheckUtils]: 18: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:52,061 INFO L290 TraceCheckUtils]: 19: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:52,061 INFO L290 TraceCheckUtils]: 20: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:52,062 INFO L290 TraceCheckUtils]: 21: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0); {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:52,062 INFO L290 TraceCheckUtils]: 22: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:52,063 INFO L290 TraceCheckUtils]: 23: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:52,064 INFO L290 TraceCheckUtils]: 24: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:52,064 INFO L290 TraceCheckUtils]: 25: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:52,065 INFO L290 TraceCheckUtils]: 26: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0); {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:52,065 INFO L290 TraceCheckUtils]: 27: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:52,066 INFO L290 TraceCheckUtils]: 28: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:52,066 INFO L290 TraceCheckUtils]: 29: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:52,067 INFO L290 TraceCheckUtils]: 30: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:52,067 INFO L290 TraceCheckUtils]: 31: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0; {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:52,069 INFO L290 TraceCheckUtils]: 32: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:52,070 INFO L290 TraceCheckUtils]: 33: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:52,070 INFO L290 TraceCheckUtils]: 34: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:52,071 INFO L290 TraceCheckUtils]: 35: Hoare triple {1396#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {1393#false} is VALID [2022-02-20 18:50:52,071 INFO L290 TraceCheckUtils]: 36: Hoare triple {1393#false} ~__return_1465~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1465~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {1393#false} is VALID [2022-02-20 18:50:52,071 INFO L290 TraceCheckUtils]: 37: Hoare triple {1393#false} assume 0 == main_~assert__arg~0#1 % 256; {1393#false} is VALID [2022-02-20 18:50:52,071 INFO L290 TraceCheckUtils]: 38: Hoare triple {1393#false} assume !false; {1393#false} is VALID [2022-02-20 18:50:52,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:50:52,073 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:52,073 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918423030] [2022-02-20 18:50:52,073 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918423030] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:52,073 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:52,074 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:50:52,074 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69678564] [2022-02-20 18:50:52,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:52,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-02-20 18:50:52,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:52,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:52,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:52,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:52,106 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:52,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:52,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:52,107 INFO L87 Difference]: Start difference. First operand 149 states and 224 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:53,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:53,019 INFO L93 Difference]: Finished difference Result 929 states and 1454 transitions. [2022-02-20 18:50:53,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:50:53,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-02-20 18:50:53,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:53,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:53,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 481 transitions. [2022-02-20 18:50:53,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:53,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 481 transitions. [2022-02-20 18:50:53,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 481 transitions. [2022-02-20 18:50:53,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 481 edges. 481 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:53,450 INFO L225 Difference]: With dead ends: 929 [2022-02-20 18:50:53,450 INFO L226 Difference]: Without dead ends: 799 [2022-02-20 18:50:53,451 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:50:53,452 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 410 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:53,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [410 Valid, 575 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:50:53,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2022-02-20 18:50:53,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 277. [2022-02-20 18:50:53,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:53,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 799 states. Second operand has 277 states, 276 states have (on average 1.5217391304347827) internal successors, (420), 276 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:53,611 INFO L74 IsIncluded]: Start isIncluded. First operand 799 states. Second operand has 277 states, 276 states have (on average 1.5217391304347827) internal successors, (420), 276 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:53,612 INFO L87 Difference]: Start difference. First operand 799 states. Second operand has 277 states, 276 states have (on average 1.5217391304347827) internal successors, (420), 276 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:53,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:53,649 INFO L93 Difference]: Finished difference Result 799 states and 1225 transitions. [2022-02-20 18:50:53,650 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1225 transitions. [2022-02-20 18:50:53,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:53,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:53,652 INFO L74 IsIncluded]: Start isIncluded. First operand has 277 states, 276 states have (on average 1.5217391304347827) internal successors, (420), 276 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 799 states. [2022-02-20 18:50:53,653 INFO L87 Difference]: Start difference. First operand has 277 states, 276 states have (on average 1.5217391304347827) internal successors, (420), 276 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 799 states. [2022-02-20 18:50:53,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:53,692 INFO L93 Difference]: Finished difference Result 799 states and 1225 transitions. [2022-02-20 18:50:53,692 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1225 transitions. [2022-02-20 18:50:53,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:53,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:53,694 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:53,694 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:53,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.5217391304347827) internal successors, (420), 276 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:53,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 420 transitions. [2022-02-20 18:50:53,703 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 420 transitions. Word has length 39 [2022-02-20 18:50:53,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:53,704 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 420 transitions. [2022-02-20 18:50:53,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:53,704 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 420 transitions. [2022-02-20 18:50:53,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 18:50:53,705 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:53,705 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:53,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:50:53,705 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:53,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:53,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1224060410, now seen corresponding path program 1 times [2022-02-20 18:50:53,706 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:53,706 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163483906] [2022-02-20 18:50:53,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:53,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:53,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {4678#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1389~0 := 0;~__return_1465~0 := 0; {4678#true} is VALID [2022-02-20 18:50:53,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {4678#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {4678#true} is VALID [2022-02-20 18:50:53,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {4678#true} assume 0 == ~r1~0 % 256; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:53,777 INFO L290 TraceCheckUtils]: 3: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 >= 0; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:53,778 INFO L290 TraceCheckUtils]: 4: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:53,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 == ~id1~0; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:53,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:53,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 >= 0; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:53,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:53,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 == ~id2~0; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:53,782 INFO L290 TraceCheckUtils]: 10: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:53,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 >= 0; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:53,782 INFO L290 TraceCheckUtils]: 12: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:53,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 == ~id3~0; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:53,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:53,792 INFO L290 TraceCheckUtils]: 15: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id2~0; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:53,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id3~0; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:53,792 INFO L290 TraceCheckUtils]: 17: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1389~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1389~0; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:53,793 INFO L290 TraceCheckUtils]: 18: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:53,793 INFO L290 TraceCheckUtils]: 19: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:53,794 INFO L290 TraceCheckUtils]: 20: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:53,794 INFO L290 TraceCheckUtils]: 21: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~send1~0 != ~nomsg~0); {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:53,794 INFO L290 TraceCheckUtils]: 22: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:53,795 INFO L290 TraceCheckUtils]: 23: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:53,795 INFO L290 TraceCheckUtils]: 24: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:53,795 INFO L290 TraceCheckUtils]: 25: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:53,796 INFO L290 TraceCheckUtils]: 26: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~send2~0 != ~nomsg~0); {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:53,796 INFO L290 TraceCheckUtils]: 27: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:53,796 INFO L290 TraceCheckUtils]: 28: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:53,797 INFO L290 TraceCheckUtils]: 29: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:53,799 INFO L290 TraceCheckUtils]: 30: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:53,800 INFO L290 TraceCheckUtils]: 31: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 != ~nomsg~0; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:53,800 INFO L290 TraceCheckUtils]: 32: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:53,801 INFO L290 TraceCheckUtils]: 33: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:53,801 INFO L290 TraceCheckUtils]: 34: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:53,801 INFO L290 TraceCheckUtils]: 35: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:50:53,802 INFO L290 TraceCheckUtils]: 36: Hoare triple {4680#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~r1~0 % 256 >= 3; {4679#false} is VALID [2022-02-20 18:50:53,802 INFO L290 TraceCheckUtils]: 37: Hoare triple {4679#false} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1; {4679#false} is VALID [2022-02-20 18:50:53,802 INFO L290 TraceCheckUtils]: 38: Hoare triple {4679#false} ~__return_1465~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1465~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {4679#false} is VALID [2022-02-20 18:50:53,802 INFO L290 TraceCheckUtils]: 39: Hoare triple {4679#false} assume 0 == main_~assert__arg~0#1 % 256; {4679#false} is VALID [2022-02-20 18:50:53,803 INFO L290 TraceCheckUtils]: 40: Hoare triple {4679#false} assume !false; {4679#false} is VALID [2022-02-20 18:50:53,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:50:53,803 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:53,803 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163483906] [2022-02-20 18:50:53,803 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163483906] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:53,804 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:53,804 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:50:53,804 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308175476] [2022-02-20 18:50:53,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:53,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 18:50:53,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:53,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:53,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:53,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:50:53,842 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:53,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:50:53,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:50:53,843 INFO L87 Difference]: Start difference. First operand 277 states and 420 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:54,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:54,273 INFO L93 Difference]: Finished difference Result 749 states and 1146 transitions. [2022-02-20 18:50:54,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:50:54,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 18:50:54,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:54,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:54,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 208 transitions. [2022-02-20 18:50:54,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:54,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 208 transitions. [2022-02-20 18:50:54,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 208 transitions. [2022-02-20 18:50:54,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:54,439 INFO L225 Difference]: With dead ends: 749 [2022-02-20 18:50:54,440 INFO L226 Difference]: Without dead ends: 491 [2022-02-20 18:50:54,441 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:50:54,456 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 36 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:54,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 141 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:50:54,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2022-02-20 18:50:54,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 481. [2022-02-20 18:50:54,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:54,745 INFO L82 GeneralOperation]: Start isEquivalent. First operand 491 states. Second operand has 481 states, 480 states have (on average 1.4916666666666667) internal successors, (716), 480 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:54,746 INFO L74 IsIncluded]: Start isIncluded. First operand 491 states. Second operand has 481 states, 480 states have (on average 1.4916666666666667) internal successors, (716), 480 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:54,747 INFO L87 Difference]: Start difference. First operand 491 states. Second operand has 481 states, 480 states have (on average 1.4916666666666667) internal successors, (716), 480 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:54,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:54,762 INFO L93 Difference]: Finished difference Result 491 states and 725 transitions. [2022-02-20 18:50:54,762 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 725 transitions. [2022-02-20 18:50:54,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:54,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:54,764 INFO L74 IsIncluded]: Start isIncluded. First operand has 481 states, 480 states have (on average 1.4916666666666667) internal successors, (716), 480 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 491 states. [2022-02-20 18:50:54,765 INFO L87 Difference]: Start difference. First operand has 481 states, 480 states have (on average 1.4916666666666667) internal successors, (716), 480 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 491 states. [2022-02-20 18:50:54,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:54,780 INFO L93 Difference]: Finished difference Result 491 states and 725 transitions. [2022-02-20 18:50:54,780 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 725 transitions. [2022-02-20 18:50:54,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:54,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:54,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:54,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:54,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 480 states have (on average 1.4916666666666667) internal successors, (716), 480 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:54,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 716 transitions. [2022-02-20 18:50:54,799 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 716 transitions. Word has length 41 [2022-02-20 18:50:54,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:54,799 INFO L470 AbstractCegarLoop]: Abstraction has 481 states and 716 transitions. [2022-02-20 18:50:54,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:54,800 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 716 transitions. [2022-02-20 18:50:54,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 18:50:54,800 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:54,800 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:54,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:50:54,801 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:54,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:54,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1245063065, now seen corresponding path program 1 times [2022-02-20 18:50:54,801 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:54,801 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649062268] [2022-02-20 18:50:54,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:54,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:54,935 INFO L290 TraceCheckUtils]: 0: Hoare triple {7383#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1389~0 := 0;~__return_1465~0 := 0; {7383#true} is VALID [2022-02-20 18:50:54,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {7383#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {7383#true} is VALID [2022-02-20 18:50:54,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {7383#true} assume 0 == ~r1~0 % 256; {7383#true} is VALID [2022-02-20 18:50:54,936 INFO L290 TraceCheckUtils]: 3: Hoare triple {7383#true} assume ~id1~0 >= 0; {7383#true} is VALID [2022-02-20 18:50:54,937 INFO L290 TraceCheckUtils]: 4: Hoare triple {7383#true} assume 0 == ~st1~0; {7385#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:50:54,937 INFO L290 TraceCheckUtils]: 5: Hoare triple {7385#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send1~0 == ~id1~0; {7385#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:50:54,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {7385#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode1~0 % 256; {7385#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:50:54,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {7385#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id2~0 >= 0; {7385#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:50:54,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {7385#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st2~0; {7386#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:50:54,939 INFO L290 TraceCheckUtils]: 9: Hoare triple {7386#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~send2~0 == ~id2~0; {7386#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:50:54,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {7386#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~mode2~0 % 256; {7386#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:50:54,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {7386#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~id3~0 >= 0; {7386#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:50:54,955 INFO L290 TraceCheckUtils]: 12: Hoare triple {7386#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~st3~0; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:54,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send3~0 == ~id3~0; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:54,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume 0 == ~mode3~0 % 256; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:54,957 INFO L290 TraceCheckUtils]: 15: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id2~0; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:54,958 INFO L290 TraceCheckUtils]: 16: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id3~0; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:54,958 INFO L290 TraceCheckUtils]: 17: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1389~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1389~0; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:54,959 INFO L290 TraceCheckUtils]: 18: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:54,960 INFO L290 TraceCheckUtils]: 19: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:54,963 INFO L290 TraceCheckUtils]: 20: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:54,963 INFO L290 TraceCheckUtils]: 21: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~send1~0 != ~nomsg~0); {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:54,964 INFO L290 TraceCheckUtils]: 22: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:54,964 INFO L290 TraceCheckUtils]: 23: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:54,965 INFO L290 TraceCheckUtils]: 24: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:54,965 INFO L290 TraceCheckUtils]: 25: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:54,966 INFO L290 TraceCheckUtils]: 26: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~send2~0 != ~nomsg~0); {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:54,967 INFO L290 TraceCheckUtils]: 27: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:54,967 INFO L290 TraceCheckUtils]: 28: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:54,967 INFO L290 TraceCheckUtils]: 29: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:54,969 INFO L290 TraceCheckUtils]: 30: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:54,969 INFO L290 TraceCheckUtils]: 31: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send3~0 != ~nomsg~0; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:54,970 INFO L290 TraceCheckUtils]: 32: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:54,973 INFO L290 TraceCheckUtils]: 33: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:54,976 INFO L290 TraceCheckUtils]: 34: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:54,977 INFO L290 TraceCheckUtils]: 35: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:54,977 INFO L290 TraceCheckUtils]: 36: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~r1~0 % 256 >= 3); {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:54,978 INFO L290 TraceCheckUtils]: 37: Hoare triple {7387#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~0#1 := 0; {7384#false} is VALID [2022-02-20 18:50:54,978 INFO L290 TraceCheckUtils]: 38: Hoare triple {7384#false} ~__return_1465~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1465~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {7384#false} is VALID [2022-02-20 18:50:54,978 INFO L290 TraceCheckUtils]: 39: Hoare triple {7384#false} assume 0 == main_~assert__arg~0#1 % 256; {7384#false} is VALID [2022-02-20 18:50:54,978 INFO L290 TraceCheckUtils]: 40: Hoare triple {7384#false} assume !false; {7384#false} is VALID [2022-02-20 18:50:54,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:50:54,979 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:54,979 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649062268] [2022-02-20 18:50:54,979 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649062268] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:54,979 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:54,979 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:50:54,980 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230615544] [2022-02-20 18:50:54,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:54,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 18:50:54,980 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:54,981 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:55,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:55,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:55,016 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:55,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:55,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:55,017 INFO L87 Difference]: Start difference. First operand 481 states and 716 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:55,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:55,706 INFO L93 Difference]: Finished difference Result 945 states and 1414 transitions. [2022-02-20 18:50:55,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:55,706 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 18:50:55,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:55,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:55,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 215 transitions. [2022-02-20 18:50:55,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:55,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 215 transitions. [2022-02-20 18:50:55,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 215 transitions. [2022-02-20 18:50:55,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 215 edges. 215 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:55,890 INFO L225 Difference]: With dead ends: 945 [2022-02-20 18:50:55,891 INFO L226 Difference]: Without dead ends: 483 [2022-02-20 18:50:55,891 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:50:55,892 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 180 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:55,893 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 204 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:50:55,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2022-02-20 18:50:56,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 481. [2022-02-20 18:50:56,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:56,230 INFO L82 GeneralOperation]: Start isEquivalent. First operand 483 states. Second operand has 481 states, 480 states have (on average 1.475) internal successors, (708), 480 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:56,231 INFO L74 IsIncluded]: Start isIncluded. First operand 483 states. Second operand has 481 states, 480 states have (on average 1.475) internal successors, (708), 480 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:56,232 INFO L87 Difference]: Start difference. First operand 483 states. Second operand has 481 states, 480 states have (on average 1.475) internal successors, (708), 480 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:56,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:56,249 INFO L93 Difference]: Finished difference Result 483 states and 709 transitions. [2022-02-20 18:50:56,249 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 709 transitions. [2022-02-20 18:50:56,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:56,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:56,251 INFO L74 IsIncluded]: Start isIncluded. First operand has 481 states, 480 states have (on average 1.475) internal successors, (708), 480 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 483 states. [2022-02-20 18:50:56,252 INFO L87 Difference]: Start difference. First operand has 481 states, 480 states have (on average 1.475) internal successors, (708), 480 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 483 states. [2022-02-20 18:50:56,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:56,266 INFO L93 Difference]: Finished difference Result 483 states and 709 transitions. [2022-02-20 18:50:56,267 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 709 transitions. [2022-02-20 18:50:56,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:56,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:56,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:56,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:56,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 480 states have (on average 1.475) internal successors, (708), 480 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:56,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 708 transitions. [2022-02-20 18:50:56,285 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 708 transitions. Word has length 41 [2022-02-20 18:50:56,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:56,285 INFO L470 AbstractCegarLoop]: Abstraction has 481 states and 708 transitions. [2022-02-20 18:50:56,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:56,285 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 708 transitions. [2022-02-20 18:50:56,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 18:50:56,285 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:56,286 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:56,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:50:56,286 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:56,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:56,287 INFO L85 PathProgramCache]: Analyzing trace with hash -59660072, now seen corresponding path program 1 times [2022-02-20 18:50:56,287 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:56,287 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465111727] [2022-02-20 18:50:56,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:56,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:56,390 INFO L290 TraceCheckUtils]: 0: Hoare triple {10348#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1389~0 := 0;~__return_1465~0 := 0; {10350#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:56,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {10350#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {10350#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:56,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {10350#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {10350#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:56,391 INFO L290 TraceCheckUtils]: 3: Hoare triple {10350#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {10351#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:50:56,392 INFO L290 TraceCheckUtils]: 4: Hoare triple {10351#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {10351#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:50:56,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {10351#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {10352#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:56,392 INFO L290 TraceCheckUtils]: 6: Hoare triple {10352#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {10352#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:56,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {10352#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {10352#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:56,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {10352#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {10352#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:56,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {10352#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {10352#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:56,397 INFO L290 TraceCheckUtils]: 10: Hoare triple {10352#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {10352#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:56,397 INFO L290 TraceCheckUtils]: 11: Hoare triple {10352#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {10352#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:56,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {10352#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {10352#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:56,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {10352#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {10352#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:56,400 INFO L290 TraceCheckUtils]: 14: Hoare triple {10352#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {10352#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:56,400 INFO L290 TraceCheckUtils]: 15: Hoare triple {10352#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {10352#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:56,400 INFO L290 TraceCheckUtils]: 16: Hoare triple {10352#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {10352#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:56,401 INFO L290 TraceCheckUtils]: 17: Hoare triple {10352#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1389~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1389~0; {10352#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:56,401 INFO L290 TraceCheckUtils]: 18: Hoare triple {10352#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {10352#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:56,401 INFO L290 TraceCheckUtils]: 19: Hoare triple {10352#(<= (+ ~nomsg~0 1) ~send1~0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {10352#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:56,402 INFO L290 TraceCheckUtils]: 20: Hoare triple {10352#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {10352#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:56,402 INFO L290 TraceCheckUtils]: 21: Hoare triple {10352#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(~send1~0 != ~nomsg~0); {10349#false} is VALID [2022-02-20 18:50:56,402 INFO L290 TraceCheckUtils]: 22: Hoare triple {10349#false} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {10349#false} is VALID [2022-02-20 18:50:56,403 INFO L290 TraceCheckUtils]: 23: Hoare triple {10349#false} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {10349#false} is VALID [2022-02-20 18:50:56,403 INFO L290 TraceCheckUtils]: 24: Hoare triple {10349#false} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {10349#false} is VALID [2022-02-20 18:50:56,403 INFO L290 TraceCheckUtils]: 25: Hoare triple {10349#false} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {10349#false} is VALID [2022-02-20 18:50:56,403 INFO L290 TraceCheckUtils]: 26: Hoare triple {10349#false} assume !(~send2~0 != ~nomsg~0); {10349#false} is VALID [2022-02-20 18:50:56,403 INFO L290 TraceCheckUtils]: 27: Hoare triple {10349#false} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {10349#false} is VALID [2022-02-20 18:50:56,403 INFO L290 TraceCheckUtils]: 28: Hoare triple {10349#false} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {10349#false} is VALID [2022-02-20 18:50:56,404 INFO L290 TraceCheckUtils]: 29: Hoare triple {10349#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {10349#false} is VALID [2022-02-20 18:50:56,404 INFO L290 TraceCheckUtils]: 30: Hoare triple {10349#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {10349#false} is VALID [2022-02-20 18:50:56,404 INFO L290 TraceCheckUtils]: 31: Hoare triple {10349#false} assume ~send3~0 != ~nomsg~0; {10349#false} is VALID [2022-02-20 18:50:56,404 INFO L290 TraceCheckUtils]: 32: Hoare triple {10349#false} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {10349#false} is VALID [2022-02-20 18:50:56,404 INFO L290 TraceCheckUtils]: 33: Hoare triple {10349#false} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {10349#false} is VALID [2022-02-20 18:50:56,404 INFO L290 TraceCheckUtils]: 34: Hoare triple {10349#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {10349#false} is VALID [2022-02-20 18:50:56,405 INFO L290 TraceCheckUtils]: 35: Hoare triple {10349#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {10349#false} is VALID [2022-02-20 18:50:56,405 INFO L290 TraceCheckUtils]: 36: Hoare triple {10349#false} assume !(~r1~0 % 256 >= 3); {10349#false} is VALID [2022-02-20 18:50:56,405 INFO L290 TraceCheckUtils]: 37: Hoare triple {10349#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {10349#false} is VALID [2022-02-20 18:50:56,405 INFO L290 TraceCheckUtils]: 38: Hoare triple {10349#false} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1; {10349#false} is VALID [2022-02-20 18:50:56,405 INFO L290 TraceCheckUtils]: 39: Hoare triple {10349#false} ~__return_1465~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1465~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {10349#false} is VALID [2022-02-20 18:50:56,406 INFO L290 TraceCheckUtils]: 40: Hoare triple {10349#false} assume 0 == main_~assert__arg~0#1 % 256; {10349#false} is VALID [2022-02-20 18:50:56,406 INFO L290 TraceCheckUtils]: 41: Hoare triple {10349#false} assume !false; {10349#false} is VALID [2022-02-20 18:50:56,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:50:56,406 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:56,406 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465111727] [2022-02-20 18:50:56,407 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465111727] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:56,407 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:56,407 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:50:56,407 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083411218] [2022-02-20 18:50:56,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:56,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-02-20 18:50:56,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:56,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:56,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:56,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:56,439 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:56,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:56,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:56,440 INFO L87 Difference]: Start difference. First operand 481 states and 708 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:57,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:57,378 INFO L93 Difference]: Finished difference Result 943 states and 1397 transitions. [2022-02-20 18:50:57,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:57,378 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-02-20 18:50:57,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:57,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:57,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 151 transitions. [2022-02-20 18:50:57,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:57,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 151 transitions. [2022-02-20 18:50:57,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 151 transitions. [2022-02-20 18:50:57,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:57,521 INFO L225 Difference]: With dead ends: 943 [2022-02-20 18:50:57,521 INFO L226 Difference]: Without dead ends: 481 [2022-02-20 18:50:57,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:50:57,522 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 220 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:57,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 56 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:50:57,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2022-02-20 18:50:58,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 481. [2022-02-20 18:50:58,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:58,136 INFO L82 GeneralOperation]: Start isEquivalent. First operand 481 states. Second operand has 481 states, 480 states have (on average 1.4416666666666667) internal successors, (692), 480 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:58,137 INFO L74 IsIncluded]: Start isIncluded. First operand 481 states. Second operand has 481 states, 480 states have (on average 1.4416666666666667) internal successors, (692), 480 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:58,138 INFO L87 Difference]: Start difference. First operand 481 states. Second operand has 481 states, 480 states have (on average 1.4416666666666667) internal successors, (692), 480 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:58,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:58,151 INFO L93 Difference]: Finished difference Result 481 states and 692 transitions. [2022-02-20 18:50:58,151 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 692 transitions. [2022-02-20 18:50:58,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:58,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:58,153 INFO L74 IsIncluded]: Start isIncluded. First operand has 481 states, 480 states have (on average 1.4416666666666667) internal successors, (692), 480 states have internal predecessors, (692), 0 states have call successors, (0), 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 481 states. [2022-02-20 18:50:58,154 INFO L87 Difference]: Start difference. First operand has 481 states, 480 states have (on average 1.4416666666666667) internal successors, (692), 480 states have internal predecessors, (692), 0 states have call successors, (0), 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 481 states. [2022-02-20 18:50:58,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:58,167 INFO L93 Difference]: Finished difference Result 481 states and 692 transitions. [2022-02-20 18:50:58,167 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 692 transitions. [2022-02-20 18:50:58,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:58,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:58,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:58,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:58,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 480 states have (on average 1.4416666666666667) internal successors, (692), 480 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:58,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 692 transitions. [2022-02-20 18:50:58,184 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 692 transitions. Word has length 42 [2022-02-20 18:50:58,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:58,184 INFO L470 AbstractCegarLoop]: Abstraction has 481 states and 692 transitions. [2022-02-20 18:50:58,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:58,185 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 692 transitions. [2022-02-20 18:50:58,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 18:50:58,185 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:58,185 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:58,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:50:58,186 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:58,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:58,186 INFO L85 PathProgramCache]: Analyzing trace with hash 68425235, now seen corresponding path program 1 times [2022-02-20 18:50:58,187 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:58,187 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359068862] [2022-02-20 18:50:58,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:58,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:58,258 INFO L290 TraceCheckUtils]: 0: Hoare triple {13309#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1389~0 := 0;~__return_1465~0 := 0; {13311#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:58,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {13311#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {13311#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:58,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {13311#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {13311#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:58,260 INFO L290 TraceCheckUtils]: 3: Hoare triple {13311#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {13311#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:58,260 INFO L290 TraceCheckUtils]: 4: Hoare triple {13311#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {13311#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:58,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {13311#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {13311#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:58,261 INFO L290 TraceCheckUtils]: 6: Hoare triple {13311#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {13311#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:58,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {13311#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {13312#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:50:58,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {13312#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {13312#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:50:58,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {13312#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {13313#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:58,263 INFO L290 TraceCheckUtils]: 10: Hoare triple {13313#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {13313#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:58,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {13313#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {13313#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:58,267 INFO L290 TraceCheckUtils]: 12: Hoare triple {13313#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {13313#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:58,273 INFO L290 TraceCheckUtils]: 13: Hoare triple {13313#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {13313#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:58,274 INFO L290 TraceCheckUtils]: 14: Hoare triple {13313#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {13313#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:58,275 INFO L290 TraceCheckUtils]: 15: Hoare triple {13313#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {13313#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:58,275 INFO L290 TraceCheckUtils]: 16: Hoare triple {13313#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {13313#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:58,278 INFO L290 TraceCheckUtils]: 17: Hoare triple {13313#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1389~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1389~0; {13313#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:58,279 INFO L290 TraceCheckUtils]: 18: Hoare triple {13313#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {13313#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:58,279 INFO L290 TraceCheckUtils]: 19: Hoare triple {13313#(<= (+ ~nomsg~0 1) ~send2~0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {13313#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:58,280 INFO L290 TraceCheckUtils]: 20: Hoare triple {13313#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {13313#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:58,280 INFO L290 TraceCheckUtils]: 21: Hoare triple {13313#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send1~0 != ~nomsg~0; {13313#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:58,280 INFO L290 TraceCheckUtils]: 22: Hoare triple {13313#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {13313#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:58,281 INFO L290 TraceCheckUtils]: 23: Hoare triple {13313#(<= (+ ~nomsg~0 1) ~send2~0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {13313#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:58,281 INFO L290 TraceCheckUtils]: 24: Hoare triple {13313#(<= (+ ~nomsg~0 1) ~send2~0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {13313#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:58,282 INFO L290 TraceCheckUtils]: 25: Hoare triple {13313#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {13313#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:58,282 INFO L290 TraceCheckUtils]: 26: Hoare triple {13313#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0); {13310#false} is VALID [2022-02-20 18:50:58,282 INFO L290 TraceCheckUtils]: 27: Hoare triple {13310#false} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {13310#false} is VALID [2022-02-20 18:50:58,282 INFO L290 TraceCheckUtils]: 28: Hoare triple {13310#false} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {13310#false} is VALID [2022-02-20 18:50:58,282 INFO L290 TraceCheckUtils]: 29: Hoare triple {13310#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {13310#false} is VALID [2022-02-20 18:50:58,283 INFO L290 TraceCheckUtils]: 30: Hoare triple {13310#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {13310#false} is VALID [2022-02-20 18:50:58,283 INFO L290 TraceCheckUtils]: 31: Hoare triple {13310#false} assume ~send3~0 != ~nomsg~0; {13310#false} is VALID [2022-02-20 18:50:58,283 INFO L290 TraceCheckUtils]: 32: Hoare triple {13310#false} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {13310#false} is VALID [2022-02-20 18:50:58,283 INFO L290 TraceCheckUtils]: 33: Hoare triple {13310#false} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {13310#false} is VALID [2022-02-20 18:50:58,283 INFO L290 TraceCheckUtils]: 34: Hoare triple {13310#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {13310#false} is VALID [2022-02-20 18:50:58,283 INFO L290 TraceCheckUtils]: 35: Hoare triple {13310#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {13310#false} is VALID [2022-02-20 18:50:58,284 INFO L290 TraceCheckUtils]: 36: Hoare triple {13310#false} assume !(~r1~0 % 256 >= 3); {13310#false} is VALID [2022-02-20 18:50:58,284 INFO L290 TraceCheckUtils]: 37: Hoare triple {13310#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {13310#false} is VALID [2022-02-20 18:50:58,284 INFO L290 TraceCheckUtils]: 38: Hoare triple {13310#false} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1; {13310#false} is VALID [2022-02-20 18:50:58,284 INFO L290 TraceCheckUtils]: 39: Hoare triple {13310#false} ~__return_1465~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1465~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; {13310#false} is VALID [2022-02-20 18:50:58,284 INFO L290 TraceCheckUtils]: 40: Hoare triple {13310#false} assume 0 == main_~assert__arg~0#1 % 256; {13310#false} is VALID [2022-02-20 18:50:58,284 INFO L290 TraceCheckUtils]: 41: Hoare triple {13310#false} assume !false; {13310#false} is VALID [2022-02-20 18:50:58,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:50:58,287 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:58,287 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359068862] [2022-02-20 18:50:58,287 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359068862] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:58,287 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:58,287 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:50:58,288 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259529990] [2022-02-20 18:50:58,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:58,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-02-20 18:50:58,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:58,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:58,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:58,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:58,322 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:58,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:58,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:58,323 INFO L87 Difference]: Start difference. First operand 481 states and 692 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:59,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:59,472 INFO L93 Difference]: Finished difference Result 943 states and 1365 transitions. [2022-02-20 18:50:59,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:59,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-02-20 18:50:59,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:59,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:59,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 149 transitions. [2022-02-20 18:50:59,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:59,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 149 transitions. [2022-02-20 18:50:59,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 149 transitions. [2022-02-20 18:50:59,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:59,605 INFO L225 Difference]: With dead ends: 943 [2022-02-20 18:50:59,605 INFO L226 Difference]: Without dead ends: 481 [2022-02-20 18:50:59,606 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:50:59,607 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 204 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:59,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 64 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:50:59,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2022-02-20 18:51:00,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 481. [2022-02-20 18:51:00,381 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:00,384 INFO L82 GeneralOperation]: Start isEquivalent. First operand 481 states. Second operand has 481 states, 480 states have (on average 1.425) internal successors, (684), 480 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:00,385 INFO L74 IsIncluded]: Start isIncluded. First operand 481 states. Second operand has 481 states, 480 states have (on average 1.425) internal successors, (684), 480 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:00,386 INFO L87 Difference]: Start difference. First operand 481 states. Second operand has 481 states, 480 states have (on average 1.425) internal successors, (684), 480 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:00,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:00,399 INFO L93 Difference]: Finished difference Result 481 states and 684 transitions. [2022-02-20 18:51:00,399 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 684 transitions. [2022-02-20 18:51:00,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:00,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:00,401 INFO L74 IsIncluded]: Start isIncluded. First operand has 481 states, 480 states have (on average 1.425) internal successors, (684), 480 states have internal predecessors, (684), 0 states have call successors, (0), 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 481 states. [2022-02-20 18:51:00,402 INFO L87 Difference]: Start difference. First operand has 481 states, 480 states have (on average 1.425) internal successors, (684), 480 states have internal predecessors, (684), 0 states have call successors, (0), 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 481 states. [2022-02-20 18:51:00,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:00,416 INFO L93 Difference]: Finished difference Result 481 states and 684 transitions. [2022-02-20 18:51:00,416 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 684 transitions. [2022-02-20 18:51:00,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:00,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:00,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:00,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:00,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 480 states have (on average 1.425) internal successors, (684), 480 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:00,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 684 transitions. [2022-02-20 18:51:00,442 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 684 transitions. Word has length 42 [2022-02-20 18:51:00,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:00,442 INFO L470 AbstractCegarLoop]: Abstraction has 481 states and 684 transitions. [2022-02-20 18:51:00,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:00,442 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 684 transitions. [2022-02-20 18:51:00,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 18:51:00,443 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:00,443 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:00,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:51:00,444 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:00,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:00,445 INFO L85 PathProgramCache]: Analyzing trace with hash 933957624, now seen corresponding path program 1 times [2022-02-20 18:51:00,445 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:00,445 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158712480] [2022-02-20 18:51:00,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:00,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:00,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:00,534 INFO L290 TraceCheckUtils]: 0: Hoare triple {16270#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1389~0 := 0;~__return_1465~0 := 0; {16270#true} is VALID [2022-02-20 18:51:00,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {16270#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {16270#true} is VALID [2022-02-20 18:51:00,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {16270#true} assume 0 == ~r1~0 % 256; {16270#true} is VALID [2022-02-20 18:51:00,536 INFO L290 TraceCheckUtils]: 3: Hoare triple {16270#true} assume ~id1~0 >= 0; {16270#true} is VALID [2022-02-20 18:51:00,536 INFO L290 TraceCheckUtils]: 4: Hoare triple {16270#true} assume 0 == ~st1~0; {16270#true} is VALID [2022-02-20 18:51:00,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {16270#true} assume ~send1~0 == ~id1~0; {16270#true} is VALID [2022-02-20 18:51:00,536 INFO L290 TraceCheckUtils]: 6: Hoare triple {16270#true} assume 0 == ~mode1~0 % 256; {16270#true} is VALID [2022-02-20 18:51:00,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {16270#true} assume ~id2~0 >= 0; {16270#true} is VALID [2022-02-20 18:51:00,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {16270#true} assume 0 == ~st2~0; {16270#true} is VALID [2022-02-20 18:51:00,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {16270#true} assume ~send2~0 == ~id2~0; {16270#true} is VALID [2022-02-20 18:51:00,537 INFO L290 TraceCheckUtils]: 10: Hoare triple {16270#true} assume 0 == ~mode2~0 % 256; {16270#true} is VALID [2022-02-20 18:51:00,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {16270#true} assume ~id3~0 >= 0; {16270#true} is VALID [2022-02-20 18:51:00,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {16270#true} assume 0 == ~st3~0; {16270#true} is VALID [2022-02-20 18:51:00,538 INFO L290 TraceCheckUtils]: 13: Hoare triple {16270#true} assume ~send3~0 == ~id3~0; {16270#true} is VALID [2022-02-20 18:51:00,538 INFO L290 TraceCheckUtils]: 14: Hoare triple {16270#true} assume 0 == ~mode3~0 % 256; {16270#true} is VALID [2022-02-20 18:51:00,538 INFO L290 TraceCheckUtils]: 15: Hoare triple {16270#true} assume ~id1~0 != ~id2~0; {16270#true} is VALID [2022-02-20 18:51:00,538 INFO L290 TraceCheckUtils]: 16: Hoare triple {16270#true} assume ~id1~0 != ~id3~0; {16270#true} is VALID [2022-02-20 18:51:00,539 INFO L290 TraceCheckUtils]: 17: Hoare triple {16270#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1389~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1389~0; {16272#(= |ULTIMATE.start_main_~main__i2~0#1| 1)} is VALID [2022-02-20 18:51:00,539 INFO L290 TraceCheckUtils]: 18: Hoare triple {16272#(= |ULTIMATE.start_main_~main__i2~0#1| 1)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {16270#true} is VALID [2022-02-20 18:51:00,539 INFO L290 TraceCheckUtils]: 19: Hoare triple {16270#true} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {16270#true} is VALID [2022-02-20 18:51:00,539 INFO L290 TraceCheckUtils]: 20: Hoare triple {16270#true} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {16270#true} is VALID [2022-02-20 18:51:00,539 INFO L290 TraceCheckUtils]: 21: Hoare triple {16270#true} assume ~send1~0 != ~nomsg~0; {16270#true} is VALID [2022-02-20 18:51:00,539 INFO L290 TraceCheckUtils]: 22: Hoare triple {16270#true} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {16270#true} is VALID [2022-02-20 18:51:00,539 INFO L290 TraceCheckUtils]: 23: Hoare triple {16270#true} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {16270#true} is VALID [2022-02-20 18:51:00,540 INFO L290 TraceCheckUtils]: 24: Hoare triple {16270#true} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {16270#true} is VALID [2022-02-20 18:51:00,540 INFO L290 TraceCheckUtils]: 25: Hoare triple {16270#true} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {16270#true} is VALID [2022-02-20 18:51:00,540 INFO L290 TraceCheckUtils]: 26: Hoare triple {16270#true} assume ~send2~0 != ~nomsg~0; {16270#true} is VALID [2022-02-20 18:51:00,540 INFO L290 TraceCheckUtils]: 27: Hoare triple {16270#true} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {16270#true} is VALID [2022-02-20 18:51:00,540 INFO L290 TraceCheckUtils]: 28: Hoare triple {16270#true} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {16270#true} is VALID [2022-02-20 18:51:00,540 INFO L290 TraceCheckUtils]: 29: Hoare triple {16270#true} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {16270#true} is VALID [2022-02-20 18:51:00,541 INFO L290 TraceCheckUtils]: 30: Hoare triple {16270#true} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {16270#true} is VALID [2022-02-20 18:51:00,541 INFO L290 TraceCheckUtils]: 31: Hoare triple {16270#true} assume ~send3~0 != ~nomsg~0; {16270#true} is VALID [2022-02-20 18:51:00,541 INFO L290 TraceCheckUtils]: 32: Hoare triple {16270#true} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {16270#true} is VALID [2022-02-20 18:51:00,541 INFO L290 TraceCheckUtils]: 33: Hoare triple {16270#true} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {16270#true} is VALID [2022-02-20 18:51:00,541 INFO L290 TraceCheckUtils]: 34: Hoare triple {16270#true} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {16270#true} is VALID [2022-02-20 18:51:00,541 INFO L290 TraceCheckUtils]: 35: Hoare triple {16270#true} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {16270#true} is VALID [2022-02-20 18:51:00,542 INFO L290 TraceCheckUtils]: 36: Hoare triple {16270#true} assume !(~r1~0 % 256 >= 3); {16270#true} is VALID [2022-02-20 18:51:00,542 INFO L290 TraceCheckUtils]: 37: Hoare triple {16270#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {16270#true} is VALID [2022-02-20 18:51:00,542 INFO L290 TraceCheckUtils]: 38: Hoare triple {16270#true} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1; {16273#(not (= |ULTIMATE.start_main_~check__tmp~0#1| 0))} is VALID [2022-02-20 18:51:00,543 INFO L290 TraceCheckUtils]: 39: Hoare triple {16273#(not (= |ULTIMATE.start_main_~check__tmp~0#1| 0))} ~__return_1465~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1465~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; {16274#(and (<= 1 |ULTIMATE.start_main_~assert__arg~0#1|) (<= (div |ULTIMATE.start_main_~assert__arg~0#1| 256) 0))} is VALID [2022-02-20 18:51:00,543 INFO L290 TraceCheckUtils]: 40: Hoare triple {16274#(and (<= 1 |ULTIMATE.start_main_~assert__arg~0#1|) (<= (div |ULTIMATE.start_main_~assert__arg~0#1| 256) 0))} assume 0 == main_~assert__arg~0#1 % 256; {16271#false} is VALID [2022-02-20 18:51:00,543 INFO L290 TraceCheckUtils]: 41: Hoare triple {16271#false} assume !false; {16271#false} is VALID [2022-02-20 18:51:00,544 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:51:00,544 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:00,544 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158712480] [2022-02-20 18:51:00,544 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158712480] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:00,544 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:00,545 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:51:00,545 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231926359] [2022-02-20 18:51:00,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:00,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-02-20 18:51:00,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:00,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:00,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:00,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:51:00,572 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:00,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:51:00,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:51:00,573 INFO L87 Difference]: Start difference. First operand 481 states and 684 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:02,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:02,682 INFO L93 Difference]: Finished difference Result 816 states and 1163 transitions. [2022-02-20 18:51:02,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:51:02,683 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-02-20 18:51:02,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:02,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:02,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2022-02-20 18:51:02,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:02,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2022-02-20 18:51:02,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 149 transitions. [2022-02-20 18:51:02,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:02,839 INFO L225 Difference]: With dead ends: 816 [2022-02-20 18:51:02,839 INFO L226 Difference]: Without dead ends: 814 [2022-02-20 18:51:02,839 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:51:02,840 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 112 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:02,840 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 403 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:51:02,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2022-02-20 18:51:03,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 497. [2022-02-20 18:51:03,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:03,767 INFO L82 GeneralOperation]: Start isEquivalent. First operand 814 states. Second operand has 497 states, 496 states have (on average 1.403225806451613) internal successors, (696), 496 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:03,768 INFO L74 IsIncluded]: Start isIncluded. First operand 814 states. Second operand has 497 states, 496 states have (on average 1.403225806451613) internal successors, (696), 496 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:03,768 INFO L87 Difference]: Start difference. First operand 814 states. Second operand has 497 states, 496 states have (on average 1.403225806451613) internal successors, (696), 496 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:03,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:03,801 INFO L93 Difference]: Finished difference Result 814 states and 1150 transitions. [2022-02-20 18:51:03,801 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1150 transitions. [2022-02-20 18:51:03,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:03,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:03,804 INFO L74 IsIncluded]: Start isIncluded. First operand has 497 states, 496 states have (on average 1.403225806451613) internal successors, (696), 496 states have internal predecessors, (696), 0 states have call successors, (0), 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 814 states. [2022-02-20 18:51:03,804 INFO L87 Difference]: Start difference. First operand has 497 states, 496 states have (on average 1.403225806451613) internal successors, (696), 496 states have internal predecessors, (696), 0 states have call successors, (0), 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 814 states. [2022-02-20 18:51:03,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:03,836 INFO L93 Difference]: Finished difference Result 814 states and 1150 transitions. [2022-02-20 18:51:03,837 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1150 transitions. [2022-02-20 18:51:03,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:03,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:03,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:03,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:03,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 496 states have (on average 1.403225806451613) internal successors, (696), 496 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:03,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 696 transitions. [2022-02-20 18:51:03,854 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 696 transitions. Word has length 42 [2022-02-20 18:51:03,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:03,855 INFO L470 AbstractCegarLoop]: Abstraction has 497 states and 696 transitions. [2022-02-20 18:51:03,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:03,855 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 696 transitions. [2022-02-20 18:51:03,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 18:51:03,855 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:03,856 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:03,856 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:51:03,856 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:03,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:03,856 INFO L85 PathProgramCache]: Analyzing trace with hash 883353381, now seen corresponding path program 1 times [2022-02-20 18:51:03,857 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:03,857 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949970758] [2022-02-20 18:51:03,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:03,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:03,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {19757#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1389~0 := 0;~__return_1465~0 := 0; {19757#true} is VALID [2022-02-20 18:51:03,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {19757#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {19757#true} is VALID [2022-02-20 18:51:03,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {19757#true} assume 0 == ~r1~0 % 256; {19757#true} is VALID [2022-02-20 18:51:03,890 INFO L290 TraceCheckUtils]: 3: Hoare triple {19757#true} assume ~id1~0 >= 0; {19757#true} is VALID [2022-02-20 18:51:03,890 INFO L290 TraceCheckUtils]: 4: Hoare triple {19757#true} assume 0 == ~st1~0; {19757#true} is VALID [2022-02-20 18:51:03,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {19757#true} assume ~send1~0 == ~id1~0; {19757#true} is VALID [2022-02-20 18:51:03,891 INFO L290 TraceCheckUtils]: 6: Hoare triple {19757#true} assume 0 == ~mode1~0 % 256; {19759#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:03,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {19759#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {19759#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:03,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {19759#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {19759#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:03,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {19759#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {19759#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:03,893 INFO L290 TraceCheckUtils]: 10: Hoare triple {19759#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {19759#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:03,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {19759#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {19759#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:03,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {19759#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {19759#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:03,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {19759#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {19759#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:03,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {19759#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {19759#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:03,895 INFO L290 TraceCheckUtils]: 15: Hoare triple {19759#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {19759#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:03,895 INFO L290 TraceCheckUtils]: 16: Hoare triple {19759#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {19759#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:03,896 INFO L290 TraceCheckUtils]: 17: Hoare triple {19759#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1389~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1389~0; {19759#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:03,896 INFO L290 TraceCheckUtils]: 18: Hoare triple {19759#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {19759#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:03,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {19759#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {19759#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:51:03,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {19759#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~mode1~0 % 256); {19758#false} is VALID [2022-02-20 18:51:03,899 INFO L290 TraceCheckUtils]: 21: Hoare triple {19758#false} assume !(255 == ~r1~0 % 256); {19758#false} is VALID [2022-02-20 18:51:03,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {19758#false} ~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {19758#false} is VALID [2022-02-20 18:51:03,900 INFO L290 TraceCheckUtils]: 23: Hoare triple {19758#false} assume main_~node1__m1~0#1 != ~nomsg~0; {19758#false} is VALID [2022-02-20 18:51:03,900 INFO L290 TraceCheckUtils]: 24: Hoare triple {19758#false} assume !(main_~node1__m1~0#1 > ~id1~0); {19758#false} is VALID [2022-02-20 18:51:03,900 INFO L290 TraceCheckUtils]: 25: Hoare triple {19758#false} assume main_~node1__m1~0#1 == ~id1~0;~st1~0 := 1; {19758#false} is VALID [2022-02-20 18:51:03,900 INFO L290 TraceCheckUtils]: 26: Hoare triple {19758#false} ~mode1~0 := 0; {19758#false} is VALID [2022-02-20 18:51:03,900 INFO L290 TraceCheckUtils]: 27: Hoare triple {19758#false} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {19758#false} is VALID [2022-02-20 18:51:03,901 INFO L290 TraceCheckUtils]: 28: Hoare triple {19758#false} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {19758#false} is VALID [2022-02-20 18:51:03,901 INFO L290 TraceCheckUtils]: 29: Hoare triple {19758#false} assume ~send2~0 != ~nomsg~0; {19758#false} is VALID [2022-02-20 18:51:03,901 INFO L290 TraceCheckUtils]: 30: Hoare triple {19758#false} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {19758#false} is VALID [2022-02-20 18:51:03,901 INFO L290 TraceCheckUtils]: 31: Hoare triple {19758#false} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {19758#false} is VALID [2022-02-20 18:51:03,901 INFO L290 TraceCheckUtils]: 32: Hoare triple {19758#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {19758#false} is VALID [2022-02-20 18:51:03,901 INFO L290 TraceCheckUtils]: 33: Hoare triple {19758#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {19758#false} is VALID [2022-02-20 18:51:03,902 INFO L290 TraceCheckUtils]: 34: Hoare triple {19758#false} assume ~send3~0 != ~nomsg~0; {19758#false} is VALID [2022-02-20 18:51:03,902 INFO L290 TraceCheckUtils]: 35: Hoare triple {19758#false} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {19758#false} is VALID [2022-02-20 18:51:03,902 INFO L290 TraceCheckUtils]: 36: Hoare triple {19758#false} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {19758#false} is VALID [2022-02-20 18:51:03,902 INFO L290 TraceCheckUtils]: 37: Hoare triple {19758#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {19758#false} is VALID [2022-02-20 18:51:03,902 INFO L290 TraceCheckUtils]: 38: Hoare triple {19758#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {19758#false} is VALID [2022-02-20 18:51:03,902 INFO L290 TraceCheckUtils]: 39: Hoare triple {19758#false} ~__return_1465~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1465~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; {19758#false} is VALID [2022-02-20 18:51:03,902 INFO L290 TraceCheckUtils]: 40: Hoare triple {19758#false} assume 0 == main_~assert__arg~0#1 % 256; {19758#false} is VALID [2022-02-20 18:51:03,903 INFO L290 TraceCheckUtils]: 41: Hoare triple {19758#false} assume !false; {19758#false} is VALID [2022-02-20 18:51:03,903 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:51:03,903 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:03,903 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949970758] [2022-02-20 18:51:03,903 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949970758] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:03,904 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:03,904 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:51:03,904 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380990068] [2022-02-20 18:51:03,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:03,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-02-20 18:51:03,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:03,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:03,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:03,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:51:03,933 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:03,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:51:03,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:51:03,934 INFO L87 Difference]: Start difference. First operand 497 states and 696 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:05,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:05,406 INFO L93 Difference]: Finished difference Result 968 states and 1382 transitions. [2022-02-20 18:51:05,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:51:05,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-02-20 18:51:05,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:05,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:05,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 196 transitions. [2022-02-20 18:51:05,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:05,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 196 transitions. [2022-02-20 18:51:05,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 196 transitions. [2022-02-20 18:51:05,550 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:05,578 INFO L225 Difference]: With dead ends: 968 [2022-02-20 18:51:05,578 INFO L226 Difference]: Without dead ends: 693 [2022-02-20 18:51:05,579 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:51:05,581 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 51 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 184 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:51:05,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 184 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:51:05,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2022-02-20 18:51:06,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 691. [2022-02-20 18:51:06,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:06,924 INFO L82 GeneralOperation]: Start isEquivalent. First operand 693 states. Second operand has 691 states, 690 states have (on average 1.4057971014492754) internal successors, (970), 690 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:06,924 INFO L74 IsIncluded]: Start isIncluded. First operand 693 states. Second operand has 691 states, 690 states have (on average 1.4057971014492754) internal successors, (970), 690 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:06,925 INFO L87 Difference]: Start difference. First operand 693 states. Second operand has 691 states, 690 states have (on average 1.4057971014492754) internal successors, (970), 690 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:06,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:06,946 INFO L93 Difference]: Finished difference Result 693 states and 971 transitions. [2022-02-20 18:51:06,946 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 971 transitions. [2022-02-20 18:51:06,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:06,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:06,948 INFO L74 IsIncluded]: Start isIncluded. First operand has 691 states, 690 states have (on average 1.4057971014492754) internal successors, (970), 690 states have internal predecessors, (970), 0 states have call successors, (0), 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 693 states. [2022-02-20 18:51:06,949 INFO L87 Difference]: Start difference. First operand has 691 states, 690 states have (on average 1.4057971014492754) internal successors, (970), 690 states have internal predecessors, (970), 0 states have call successors, (0), 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 693 states. [2022-02-20 18:51:06,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:06,970 INFO L93 Difference]: Finished difference Result 693 states and 971 transitions. [2022-02-20 18:51:06,970 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 971 transitions. [2022-02-20 18:51:06,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:06,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:06,971 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:06,971 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:06,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 690 states have (on average 1.4057971014492754) internal successors, (970), 690 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:06,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 970 transitions. [2022-02-20 18:51:06,992 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 970 transitions. Word has length 42 [2022-02-20 18:51:06,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:06,992 INFO L470 AbstractCegarLoop]: Abstraction has 691 states and 970 transitions. [2022-02-20 18:51:06,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:06,992 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 970 transitions. [2022-02-20 18:51:06,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-20 18:51:06,993 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:06,994 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:06,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:51:06,994 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:06,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:06,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1515661308, now seen corresponding path program 1 times [2022-02-20 18:51:06,994 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:06,995 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73052934] [2022-02-20 18:51:06,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:06,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:07,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:07,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {23473#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1389~0 := 0;~__return_1465~0 := 0; {23473#true} is VALID [2022-02-20 18:51:07,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {23473#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {23473#true} is VALID [2022-02-20 18:51:07,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {23473#true} assume 0 == ~r1~0 % 256; {23473#true} is VALID [2022-02-20 18:51:07,083 INFO L290 TraceCheckUtils]: 3: Hoare triple {23473#true} assume ~id1~0 >= 0; {23473#true} is VALID [2022-02-20 18:51:07,083 INFO L290 TraceCheckUtils]: 4: Hoare triple {23473#true} assume 0 == ~st1~0; {23475#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:07,083 INFO L290 TraceCheckUtils]: 5: Hoare triple {23475#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {23475#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:07,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {23475#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {23475#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:07,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {23475#(<= ~st1~0 0)} assume ~id2~0 >= 0; {23475#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:07,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {23475#(<= ~st1~0 0)} assume 0 == ~st2~0; {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,085 INFO L290 TraceCheckUtils]: 10: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,086 INFO L290 TraceCheckUtils]: 12: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,086 INFO L290 TraceCheckUtils]: 13: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,087 INFO L290 TraceCheckUtils]: 16: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,088 INFO L290 TraceCheckUtils]: 17: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1389~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1389~0; {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,088 INFO L290 TraceCheckUtils]: 18: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,089 INFO L290 TraceCheckUtils]: 20: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,089 INFO L290 TraceCheckUtils]: 21: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0; {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,090 INFO L290 TraceCheckUtils]: 22: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,090 INFO L290 TraceCheckUtils]: 23: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,090 INFO L290 TraceCheckUtils]: 24: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,091 INFO L290 TraceCheckUtils]: 25: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,091 INFO L290 TraceCheckUtils]: 26: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0; {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,091 INFO L290 TraceCheckUtils]: 27: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,092 INFO L290 TraceCheckUtils]: 28: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,092 INFO L290 TraceCheckUtils]: 29: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,092 INFO L290 TraceCheckUtils]: 30: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,093 INFO L290 TraceCheckUtils]: 31: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0; {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,093 INFO L290 TraceCheckUtils]: 32: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,093 INFO L290 TraceCheckUtils]: 33: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,094 INFO L290 TraceCheckUtils]: 34: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,094 INFO L290 TraceCheckUtils]: 35: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,095 INFO L290 TraceCheckUtils]: 36: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~r1~0 % 256 >= 3); {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,095 INFO L290 TraceCheckUtils]: 37: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,095 INFO L290 TraceCheckUtils]: 38: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1; {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,096 INFO L290 TraceCheckUtils]: 39: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} ~__return_1465~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1465~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; {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,096 INFO L290 TraceCheckUtils]: 40: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256); {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,096 INFO L290 TraceCheckUtils]: 41: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,097 INFO L290 TraceCheckUtils]: 42: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,097 INFO L290 TraceCheckUtils]: 43: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0; {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,097 INFO L290 TraceCheckUtils]: 44: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,098 INFO L290 TraceCheckUtils]: 45: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,098 INFO L290 TraceCheckUtils]: 46: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,098 INFO L290 TraceCheckUtils]: 47: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,099 INFO L290 TraceCheckUtils]: 48: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~0#1 != ~nomsg~0); {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,099 INFO L290 TraceCheckUtils]: 49: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} ~mode2~0 := 0; {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,099 INFO L290 TraceCheckUtils]: 50: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,100 INFO L290 TraceCheckUtils]: 51: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,100 INFO L290 TraceCheckUtils]: 52: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~node3__m3~0#1 != ~nomsg~0; {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,100 INFO L290 TraceCheckUtils]: 53: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~0#1 > ~id3~0); {23476#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:07,101 INFO L290 TraceCheckUtils]: 54: Hoare triple {23476#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~node3__m3~0#1 == ~id3~0;~st3~0 := 1; {23477#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:07,101 INFO L290 TraceCheckUtils]: 55: Hoare triple {23477#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} ~mode3~0 := 0; {23477#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:07,102 INFO L290 TraceCheckUtils]: 56: Hoare triple {23477#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {23477#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:07,102 INFO L290 TraceCheckUtils]: 57: Hoare triple {23477#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {23474#false} is VALID [2022-02-20 18:51:07,102 INFO L290 TraceCheckUtils]: 58: Hoare triple {23474#false} ~__return_1465~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1465~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; {23474#false} is VALID [2022-02-20 18:51:07,102 INFO L290 TraceCheckUtils]: 59: Hoare triple {23474#false} assume 0 == main_~assert__arg~0#1 % 256; {23474#false} is VALID [2022-02-20 18:51:07,103 INFO L290 TraceCheckUtils]: 60: Hoare triple {23474#false} assume !false; {23474#false} is VALID [2022-02-20 18:51:07,103 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-20 18:51:07,103 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:07,104 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73052934] [2022-02-20 18:51:07,104 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73052934] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:07,104 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:07,104 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:51:07,105 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713007517] [2022-02-20 18:51:07,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:07,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-02-20 18:51:07,106 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:07,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:07,142 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:51:07,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:51:07,142 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:07,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:51:07,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:51:07,143 INFO L87 Difference]: Start difference. First operand 691 states and 970 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:11,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:11,816 INFO L93 Difference]: Finished difference Result 2835 states and 4000 transitions. [2022-02-20 18:51:11,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:51:11,816 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-02-20 18:51:11,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:11,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:11,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 336 transitions. [2022-02-20 18:51:11,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:11,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 336 transitions. [2022-02-20 18:51:11,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 336 transitions. [2022-02-20 18:51:12,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 336 edges. 336 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:12,223 INFO L225 Difference]: With dead ends: 2835 [2022-02-20 18:51:12,223 INFO L226 Difference]: Without dead ends: 2165 [2022-02-20 18:51:12,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:51:12,225 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 222 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:12,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 342 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:51:12,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2165 states. [2022-02-20 18:51:14,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2165 to 1359. [2022-02-20 18:51:14,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:14,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2165 states. Second operand has 1359 states, 1358 states have (on average 1.4035346097201766) internal successors, (1906), 1358 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:14,841 INFO L74 IsIncluded]: Start isIncluded. First operand 2165 states. Second operand has 1359 states, 1358 states have (on average 1.4035346097201766) internal successors, (1906), 1358 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:14,842 INFO L87 Difference]: Start difference. First operand 2165 states. Second operand has 1359 states, 1358 states have (on average 1.4035346097201766) internal successors, (1906), 1358 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:15,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:15,011 INFO L93 Difference]: Finished difference Result 2165 states and 3039 transitions. [2022-02-20 18:51:15,011 INFO L276 IsEmpty]: Start isEmpty. Operand 2165 states and 3039 transitions. [2022-02-20 18:51:15,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:15,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:15,016 INFO L74 IsIncluded]: Start isIncluded. First operand has 1359 states, 1358 states have (on average 1.4035346097201766) internal successors, (1906), 1358 states have internal predecessors, (1906), 0 states have call successors, (0), 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 2165 states. [2022-02-20 18:51:15,017 INFO L87 Difference]: Start difference. First operand has 1359 states, 1358 states have (on average 1.4035346097201766) internal successors, (1906), 1358 states have internal predecessors, (1906), 0 states have call successors, (0), 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 2165 states. [2022-02-20 18:51:15,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:15,149 INFO L93 Difference]: Finished difference Result 2165 states and 3039 transitions. [2022-02-20 18:51:15,149 INFO L276 IsEmpty]: Start isEmpty. Operand 2165 states and 3039 transitions. [2022-02-20 18:51:15,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:15,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:15,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:15,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:15,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1359 states, 1358 states have (on average 1.4035346097201766) internal successors, (1906), 1358 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:15,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 1906 transitions. [2022-02-20 18:51:15,224 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 1906 transitions. Word has length 61 [2022-02-20 18:51:15,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:15,224 INFO L470 AbstractCegarLoop]: Abstraction has 1359 states and 1906 transitions. [2022-02-20 18:51:15,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:15,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 1906 transitions. [2022-02-20 18:51:15,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-20 18:51:15,225 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:15,225 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:15,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:51:15,225 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:15,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:15,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1625359882, now seen corresponding path program 1 times [2022-02-20 18:51:15,226 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:15,226 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901618869] [2022-02-20 18:51:15,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:15,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:15,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {33723#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1389~0 := 0;~__return_1465~0 := 0; {33723#true} is VALID [2022-02-20 18:51:15,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {33723#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {33723#true} is VALID [2022-02-20 18:51:15,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {33723#true} assume 0 == ~r1~0 % 256; {33723#true} is VALID [2022-02-20 18:51:15,317 INFO L290 TraceCheckUtils]: 3: Hoare triple {33723#true} assume ~id1~0 >= 0; {33723#true} is VALID [2022-02-20 18:51:15,317 INFO L290 TraceCheckUtils]: 4: Hoare triple {33723#true} assume 0 == ~st1~0; {33725#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:15,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {33725#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {33725#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:15,318 INFO L290 TraceCheckUtils]: 6: Hoare triple {33725#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {33725#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:15,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {33725#(<= ~st1~0 0)} assume ~id2~0 >= 0; {33725#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:15,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {33725#(<= ~st1~0 0)} assume 0 == ~st2~0; {33725#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:15,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {33725#(<= ~st1~0 0)} assume ~send2~0 == ~id2~0; {33725#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:15,320 INFO L290 TraceCheckUtils]: 10: Hoare triple {33725#(<= ~st1~0 0)} assume 0 == ~mode2~0 % 256; {33725#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:15,320 INFO L290 TraceCheckUtils]: 11: Hoare triple {33725#(<= ~st1~0 0)} assume ~id3~0 >= 0; {33725#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:15,320 INFO L290 TraceCheckUtils]: 12: Hoare triple {33725#(<= ~st1~0 0)} assume 0 == ~st3~0; {33726#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:15,321 INFO L290 TraceCheckUtils]: 13: Hoare triple {33726#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {33726#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:15,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {33726#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {33726#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:15,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {33726#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {33726#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:15,322 INFO L290 TraceCheckUtils]: 16: Hoare triple {33726#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {33726#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:15,322 INFO L290 TraceCheckUtils]: 17: Hoare triple {33726#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1389~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1389~0; {33726#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:15,323 INFO L290 TraceCheckUtils]: 18: Hoare triple {33726#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {33726#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:15,323 INFO L290 TraceCheckUtils]: 19: Hoare triple {33726#(<= (+ ~st3~0 ~st1~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {33726#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:15,323 INFO L290 TraceCheckUtils]: 20: Hoare triple {33726#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {33726#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:15,324 INFO L290 TraceCheckUtils]: 21: Hoare triple {33726#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0; {33726#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:15,324 INFO L290 TraceCheckUtils]: 22: Hoare triple {33726#(<= (+ ~st3~0 ~st1~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {33726#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:15,324 INFO L290 TraceCheckUtils]: 23: Hoare triple {33726#(<= (+ ~st3~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {33726#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:15,325 INFO L290 TraceCheckUtils]: 24: Hoare triple {33726#(<= (+ ~st3~0 ~st1~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {33726#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:15,325 INFO L290 TraceCheckUtils]: 25: Hoare triple {33726#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {33726#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:15,325 INFO L290 TraceCheckUtils]: 26: Hoare triple {33726#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0; {33726#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:15,326 INFO L290 TraceCheckUtils]: 27: Hoare triple {33726#(<= (+ ~st3~0 ~st1~0) 0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {33726#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:15,326 INFO L290 TraceCheckUtils]: 28: Hoare triple {33726#(<= (+ ~st3~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {33726#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:15,327 INFO L290 TraceCheckUtils]: 29: Hoare triple {33726#(<= (+ ~st3~0 ~st1~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {33726#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:15,327 INFO L290 TraceCheckUtils]: 30: Hoare triple {33726#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {33726#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:15,327 INFO L290 TraceCheckUtils]: 31: Hoare triple {33726#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0; {33726#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:15,328 INFO L290 TraceCheckUtils]: 32: Hoare triple {33726#(<= (+ ~st3~0 ~st1~0) 0)} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {33726#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:15,328 INFO L290 TraceCheckUtils]: 33: Hoare triple {33726#(<= (+ ~st3~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {33726#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:15,328 INFO L290 TraceCheckUtils]: 34: Hoare triple {33726#(<= (+ ~st3~0 ~st1~0) 0)} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {33726#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:15,329 INFO L290 TraceCheckUtils]: 35: Hoare triple {33726#(<= (+ ~st3~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {33726#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:15,329 INFO L290 TraceCheckUtils]: 36: Hoare triple {33726#(<= (+ ~st3~0 ~st1~0) 0)} assume !(~r1~0 % 256 >= 3); {33726#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:15,329 INFO L290 TraceCheckUtils]: 37: Hoare triple {33726#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {33726#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:15,330 INFO L290 TraceCheckUtils]: 38: Hoare triple {33726#(<= (+ ~st3~0 ~st1~0) 0)} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1; {33726#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:15,330 INFO L290 TraceCheckUtils]: 39: Hoare triple {33726#(<= (+ ~st3~0 ~st1~0) 0)} ~__return_1465~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1465~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; {33726#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:15,330 INFO L290 TraceCheckUtils]: 40: Hoare triple {33726#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256); {33726#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:15,331 INFO L290 TraceCheckUtils]: 41: Hoare triple {33726#(<= (+ ~st3~0 ~st1~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {33726#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:15,331 INFO L290 TraceCheckUtils]: 42: Hoare triple {33726#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {33726#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:15,332 INFO L290 TraceCheckUtils]: 43: Hoare triple {33726#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0; {33726#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:15,332 INFO L290 TraceCheckUtils]: 44: Hoare triple {33726#(<= (+ ~st3~0 ~st1~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {33726#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:15,332 INFO L290 TraceCheckUtils]: 45: Hoare triple {33726#(<= (+ ~st3~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {33726#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:15,333 INFO L290 TraceCheckUtils]: 46: Hoare triple {33726#(<= (+ ~st3~0 ~st1~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {33726#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:15,333 INFO L290 TraceCheckUtils]: 47: Hoare triple {33726#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {33726#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:15,333 INFO L290 TraceCheckUtils]: 48: Hoare triple {33726#(<= (+ ~st3~0 ~st1~0) 0)} assume main_~node2__m2~0#1 != ~nomsg~0; {33726#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:15,334 INFO L290 TraceCheckUtils]: 49: Hoare triple {33726#(<= (+ ~st3~0 ~st1~0) 0)} assume !(main_~node2__m2~0#1 > ~id2~0); {33726#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:15,334 INFO L290 TraceCheckUtils]: 50: Hoare triple {33726#(<= (+ ~st3~0 ~st1~0) 0)} assume main_~node2__m2~0#1 == ~id2~0;~st2~0 := 1; {33727#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:51:15,335 INFO L290 TraceCheckUtils]: 51: Hoare triple {33727#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode2~0 := 0; {33727#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:51:15,335 INFO L290 TraceCheckUtils]: 52: Hoare triple {33727#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {33727#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:51:15,336 INFO L290 TraceCheckUtils]: 53: Hoare triple {33727#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {33727#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:51:15,336 INFO L290 TraceCheckUtils]: 54: Hoare triple {33727#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(main_~node3__m3~0#1 != ~nomsg~0); {33727#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:51:15,337 INFO L290 TraceCheckUtils]: 55: Hoare triple {33727#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode3~0 := 0; {33727#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:51:15,337 INFO L290 TraceCheckUtils]: 56: Hoare triple {33727#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {33727#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:51:15,338 INFO L290 TraceCheckUtils]: 57: Hoare triple {33727#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {33724#false} is VALID [2022-02-20 18:51:15,338 INFO L290 TraceCheckUtils]: 58: Hoare triple {33724#false} ~__return_1465~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1465~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; {33724#false} is VALID [2022-02-20 18:51:15,338 INFO L290 TraceCheckUtils]: 59: Hoare triple {33724#false} assume 0 == main_~assert__arg~0#1 % 256; {33724#false} is VALID [2022-02-20 18:51:15,338 INFO L290 TraceCheckUtils]: 60: Hoare triple {33724#false} assume !false; {33724#false} is VALID [2022-02-20 18:51:15,338 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 18:51:15,338 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:15,339 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901618869] [2022-02-20 18:51:15,339 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901618869] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:15,339 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:15,339 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:51:15,339 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116081826] [2022-02-20 18:51:15,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:15,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-02-20 18:51:15,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:15,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:15,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:15,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:51:15,378 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:15,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:51:15,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:51:15,379 INFO L87 Difference]: Start difference. First operand 1359 states and 1906 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:21,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:21,724 INFO L93 Difference]: Finished difference Result 3503 states and 4936 transitions. [2022-02-20 18:51:21,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:51:21,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-02-20 18:51:21,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:21,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:21,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 336 transitions. [2022-02-20 18:51:21,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:21,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 336 transitions. [2022-02-20 18:51:21,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 336 transitions. [2022-02-20 18:51:21,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 336 edges. 336 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:22,240 INFO L225 Difference]: With dead ends: 3503 [2022-02-20 18:51:22,241 INFO L226 Difference]: Without dead ends: 2833 [2022-02-20 18:51:22,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:51:22,243 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 220 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:22,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 366 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:51:22,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2833 states. [2022-02-20 18:51:27,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2833 to 2363. [2022-02-20 18:51:27,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:27,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2833 states. Second operand has 2363 states, 2362 states have (on average 1.397121083827265) internal successors, (3300), 2362 states have internal predecessors, (3300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:27,076 INFO L74 IsIncluded]: Start isIncluded. First operand 2833 states. Second operand has 2363 states, 2362 states have (on average 1.397121083827265) internal successors, (3300), 2362 states have internal predecessors, (3300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:27,079 INFO L87 Difference]: Start difference. First operand 2833 states. Second operand has 2363 states, 2362 states have (on average 1.397121083827265) internal successors, (3300), 2362 states have internal predecessors, (3300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:27,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:27,329 INFO L93 Difference]: Finished difference Result 2833 states and 3975 transitions. [2022-02-20 18:51:27,329 INFO L276 IsEmpty]: Start isEmpty. Operand 2833 states and 3975 transitions. [2022-02-20 18:51:27,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:27,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:27,337 INFO L74 IsIncluded]: Start isIncluded. First operand has 2363 states, 2362 states have (on average 1.397121083827265) internal successors, (3300), 2362 states have internal predecessors, (3300), 0 states have call successors, (0), 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 2833 states. [2022-02-20 18:51:27,340 INFO L87 Difference]: Start difference. First operand has 2363 states, 2362 states have (on average 1.397121083827265) internal successors, (3300), 2362 states have internal predecessors, (3300), 0 states have call successors, (0), 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 2833 states. [2022-02-20 18:51:27,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:27,584 INFO L93 Difference]: Finished difference Result 2833 states and 3975 transitions. [2022-02-20 18:51:27,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2833 states and 3975 transitions. [2022-02-20 18:51:27,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:27,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:27,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:27,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:27,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2363 states, 2362 states have (on average 1.397121083827265) internal successors, (3300), 2362 states have internal predecessors, (3300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:27,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3300 transitions. [2022-02-20 18:51:27,855 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3300 transitions. Word has length 61 [2022-02-20 18:51:27,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:27,856 INFO L470 AbstractCegarLoop]: Abstraction has 2363 states and 3300 transitions. [2022-02-20 18:51:27,856 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:27,856 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3300 transitions. [2022-02-20 18:51:27,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 18:51:27,857 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:27,857 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:27,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:51:27,858 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:27,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:27,858 INFO L85 PathProgramCache]: Analyzing trace with hash -2114297975, now seen corresponding path program 1 times [2022-02-20 18:51:27,859 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:27,859 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43317883] [2022-02-20 18:51:27,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:27,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:27,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:27,917 INFO L290 TraceCheckUtils]: 0: Hoare triple {47673#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1389~0 := 0;~__return_1465~0 := 0; {47673#true} is VALID [2022-02-20 18:51:27,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {47673#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {47673#true} is VALID [2022-02-20 18:51:27,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {47673#true} assume 0 == ~r1~0 % 256; {47673#true} is VALID [2022-02-20 18:51:27,918 INFO L290 TraceCheckUtils]: 3: Hoare triple {47673#true} assume ~id1~0 >= 0; {47673#true} is VALID [2022-02-20 18:51:27,918 INFO L290 TraceCheckUtils]: 4: Hoare triple {47673#true} assume 0 == ~st1~0; {47673#true} is VALID [2022-02-20 18:51:27,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {47673#true} assume ~send1~0 == ~id1~0; {47673#true} is VALID [2022-02-20 18:51:27,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {47673#true} assume 0 == ~mode1~0 % 256; {47673#true} is VALID [2022-02-20 18:51:27,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {47673#true} assume ~id2~0 >= 0; {47673#true} is VALID [2022-02-20 18:51:27,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {47673#true} assume 0 == ~st2~0; {47675#(<= ~st2~0 0)} is VALID [2022-02-20 18:51:27,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {47675#(<= ~st2~0 0)} assume ~send2~0 == ~id2~0; {47675#(<= ~st2~0 0)} is VALID [2022-02-20 18:51:27,919 INFO L290 TraceCheckUtils]: 10: Hoare triple {47675#(<= ~st2~0 0)} assume 0 == ~mode2~0 % 256; {47675#(<= ~st2~0 0)} is VALID [2022-02-20 18:51:27,920 INFO L290 TraceCheckUtils]: 11: Hoare triple {47675#(<= ~st2~0 0)} assume ~id3~0 >= 0; {47675#(<= ~st2~0 0)} is VALID [2022-02-20 18:51:27,920 INFO L290 TraceCheckUtils]: 12: Hoare triple {47675#(<= ~st2~0 0)} assume 0 == ~st3~0; {47676#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:27,920 INFO L290 TraceCheckUtils]: 13: Hoare triple {47676#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send3~0 == ~id3~0; {47676#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:27,921 INFO L290 TraceCheckUtils]: 14: Hoare triple {47676#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256; {47676#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:27,921 INFO L290 TraceCheckUtils]: 15: Hoare triple {47676#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id2~0; {47676#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:27,921 INFO L290 TraceCheckUtils]: 16: Hoare triple {47676#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id3~0; {47676#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:27,922 INFO L290 TraceCheckUtils]: 17: Hoare triple {47676#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1389~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1389~0; {47676#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:27,922 INFO L290 TraceCheckUtils]: 18: Hoare triple {47676#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {47676#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:27,922 INFO L290 TraceCheckUtils]: 19: Hoare triple {47676#(<= (+ ~st3~0 ~st2~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {47676#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:27,923 INFO L290 TraceCheckUtils]: 20: Hoare triple {47676#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {47676#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:27,923 INFO L290 TraceCheckUtils]: 21: Hoare triple {47676#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send1~0 != ~nomsg~0; {47676#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:27,924 INFO L290 TraceCheckUtils]: 22: Hoare triple {47676#(<= (+ ~st3~0 ~st2~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {47676#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:27,924 INFO L290 TraceCheckUtils]: 23: Hoare triple {47676#(<= (+ ~st3~0 ~st2~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {47676#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:27,924 INFO L290 TraceCheckUtils]: 24: Hoare triple {47676#(<= (+ ~st3~0 ~st2~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {47676#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:27,925 INFO L290 TraceCheckUtils]: 25: Hoare triple {47676#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {47676#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:27,925 INFO L290 TraceCheckUtils]: 26: Hoare triple {47676#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send2~0 != ~nomsg~0; {47676#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:27,925 INFO L290 TraceCheckUtils]: 27: Hoare triple {47676#(<= (+ ~st3~0 ~st2~0) 0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {47676#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:27,926 INFO L290 TraceCheckUtils]: 28: Hoare triple {47676#(<= (+ ~st3~0 ~st2~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {47676#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:27,926 INFO L290 TraceCheckUtils]: 29: Hoare triple {47676#(<= (+ ~st3~0 ~st2~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {47676#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:27,926 INFO L290 TraceCheckUtils]: 30: Hoare triple {47676#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {47676#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:27,927 INFO L290 TraceCheckUtils]: 31: Hoare triple {47676#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send3~0 != ~nomsg~0; {47676#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:27,927 INFO L290 TraceCheckUtils]: 32: Hoare triple {47676#(<= (+ ~st3~0 ~st2~0) 0)} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {47676#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:27,927 INFO L290 TraceCheckUtils]: 33: Hoare triple {47676#(<= (+ ~st3~0 ~st2~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {47676#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:27,928 INFO L290 TraceCheckUtils]: 34: Hoare triple {47676#(<= (+ ~st3~0 ~st2~0) 0)} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {47676#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:27,928 INFO L290 TraceCheckUtils]: 35: Hoare triple {47676#(<= (+ ~st3~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {47676#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:27,928 INFO L290 TraceCheckUtils]: 36: Hoare triple {47676#(<= (+ ~st3~0 ~st2~0) 0)} assume !(~r1~0 % 256 >= 3); {47676#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:27,929 INFO L290 TraceCheckUtils]: 37: Hoare triple {47676#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {47676#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:27,929 INFO L290 TraceCheckUtils]: 38: Hoare triple {47676#(<= (+ ~st3~0 ~st2~0) 0)} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1; {47676#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:27,929 INFO L290 TraceCheckUtils]: 39: Hoare triple {47676#(<= (+ ~st3~0 ~st2~0) 0)} ~__return_1465~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1465~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; {47676#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:27,930 INFO L290 TraceCheckUtils]: 40: Hoare triple {47676#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256); {47676#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:27,930 INFO L290 TraceCheckUtils]: 41: Hoare triple {47676#(<= (+ ~st3~0 ~st2~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {47676#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:27,930 INFO L290 TraceCheckUtils]: 42: Hoare triple {47676#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 == ~mode1~0 % 256); {47676#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:27,931 INFO L290 TraceCheckUtils]: 43: Hoare triple {47676#(<= (+ ~st3~0 ~st2~0) 0)} assume !(255 == ~r1~0 % 256); {47676#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:27,931 INFO L290 TraceCheckUtils]: 44: Hoare triple {47676#(<= (+ ~st3~0 ~st2~0) 0)} ~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {47676#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:27,931 INFO L290 TraceCheckUtils]: 45: Hoare triple {47676#(<= (+ ~st3~0 ~st2~0) 0)} assume main_~node1__m1~0#1 != ~nomsg~0; {47676#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:27,932 INFO L290 TraceCheckUtils]: 46: Hoare triple {47676#(<= (+ ~st3~0 ~st2~0) 0)} assume !(main_~node1__m1~0#1 > ~id1~0); {47676#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:27,932 INFO L290 TraceCheckUtils]: 47: Hoare triple {47676#(<= (+ ~st3~0 ~st2~0) 0)} assume main_~node1__m1~0#1 == ~id1~0;~st1~0 := 1; {47677#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:27,933 INFO L290 TraceCheckUtils]: 48: Hoare triple {47677#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} ~mode1~0 := 0; {47677#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:27,933 INFO L290 TraceCheckUtils]: 49: Hoare triple {47677#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {47677#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:27,933 INFO L290 TraceCheckUtils]: 50: Hoare triple {47677#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {47677#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:27,934 INFO L290 TraceCheckUtils]: 51: Hoare triple {47677#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(main_~node2__m2~0#1 != ~nomsg~0); {47677#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:27,934 INFO L290 TraceCheckUtils]: 52: Hoare triple {47677#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} ~mode2~0 := 0; {47677#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:27,935 INFO L290 TraceCheckUtils]: 53: Hoare triple {47677#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {47677#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:27,935 INFO L290 TraceCheckUtils]: 54: Hoare triple {47677#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {47677#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:27,936 INFO L290 TraceCheckUtils]: 55: Hoare triple {47677#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(main_~node3__m3~0#1 != ~nomsg~0); {47677#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:27,936 INFO L290 TraceCheckUtils]: 56: Hoare triple {47677#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} ~mode3~0 := 0; {47677#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:27,937 INFO L290 TraceCheckUtils]: 57: Hoare triple {47677#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {47677#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:27,937 INFO L290 TraceCheckUtils]: 58: Hoare triple {47677#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {47674#false} is VALID [2022-02-20 18:51:27,937 INFO L290 TraceCheckUtils]: 59: Hoare triple {47674#false} ~__return_1465~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1465~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; {47674#false} is VALID [2022-02-20 18:51:27,937 INFO L290 TraceCheckUtils]: 60: Hoare triple {47674#false} assume 0 == main_~assert__arg~0#1 % 256; {47674#false} is VALID [2022-02-20 18:51:27,938 INFO L290 TraceCheckUtils]: 61: Hoare triple {47674#false} assume !false; {47674#false} is VALID [2022-02-20 18:51:27,938 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 18:51:27,938 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:27,938 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43317883] [2022-02-20 18:51:27,938 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43317883] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:27,939 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:27,939 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:51:27,939 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768081622] [2022-02-20 18:51:27,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:27,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-02-20 18:51:27,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:27,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:27,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:27,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:51:27,992 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:27,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:51:27,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:51:27,993 INFO L87 Difference]: Start difference. First operand 2363 states and 3300 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:35,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:35,711 INFO L93 Difference]: Finished difference Result 3763 states and 5320 transitions. [2022-02-20 18:51:35,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:51:35,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-02-20 18:51:35,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:35,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:35,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 336 transitions. [2022-02-20 18:51:35,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:35,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 336 transitions. [2022-02-20 18:51:35,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 336 transitions. [2022-02-20 18:51:35,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 336 edges. 336 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:36,382 INFO L225 Difference]: With dead ends: 3763 [2022-02-20 18:51:36,382 INFO L226 Difference]: Without dead ends: 3297 [2022-02-20 18:51:36,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:51:36,383 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 212 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:36,383 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 343 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:51:36,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3297 states. [2022-02-20 18:51:42,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3297 to 2827. [2022-02-20 18:51:42,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:42,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3297 states. Second operand has 2827 states, 2826 states have (on average 1.402689313517339) internal successors, (3964), 2826 states have internal predecessors, (3964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:42,404 INFO L74 IsIncluded]: Start isIncluded. First operand 3297 states. Second operand has 2827 states, 2826 states have (on average 1.402689313517339) internal successors, (3964), 2826 states have internal predecessors, (3964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:42,406 INFO L87 Difference]: Start difference. First operand 3297 states. Second operand has 2827 states, 2826 states have (on average 1.402689313517339) internal successors, (3964), 2826 states have internal predecessors, (3964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:42,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:42,739 INFO L93 Difference]: Finished difference Result 3297 states and 4639 transitions. [2022-02-20 18:51:42,739 INFO L276 IsEmpty]: Start isEmpty. Operand 3297 states and 4639 transitions. [2022-02-20 18:51:42,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:42,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:42,746 INFO L74 IsIncluded]: Start isIncluded. First operand has 2827 states, 2826 states have (on average 1.402689313517339) internal successors, (3964), 2826 states have internal predecessors, (3964), 0 states have call successors, (0), 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 3297 states. [2022-02-20 18:51:42,748 INFO L87 Difference]: Start difference. First operand has 2827 states, 2826 states have (on average 1.402689313517339) internal successors, (3964), 2826 states have internal predecessors, (3964), 0 states have call successors, (0), 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 3297 states. [2022-02-20 18:51:43,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:43,067 INFO L93 Difference]: Finished difference Result 3297 states and 4639 transitions. [2022-02-20 18:51:43,067 INFO L276 IsEmpty]: Start isEmpty. Operand 3297 states and 4639 transitions. [2022-02-20 18:51:43,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:43,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:43,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:43,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:43,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2827 states, 2826 states have (on average 1.402689313517339) internal successors, (3964), 2826 states have internal predecessors, (3964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:43,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2827 states to 2827 states and 3964 transitions. [2022-02-20 18:51:43,392 INFO L78 Accepts]: Start accepts. Automaton has 2827 states and 3964 transitions. Word has length 62 [2022-02-20 18:51:43,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:43,393 INFO L470 AbstractCegarLoop]: Abstraction has 2827 states and 3964 transitions. [2022-02-20 18:51:43,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:43,393 INFO L276 IsEmpty]: Start isEmpty. Operand 2827 states and 3964 transitions. [2022-02-20 18:51:43,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:51:43,394 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:43,394 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:43,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 18:51:43,394 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:43,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:43,394 INFO L85 PathProgramCache]: Analyzing trace with hash -344216809, now seen corresponding path program 1 times [2022-02-20 18:51:43,394 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:43,395 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485312326] [2022-02-20 18:51:43,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:43,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:43,476 INFO L290 TraceCheckUtils]: 0: Hoare triple {63575#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1389~0 := 0;~__return_1465~0 := 0; {63575#true} is VALID [2022-02-20 18:51:43,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {63575#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {63575#true} is VALID [2022-02-20 18:51:43,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {63575#true} assume 0 == ~r1~0 % 256; {63575#true} is VALID [2022-02-20 18:51:43,477 INFO L290 TraceCheckUtils]: 3: Hoare triple {63575#true} assume ~id1~0 >= 0; {63575#true} is VALID [2022-02-20 18:51:43,477 INFO L290 TraceCheckUtils]: 4: Hoare triple {63575#true} assume 0 == ~st1~0; {63575#true} is VALID [2022-02-20 18:51:43,477 INFO L290 TraceCheckUtils]: 5: Hoare triple {63575#true} assume ~send1~0 == ~id1~0; {63575#true} is VALID [2022-02-20 18:51:43,477 INFO L290 TraceCheckUtils]: 6: Hoare triple {63575#true} assume 0 == ~mode1~0 % 256; {63575#true} is VALID [2022-02-20 18:51:43,477 INFO L290 TraceCheckUtils]: 7: Hoare triple {63575#true} assume ~id2~0 >= 0; {63575#true} is VALID [2022-02-20 18:51:43,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {63575#true} assume 0 == ~st2~0; {63575#true} is VALID [2022-02-20 18:51:43,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {63575#true} assume ~send2~0 == ~id2~0; {63575#true} is VALID [2022-02-20 18:51:43,478 INFO L290 TraceCheckUtils]: 10: Hoare triple {63575#true} assume 0 == ~mode2~0 % 256; {63575#true} is VALID [2022-02-20 18:51:43,478 INFO L290 TraceCheckUtils]: 11: Hoare triple {63575#true} assume ~id3~0 >= 0; {63575#true} is VALID [2022-02-20 18:51:43,478 INFO L290 TraceCheckUtils]: 12: Hoare triple {63575#true} assume 0 == ~st3~0; {63575#true} is VALID [2022-02-20 18:51:43,479 INFO L290 TraceCheckUtils]: 13: Hoare triple {63575#true} assume ~send3~0 == ~id3~0; {63575#true} is VALID [2022-02-20 18:51:43,479 INFO L290 TraceCheckUtils]: 14: Hoare triple {63575#true} assume 0 == ~mode3~0 % 256; {63575#true} is VALID [2022-02-20 18:51:43,479 INFO L290 TraceCheckUtils]: 15: Hoare triple {63575#true} assume ~id1~0 != ~id2~0; {63575#true} is VALID [2022-02-20 18:51:43,479 INFO L290 TraceCheckUtils]: 16: Hoare triple {63575#true} assume ~id1~0 != ~id3~0; {63575#true} is VALID [2022-02-20 18:51:43,479 INFO L290 TraceCheckUtils]: 17: Hoare triple {63575#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1389~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1389~0; {63575#true} is VALID [2022-02-20 18:51:43,479 INFO L290 TraceCheckUtils]: 18: Hoare triple {63575#true} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {63575#true} is VALID [2022-02-20 18:51:43,480 INFO L290 TraceCheckUtils]: 19: Hoare triple {63575#true} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {63575#true} is VALID [2022-02-20 18:51:43,480 INFO L290 TraceCheckUtils]: 20: Hoare triple {63575#true} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {63575#true} is VALID [2022-02-20 18:51:43,480 INFO L290 TraceCheckUtils]: 21: Hoare triple {63575#true} assume ~send1~0 != ~nomsg~0; {63575#true} is VALID [2022-02-20 18:51:43,480 INFO L290 TraceCheckUtils]: 22: Hoare triple {63575#true} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {63575#true} is VALID [2022-02-20 18:51:43,480 INFO L290 TraceCheckUtils]: 23: Hoare triple {63575#true} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {63577#(= (+ (- 1) ~mode1~0) 0)} is VALID [2022-02-20 18:51:43,481 INFO L290 TraceCheckUtils]: 24: Hoare triple {63577#(= (+ (- 1) ~mode1~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {63577#(= (+ (- 1) ~mode1~0) 0)} is VALID [2022-02-20 18:51:43,481 INFO L290 TraceCheckUtils]: 25: Hoare triple {63577#(= (+ (- 1) ~mode1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {63577#(= (+ (- 1) ~mode1~0) 0)} is VALID [2022-02-20 18:51:43,481 INFO L290 TraceCheckUtils]: 26: Hoare triple {63577#(= (+ (- 1) ~mode1~0) 0)} assume ~send2~0 != ~nomsg~0; {63577#(= (+ (- 1) ~mode1~0) 0)} is VALID [2022-02-20 18:51:43,482 INFO L290 TraceCheckUtils]: 27: Hoare triple {63577#(= (+ (- 1) ~mode1~0) 0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {63577#(= (+ (- 1) ~mode1~0) 0)} is VALID [2022-02-20 18:51:43,482 INFO L290 TraceCheckUtils]: 28: Hoare triple {63577#(= (+ (- 1) ~mode1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {63577#(= (+ (- 1) ~mode1~0) 0)} is VALID [2022-02-20 18:51:43,483 INFO L290 TraceCheckUtils]: 29: Hoare triple {63577#(= (+ (- 1) ~mode1~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {63577#(= (+ (- 1) ~mode1~0) 0)} is VALID [2022-02-20 18:51:43,483 INFO L290 TraceCheckUtils]: 30: Hoare triple {63577#(= (+ (- 1) ~mode1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {63577#(= (+ (- 1) ~mode1~0) 0)} is VALID [2022-02-20 18:51:43,483 INFO L290 TraceCheckUtils]: 31: Hoare triple {63577#(= (+ (- 1) ~mode1~0) 0)} assume ~send3~0 != ~nomsg~0; {63577#(= (+ (- 1) ~mode1~0) 0)} is VALID [2022-02-20 18:51:43,484 INFO L290 TraceCheckUtils]: 32: Hoare triple {63577#(= (+ (- 1) ~mode1~0) 0)} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {63577#(= (+ (- 1) ~mode1~0) 0)} is VALID [2022-02-20 18:51:43,484 INFO L290 TraceCheckUtils]: 33: Hoare triple {63577#(= (+ (- 1) ~mode1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {63577#(= (+ (- 1) ~mode1~0) 0)} is VALID [2022-02-20 18:51:43,484 INFO L290 TraceCheckUtils]: 34: Hoare triple {63577#(= (+ (- 1) ~mode1~0) 0)} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {63577#(= (+ (- 1) ~mode1~0) 0)} is VALID [2022-02-20 18:51:43,485 INFO L290 TraceCheckUtils]: 35: Hoare triple {63577#(= (+ (- 1) ~mode1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {63577#(= (+ (- 1) ~mode1~0) 0)} is VALID [2022-02-20 18:51:43,485 INFO L290 TraceCheckUtils]: 36: Hoare triple {63577#(= (+ (- 1) ~mode1~0) 0)} assume !(~r1~0 % 256 >= 3); {63577#(= (+ (- 1) ~mode1~0) 0)} is VALID [2022-02-20 18:51:43,485 INFO L290 TraceCheckUtils]: 37: Hoare triple {63577#(= (+ (- 1) ~mode1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {63577#(= (+ (- 1) ~mode1~0) 0)} is VALID [2022-02-20 18:51:43,486 INFO L290 TraceCheckUtils]: 38: Hoare triple {63577#(= (+ (- 1) ~mode1~0) 0)} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1; {63577#(= (+ (- 1) ~mode1~0) 0)} is VALID [2022-02-20 18:51:43,486 INFO L290 TraceCheckUtils]: 39: Hoare triple {63577#(= (+ (- 1) ~mode1~0) 0)} ~__return_1465~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1465~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; {63577#(= (+ (- 1) ~mode1~0) 0)} is VALID [2022-02-20 18:51:43,486 INFO L290 TraceCheckUtils]: 40: Hoare triple {63577#(= (+ (- 1) ~mode1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256); {63577#(= (+ (- 1) ~mode1~0) 0)} is VALID [2022-02-20 18:51:43,487 INFO L290 TraceCheckUtils]: 41: Hoare triple {63577#(= (+ (- 1) ~mode1~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {63577#(= (+ (- 1) ~mode1~0) 0)} is VALID [2022-02-20 18:51:43,487 INFO L290 TraceCheckUtils]: 42: Hoare triple {63577#(= (+ (- 1) ~mode1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {63576#false} is VALID [2022-02-20 18:51:43,487 INFO L290 TraceCheckUtils]: 43: Hoare triple {63576#false} assume ~send1~0 != ~nomsg~0; {63576#false} is VALID [2022-02-20 18:51:43,487 INFO L290 TraceCheckUtils]: 44: Hoare triple {63576#false} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {63576#false} is VALID [2022-02-20 18:51:43,488 INFO L290 TraceCheckUtils]: 45: Hoare triple {63576#false} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {63576#false} is VALID [2022-02-20 18:51:43,488 INFO L290 TraceCheckUtils]: 46: Hoare triple {63576#false} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {63576#false} is VALID [2022-02-20 18:51:43,488 INFO L290 TraceCheckUtils]: 47: Hoare triple {63576#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {63576#false} is VALID [2022-02-20 18:51:43,488 INFO L290 TraceCheckUtils]: 48: Hoare triple {63576#false} assume !(main_~node2__m2~0#1 != ~nomsg~0); {63576#false} is VALID [2022-02-20 18:51:43,488 INFO L290 TraceCheckUtils]: 49: Hoare triple {63576#false} ~mode2~0 := 0; {63576#false} is VALID [2022-02-20 18:51:43,488 INFO L290 TraceCheckUtils]: 50: Hoare triple {63576#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {63576#false} is VALID [2022-02-20 18:51:43,488 INFO L290 TraceCheckUtils]: 51: Hoare triple {63576#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {63576#false} is VALID [2022-02-20 18:51:43,489 INFO L290 TraceCheckUtils]: 52: Hoare triple {63576#false} assume main_~node3__m3~0#1 != ~nomsg~0; {63576#false} is VALID [2022-02-20 18:51:43,489 INFO L290 TraceCheckUtils]: 53: Hoare triple {63576#false} assume !(main_~node3__m3~0#1 > ~id3~0); {63576#false} is VALID [2022-02-20 18:51:43,489 INFO L290 TraceCheckUtils]: 54: Hoare triple {63576#false} assume main_~node3__m3~0#1 == ~id3~0;~st3~0 := 1; {63576#false} is VALID [2022-02-20 18:51:43,489 INFO L290 TraceCheckUtils]: 55: Hoare triple {63576#false} ~mode3~0 := 0; {63576#false} is VALID [2022-02-20 18:51:43,490 INFO L290 TraceCheckUtils]: 56: Hoare triple {63576#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {63576#false} is VALID [2022-02-20 18:51:43,490 INFO L290 TraceCheckUtils]: 57: Hoare triple {63576#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {63576#false} is VALID [2022-02-20 18:51:43,490 INFO L290 TraceCheckUtils]: 58: Hoare triple {63576#false} assume !(~r1~0 % 256 >= 3); {63576#false} is VALID [2022-02-20 18:51:43,490 INFO L290 TraceCheckUtils]: 59: Hoare triple {63576#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~0#1 := 0; {63576#false} is VALID [2022-02-20 18:51:43,490 INFO L290 TraceCheckUtils]: 60: Hoare triple {63576#false} ~__return_1465~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1465~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; {63576#false} is VALID [2022-02-20 18:51:43,490 INFO L290 TraceCheckUtils]: 61: Hoare triple {63576#false} assume 0 == main_~assert__arg~0#1 % 256; {63576#false} is VALID [2022-02-20 18:51:43,490 INFO L290 TraceCheckUtils]: 62: Hoare triple {63576#false} assume !false; {63576#false} is VALID [2022-02-20 18:51:43,490 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:43,490 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:43,490 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485312326] [2022-02-20 18:51:43,490 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485312326] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:43,490 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:43,491 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:51:43,491 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145159716] [2022-02-20 18:51:43,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:43,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-02-20 18:51:43,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:43,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:43,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:43,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:51:43,529 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:43,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:51:43,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:51:43,529 INFO L87 Difference]: Start difference. First operand 2827 states and 3964 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)