./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5cbdd74a230613e4bdaea53735767d2cb8a557f2fb27b4c6d6d20587e28e4a0f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:28:16,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:28:16,424 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:28:16,454 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:28:16,455 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:28:16,458 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:28:16,459 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:28:16,461 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:28:16,462 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:28:16,466 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:28:16,466 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:28:16,467 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:28:16,468 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:28:16,469 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:28:16,470 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:28:16,473 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:28:16,473 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:28:16,474 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:28:16,476 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:28:16,480 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:28:16,481 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:28:16,482 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:28:16,483 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:28:16,484 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:28:16,488 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:28:16,489 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:28:16,489 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:28:16,490 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:28:16,491 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:28:16,492 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:28:16,492 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:28:16,492 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:28:16,494 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:28:16,494 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:28:16,495 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:28:16,496 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:28:16,496 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:28:16,496 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:28:16,496 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:28:16,497 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:28:16,497 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:28:16,499 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:28:16,525 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:28:16,525 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:28:16,526 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:28:16,526 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:28:16,526 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:28:16,527 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:28:16,527 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:28:16,527 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:28:16,527 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:28:16,528 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:28:16,528 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:28:16,528 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:28:16,529 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:28:16,529 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:28:16,529 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:28:16,529 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:28:16,529 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:28:16,529 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:28:16,529 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:28:16,530 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:28:16,530 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:28:16,530 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:28:16,530 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:28:16,530 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:28:16,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:28:16,531 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:28:16,531 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:28:16,532 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:28:16,532 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:28:16,532 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:28:16,532 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:28:16,532 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:28:16,533 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:28:16,533 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 -> 5cbdd74a230613e4bdaea53735767d2cb8a557f2fb27b4c6d6d20587e28e4a0f [2022-02-20 18:28:16,764 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:28:16,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:28:16,791 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:28:16,791 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:28:16,792 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:28:16,793 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c [2022-02-20 18:28:16,845 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23b149048/4eb3492704e64718a0a0e906bb955ff1/FLAG8569caa5a [2022-02-20 18:28:17,228 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:28:17,228 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c [2022-02-20 18:28:17,242 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23b149048/4eb3492704e64718a0a0e906bb955ff1/FLAG8569caa5a [2022-02-20 18:28:17,253 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23b149048/4eb3492704e64718a0a0e906bb955ff1 [2022-02-20 18:28:17,256 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:28:17,257 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:28:17,260 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:28:17,260 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:28:17,262 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:28:17,263 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:28:17" (1/1) ... [2022-02-20 18:28:17,264 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fdd3e70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:17, skipping insertion in model container [2022-02-20 18:28:17,264 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:28:17" (1/1) ... [2022-02-20 18:28:17,268 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:28:17,304 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:28:17,518 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c[16977,16990] [2022-02-20 18:28:17,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:28:17,525 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:28:17,580 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c[16977,16990] [2022-02-20 18:28:17,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:28:17,590 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:28:17,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:17 WrapperNode [2022-02-20 18:28:17,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:28:17,592 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:28:17,592 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:28:17,592 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:28:17,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:17" (1/1) ... [2022-02-20 18:28:17,612 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:17" (1/1) ... [2022-02-20 18:28:17,655 INFO L137 Inliner]: procedures = 25, calls = 17, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 462 [2022-02-20 18:28:17,661 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:28:17,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:28:17,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:28:17,663 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:28:17,668 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:17" (1/1) ... [2022-02-20 18:28:17,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:17" (1/1) ... [2022-02-20 18:28:17,676 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:17" (1/1) ... [2022-02-20 18:28:17,679 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:17" (1/1) ... [2022-02-20 18:28:17,685 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:17" (1/1) ... [2022-02-20 18:28:17,699 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:17" (1/1) ... [2022-02-20 18:28:17,702 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:17" (1/1) ... [2022-02-20 18:28:17,709 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:28:17,712 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:28:17,712 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:28:17,713 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:28:17,714 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:17" (1/1) ... [2022-02-20 18:28:17,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:28:17,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:28:17,735 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:28:17,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:28:17,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:28:17,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:28:17,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:28:17,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:28:17,862 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:28:17,863 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:28:18,533 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:28:18,541 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:28:18,542 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 18:28:18,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:28:18 BoogieIcfgContainer [2022-02-20 18:28:18,544 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:28:18,546 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:28:18,546 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:28:18,548 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:28:18,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:28:17" (1/3) ... [2022-02-20 18:28:18,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0cb9ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:28:18, skipping insertion in model container [2022-02-20 18:28:18,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:28:17" (2/3) ... [2022-02-20 18:28:18,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0cb9ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:28:18, skipping insertion in model container [2022-02-20 18:28:18,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:28:18" (3/3) ... [2022-02-20 18:28:18,550 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c [2022-02-20 18:28:18,554 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:28:18,555 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:28:18,590 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:28:18,596 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:28:18,596 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:28:18,615 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 143 states have (on average 1.7202797202797202) internal successors, (246), 144 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:18,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:28:18,620 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:18,620 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:28:18,621 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:18,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:18,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1929732074, now seen corresponding path program 1 times [2022-02-20 18:28:18,630 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:18,630 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195640913] [2022-02-20 18:28:18,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:18,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:18,847 INFO L290 TraceCheckUtils]: 0: Hoare triple {148#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; {148#true} is VALID [2022-02-20 18:28:18,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_#t~post49#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~r1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume -128 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 127;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;assume -128 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 127;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;assume -128 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 127;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;assume -128 <= main_#t~nondet44#1 && main_#t~nondet44#1 <= 127;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {148#true} is VALID [2022-02-20 18:28:18,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {148#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {150#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 18:28:18,849 INFO L290 TraceCheckUtils]: 3: Hoare triple {150#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {151#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 18:28:18,854 INFO L290 TraceCheckUtils]: 4: Hoare triple {151#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret47#1 && main_#t~ret47#1 <= 2147483647;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {152#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 18:28:18,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {152#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {149#false} is VALID [2022-02-20 18:28:18,855 INFO L290 TraceCheckUtils]: 6: Hoare triple {149#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {149#false} is VALID [2022-02-20 18:28:18,855 INFO L290 TraceCheckUtils]: 7: Hoare triple {149#false} assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {149#false} is VALID [2022-02-20 18:28:18,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {149#false} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {149#false} is VALID [2022-02-20 18:28:18,856 INFO L290 TraceCheckUtils]: 9: Hoare triple {149#false} assume !(node1_~m1~0#1 != ~nomsg~0); {149#false} is VALID [2022-02-20 18:28:18,865 INFO L290 TraceCheckUtils]: 10: Hoare triple {149#false} ~mode1~0 := 0; {149#false} is VALID [2022-02-20 18:28:18,865 INFO L290 TraceCheckUtils]: 11: Hoare triple {149#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {149#false} is VALID [2022-02-20 18:28:18,866 INFO L290 TraceCheckUtils]: 12: Hoare triple {149#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {149#false} is VALID [2022-02-20 18:28:18,866 INFO L290 TraceCheckUtils]: 13: Hoare triple {149#false} assume !(node2_~m2~0#1 != ~nomsg~0); {149#false} is VALID [2022-02-20 18:28:18,866 INFO L290 TraceCheckUtils]: 14: Hoare triple {149#false} ~mode2~0 := 0; {149#false} is VALID [2022-02-20 18:28:18,866 INFO L290 TraceCheckUtils]: 15: Hoare triple {149#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {149#false} is VALID [2022-02-20 18:28:18,866 INFO L290 TraceCheckUtils]: 16: Hoare triple {149#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {149#false} is VALID [2022-02-20 18:28:18,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {149#false} assume !(node3_~m3~0#1 != ~nomsg~0); {149#false} is VALID [2022-02-20 18:28:18,867 INFO L290 TraceCheckUtils]: 18: Hoare triple {149#false} ~mode3~0 := 0; {149#false} is VALID [2022-02-20 18:28:18,868 INFO L290 TraceCheckUtils]: 19: Hoare triple {149#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {149#false} is VALID [2022-02-20 18:28:18,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {149#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {149#false} is VALID [2022-02-20 18:28:18,869 INFO L290 TraceCheckUtils]: 21: Hoare triple {149#false} assume !(node4_~m4~0#1 != ~nomsg~0); {149#false} is VALID [2022-02-20 18:28:18,869 INFO L290 TraceCheckUtils]: 22: Hoare triple {149#false} ~mode4~0 := 0; {149#false} is VALID [2022-02-20 18:28:18,869 INFO L290 TraceCheckUtils]: 23: Hoare triple {149#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {149#false} is VALID [2022-02-20 18:28:18,869 INFO L290 TraceCheckUtils]: 24: Hoare triple {149#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {149#false} is VALID [2022-02-20 18:28:18,870 INFO L290 TraceCheckUtils]: 25: Hoare triple {149#false} assume !(node5_~m5~0#1 != ~nomsg~0); {149#false} is VALID [2022-02-20 18:28:18,870 INFO L290 TraceCheckUtils]: 26: Hoare triple {149#false} ~mode5~0 := 0; {149#false} is VALID [2022-02-20 18:28:18,870 INFO L290 TraceCheckUtils]: 27: Hoare triple {149#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {149#false} is VALID [2022-02-20 18:28:18,870 INFO L290 TraceCheckUtils]: 28: Hoare triple {149#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {149#false} is VALID [2022-02-20 18:28:18,870 INFO L290 TraceCheckUtils]: 29: Hoare triple {149#false} assume !(node6_~m6~0#1 != ~nomsg~0); {149#false} is VALID [2022-02-20 18:28:18,871 INFO L290 TraceCheckUtils]: 30: Hoare triple {149#false} ~mode6~0 := 0; {149#false} is VALID [2022-02-20 18:28:18,872 INFO L290 TraceCheckUtils]: 31: Hoare triple {149#false} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {149#false} is VALID [2022-02-20 18:28:18,872 INFO L290 TraceCheckUtils]: 32: Hoare triple {149#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {149#false} is VALID [2022-02-20 18:28:18,872 INFO L290 TraceCheckUtils]: 33: Hoare triple {149#false} check_#res#1 := check_~tmp~1#1; {149#false} is VALID [2022-02-20 18:28:18,872 INFO L290 TraceCheckUtils]: 34: Hoare triple {149#false} main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret48#1 && main_#t~ret48#1 <= 2147483647;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {149#false} is VALID [2022-02-20 18:28:18,873 INFO L290 TraceCheckUtils]: 35: Hoare triple {149#false} assume 0 == assert_~arg#1 % 256; {149#false} is VALID [2022-02-20 18:28:18,873 INFO L290 TraceCheckUtils]: 36: Hoare triple {149#false} assume !false; {149#false} is VALID [2022-02-20 18:28:18,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:28:18,875 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:18,875 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195640913] [2022-02-20 18:28:18,876 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195640913] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:18,876 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:18,876 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:28:18,877 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586878821] [2022-02-20 18:28:18,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:18,884 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 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:28:18,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:18,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 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:28:18,923 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:28:18,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:28:18,924 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:18,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:28:18,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:28:18,945 INFO L87 Difference]: Start difference. First operand has 145 states, 143 states have (on average 1.7202797202797202) internal successors, (246), 144 states have internal predecessors, (246), 0 states have call successors, (0), 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 5 states, 5 states have (on average 7.4) internal successors, (37), 5 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:28:19,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:19,415 INFO L93 Difference]: Finished difference Result 247 states and 408 transitions. [2022-02-20 18:28:19,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:28:19,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 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:28:19,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:19,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 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:28:19,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 408 transitions. [2022-02-20 18:28:19,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 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:28:19,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 408 transitions. [2022-02-20 18:28:19,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 408 transitions. [2022-02-20 18:28:19,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 408 edges. 408 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:19,690 INFO L225 Difference]: With dead ends: 247 [2022-02-20 18:28:19,690 INFO L226 Difference]: Without dead ends: 141 [2022-02-20 18:28:19,693 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:28:19,695 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 3 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:28:19,696 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 920 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:19,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-02-20 18:28:19,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2022-02-20 18:28:19,718 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:19,719 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 141 states, 140 states have (on average 1.4142857142857144) internal successors, (198), 140 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:19,720 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 141 states, 140 states have (on average 1.4142857142857144) internal successors, (198), 140 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:19,720 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 141 states, 140 states have (on average 1.4142857142857144) internal successors, (198), 140 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:19,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:19,726 INFO L93 Difference]: Finished difference Result 141 states and 198 transitions. [2022-02-20 18:28:19,726 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 198 transitions. [2022-02-20 18:28:19,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:19,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:19,728 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 140 states have (on average 1.4142857142857144) internal successors, (198), 140 states have internal predecessors, (198), 0 states have call successors, (0), 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 141 states. [2022-02-20 18:28:19,729 INFO L87 Difference]: Start difference. First operand has 141 states, 140 states have (on average 1.4142857142857144) internal successors, (198), 140 states have internal predecessors, (198), 0 states have call successors, (0), 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 141 states. [2022-02-20 18:28:19,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:19,734 INFO L93 Difference]: Finished difference Result 141 states and 198 transitions. [2022-02-20 18:28:19,734 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 198 transitions. [2022-02-20 18:28:19,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:19,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:19,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:19,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:19,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.4142857142857144) internal successors, (198), 140 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:19,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 198 transitions. [2022-02-20 18:28:19,742 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 198 transitions. Word has length 37 [2022-02-20 18:28:19,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:19,742 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 198 transitions. [2022-02-20 18:28:19,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 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:28:19,742 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 198 transitions. [2022-02-20 18:28:19,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 18:28:19,744 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:19,745 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:28:19,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:28:19,745 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:19,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:19,746 INFO L85 PathProgramCache]: Analyzing trace with hash -2008203596, now seen corresponding path program 1 times [2022-02-20 18:28:19,746 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:19,746 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422453516] [2022-02-20 18:28:19,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:19,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:19,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {858#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; {858#true} is VALID [2022-02-20 18:28:19,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {858#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_#t~post49#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~r1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume -128 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 127;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;assume -128 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 127;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;assume -128 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 127;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;assume -128 <= main_#t~nondet44#1 && main_#t~nondet44#1 <= 127;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {858#true} is VALID [2022-02-20 18:28:19,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {858#true} assume 0 == ~r1~0; {858#true} is VALID [2022-02-20 18:28:19,864 INFO L290 TraceCheckUtils]: 3: Hoare triple {858#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {858#true} is VALID [2022-02-20 18:28:19,864 INFO L290 TraceCheckUtils]: 4: Hoare triple {858#true} assume ~id1~0 >= 0; {858#true} is VALID [2022-02-20 18:28:19,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {858#true} assume 0 == ~st1~0; {858#true} is VALID [2022-02-20 18:28:19,865 INFO L290 TraceCheckUtils]: 6: Hoare triple {858#true} assume ~send1~0 == ~id1~0; {858#true} is VALID [2022-02-20 18:28:19,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {858#true} assume 0 == ~mode1~0 % 256; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:19,866 INFO L290 TraceCheckUtils]: 8: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:19,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:19,866 INFO L290 TraceCheckUtils]: 10: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:19,867 INFO L290 TraceCheckUtils]: 11: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:19,867 INFO L290 TraceCheckUtils]: 12: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:19,868 INFO L290 TraceCheckUtils]: 13: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:19,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:19,868 INFO L290 TraceCheckUtils]: 15: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:19,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:19,869 INFO L290 TraceCheckUtils]: 17: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:19,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:19,870 INFO L290 TraceCheckUtils]: 19: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:19,870 INFO L290 TraceCheckUtils]: 20: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:19,871 INFO L290 TraceCheckUtils]: 21: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:19,871 INFO L290 TraceCheckUtils]: 22: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:19,871 INFO L290 TraceCheckUtils]: 23: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:19,872 INFO L290 TraceCheckUtils]: 24: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 >= 0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:19,872 INFO L290 TraceCheckUtils]: 25: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st6~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:19,873 INFO L290 TraceCheckUtils]: 26: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send6~0 == ~id6~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:19,873 INFO L290 TraceCheckUtils]: 27: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode6~0 % 256; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:19,873 INFO L290 TraceCheckUtils]: 28: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:19,874 INFO L290 TraceCheckUtils]: 29: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:19,874 INFO L290 TraceCheckUtils]: 30: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:19,874 INFO L290 TraceCheckUtils]: 31: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:19,875 INFO L290 TraceCheckUtils]: 32: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id6~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:19,875 INFO L290 TraceCheckUtils]: 33: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:19,876 INFO L290 TraceCheckUtils]: 34: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:19,876 INFO L290 TraceCheckUtils]: 35: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:19,876 INFO L290 TraceCheckUtils]: 36: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id6~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:19,877 INFO L290 TraceCheckUtils]: 37: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:19,877 INFO L290 TraceCheckUtils]: 38: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:19,877 INFO L290 TraceCheckUtils]: 39: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id6~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:19,878 INFO L290 TraceCheckUtils]: 40: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:19,878 INFO L290 TraceCheckUtils]: 41: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id6~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:19,879 INFO L290 TraceCheckUtils]: 42: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:19,879 INFO L290 TraceCheckUtils]: 43: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:19,879 INFO L290 TraceCheckUtils]: 44: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret47#1 && main_#t~ret47#1 <= 2147483647;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:19,880 INFO L290 TraceCheckUtils]: 45: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:19,881 INFO L290 TraceCheckUtils]: 46: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:19,881 INFO L290 TraceCheckUtils]: 47: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:19,882 INFO L290 TraceCheckUtils]: 48: Hoare triple {860#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {859#false} is VALID [2022-02-20 18:28:19,882 INFO L290 TraceCheckUtils]: 49: Hoare triple {859#false} assume !(node1_~m1~0#1 != ~nomsg~0); {859#false} is VALID [2022-02-20 18:28:19,882 INFO L290 TraceCheckUtils]: 50: Hoare triple {859#false} ~mode1~0 := 0; {859#false} is VALID [2022-02-20 18:28:19,882 INFO L290 TraceCheckUtils]: 51: Hoare triple {859#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {859#false} is VALID [2022-02-20 18:28:19,883 INFO L290 TraceCheckUtils]: 52: Hoare triple {859#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {859#false} is VALID [2022-02-20 18:28:19,883 INFO L290 TraceCheckUtils]: 53: Hoare triple {859#false} assume !(node2_~m2~0#1 != ~nomsg~0); {859#false} is VALID [2022-02-20 18:28:19,883 INFO L290 TraceCheckUtils]: 54: Hoare triple {859#false} ~mode2~0 := 0; {859#false} is VALID [2022-02-20 18:28:19,883 INFO L290 TraceCheckUtils]: 55: Hoare triple {859#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {859#false} is VALID [2022-02-20 18:28:19,883 INFO L290 TraceCheckUtils]: 56: Hoare triple {859#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {859#false} is VALID [2022-02-20 18:28:19,883 INFO L290 TraceCheckUtils]: 57: Hoare triple {859#false} assume !(node3_~m3~0#1 != ~nomsg~0); {859#false} is VALID [2022-02-20 18:28:19,884 INFO L290 TraceCheckUtils]: 58: Hoare triple {859#false} ~mode3~0 := 0; {859#false} is VALID [2022-02-20 18:28:19,884 INFO L290 TraceCheckUtils]: 59: Hoare triple {859#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {859#false} is VALID [2022-02-20 18:28:19,884 INFO L290 TraceCheckUtils]: 60: Hoare triple {859#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {859#false} is VALID [2022-02-20 18:28:19,884 INFO L290 TraceCheckUtils]: 61: Hoare triple {859#false} assume !(node4_~m4~0#1 != ~nomsg~0); {859#false} is VALID [2022-02-20 18:28:19,884 INFO L290 TraceCheckUtils]: 62: Hoare triple {859#false} ~mode4~0 := 0; {859#false} is VALID [2022-02-20 18:28:19,885 INFO L290 TraceCheckUtils]: 63: Hoare triple {859#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {859#false} is VALID [2022-02-20 18:28:19,885 INFO L290 TraceCheckUtils]: 64: Hoare triple {859#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {859#false} is VALID [2022-02-20 18:28:19,885 INFO L290 TraceCheckUtils]: 65: Hoare triple {859#false} assume !(node5_~m5~0#1 != ~nomsg~0); {859#false} is VALID [2022-02-20 18:28:19,885 INFO L290 TraceCheckUtils]: 66: Hoare triple {859#false} ~mode5~0 := 0; {859#false} is VALID [2022-02-20 18:28:19,885 INFO L290 TraceCheckUtils]: 67: Hoare triple {859#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {859#false} is VALID [2022-02-20 18:28:19,885 INFO L290 TraceCheckUtils]: 68: Hoare triple {859#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {859#false} is VALID [2022-02-20 18:28:19,886 INFO L290 TraceCheckUtils]: 69: Hoare triple {859#false} assume !(node6_~m6~0#1 != ~nomsg~0); {859#false} is VALID [2022-02-20 18:28:19,886 INFO L290 TraceCheckUtils]: 70: Hoare triple {859#false} ~mode6~0 := 0; {859#false} is VALID [2022-02-20 18:28:19,886 INFO L290 TraceCheckUtils]: 71: Hoare triple {859#false} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {859#false} is VALID [2022-02-20 18:28:19,886 INFO L290 TraceCheckUtils]: 72: Hoare triple {859#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {859#false} is VALID [2022-02-20 18:28:19,886 INFO L290 TraceCheckUtils]: 73: Hoare triple {859#false} check_#res#1 := check_~tmp~1#1; {859#false} is VALID [2022-02-20 18:28:19,887 INFO L290 TraceCheckUtils]: 74: Hoare triple {859#false} main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret48#1 && main_#t~ret48#1 <= 2147483647;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {859#false} is VALID [2022-02-20 18:28:19,887 INFO L290 TraceCheckUtils]: 75: Hoare triple {859#false} assume 0 == assert_~arg#1 % 256; {859#false} is VALID [2022-02-20 18:28:19,887 INFO L290 TraceCheckUtils]: 76: Hoare triple {859#false} assume !false; {859#false} is VALID [2022-02-20 18:28:19,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:28:19,888 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:19,888 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422453516] [2022-02-20 18:28:19,888 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422453516] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:19,888 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:19,888 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:28:19,889 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339376135] [2022-02-20 18:28:19,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:19,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 18:28:19,890 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:19,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:19,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:19,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:28:19,935 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:19,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:28:19,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:19,936 INFO L87 Difference]: Start difference. First operand 141 states and 198 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:20,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:20,190 INFO L93 Difference]: Finished difference Result 317 states and 480 transitions. [2022-02-20 18:28:20,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:28:20,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 18:28:20,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:20,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:20,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-02-20 18:28:20,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:20,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-02-20 18:28:20,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 480 transitions. [2022-02-20 18:28:20,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:20,506 INFO L225 Difference]: With dead ends: 317 [2022-02-20 18:28:20,507 INFO L226 Difference]: Without dead ends: 223 [2022-02-20 18:28:20,507 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:20,508 INFO L933 BasicCegarLoop]: 325 mSDtfsCounter, 139 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:28:20,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 467 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:20,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-02-20 18:28:20,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2022-02-20 18:28:20,532 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:20,532 INFO L82 GeneralOperation]: Start isEquivalent. First operand 223 states. Second operand has 221 states, 220 states have (on average 1.4863636363636363) internal successors, (327), 220 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:20,533 INFO L74 IsIncluded]: Start isIncluded. First operand 223 states. Second operand has 221 states, 220 states have (on average 1.4863636363636363) internal successors, (327), 220 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:20,533 INFO L87 Difference]: Start difference. First operand 223 states. Second operand has 221 states, 220 states have (on average 1.4863636363636363) internal successors, (327), 220 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:20,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:20,539 INFO L93 Difference]: Finished difference Result 223 states and 328 transitions. [2022-02-20 18:28:20,539 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 328 transitions. [2022-02-20 18:28:20,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:20,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:20,541 INFO L74 IsIncluded]: Start isIncluded. First operand has 221 states, 220 states have (on average 1.4863636363636363) internal successors, (327), 220 states have internal predecessors, (327), 0 states have call successors, (0), 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 223 states. [2022-02-20 18:28:20,541 INFO L87 Difference]: Start difference. First operand has 221 states, 220 states have (on average 1.4863636363636363) internal successors, (327), 220 states have internal predecessors, (327), 0 states have call successors, (0), 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 223 states. [2022-02-20 18:28:20,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:20,547 INFO L93 Difference]: Finished difference Result 223 states and 328 transitions. [2022-02-20 18:28:20,547 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 328 transitions. [2022-02-20 18:28:20,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:20,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:20,548 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:20,548 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:20,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.4863636363636363) internal successors, (327), 220 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:20,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 327 transitions. [2022-02-20 18:28:20,554 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 327 transitions. Word has length 77 [2022-02-20 18:28:20,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:20,554 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 327 transitions. [2022-02-20 18:28:20,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:20,555 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 327 transitions. [2022-02-20 18:28:20,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 18:28:20,556 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:20,556 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:28:20,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:28:20,556 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:20,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:20,557 INFO L85 PathProgramCache]: Analyzing trace with hash 823495780, now seen corresponding path program 1 times [2022-02-20 18:28:20,557 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:20,557 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148279975] [2022-02-20 18:28:20,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:20,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:20,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:20,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {1889#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; {1889#true} is VALID [2022-02-20 18:28:20,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {1889#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_#t~post49#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~r1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume -128 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 127;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;assume -128 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 127;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;assume -128 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 127;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;assume -128 <= main_#t~nondet44#1 && main_#t~nondet44#1 <= 127;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1889#true} is VALID [2022-02-20 18:28:20,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {1889#true} assume 0 == ~r1~0; {1889#true} is VALID [2022-02-20 18:28:20,645 INFO L290 TraceCheckUtils]: 3: Hoare triple {1889#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {1889#true} is VALID [2022-02-20 18:28:20,645 INFO L290 TraceCheckUtils]: 4: Hoare triple {1889#true} assume ~id1~0 >= 0; {1889#true} is VALID [2022-02-20 18:28:20,645 INFO L290 TraceCheckUtils]: 5: Hoare triple {1889#true} assume 0 == ~st1~0; {1889#true} is VALID [2022-02-20 18:28:20,646 INFO L290 TraceCheckUtils]: 6: Hoare triple {1889#true} assume ~send1~0 == ~id1~0; {1889#true} is VALID [2022-02-20 18:28:20,646 INFO L290 TraceCheckUtils]: 7: Hoare triple {1889#true} assume 0 == ~mode1~0 % 256; {1889#true} is VALID [2022-02-20 18:28:20,646 INFO L290 TraceCheckUtils]: 8: Hoare triple {1889#true} assume ~id2~0 >= 0; {1889#true} is VALID [2022-02-20 18:28:20,646 INFO L290 TraceCheckUtils]: 9: Hoare triple {1889#true} assume 0 == ~st2~0; {1889#true} is VALID [2022-02-20 18:28:20,646 INFO L290 TraceCheckUtils]: 10: Hoare triple {1889#true} assume ~send2~0 == ~id2~0; {1889#true} is VALID [2022-02-20 18:28:20,647 INFO L290 TraceCheckUtils]: 11: Hoare triple {1889#true} assume 0 == ~mode2~0 % 256; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:20,647 INFO L290 TraceCheckUtils]: 12: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:20,648 INFO L290 TraceCheckUtils]: 13: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:20,648 INFO L290 TraceCheckUtils]: 14: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:20,649 INFO L290 TraceCheckUtils]: 15: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:20,649 INFO L290 TraceCheckUtils]: 16: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:20,649 INFO L290 TraceCheckUtils]: 17: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:20,650 INFO L290 TraceCheckUtils]: 18: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:20,650 INFO L290 TraceCheckUtils]: 19: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:20,651 INFO L290 TraceCheckUtils]: 20: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:20,651 INFO L290 TraceCheckUtils]: 21: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:20,651 INFO L290 TraceCheckUtils]: 22: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:20,652 INFO L290 TraceCheckUtils]: 23: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:20,652 INFO L290 TraceCheckUtils]: 24: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 >= 0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:20,653 INFO L290 TraceCheckUtils]: 25: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st6~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:20,653 INFO L290 TraceCheckUtils]: 26: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send6~0 == ~id6~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:20,653 INFO L290 TraceCheckUtils]: 27: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode6~0 % 256; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:20,654 INFO L290 TraceCheckUtils]: 28: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:20,654 INFO L290 TraceCheckUtils]: 29: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:20,654 INFO L290 TraceCheckUtils]: 30: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:20,655 INFO L290 TraceCheckUtils]: 31: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:20,655 INFO L290 TraceCheckUtils]: 32: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id6~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:20,656 INFO L290 TraceCheckUtils]: 33: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:20,656 INFO L290 TraceCheckUtils]: 34: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:20,657 INFO L290 TraceCheckUtils]: 35: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:20,657 INFO L290 TraceCheckUtils]: 36: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id6~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:20,658 INFO L290 TraceCheckUtils]: 37: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:20,658 INFO L290 TraceCheckUtils]: 38: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:20,658 INFO L290 TraceCheckUtils]: 39: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id6~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:20,659 INFO L290 TraceCheckUtils]: 40: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:20,659 INFO L290 TraceCheckUtils]: 41: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id6~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:20,660 INFO L290 TraceCheckUtils]: 42: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:20,660 INFO L290 TraceCheckUtils]: 43: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:20,660 INFO L290 TraceCheckUtils]: 44: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret47#1 && main_#t~ret47#1 <= 2147483647;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:20,661 INFO L290 TraceCheckUtils]: 45: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:20,661 INFO L290 TraceCheckUtils]: 46: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:20,662 INFO L290 TraceCheckUtils]: 47: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:20,662 INFO L290 TraceCheckUtils]: 48: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:20,663 INFO L290 TraceCheckUtils]: 49: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~alive1~0 % 256); {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:20,663 INFO L290 TraceCheckUtils]: 50: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(~send1~0 != ~id1~0); {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:20,663 INFO L290 TraceCheckUtils]: 51: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:20,664 INFO L290 TraceCheckUtils]: 52: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:28:20,664 INFO L290 TraceCheckUtils]: 53: Hoare triple {1891#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1890#false} is VALID [2022-02-20 18:28:20,664 INFO L290 TraceCheckUtils]: 54: Hoare triple {1890#false} assume !(node2_~m2~0#1 != ~nomsg~0); {1890#false} is VALID [2022-02-20 18:28:20,665 INFO L290 TraceCheckUtils]: 55: Hoare triple {1890#false} ~mode2~0 := 0; {1890#false} is VALID [2022-02-20 18:28:20,665 INFO L290 TraceCheckUtils]: 56: Hoare triple {1890#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1890#false} is VALID [2022-02-20 18:28:20,665 INFO L290 TraceCheckUtils]: 57: Hoare triple {1890#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1890#false} is VALID [2022-02-20 18:28:20,665 INFO L290 TraceCheckUtils]: 58: Hoare triple {1890#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1890#false} is VALID [2022-02-20 18:28:20,665 INFO L290 TraceCheckUtils]: 59: Hoare triple {1890#false} ~mode3~0 := 0; {1890#false} is VALID [2022-02-20 18:28:20,665 INFO L290 TraceCheckUtils]: 60: Hoare triple {1890#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1890#false} is VALID [2022-02-20 18:28:20,666 INFO L290 TraceCheckUtils]: 61: Hoare triple {1890#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1890#false} is VALID [2022-02-20 18:28:20,666 INFO L290 TraceCheckUtils]: 62: Hoare triple {1890#false} assume !(node4_~m4~0#1 != ~nomsg~0); {1890#false} is VALID [2022-02-20 18:28:20,666 INFO L290 TraceCheckUtils]: 63: Hoare triple {1890#false} ~mode4~0 := 0; {1890#false} is VALID [2022-02-20 18:28:20,666 INFO L290 TraceCheckUtils]: 64: Hoare triple {1890#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {1890#false} is VALID [2022-02-20 18:28:20,666 INFO L290 TraceCheckUtils]: 65: Hoare triple {1890#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1890#false} is VALID [2022-02-20 18:28:20,666 INFO L290 TraceCheckUtils]: 66: Hoare triple {1890#false} assume !(node5_~m5~0#1 != ~nomsg~0); {1890#false} is VALID [2022-02-20 18:28:20,667 INFO L290 TraceCheckUtils]: 67: Hoare triple {1890#false} ~mode5~0 := 0; {1890#false} is VALID [2022-02-20 18:28:20,667 INFO L290 TraceCheckUtils]: 68: Hoare triple {1890#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {1890#false} is VALID [2022-02-20 18:28:20,670 INFO L290 TraceCheckUtils]: 69: Hoare triple {1890#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1890#false} is VALID [2022-02-20 18:28:20,671 INFO L290 TraceCheckUtils]: 70: Hoare triple {1890#false} assume !(node6_~m6~0#1 != ~nomsg~0); {1890#false} is VALID [2022-02-20 18:28:20,671 INFO L290 TraceCheckUtils]: 71: Hoare triple {1890#false} ~mode6~0 := 0; {1890#false} is VALID [2022-02-20 18:28:20,671 INFO L290 TraceCheckUtils]: 72: Hoare triple {1890#false} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1890#false} is VALID [2022-02-20 18:28:20,671 INFO L290 TraceCheckUtils]: 73: Hoare triple {1890#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {1890#false} is VALID [2022-02-20 18:28:20,671 INFO L290 TraceCheckUtils]: 74: Hoare triple {1890#false} check_#res#1 := check_~tmp~1#1; {1890#false} is VALID [2022-02-20 18:28:20,672 INFO L290 TraceCheckUtils]: 75: Hoare triple {1890#false} main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret48#1 && main_#t~ret48#1 <= 2147483647;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1890#false} is VALID [2022-02-20 18:28:20,672 INFO L290 TraceCheckUtils]: 76: Hoare triple {1890#false} assume 0 == assert_~arg#1 % 256; {1890#false} is VALID [2022-02-20 18:28:20,672 INFO L290 TraceCheckUtils]: 77: Hoare triple {1890#false} assume !false; {1890#false} is VALID [2022-02-20 18:28:20,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:28:20,673 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:20,673 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148279975] [2022-02-20 18:28:20,673 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148279975] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:20,673 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:20,673 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:28:20,674 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093830653] [2022-02-20 18:28:20,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:20,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 18:28:20,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:20,675 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:20,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:20,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:28:20,720 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:20,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:28:20,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:20,721 INFO L87 Difference]: Start difference. First operand 221 states and 327 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:20,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:20,966 INFO L93 Difference]: Finished difference Result 545 states and 847 transitions. [2022-02-20 18:28:20,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:28:20,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 18:28:20,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:20,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:20,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-02-20 18:28:20,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:20,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-02-20 18:28:20,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 480 transitions. [2022-02-20 18:28:21,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:21,277 INFO L225 Difference]: With dead ends: 545 [2022-02-20 18:28:21,277 INFO L226 Difference]: Without dead ends: 371 [2022-02-20 18:28:21,280 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:21,286 INFO L933 BasicCegarLoop]: 312 mSDtfsCounter, 134 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:28:21,287 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 458 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:21,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2022-02-20 18:28:21,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 369. [2022-02-20 18:28:21,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:21,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 371 states. Second operand has 369 states, 368 states have (on average 1.5326086956521738) internal successors, (564), 368 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:21,302 INFO L74 IsIncluded]: Start isIncluded. First operand 371 states. Second operand has 369 states, 368 states have (on average 1.5326086956521738) internal successors, (564), 368 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:21,303 INFO L87 Difference]: Start difference. First operand 371 states. Second operand has 369 states, 368 states have (on average 1.5326086956521738) internal successors, (564), 368 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:21,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:21,311 INFO L93 Difference]: Finished difference Result 371 states and 565 transitions. [2022-02-20 18:28:21,311 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 565 transitions. [2022-02-20 18:28:21,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:21,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:21,312 INFO L74 IsIncluded]: Start isIncluded. First operand has 369 states, 368 states have (on average 1.5326086956521738) internal successors, (564), 368 states have internal predecessors, (564), 0 states have call successors, (0), 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 371 states. [2022-02-20 18:28:21,313 INFO L87 Difference]: Start difference. First operand has 369 states, 368 states have (on average 1.5326086956521738) internal successors, (564), 368 states have internal predecessors, (564), 0 states have call successors, (0), 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 371 states. [2022-02-20 18:28:21,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:21,330 INFO L93 Difference]: Finished difference Result 371 states and 565 transitions. [2022-02-20 18:28:21,330 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 565 transitions. [2022-02-20 18:28:21,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:21,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:21,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:21,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:21,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 368 states have (on average 1.5326086956521738) internal successors, (564), 368 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:21,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 564 transitions. [2022-02-20 18:28:21,338 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 564 transitions. Word has length 78 [2022-02-20 18:28:21,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:21,338 INFO L470 AbstractCegarLoop]: Abstraction has 369 states and 564 transitions. [2022-02-20 18:28:21,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:21,339 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 564 transitions. [2022-02-20 18:28:21,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 18:28:21,340 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:21,340 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:28:21,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:28:21,341 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:21,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:21,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1276515004, now seen corresponding path program 1 times [2022-02-20 18:28:21,342 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:21,342 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224654152] [2022-02-20 18:28:21,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:21,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:21,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {3632#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; {3632#true} is VALID [2022-02-20 18:28:21,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {3632#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_#t~post49#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~r1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume -128 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 127;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;assume -128 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 127;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;assume -128 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 127;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;assume -128 <= main_#t~nondet44#1 && main_#t~nondet44#1 <= 127;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {3632#true} is VALID [2022-02-20 18:28:21,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {3632#true} assume 0 == ~r1~0; {3632#true} is VALID [2022-02-20 18:28:21,429 INFO L290 TraceCheckUtils]: 3: Hoare triple {3632#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {3632#true} is VALID [2022-02-20 18:28:21,429 INFO L290 TraceCheckUtils]: 4: Hoare triple {3632#true} assume ~id1~0 >= 0; {3632#true} is VALID [2022-02-20 18:28:21,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {3632#true} assume 0 == ~st1~0; {3632#true} is VALID [2022-02-20 18:28:21,429 INFO L290 TraceCheckUtils]: 6: Hoare triple {3632#true} assume ~send1~0 == ~id1~0; {3632#true} is VALID [2022-02-20 18:28:21,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {3632#true} assume 0 == ~mode1~0 % 256; {3632#true} is VALID [2022-02-20 18:28:21,430 INFO L290 TraceCheckUtils]: 8: Hoare triple {3632#true} assume ~id2~0 >= 0; {3632#true} is VALID [2022-02-20 18:28:21,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {3632#true} assume 0 == ~st2~0; {3632#true} is VALID [2022-02-20 18:28:21,430 INFO L290 TraceCheckUtils]: 10: Hoare triple {3632#true} assume ~send2~0 == ~id2~0; {3632#true} is VALID [2022-02-20 18:28:21,430 INFO L290 TraceCheckUtils]: 11: Hoare triple {3632#true} assume 0 == ~mode2~0 % 256; {3632#true} is VALID [2022-02-20 18:28:21,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {3632#true} assume ~id3~0 >= 0; {3632#true} is VALID [2022-02-20 18:28:21,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {3632#true} assume 0 == ~st3~0; {3632#true} is VALID [2022-02-20 18:28:21,431 INFO L290 TraceCheckUtils]: 14: Hoare triple {3632#true} assume ~send3~0 == ~id3~0; {3632#true} is VALID [2022-02-20 18:28:21,431 INFO L290 TraceCheckUtils]: 15: Hoare triple {3632#true} assume 0 == ~mode3~0 % 256; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:21,432 INFO L290 TraceCheckUtils]: 16: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:21,432 INFO L290 TraceCheckUtils]: 17: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:21,432 INFO L290 TraceCheckUtils]: 18: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:21,433 INFO L290 TraceCheckUtils]: 19: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:21,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:21,433 INFO L290 TraceCheckUtils]: 21: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:21,434 INFO L290 TraceCheckUtils]: 22: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:21,434 INFO L290 TraceCheckUtils]: 23: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:21,434 INFO L290 TraceCheckUtils]: 24: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 >= 0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:21,435 INFO L290 TraceCheckUtils]: 25: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st6~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:21,435 INFO L290 TraceCheckUtils]: 26: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send6~0 == ~id6~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:21,436 INFO L290 TraceCheckUtils]: 27: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode6~0 % 256; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:21,436 INFO L290 TraceCheckUtils]: 28: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:21,436 INFO L290 TraceCheckUtils]: 29: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:21,437 INFO L290 TraceCheckUtils]: 30: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:21,437 INFO L290 TraceCheckUtils]: 31: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:21,437 INFO L290 TraceCheckUtils]: 32: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id6~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:21,438 INFO L290 TraceCheckUtils]: 33: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:21,438 INFO L290 TraceCheckUtils]: 34: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:21,438 INFO L290 TraceCheckUtils]: 35: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:21,439 INFO L290 TraceCheckUtils]: 36: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id6~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:21,439 INFO L290 TraceCheckUtils]: 37: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:21,440 INFO L290 TraceCheckUtils]: 38: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:21,440 INFO L290 TraceCheckUtils]: 39: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id6~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:21,440 INFO L290 TraceCheckUtils]: 40: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:21,441 INFO L290 TraceCheckUtils]: 41: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id6~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:21,441 INFO L290 TraceCheckUtils]: 42: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:21,441 INFO L290 TraceCheckUtils]: 43: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:21,442 INFO L290 TraceCheckUtils]: 44: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret47#1 && main_#t~ret47#1 <= 2147483647;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:21,442 INFO L290 TraceCheckUtils]: 45: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:21,443 INFO L290 TraceCheckUtils]: 46: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:21,443 INFO L290 TraceCheckUtils]: 47: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:21,443 INFO L290 TraceCheckUtils]: 48: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:21,444 INFO L290 TraceCheckUtils]: 49: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~alive1~0 % 256); {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:21,444 INFO L290 TraceCheckUtils]: 50: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send1~0 != ~id1~0); {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:21,444 INFO L290 TraceCheckUtils]: 51: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:21,445 INFO L290 TraceCheckUtils]: 52: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:21,445 INFO L290 TraceCheckUtils]: 53: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:21,446 INFO L290 TraceCheckUtils]: 54: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~alive2~0 % 256); {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:21,446 INFO L290 TraceCheckUtils]: 55: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send2~0 != ~id2~0); {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:21,446 INFO L290 TraceCheckUtils]: 56: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:21,447 INFO L290 TraceCheckUtils]: 57: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:28:21,447 INFO L290 TraceCheckUtils]: 58: Hoare triple {3634#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {3633#false} is VALID [2022-02-20 18:28:21,448 INFO L290 TraceCheckUtils]: 59: Hoare triple {3633#false} assume !(node3_~m3~0#1 != ~nomsg~0); {3633#false} is VALID [2022-02-20 18:28:21,448 INFO L290 TraceCheckUtils]: 60: Hoare triple {3633#false} ~mode3~0 := 0; {3633#false} is VALID [2022-02-20 18:28:21,448 INFO L290 TraceCheckUtils]: 61: Hoare triple {3633#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {3633#false} is VALID [2022-02-20 18:28:21,448 INFO L290 TraceCheckUtils]: 62: Hoare triple {3633#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {3633#false} is VALID [2022-02-20 18:28:21,448 INFO L290 TraceCheckUtils]: 63: Hoare triple {3633#false} assume !(node4_~m4~0#1 != ~nomsg~0); {3633#false} is VALID [2022-02-20 18:28:21,448 INFO L290 TraceCheckUtils]: 64: Hoare triple {3633#false} ~mode4~0 := 0; {3633#false} is VALID [2022-02-20 18:28:21,449 INFO L290 TraceCheckUtils]: 65: Hoare triple {3633#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {3633#false} is VALID [2022-02-20 18:28:21,449 INFO L290 TraceCheckUtils]: 66: Hoare triple {3633#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {3633#false} is VALID [2022-02-20 18:28:21,449 INFO L290 TraceCheckUtils]: 67: Hoare triple {3633#false} assume !(node5_~m5~0#1 != ~nomsg~0); {3633#false} is VALID [2022-02-20 18:28:21,449 INFO L290 TraceCheckUtils]: 68: Hoare triple {3633#false} ~mode5~0 := 0; {3633#false} is VALID [2022-02-20 18:28:21,449 INFO L290 TraceCheckUtils]: 69: Hoare triple {3633#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {3633#false} is VALID [2022-02-20 18:28:21,449 INFO L290 TraceCheckUtils]: 70: Hoare triple {3633#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {3633#false} is VALID [2022-02-20 18:28:21,449 INFO L290 TraceCheckUtils]: 71: Hoare triple {3633#false} assume !(node6_~m6~0#1 != ~nomsg~0); {3633#false} is VALID [2022-02-20 18:28:21,450 INFO L290 TraceCheckUtils]: 72: Hoare triple {3633#false} ~mode6~0 := 0; {3633#false} is VALID [2022-02-20 18:28:21,450 INFO L290 TraceCheckUtils]: 73: Hoare triple {3633#false} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {3633#false} is VALID [2022-02-20 18:28:21,450 INFO L290 TraceCheckUtils]: 74: Hoare triple {3633#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {3633#false} is VALID [2022-02-20 18:28:21,450 INFO L290 TraceCheckUtils]: 75: Hoare triple {3633#false} check_#res#1 := check_~tmp~1#1; {3633#false} is VALID [2022-02-20 18:28:21,450 INFO L290 TraceCheckUtils]: 76: Hoare triple {3633#false} main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret48#1 && main_#t~ret48#1 <= 2147483647;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {3633#false} is VALID [2022-02-20 18:28:21,450 INFO L290 TraceCheckUtils]: 77: Hoare triple {3633#false} assume 0 == assert_~arg#1 % 256; {3633#false} is VALID [2022-02-20 18:28:21,451 INFO L290 TraceCheckUtils]: 78: Hoare triple {3633#false} assume !false; {3633#false} is VALID [2022-02-20 18:28:21,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:28:21,451 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:21,451 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224654152] [2022-02-20 18:28:21,452 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224654152] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:21,452 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:21,452 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:28:21,452 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273719555] [2022-02-20 18:28:21,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:21,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2022-02-20 18:28:21,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:21,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:21,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:21,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:28:21,501 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:21,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:28:21,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:21,502 INFO L87 Difference]: Start difference. First operand 369 states and 564 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:21,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:21,768 INFO L93 Difference]: Finished difference Result 965 states and 1518 transitions. [2022-02-20 18:28:21,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:28:21,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2022-02-20 18:28:21,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:21,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:21,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-02-20 18:28:21,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:21,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-02-20 18:28:21,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 480 transitions. [2022-02-20 18:28:22,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:22,079 INFO L225 Difference]: With dead ends: 965 [2022-02-20 18:28:22,080 INFO L226 Difference]: Without dead ends: 643 [2022-02-20 18:28:22,080 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:22,081 INFO L933 BasicCegarLoop]: 299 mSDtfsCounter, 129 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:28:22,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 449 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:22,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2022-02-20 18:28:22,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 641. [2022-02-20 18:28:22,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:22,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 643 states. Second operand has 641 states, 640 states have (on average 1.55625) internal successors, (996), 640 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:22,101 INFO L74 IsIncluded]: Start isIncluded. First operand 643 states. Second operand has 641 states, 640 states have (on average 1.55625) internal successors, (996), 640 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:22,103 INFO L87 Difference]: Start difference. First operand 643 states. Second operand has 641 states, 640 states have (on average 1.55625) internal successors, (996), 640 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:22,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:22,117 INFO L93 Difference]: Finished difference Result 643 states and 997 transitions. [2022-02-20 18:28:22,117 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 997 transitions. [2022-02-20 18:28:22,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:22,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:22,120 INFO L74 IsIncluded]: Start isIncluded. First operand has 641 states, 640 states have (on average 1.55625) internal successors, (996), 640 states have internal predecessors, (996), 0 states have call successors, (0), 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 643 states. [2022-02-20 18:28:22,121 INFO L87 Difference]: Start difference. First operand has 641 states, 640 states have (on average 1.55625) internal successors, (996), 640 states have internal predecessors, (996), 0 states have call successors, (0), 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 643 states. [2022-02-20 18:28:22,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:22,136 INFO L93 Difference]: Finished difference Result 643 states and 997 transitions. [2022-02-20 18:28:22,136 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 997 transitions. [2022-02-20 18:28:22,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:22,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:22,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:22,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:22,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 640 states have (on average 1.55625) internal successors, (996), 640 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:22,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 996 transitions. [2022-02-20 18:28:22,154 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 996 transitions. Word has length 79 [2022-02-20 18:28:22,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:22,155 INFO L470 AbstractCegarLoop]: Abstraction has 641 states and 996 transitions. [2022-02-20 18:28:22,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:22,155 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 996 transitions. [2022-02-20 18:28:22,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-20 18:28:22,155 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:22,156 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:28:22,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:28:22,156 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:22,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:22,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1327982836, now seen corresponding path program 1 times [2022-02-20 18:28:22,157 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:22,157 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159233922] [2022-02-20 18:28:22,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:22,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:22,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:22,220 INFO L290 TraceCheckUtils]: 0: Hoare triple {6691#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; {6691#true} is VALID [2022-02-20 18:28:22,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {6691#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_#t~post49#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~r1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume -128 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 127;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;assume -128 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 127;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;assume -128 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 127;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;assume -128 <= main_#t~nondet44#1 && main_#t~nondet44#1 <= 127;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {6691#true} is VALID [2022-02-20 18:28:22,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {6691#true} assume 0 == ~r1~0; {6691#true} is VALID [2022-02-20 18:28:22,221 INFO L290 TraceCheckUtils]: 3: Hoare triple {6691#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {6691#true} is VALID [2022-02-20 18:28:22,221 INFO L290 TraceCheckUtils]: 4: Hoare triple {6691#true} assume ~id1~0 >= 0; {6691#true} is VALID [2022-02-20 18:28:22,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {6691#true} assume 0 == ~st1~0; {6691#true} is VALID [2022-02-20 18:28:22,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {6691#true} assume ~send1~0 == ~id1~0; {6691#true} is VALID [2022-02-20 18:28:22,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {6691#true} assume 0 == ~mode1~0 % 256; {6691#true} is VALID [2022-02-20 18:28:22,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {6691#true} assume ~id2~0 >= 0; {6691#true} is VALID [2022-02-20 18:28:22,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {6691#true} assume 0 == ~st2~0; {6691#true} is VALID [2022-02-20 18:28:22,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {6691#true} assume ~send2~0 == ~id2~0; {6691#true} is VALID [2022-02-20 18:28:22,222 INFO L290 TraceCheckUtils]: 11: Hoare triple {6691#true} assume 0 == ~mode2~0 % 256; {6691#true} is VALID [2022-02-20 18:28:22,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {6691#true} assume ~id3~0 >= 0; {6691#true} is VALID [2022-02-20 18:28:22,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {6691#true} assume 0 == ~st3~0; {6691#true} is VALID [2022-02-20 18:28:22,222 INFO L290 TraceCheckUtils]: 14: Hoare triple {6691#true} assume ~send3~0 == ~id3~0; {6691#true} is VALID [2022-02-20 18:28:22,222 INFO L290 TraceCheckUtils]: 15: Hoare triple {6691#true} assume 0 == ~mode3~0 % 256; {6691#true} is VALID [2022-02-20 18:28:22,223 INFO L290 TraceCheckUtils]: 16: Hoare triple {6691#true} assume ~id4~0 >= 0; {6691#true} is VALID [2022-02-20 18:28:22,223 INFO L290 TraceCheckUtils]: 17: Hoare triple {6691#true} assume 0 == ~st4~0; {6691#true} is VALID [2022-02-20 18:28:22,223 INFO L290 TraceCheckUtils]: 18: Hoare triple {6691#true} assume ~send4~0 == ~id4~0; {6691#true} is VALID [2022-02-20 18:28:22,223 INFO L290 TraceCheckUtils]: 19: Hoare triple {6691#true} assume 0 == ~mode4~0 % 256; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,224 INFO L290 TraceCheckUtils]: 20: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,224 INFO L290 TraceCheckUtils]: 21: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,225 INFO L290 TraceCheckUtils]: 22: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,225 INFO L290 TraceCheckUtils]: 23: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,225 INFO L290 TraceCheckUtils]: 24: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 >= 0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,226 INFO L290 TraceCheckUtils]: 25: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st6~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,226 INFO L290 TraceCheckUtils]: 26: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send6~0 == ~id6~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,226 INFO L290 TraceCheckUtils]: 27: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode6~0 % 256; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,227 INFO L290 TraceCheckUtils]: 28: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,227 INFO L290 TraceCheckUtils]: 29: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,228 INFO L290 TraceCheckUtils]: 30: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,228 INFO L290 TraceCheckUtils]: 31: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,228 INFO L290 TraceCheckUtils]: 32: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id6~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,229 INFO L290 TraceCheckUtils]: 33: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,230 INFO L290 TraceCheckUtils]: 34: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,231 INFO L290 TraceCheckUtils]: 35: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,231 INFO L290 TraceCheckUtils]: 36: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id6~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,232 INFO L290 TraceCheckUtils]: 37: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,232 INFO L290 TraceCheckUtils]: 38: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,232 INFO L290 TraceCheckUtils]: 39: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id6~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,233 INFO L290 TraceCheckUtils]: 40: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,233 INFO L290 TraceCheckUtils]: 41: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id6~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,233 INFO L290 TraceCheckUtils]: 42: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,234 INFO L290 TraceCheckUtils]: 43: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,234 INFO L290 TraceCheckUtils]: 44: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret47#1 && main_#t~ret47#1 <= 2147483647;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,234 INFO L290 TraceCheckUtils]: 45: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,235 INFO L290 TraceCheckUtils]: 46: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,235 INFO L290 TraceCheckUtils]: 47: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,236 INFO L290 TraceCheckUtils]: 48: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,236 INFO L290 TraceCheckUtils]: 49: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~alive1~0 % 256); {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,236 INFO L290 TraceCheckUtils]: 50: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send1~0 != ~id1~0); {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,237 INFO L290 TraceCheckUtils]: 51: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode1~0 := 1; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,237 INFO L290 TraceCheckUtils]: 52: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,237 INFO L290 TraceCheckUtils]: 53: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,238 INFO L290 TraceCheckUtils]: 54: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~alive2~0 % 256); {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,238 INFO L290 TraceCheckUtils]: 55: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send2~0 != ~id2~0); {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,238 INFO L290 TraceCheckUtils]: 56: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode2~0 := 1; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,239 INFO L290 TraceCheckUtils]: 57: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,239 INFO L290 TraceCheckUtils]: 58: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,240 INFO L290 TraceCheckUtils]: 59: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~alive3~0 % 256); {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,240 INFO L290 TraceCheckUtils]: 60: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send3~0 != ~id3~0); {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,240 INFO L290 TraceCheckUtils]: 61: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode3~0 := 1; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,241 INFO L290 TraceCheckUtils]: 62: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:28:22,241 INFO L290 TraceCheckUtils]: 63: Hoare triple {6693#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {6692#false} is VALID [2022-02-20 18:28:22,241 INFO L290 TraceCheckUtils]: 64: Hoare triple {6692#false} assume !(node4_~m4~0#1 != ~nomsg~0); {6692#false} is VALID [2022-02-20 18:28:22,241 INFO L290 TraceCheckUtils]: 65: Hoare triple {6692#false} ~mode4~0 := 0; {6692#false} is VALID [2022-02-20 18:28:22,242 INFO L290 TraceCheckUtils]: 66: Hoare triple {6692#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {6692#false} is VALID [2022-02-20 18:28:22,242 INFO L290 TraceCheckUtils]: 67: Hoare triple {6692#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {6692#false} is VALID [2022-02-20 18:28:22,242 INFO L290 TraceCheckUtils]: 68: Hoare triple {6692#false} assume !(node5_~m5~0#1 != ~nomsg~0); {6692#false} is VALID [2022-02-20 18:28:22,242 INFO L290 TraceCheckUtils]: 69: Hoare triple {6692#false} ~mode5~0 := 0; {6692#false} is VALID [2022-02-20 18:28:22,242 INFO L290 TraceCheckUtils]: 70: Hoare triple {6692#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {6692#false} is VALID [2022-02-20 18:28:22,242 INFO L290 TraceCheckUtils]: 71: Hoare triple {6692#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {6692#false} is VALID [2022-02-20 18:28:22,242 INFO L290 TraceCheckUtils]: 72: Hoare triple {6692#false} assume !(node6_~m6~0#1 != ~nomsg~0); {6692#false} is VALID [2022-02-20 18:28:22,247 INFO L290 TraceCheckUtils]: 73: Hoare triple {6692#false} ~mode6~0 := 0; {6692#false} is VALID [2022-02-20 18:28:22,247 INFO L290 TraceCheckUtils]: 74: Hoare triple {6692#false} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {6692#false} is VALID [2022-02-20 18:28:22,247 INFO L290 TraceCheckUtils]: 75: Hoare triple {6692#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {6692#false} is VALID [2022-02-20 18:28:22,247 INFO L290 TraceCheckUtils]: 76: Hoare triple {6692#false} check_#res#1 := check_~tmp~1#1; {6692#false} is VALID [2022-02-20 18:28:22,247 INFO L290 TraceCheckUtils]: 77: Hoare triple {6692#false} main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret48#1 && main_#t~ret48#1 <= 2147483647;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {6692#false} is VALID [2022-02-20 18:28:22,248 INFO L290 TraceCheckUtils]: 78: Hoare triple {6692#false} assume 0 == assert_~arg#1 % 256; {6692#false} is VALID [2022-02-20 18:28:22,248 INFO L290 TraceCheckUtils]: 79: Hoare triple {6692#false} assume !false; {6692#false} is VALID [2022-02-20 18:28:22,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:28:22,248 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:22,249 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159233922] [2022-02-20 18:28:22,249 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159233922] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:22,249 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:22,249 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:28:22,249 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541410227] [2022-02-20 18:28:22,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:22,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2022-02-20 18:28:22,251 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:22,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:22,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:22,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:28:22,295 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:22,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:28:22,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:22,296 INFO L87 Difference]: Start difference. First operand 641 states and 996 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:22,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:22,618 INFO L93 Difference]: Finished difference Result 1733 states and 2734 transitions. [2022-02-20 18:28:22,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:28:22,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2022-02-20 18:28:22,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:22,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:22,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-02-20 18:28:22,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:22,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-02-20 18:28:22,623 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 480 transitions. [2022-02-20 18:28:22,915 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:22,960 INFO L225 Difference]: With dead ends: 1733 [2022-02-20 18:28:22,960 INFO L226 Difference]: Without dead ends: 1139 [2022-02-20 18:28:22,961 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:22,962 INFO L933 BasicCegarLoop]: 286 mSDtfsCounter, 124 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:28:22,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 440 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:22,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2022-02-20 18:28:22,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1137. [2022-02-20 18:28:22,987 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:22,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1139 states. Second operand has 1137 states, 1136 states have (on average 1.5633802816901408) internal successors, (1776), 1136 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:22,990 INFO L74 IsIncluded]: Start isIncluded. First operand 1139 states. Second operand has 1137 states, 1136 states have (on average 1.5633802816901408) internal successors, (1776), 1136 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:22,992 INFO L87 Difference]: Start difference. First operand 1139 states. Second operand has 1137 states, 1136 states have (on average 1.5633802816901408) internal successors, (1776), 1136 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:23,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:23,032 INFO L93 Difference]: Finished difference Result 1139 states and 1777 transitions. [2022-02-20 18:28:23,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1777 transitions. [2022-02-20 18:28:23,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:23,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:23,035 INFO L74 IsIncluded]: Start isIncluded. First operand has 1137 states, 1136 states have (on average 1.5633802816901408) internal successors, (1776), 1136 states have internal predecessors, (1776), 0 states have call successors, (0), 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 1139 states. [2022-02-20 18:28:23,037 INFO L87 Difference]: Start difference. First operand has 1137 states, 1136 states have (on average 1.5633802816901408) internal successors, (1776), 1136 states have internal predecessors, (1776), 0 states have call successors, (0), 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 1139 states. [2022-02-20 18:28:23,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:23,076 INFO L93 Difference]: Finished difference Result 1139 states and 1777 transitions. [2022-02-20 18:28:23,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1777 transitions. [2022-02-20 18:28:23,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:23,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:23,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:23,078 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:23,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1137 states, 1136 states have (on average 1.5633802816901408) internal successors, (1776), 1136 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:23,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1776 transitions. [2022-02-20 18:28:23,127 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1776 transitions. Word has length 80 [2022-02-20 18:28:23,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:23,128 INFO L470 AbstractCegarLoop]: Abstraction has 1137 states and 1776 transitions. [2022-02-20 18:28:23,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:23,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1776 transitions. [2022-02-20 18:28:23,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-02-20 18:28:23,129 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:23,129 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:28:23,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:28:23,129 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:23,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:23,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1219881940, now seen corresponding path program 1 times [2022-02-20 18:28:23,130 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:23,131 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478494987] [2022-02-20 18:28:23,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:23,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:23,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {12166#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; {12166#true} is VALID [2022-02-20 18:28:23,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {12166#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_#t~post49#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~r1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume -128 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 127;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;assume -128 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 127;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;assume -128 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 127;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;assume -128 <= main_#t~nondet44#1 && main_#t~nondet44#1 <= 127;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {12166#true} is VALID [2022-02-20 18:28:23,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {12166#true} assume 0 == ~r1~0; {12166#true} is VALID [2022-02-20 18:28:23,207 INFO L290 TraceCheckUtils]: 3: Hoare triple {12166#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {12166#true} is VALID [2022-02-20 18:28:23,207 INFO L290 TraceCheckUtils]: 4: Hoare triple {12166#true} assume ~id1~0 >= 0; {12166#true} is VALID [2022-02-20 18:28:23,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {12166#true} assume 0 == ~st1~0; {12166#true} is VALID [2022-02-20 18:28:23,207 INFO L290 TraceCheckUtils]: 6: Hoare triple {12166#true} assume ~send1~0 == ~id1~0; {12166#true} is VALID [2022-02-20 18:28:23,208 INFO L290 TraceCheckUtils]: 7: Hoare triple {12166#true} assume 0 == ~mode1~0 % 256; {12166#true} is VALID [2022-02-20 18:28:23,208 INFO L290 TraceCheckUtils]: 8: Hoare triple {12166#true} assume ~id2~0 >= 0; {12166#true} is VALID [2022-02-20 18:28:23,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {12166#true} assume 0 == ~st2~0; {12166#true} is VALID [2022-02-20 18:28:23,208 INFO L290 TraceCheckUtils]: 10: Hoare triple {12166#true} assume ~send2~0 == ~id2~0; {12166#true} is VALID [2022-02-20 18:28:23,208 INFO L290 TraceCheckUtils]: 11: Hoare triple {12166#true} assume 0 == ~mode2~0 % 256; {12166#true} is VALID [2022-02-20 18:28:23,208 INFO L290 TraceCheckUtils]: 12: Hoare triple {12166#true} assume ~id3~0 >= 0; {12166#true} is VALID [2022-02-20 18:28:23,208 INFO L290 TraceCheckUtils]: 13: Hoare triple {12166#true} assume 0 == ~st3~0; {12166#true} is VALID [2022-02-20 18:28:23,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {12166#true} assume ~send3~0 == ~id3~0; {12166#true} is VALID [2022-02-20 18:28:23,209 INFO L290 TraceCheckUtils]: 15: Hoare triple {12166#true} assume 0 == ~mode3~0 % 256; {12166#true} is VALID [2022-02-20 18:28:23,209 INFO L290 TraceCheckUtils]: 16: Hoare triple {12166#true} assume ~id4~0 >= 0; {12166#true} is VALID [2022-02-20 18:28:23,209 INFO L290 TraceCheckUtils]: 17: Hoare triple {12166#true} assume 0 == ~st4~0; {12166#true} is VALID [2022-02-20 18:28:23,209 INFO L290 TraceCheckUtils]: 18: Hoare triple {12166#true} assume ~send4~0 == ~id4~0; {12166#true} is VALID [2022-02-20 18:28:23,209 INFO L290 TraceCheckUtils]: 19: Hoare triple {12166#true} assume 0 == ~mode4~0 % 256; {12166#true} is VALID [2022-02-20 18:28:23,209 INFO L290 TraceCheckUtils]: 20: Hoare triple {12166#true} assume ~id5~0 >= 0; {12166#true} is VALID [2022-02-20 18:28:23,209 INFO L290 TraceCheckUtils]: 21: Hoare triple {12166#true} assume 0 == ~st5~0; {12166#true} is VALID [2022-02-20 18:28:23,210 INFO L290 TraceCheckUtils]: 22: Hoare triple {12166#true} assume ~send5~0 == ~id5~0; {12166#true} is VALID [2022-02-20 18:28:23,210 INFO L290 TraceCheckUtils]: 23: Hoare triple {12166#true} assume 0 == ~mode5~0 % 256; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,211 INFO L290 TraceCheckUtils]: 24: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 >= 0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,211 INFO L290 TraceCheckUtils]: 25: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st6~0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,211 INFO L290 TraceCheckUtils]: 26: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send6~0 == ~id6~0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,212 INFO L290 TraceCheckUtils]: 27: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode6~0 % 256; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,212 INFO L290 TraceCheckUtils]: 28: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,212 INFO L290 TraceCheckUtils]: 29: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,213 INFO L290 TraceCheckUtils]: 30: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,213 INFO L290 TraceCheckUtils]: 31: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,214 INFO L290 TraceCheckUtils]: 32: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id6~0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,214 INFO L290 TraceCheckUtils]: 33: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,214 INFO L290 TraceCheckUtils]: 34: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,215 INFO L290 TraceCheckUtils]: 35: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,215 INFO L290 TraceCheckUtils]: 36: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id6~0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,215 INFO L290 TraceCheckUtils]: 37: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,216 INFO L290 TraceCheckUtils]: 38: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,216 INFO L290 TraceCheckUtils]: 39: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id6~0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,216 INFO L290 TraceCheckUtils]: 40: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,217 INFO L290 TraceCheckUtils]: 41: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id6~0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,217 INFO L290 TraceCheckUtils]: 42: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,217 INFO L290 TraceCheckUtils]: 43: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,218 INFO L290 TraceCheckUtils]: 44: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret47#1 && main_#t~ret47#1 <= 2147483647;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,218 INFO L290 TraceCheckUtils]: 45: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,219 INFO L290 TraceCheckUtils]: 46: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,219 INFO L290 TraceCheckUtils]: 47: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,219 INFO L290 TraceCheckUtils]: 48: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,220 INFO L290 TraceCheckUtils]: 49: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~alive1~0 % 256); {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,220 INFO L290 TraceCheckUtils]: 50: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send1~0 != ~id1~0); {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,220 INFO L290 TraceCheckUtils]: 51: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~mode1~0 := 1; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,221 INFO L290 TraceCheckUtils]: 52: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,221 INFO L290 TraceCheckUtils]: 53: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,221 INFO L290 TraceCheckUtils]: 54: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~alive2~0 % 256); {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,222 INFO L290 TraceCheckUtils]: 55: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send2~0 != ~id2~0); {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,222 INFO L290 TraceCheckUtils]: 56: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~mode2~0 := 1; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,223 INFO L290 TraceCheckUtils]: 57: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,223 INFO L290 TraceCheckUtils]: 58: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,223 INFO L290 TraceCheckUtils]: 59: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~alive3~0 % 256); {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,224 INFO L290 TraceCheckUtils]: 60: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send3~0 != ~id3~0); {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,224 INFO L290 TraceCheckUtils]: 61: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~mode3~0 := 1; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,224 INFO L290 TraceCheckUtils]: 62: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,225 INFO L290 TraceCheckUtils]: 63: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,225 INFO L290 TraceCheckUtils]: 64: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~alive4~0 % 256); {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,225 INFO L290 TraceCheckUtils]: 65: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send4~0 != ~id4~0); {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,226 INFO L290 TraceCheckUtils]: 66: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~mode4~0 := 1; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,226 INFO L290 TraceCheckUtils]: 67: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:28:23,227 INFO L290 TraceCheckUtils]: 68: Hoare triple {12168#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {12167#false} is VALID [2022-02-20 18:28:23,227 INFO L290 TraceCheckUtils]: 69: Hoare triple {12167#false} assume !(node5_~m5~0#1 != ~nomsg~0); {12167#false} is VALID [2022-02-20 18:28:23,227 INFO L290 TraceCheckUtils]: 70: Hoare triple {12167#false} ~mode5~0 := 0; {12167#false} is VALID [2022-02-20 18:28:23,227 INFO L290 TraceCheckUtils]: 71: Hoare triple {12167#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {12167#false} is VALID [2022-02-20 18:28:23,227 INFO L290 TraceCheckUtils]: 72: Hoare triple {12167#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {12167#false} is VALID [2022-02-20 18:28:23,227 INFO L290 TraceCheckUtils]: 73: Hoare triple {12167#false} assume !(node6_~m6~0#1 != ~nomsg~0); {12167#false} is VALID [2022-02-20 18:28:23,227 INFO L290 TraceCheckUtils]: 74: Hoare triple {12167#false} ~mode6~0 := 0; {12167#false} is VALID [2022-02-20 18:28:23,228 INFO L290 TraceCheckUtils]: 75: Hoare triple {12167#false} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {12167#false} is VALID [2022-02-20 18:28:23,228 INFO L290 TraceCheckUtils]: 76: Hoare triple {12167#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {12167#false} is VALID [2022-02-20 18:28:23,228 INFO L290 TraceCheckUtils]: 77: Hoare triple {12167#false} check_#res#1 := check_~tmp~1#1; {12167#false} is VALID [2022-02-20 18:28:23,228 INFO L290 TraceCheckUtils]: 78: Hoare triple {12167#false} main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret48#1 && main_#t~ret48#1 <= 2147483647;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {12167#false} is VALID [2022-02-20 18:28:23,228 INFO L290 TraceCheckUtils]: 79: Hoare triple {12167#false} assume 0 == assert_~arg#1 % 256; {12167#false} is VALID [2022-02-20 18:28:23,228 INFO L290 TraceCheckUtils]: 80: Hoare triple {12167#false} assume !false; {12167#false} is VALID [2022-02-20 18:28:23,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:28:23,229 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:23,229 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478494987] [2022-02-20 18:28:23,229 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478494987] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:23,229 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:23,229 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:28:23,230 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955760006] [2022-02-20 18:28:23,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:23,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2022-02-20 18:28:23,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:23,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:23,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:23,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:28:23,277 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:23,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:28:23,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:23,278 INFO L87 Difference]: Start difference. First operand 1137 states and 1776 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:23,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:23,869 INFO L93 Difference]: Finished difference Result 3125 states and 4914 transitions. [2022-02-20 18:28:23,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:28:23,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2022-02-20 18:28:23,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:23,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:23,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-02-20 18:28:23,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:23,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-02-20 18:28:23,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 480 transitions. [2022-02-20 18:28:24,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:24,279 INFO L225 Difference]: With dead ends: 3125 [2022-02-20 18:28:24,279 INFO L226 Difference]: Without dead ends: 2035 [2022-02-20 18:28:24,280 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:24,281 INFO L933 BasicCegarLoop]: 273 mSDtfsCounter, 119 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:28:24,281 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 431 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:24,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2035 states. [2022-02-20 18:28:24,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2035 to 2033. [2022-02-20 18:28:24,330 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:24,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2035 states. Second operand has 2033 states, 2032 states have (on average 1.5590551181102361) internal successors, (3168), 2032 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:24,336 INFO L74 IsIncluded]: Start isIncluded. First operand 2035 states. Second operand has 2033 states, 2032 states have (on average 1.5590551181102361) internal successors, (3168), 2032 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:24,340 INFO L87 Difference]: Start difference. First operand 2035 states. Second operand has 2033 states, 2032 states have (on average 1.5590551181102361) internal successors, (3168), 2032 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:24,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:24,453 INFO L93 Difference]: Finished difference Result 2035 states and 3169 transitions. [2022-02-20 18:28:24,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 3169 transitions. [2022-02-20 18:28:24,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:24,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:24,459 INFO L74 IsIncluded]: Start isIncluded. First operand has 2033 states, 2032 states have (on average 1.5590551181102361) internal successors, (3168), 2032 states have internal predecessors, (3168), 0 states have call successors, (0), 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 2035 states. [2022-02-20 18:28:24,462 INFO L87 Difference]: Start difference. First operand has 2033 states, 2032 states have (on average 1.5590551181102361) internal successors, (3168), 2032 states have internal predecessors, (3168), 0 states have call successors, (0), 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 2035 states. [2022-02-20 18:28:24,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:24,583 INFO L93 Difference]: Finished difference Result 2035 states and 3169 transitions. [2022-02-20 18:28:24,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 3169 transitions. [2022-02-20 18:28:24,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:24,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:24,587 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:24,587 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:24,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2033 states, 2032 states have (on average 1.5590551181102361) internal successors, (3168), 2032 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:24,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2033 states to 2033 states and 3168 transitions. [2022-02-20 18:28:24,721 INFO L78 Accepts]: Start accepts. Automaton has 2033 states and 3168 transitions. Word has length 81 [2022-02-20 18:28:24,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:24,721 INFO L470 AbstractCegarLoop]: Abstraction has 2033 states and 3168 transitions. [2022-02-20 18:28:24,721 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:24,722 INFO L276 IsEmpty]: Start isEmpty. Operand 2033 states and 3168 transitions. [2022-02-20 18:28:24,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-20 18:28:24,722 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:24,722 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:28:24,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:28:24,722 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:24,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:24,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1035004540, now seen corresponding path program 1 times [2022-02-20 18:28:24,723 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:24,723 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334942892] [2022-02-20 18:28:24,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:24,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:24,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:24,770 INFO L290 TraceCheckUtils]: 0: Hoare triple {22041#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; {22041#true} is VALID [2022-02-20 18:28:24,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {22041#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_#t~post49#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~r1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume -128 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 127;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;assume -128 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 127;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;assume -128 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 127;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;assume -128 <= main_#t~nondet44#1 && main_#t~nondet44#1 <= 127;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {22041#true} is VALID [2022-02-20 18:28:24,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {22041#true} assume 0 == ~r1~0; {22041#true} is VALID [2022-02-20 18:28:24,770 INFO L290 TraceCheckUtils]: 3: Hoare triple {22041#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {22041#true} is VALID [2022-02-20 18:28:24,770 INFO L290 TraceCheckUtils]: 4: Hoare triple {22041#true} assume ~id1~0 >= 0; {22041#true} is VALID [2022-02-20 18:28:24,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {22041#true} assume 0 == ~st1~0; {22041#true} is VALID [2022-02-20 18:28:24,771 INFO L290 TraceCheckUtils]: 6: Hoare triple {22041#true} assume ~send1~0 == ~id1~0; {22041#true} is VALID [2022-02-20 18:28:24,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {22041#true} assume 0 == ~mode1~0 % 256; {22041#true} is VALID [2022-02-20 18:28:24,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {22041#true} assume ~id2~0 >= 0; {22041#true} is VALID [2022-02-20 18:28:24,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {22041#true} assume 0 == ~st2~0; {22041#true} is VALID [2022-02-20 18:28:24,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {22041#true} assume ~send2~0 == ~id2~0; {22041#true} is VALID [2022-02-20 18:28:24,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {22041#true} assume 0 == ~mode2~0 % 256; {22041#true} is VALID [2022-02-20 18:28:24,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {22041#true} assume ~id3~0 >= 0; {22041#true} is VALID [2022-02-20 18:28:24,772 INFO L290 TraceCheckUtils]: 13: Hoare triple {22041#true} assume 0 == ~st3~0; {22041#true} is VALID [2022-02-20 18:28:24,772 INFO L290 TraceCheckUtils]: 14: Hoare triple {22041#true} assume ~send3~0 == ~id3~0; {22041#true} is VALID [2022-02-20 18:28:24,772 INFO L290 TraceCheckUtils]: 15: Hoare triple {22041#true} assume 0 == ~mode3~0 % 256; {22041#true} is VALID [2022-02-20 18:28:24,772 INFO L290 TraceCheckUtils]: 16: Hoare triple {22041#true} assume ~id4~0 >= 0; {22041#true} is VALID [2022-02-20 18:28:24,772 INFO L290 TraceCheckUtils]: 17: Hoare triple {22041#true} assume 0 == ~st4~0; {22041#true} is VALID [2022-02-20 18:28:24,773 INFO L290 TraceCheckUtils]: 18: Hoare triple {22041#true} assume ~send4~0 == ~id4~0; {22041#true} is VALID [2022-02-20 18:28:24,773 INFO L290 TraceCheckUtils]: 19: Hoare triple {22041#true} assume 0 == ~mode4~0 % 256; {22041#true} is VALID [2022-02-20 18:28:24,773 INFO L290 TraceCheckUtils]: 20: Hoare triple {22041#true} assume ~id5~0 >= 0; {22041#true} is VALID [2022-02-20 18:28:24,773 INFO L290 TraceCheckUtils]: 21: Hoare triple {22041#true} assume 0 == ~st5~0; {22041#true} is VALID [2022-02-20 18:28:24,773 INFO L290 TraceCheckUtils]: 22: Hoare triple {22041#true} assume ~send5~0 == ~id5~0; {22041#true} is VALID [2022-02-20 18:28:24,773 INFO L290 TraceCheckUtils]: 23: Hoare triple {22041#true} assume 0 == ~mode5~0 % 256; {22041#true} is VALID [2022-02-20 18:28:24,773 INFO L290 TraceCheckUtils]: 24: Hoare triple {22041#true} assume ~id6~0 >= 0; {22041#true} is VALID [2022-02-20 18:28:24,773 INFO L290 TraceCheckUtils]: 25: Hoare triple {22041#true} assume 0 == ~st6~0; {22041#true} is VALID [2022-02-20 18:28:24,774 INFO L290 TraceCheckUtils]: 26: Hoare triple {22041#true} assume ~send6~0 == ~id6~0; {22041#true} is VALID [2022-02-20 18:28:24,774 INFO L290 TraceCheckUtils]: 27: Hoare triple {22041#true} assume 0 == ~mode6~0 % 256; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,775 INFO L290 TraceCheckUtils]: 28: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id2~0; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,775 INFO L290 TraceCheckUtils]: 29: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id3~0; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,775 INFO L290 TraceCheckUtils]: 30: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id4~0; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,776 INFO L290 TraceCheckUtils]: 31: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id5~0; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,776 INFO L290 TraceCheckUtils]: 32: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id6~0; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,776 INFO L290 TraceCheckUtils]: 33: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id3~0; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,777 INFO L290 TraceCheckUtils]: 34: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id4~0; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,777 INFO L290 TraceCheckUtils]: 35: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id5~0; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,777 INFO L290 TraceCheckUtils]: 36: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id6~0; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,778 INFO L290 TraceCheckUtils]: 37: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id4~0; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,778 INFO L290 TraceCheckUtils]: 38: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id5~0; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,778 INFO L290 TraceCheckUtils]: 39: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id6~0; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,779 INFO L290 TraceCheckUtils]: 40: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id5~0; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,779 INFO L290 TraceCheckUtils]: 41: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id6~0; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,779 INFO L290 TraceCheckUtils]: 42: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,780 INFO L290 TraceCheckUtils]: 43: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} init_#res#1 := init_~tmp~0#1; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,780 INFO L290 TraceCheckUtils]: 44: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret47#1 && main_#t~ret47#1 <= 2147483647;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,780 INFO L290 TraceCheckUtils]: 45: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,781 INFO L290 TraceCheckUtils]: 46: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,781 INFO L290 TraceCheckUtils]: 47: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,781 INFO L290 TraceCheckUtils]: 48: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode1~0 % 256); {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,782 INFO L290 TraceCheckUtils]: 49: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~alive1~0 % 256); {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,782 INFO L290 TraceCheckUtils]: 50: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send1~0 != ~id1~0); {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,782 INFO L290 TraceCheckUtils]: 51: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~mode1~0 := 1; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,783 INFO L290 TraceCheckUtils]: 52: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,783 INFO L290 TraceCheckUtils]: 53: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode2~0 % 256); {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,783 INFO L290 TraceCheckUtils]: 54: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~alive2~0 % 256); {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,784 INFO L290 TraceCheckUtils]: 55: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send2~0 != ~id2~0); {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,784 INFO L290 TraceCheckUtils]: 56: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~mode2~0 := 1; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,784 INFO L290 TraceCheckUtils]: 57: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,785 INFO L290 TraceCheckUtils]: 58: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode3~0 % 256); {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,785 INFO L290 TraceCheckUtils]: 59: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~alive3~0 % 256); {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,785 INFO L290 TraceCheckUtils]: 60: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send3~0 != ~id3~0); {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,786 INFO L290 TraceCheckUtils]: 61: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~mode3~0 := 1; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,786 INFO L290 TraceCheckUtils]: 62: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,786 INFO L290 TraceCheckUtils]: 63: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode4~0 % 256); {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,787 INFO L290 TraceCheckUtils]: 64: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~alive4~0 % 256); {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,788 INFO L290 TraceCheckUtils]: 65: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send4~0 != ~id4~0); {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,789 INFO L290 TraceCheckUtils]: 66: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~mode4~0 := 1; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,791 INFO L290 TraceCheckUtils]: 67: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,791 INFO L290 TraceCheckUtils]: 68: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode5~0 % 256); {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,791 INFO L290 TraceCheckUtils]: 69: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~alive5~0 % 256); {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,792 INFO L290 TraceCheckUtils]: 70: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send5~0 != ~id5~0); {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,792 INFO L290 TraceCheckUtils]: 71: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~mode5~0 := 1; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,792 INFO L290 TraceCheckUtils]: 72: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:28:24,793 INFO L290 TraceCheckUtils]: 73: Hoare triple {22043#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {22042#false} is VALID [2022-02-20 18:28:24,793 INFO L290 TraceCheckUtils]: 74: Hoare triple {22042#false} assume !(node6_~m6~0#1 != ~nomsg~0); {22042#false} is VALID [2022-02-20 18:28:24,793 INFO L290 TraceCheckUtils]: 75: Hoare triple {22042#false} ~mode6~0 := 0; {22042#false} is VALID [2022-02-20 18:28:24,794 INFO L290 TraceCheckUtils]: 76: Hoare triple {22042#false} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {22042#false} is VALID [2022-02-20 18:28:24,794 INFO L290 TraceCheckUtils]: 77: Hoare triple {22042#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {22042#false} is VALID [2022-02-20 18:28:24,794 INFO L290 TraceCheckUtils]: 78: Hoare triple {22042#false} check_#res#1 := check_~tmp~1#1; {22042#false} is VALID [2022-02-20 18:28:24,794 INFO L290 TraceCheckUtils]: 79: Hoare triple {22042#false} main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret48#1 && main_#t~ret48#1 <= 2147483647;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {22042#false} is VALID [2022-02-20 18:28:24,794 INFO L290 TraceCheckUtils]: 80: Hoare triple {22042#false} assume 0 == assert_~arg#1 % 256; {22042#false} is VALID [2022-02-20 18:28:24,794 INFO L290 TraceCheckUtils]: 81: Hoare triple {22042#false} assume !false; {22042#false} is VALID [2022-02-20 18:28:24,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:28:24,795 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:24,795 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334942892] [2022-02-20 18:28:24,795 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334942892] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:24,795 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:24,795 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:28:24,795 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347957577] [2022-02-20 18:28:24,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:24,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2022-02-20 18:28:24,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:24,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:24,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:24,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:28:24,842 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:24,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:28:24,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:24,842 INFO L87 Difference]: Start difference. First operand 2033 states and 3168 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:26,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:26,061 INFO L93 Difference]: Finished difference Result 5621 states and 8770 transitions. [2022-02-20 18:28:26,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:28:26,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2022-02-20 18:28:26,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:26,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:26,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-02-20 18:28:26,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:26,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-02-20 18:28:26,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 480 transitions. [2022-02-20 18:28:26,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:26,813 INFO L225 Difference]: With dead ends: 5621 [2022-02-20 18:28:26,813 INFO L226 Difference]: Without dead ends: 3635 [2022-02-20 18:28:26,819 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:26,822 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 114 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:28:26,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 422 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:26,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3635 states. [2022-02-20 18:28:26,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3635 to 3633. [2022-02-20 18:28:26,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:26,918 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3635 states. Second operand has 3633 states, 3632 states have (on average 1.5462555066079295) internal successors, (5616), 3632 states have internal predecessors, (5616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:26,923 INFO L74 IsIncluded]: Start isIncluded. First operand 3635 states. Second operand has 3633 states, 3632 states have (on average 1.5462555066079295) internal successors, (5616), 3632 states have internal predecessors, (5616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:26,926 INFO L87 Difference]: Start difference. First operand 3635 states. Second operand has 3633 states, 3632 states have (on average 1.5462555066079295) internal successors, (5616), 3632 states have internal predecessors, (5616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:27,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:27,319 INFO L93 Difference]: Finished difference Result 3635 states and 5617 transitions. [2022-02-20 18:28:27,319 INFO L276 IsEmpty]: Start isEmpty. Operand 3635 states and 5617 transitions. [2022-02-20 18:28:27,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:27,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:27,329 INFO L74 IsIncluded]: Start isIncluded. First operand has 3633 states, 3632 states have (on average 1.5462555066079295) internal successors, (5616), 3632 states have internal predecessors, (5616), 0 states have call successors, (0), 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 3635 states. [2022-02-20 18:28:27,333 INFO L87 Difference]: Start difference. First operand has 3633 states, 3632 states have (on average 1.5462555066079295) internal successors, (5616), 3632 states have internal predecessors, (5616), 0 states have call successors, (0), 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 3635 states. [2022-02-20 18:28:27,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:27,705 INFO L93 Difference]: Finished difference Result 3635 states and 5617 transitions. [2022-02-20 18:28:27,705 INFO L276 IsEmpty]: Start isEmpty. Operand 3635 states and 5617 transitions. [2022-02-20 18:28:27,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:27,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:27,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:27,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:27,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3633 states, 3632 states have (on average 1.5462555066079295) internal successors, (5616), 3632 states have internal predecessors, (5616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:28,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 3633 states and 5616 transitions. [2022-02-20 18:28:28,142 INFO L78 Accepts]: Start accepts. Automaton has 3633 states and 5616 transitions. Word has length 82 [2022-02-20 18:28:28,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:28,142 INFO L470 AbstractCegarLoop]: Abstraction has 3633 states and 5616 transitions. [2022-02-20 18:28:28,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:28,143 INFO L276 IsEmpty]: Start isEmpty. Operand 3633 states and 5616 transitions. [2022-02-20 18:28:28,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-02-20 18:28:28,143 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:28,143 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:28:28,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:28:28,143 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:28,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:28,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1846622820, now seen corresponding path program 1 times [2022-02-20 18:28:28,144 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:28,144 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389651353] [2022-02-20 18:28:28,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:28,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:28,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {39852#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; {39852#true} is VALID [2022-02-20 18:28:28,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {39852#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_#t~post49#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~r1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume -128 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 127;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;assume -128 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 127;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;assume -128 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 127;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;assume -128 <= main_#t~nondet44#1 && main_#t~nondet44#1 <= 127;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {39852#true} is VALID [2022-02-20 18:28:28,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {39852#true} assume 0 == ~r1~0; {39852#true} is VALID [2022-02-20 18:28:28,268 INFO L290 TraceCheckUtils]: 3: Hoare triple {39852#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {39852#true} is VALID [2022-02-20 18:28:28,269 INFO L290 TraceCheckUtils]: 4: Hoare triple {39852#true} assume ~id1~0 >= 0; {39852#true} is VALID [2022-02-20 18:28:28,270 INFO L290 TraceCheckUtils]: 5: Hoare triple {39852#true} assume 0 == ~st1~0; {39854#(<= ~st1~0 0)} is VALID [2022-02-20 18:28:28,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {39854#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {39854#(<= ~st1~0 0)} is VALID [2022-02-20 18:28:28,271 INFO L290 TraceCheckUtils]: 7: Hoare triple {39854#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {39854#(<= ~st1~0 0)} is VALID [2022-02-20 18:28:28,271 INFO L290 TraceCheckUtils]: 8: Hoare triple {39854#(<= ~st1~0 0)} assume ~id2~0 >= 0; {39854#(<= ~st1~0 0)} is VALID [2022-02-20 18:28:28,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {39854#(<= ~st1~0 0)} assume 0 == ~st2~0; {39855#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:28,272 INFO L290 TraceCheckUtils]: 10: Hoare triple {39855#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {39855#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:28,272 INFO L290 TraceCheckUtils]: 11: Hoare triple {39855#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {39855#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:28,272 INFO L290 TraceCheckUtils]: 12: Hoare triple {39855#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {39855#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:28,273 INFO L290 TraceCheckUtils]: 13: Hoare triple {39855#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {39856#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:28,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {39856#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {39856#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:28,274 INFO L290 TraceCheckUtils]: 15: Hoare triple {39856#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {39856#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:28,274 INFO L290 TraceCheckUtils]: 16: Hoare triple {39856#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {39856#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:28,274 INFO L290 TraceCheckUtils]: 17: Hoare triple {39856#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {39857#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:28,275 INFO L290 TraceCheckUtils]: 18: Hoare triple {39857#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {39857#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:28,275 INFO L290 TraceCheckUtils]: 19: Hoare triple {39857#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {39857#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:28,275 INFO L290 TraceCheckUtils]: 20: Hoare triple {39857#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {39857#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:28,276 INFO L290 TraceCheckUtils]: 21: Hoare triple {39857#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {39858#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:28,276 INFO L290 TraceCheckUtils]: 22: Hoare triple {39858#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {39858#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:28,277 INFO L290 TraceCheckUtils]: 23: Hoare triple {39858#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {39858#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:28,277 INFO L290 TraceCheckUtils]: 24: Hoare triple {39858#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id6~0 >= 0; {39858#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:28:28,277 INFO L290 TraceCheckUtils]: 25: Hoare triple {39858#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st6~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,278 INFO L290 TraceCheckUtils]: 26: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 == ~id6~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,278 INFO L290 TraceCheckUtils]: 27: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~mode6~0 % 256; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,279 INFO L290 TraceCheckUtils]: 28: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id2~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,279 INFO L290 TraceCheckUtils]: 29: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id3~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,279 INFO L290 TraceCheckUtils]: 30: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id4~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,280 INFO L290 TraceCheckUtils]: 31: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id5~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,280 INFO L290 TraceCheckUtils]: 32: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id6~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,280 INFO L290 TraceCheckUtils]: 33: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id3~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,281 INFO L290 TraceCheckUtils]: 34: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id4~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,281 INFO L290 TraceCheckUtils]: 35: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id5~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,282 INFO L290 TraceCheckUtils]: 36: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id6~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,282 INFO L290 TraceCheckUtils]: 37: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id4~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,282 INFO L290 TraceCheckUtils]: 38: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id5~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,283 INFO L290 TraceCheckUtils]: 39: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id6~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,283 INFO L290 TraceCheckUtils]: 40: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id5~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,283 INFO L290 TraceCheckUtils]: 41: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id6~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,284 INFO L290 TraceCheckUtils]: 42: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,284 INFO L290 TraceCheckUtils]: 43: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} init_#res#1 := init_~tmp~0#1; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,285 INFO L290 TraceCheckUtils]: 44: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret47#1 && main_#t~ret47#1 <= 2147483647;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,285 INFO L290 TraceCheckUtils]: 45: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,285 INFO L290 TraceCheckUtils]: 46: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,286 INFO L290 TraceCheckUtils]: 47: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,286 INFO L290 TraceCheckUtils]: 48: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode1~0 % 256); {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,287 INFO L290 TraceCheckUtils]: 49: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~alive1~0 % 256); {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,287 INFO L290 TraceCheckUtils]: 50: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send1~0 != ~id1~0); {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,287 INFO L290 TraceCheckUtils]: 51: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode1~0 := 1; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,288 INFO L290 TraceCheckUtils]: 52: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,288 INFO L290 TraceCheckUtils]: 53: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode2~0 % 256); {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,289 INFO L290 TraceCheckUtils]: 54: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~alive2~0 % 256); {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,289 INFO L290 TraceCheckUtils]: 55: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send2~0 != ~id2~0); {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,289 INFO L290 TraceCheckUtils]: 56: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode2~0 := 1; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,290 INFO L290 TraceCheckUtils]: 57: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,290 INFO L290 TraceCheckUtils]: 58: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode3~0 % 256); {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,290 INFO L290 TraceCheckUtils]: 59: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~alive3~0 % 256); {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,291 INFO L290 TraceCheckUtils]: 60: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send3~0 != ~id3~0); {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,291 INFO L290 TraceCheckUtils]: 61: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode3~0 := 1; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,291 INFO L290 TraceCheckUtils]: 62: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,292 INFO L290 TraceCheckUtils]: 63: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode4~0 % 256); {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,292 INFO L290 TraceCheckUtils]: 64: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~alive4~0 % 256); {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,292 INFO L290 TraceCheckUtils]: 65: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send4~0 != ~id4~0); {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,293 INFO L290 TraceCheckUtils]: 66: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode4~0 := 1; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,293 INFO L290 TraceCheckUtils]: 67: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,294 INFO L290 TraceCheckUtils]: 68: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode5~0 % 256); {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,294 INFO L290 TraceCheckUtils]: 69: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~alive5~0 % 256); {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,294 INFO L290 TraceCheckUtils]: 70: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send5~0 != ~id5~0); {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,295 INFO L290 TraceCheckUtils]: 71: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode5~0 := 1; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,295 INFO L290 TraceCheckUtils]: 72: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,295 INFO L290 TraceCheckUtils]: 73: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode6~0 % 256); {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,296 INFO L290 TraceCheckUtils]: 74: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~alive6~0 % 256); {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,296 INFO L290 TraceCheckUtils]: 75: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send6~0 != ~id6~0); {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,296 INFO L290 TraceCheckUtils]: 76: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode6~0 := 1; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,297 INFO L290 TraceCheckUtils]: 77: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:28:28,297 INFO L290 TraceCheckUtils]: 78: Hoare triple {39859#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {39853#false} is VALID [2022-02-20 18:28:28,297 INFO L290 TraceCheckUtils]: 79: Hoare triple {39853#false} check_#res#1 := check_~tmp~1#1; {39853#false} is VALID [2022-02-20 18:28:28,297 INFO L290 TraceCheckUtils]: 80: Hoare triple {39853#false} main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret48#1 && main_#t~ret48#1 <= 2147483647;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {39853#false} is VALID [2022-02-20 18:28:28,298 INFO L290 TraceCheckUtils]: 81: Hoare triple {39853#false} assume 0 == assert_~arg#1 % 256; {39853#false} is VALID [2022-02-20 18:28:28,298 INFO L290 TraceCheckUtils]: 82: Hoare triple {39853#false} assume !false; {39853#false} is VALID [2022-02-20 18:28:28,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:28:28,298 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:28,298 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389651353] [2022-02-20 18:28:28,299 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389651353] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:28,299 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:28,299 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:28:28,299 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997941191] [2022-02-20 18:28:28,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:28,299 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2022-02-20 18:28:28,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:28,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:28,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:28,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:28:28,364 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:28,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:28:28,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:28:28,365 INFO L87 Difference]: Start difference. First operand 3633 states and 5616 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:14,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:14,090 INFO L93 Difference]: Finished difference Result 28735 states and 44599 transitions. [2022-02-20 18:29:14,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 18:29:14,091 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2022-02-20 18:29:14,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:14,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:14,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1255 transitions. [2022-02-20 18:29:14,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:29:14,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1255 transitions. [2022-02-20 18:29:14,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 1255 transitions. [2022-02-20 18:29:14,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1255 edges. 1255 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.