./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label00.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/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label00.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 c4ba866c3a79d104a7473fc3c035156e2c10c247b66ad04eaab0b68446430314 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:44:07,156 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:44:07,158 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:44:07,183 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:44:07,184 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:44:07,187 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:44:07,188 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:44:07,192 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:44:07,194 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:44:07,196 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:44:07,196 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:44:07,197 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:44:07,197 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:44:07,202 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:44:07,203 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:44:07,204 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:44:07,207 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:44:07,207 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:44:07,208 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:44:07,210 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:44:07,213 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:44:07,214 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:44:07,215 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:44:07,216 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:44:07,217 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:44:07,219 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:44:07,219 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:44:07,219 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:44:07,220 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:44:07,221 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:44:07,221 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:44:07,222 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:44:07,223 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:44:07,223 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:44:07,224 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:44:07,224 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:44:07,225 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:44:07,226 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:44:07,226 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:44:07,226 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:44:07,227 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:44:07,227 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:44:07,245 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:44:07,248 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:44:07,248 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:44:07,248 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:44:07,249 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:44:07,249 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:44:07,250 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:44:07,250 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:44:07,250 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:44:07,250 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:44:07,251 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:44:07,251 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:44:07,251 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:44:07,251 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:44:07,251 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:44:07,252 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:44:07,252 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:44:07,252 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:44:07,252 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:44:07,252 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:44:07,252 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:44:07,253 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:44:07,253 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:44:07,253 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:44:07,253 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:44:07,253 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:44:07,253 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:44:07,255 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:44:07,255 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:44:07,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:44:07,255 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:44:07,255 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:44:07,256 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:44:07,256 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 -> c4ba866c3a79d104a7473fc3c035156e2c10c247b66ad04eaab0b68446430314 [2022-02-20 19:44:07,528 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:44:07,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:44:07,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:44:07,548 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:44:07,549 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:44:07,550 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label00.c [2022-02-20 19:44:07,596 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0992b11f9/5627c76112bd45daa7ae967622ed0851/FLAG89501f550 [2022-02-20 19:44:08,240 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:44:08,241 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label00.c [2022-02-20 19:44:08,277 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0992b11f9/5627c76112bd45daa7ae967622ed0851/FLAG89501f550 [2022-02-20 19:44:08,592 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0992b11f9/5627c76112bd45daa7ae967622ed0851 [2022-02-20 19:44:08,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:44:08,595 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:44:08,597 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:44:08,597 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:44:08,599 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:44:08,600 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:44:08" (1/1) ... [2022-02-20 19:44:08,601 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b9aef0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:08, skipping insertion in model container [2022-02-20 19:44:08,601 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:44:08" (1/1) ... [2022-02-20 19:44:08,608 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:44:08,706 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:44:08,974 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/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label00.c[11640,11653] [2022-02-20 19:44:08,996 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/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label00.c[13515,13528] [2022-02-20 19:44:09,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:44:09,484 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:44:09,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/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label00.c[11640,11653] [2022-02-20 19:44:09,523 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/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label00.c[13515,13528] [2022-02-20 19:44:09,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:44:09,845 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:44:09,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:09 WrapperNode [2022-02-20 19:44:09,845 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:44:09,846 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:44:09,846 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:44:09,846 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:44:09,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:09" (1/1) ... [2022-02-20 19:44:09,924 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:09" (1/1) ... [2022-02-20 19:44:10,262 INFO L137 Inliner]: procedures = 36, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5090 [2022-02-20 19:44:10,262 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:44:10,263 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:44:10,263 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:44:10,263 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:44:10,273 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:09" (1/1) ... [2022-02-20 19:44:10,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:09" (1/1) ... [2022-02-20 19:44:10,307 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:09" (1/1) ... [2022-02-20 19:44:10,308 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:09" (1/1) ... [2022-02-20 19:44:10,385 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:09" (1/1) ... [2022-02-20 19:44:10,408 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:09" (1/1) ... [2022-02-20 19:44:10,432 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:09" (1/1) ... [2022-02-20 19:44:10,535 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:44:10,537 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:44:10,537 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:44:10,537 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:44:10,538 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:09" (1/1) ... [2022-02-20 19:44:10,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:44:10,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:44:10,596 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 19:44:10,622 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 19:44:10,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:44:10,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:44:10,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:44:10,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:44:10,700 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:44:10,701 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:44:17,619 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:44:17,630 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:44:17,630 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:44:17,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:44:17 BoogieIcfgContainer [2022-02-20 19:44:17,632 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:44:17,633 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:44:17,633 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:44:17,635 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:44:17,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:44:08" (1/3) ... [2022-02-20 19:44:17,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dffb29c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:44:17, skipping insertion in model container [2022-02-20 19:44:17,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:09" (2/3) ... [2022-02-20 19:44:17,637 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dffb29c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:44:17, skipping insertion in model container [2022-02-20 19:44:17,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:44:17" (3/3) ... [2022-02-20 19:44:17,638 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label00.c [2022-02-20 19:44:17,641 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:44:17,641 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:44:17,674 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:44:17,678 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 19:44:17,678 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:44:17,706 INFO L276 IsEmpty]: Start isEmpty. Operand has 909 states, 906 states have (on average 1.900662251655629) internal successors, (1722), 908 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:17,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 19:44:17,710 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:44:17,710 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:44:17,711 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:44:17,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:44:17,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1807618123, now seen corresponding path program 1 times [2022-02-20 19:44:17,720 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:44:17,720 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375341324] [2022-02-20 19:44:17,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:44:17,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:44:17,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:44:17,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {912#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(33, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {914#(<= 15 ~a24~0)} is VALID [2022-02-20 19:44:17,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {914#(<= 15 ~a24~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {914#(<= 15 ~a24~0)} is VALID [2022-02-20 19:44:17,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {914#(<= 15 ~a24~0)} assume !(0 != main_#t~nondet48#1);havoc main_#t~nondet48#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet46#1, main2_#t~ret47#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {914#(<= 15 ~a24~0)} is VALID [2022-02-20 19:44:17,874 INFO L290 TraceCheckUtils]: 3: Hoare triple {914#(<= 15 ~a24~0)} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet46#1 && main2_#t~nondet46#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet46#1;havoc main2_#t~nondet46#1; {914#(<= 15 ~a24~0)} is VALID [2022-02-20 19:44:17,875 INFO L290 TraceCheckUtils]: 4: Hoare triple {914#(<= 15 ~a24~0)} assume !(((((1 != main2_~input~0#1 && 2 != main2_~input~0#1) && 3 != main2_~input~0#1) && 4 != main2_~input~0#1) && 5 != main2_~input~0#1) && 6 != main2_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main2_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret43#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {914#(<= 15 ~a24~0)} is VALID [2022-02-20 19:44:17,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {914#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {914#(<= 15 ~a24~0)} is VALID [2022-02-20 19:44:17,875 INFO L290 TraceCheckUtils]: 6: Hoare triple {914#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {914#(<= 15 ~a24~0)} is VALID [2022-02-20 19:44:17,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {914#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {914#(<= 15 ~a24~0)} is VALID [2022-02-20 19:44:17,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {914#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {914#(<= 15 ~a24~0)} is VALID [2022-02-20 19:44:17,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {914#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {914#(<= 15 ~a24~0)} is VALID [2022-02-20 19:44:17,881 INFO L290 TraceCheckUtils]: 10: Hoare triple {914#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {914#(<= 15 ~a24~0)} is VALID [2022-02-20 19:44:17,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {914#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {914#(<= 15 ~a24~0)} is VALID [2022-02-20 19:44:17,882 INFO L290 TraceCheckUtils]: 12: Hoare triple {914#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {914#(<= 15 ~a24~0)} is VALID [2022-02-20 19:44:17,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {914#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {914#(<= 15 ~a24~0)} is VALID [2022-02-20 19:44:17,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {914#(<= 15 ~a24~0)} assume (((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0; {913#false} is VALID [2022-02-20 19:44:17,884 INFO L290 TraceCheckUtils]: 15: Hoare triple {913#false} assume !false; {913#false} is VALID [2022-02-20 19:44:17,885 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 19:44:17,885 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:44:17,885 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375341324] [2022-02-20 19:44:17,886 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375341324] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:44:17,886 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:44:17,886 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:44:17,887 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885531682] [2022-02-20 19:44:17,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:44:17,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-02-20 19:44:17,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:44:17,894 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:17,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:44:17,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:44:17,915 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:44:17,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:44:17,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:44:17,939 INFO L87 Difference]: Start difference. First operand has 909 states, 906 states have (on average 1.900662251655629) internal successors, (1722), 908 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:23,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:23,037 INFO L93 Difference]: Finished difference Result 2536 states and 4876 transitions. [2022-02-20 19:44:23,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:44:23,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-02-20 19:44:23,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:44:23,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:23,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4876 transitions. [2022-02-20 19:44:23,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:23,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4876 transitions. [2022-02-20 19:44:23,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4876 transitions. [2022-02-20 19:44:26,609 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4876 edges. 4876 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:44:26,726 INFO L225 Difference]: With dead ends: 2536 [2022-02-20 19:44:26,726 INFO L226 Difference]: Without dead ends: 1594 [2022-02-20 19:44:26,730 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 19:44:26,732 INFO L933 BasicCegarLoop]: 625 mSDtfsCounter, 972 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2334 mSolverCounterSat, 651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 2985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 651 IncrementalHoareTripleChecker+Valid, 2334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-02-20 19:44:26,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [972 Valid, 636 Invalid, 2985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [651 Valid, 2334 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-02-20 19:44:26,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2022-02-20 19:44:26,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 1594. [2022-02-20 19:44:26,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:44:26,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1594 states. Second operand has 1594 states, 1592 states have (on average 1.64321608040201) internal successors, (2616), 1593 states have internal predecessors, (2616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:26,811 INFO L74 IsIncluded]: Start isIncluded. First operand 1594 states. Second operand has 1594 states, 1592 states have (on average 1.64321608040201) internal successors, (2616), 1593 states have internal predecessors, (2616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:26,814 INFO L87 Difference]: Start difference. First operand 1594 states. Second operand has 1594 states, 1592 states have (on average 1.64321608040201) internal successors, (2616), 1593 states have internal predecessors, (2616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:26,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:26,887 INFO L93 Difference]: Finished difference Result 1594 states and 2616 transitions. [2022-02-20 19:44:26,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 2616 transitions. [2022-02-20 19:44:26,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:26,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:26,898 INFO L74 IsIncluded]: Start isIncluded. First operand has 1594 states, 1592 states have (on average 1.64321608040201) internal successors, (2616), 1593 states have internal predecessors, (2616), 0 states have call successors, (0), 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 1594 states. [2022-02-20 19:44:26,900 INFO L87 Difference]: Start difference. First operand has 1594 states, 1592 states have (on average 1.64321608040201) internal successors, (2616), 1593 states have internal predecessors, (2616), 0 states have call successors, (0), 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 1594 states. [2022-02-20 19:44:26,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:26,973 INFO L93 Difference]: Finished difference Result 1594 states and 2616 transitions. [2022-02-20 19:44:26,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 2616 transitions. [2022-02-20 19:44:26,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:26,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:26,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:44:26,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:44:26,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1594 states, 1592 states have (on average 1.64321608040201) internal successors, (2616), 1593 states have internal predecessors, (2616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:27,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 2616 transitions. [2022-02-20 19:44:27,053 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 2616 transitions. Word has length 16 [2022-02-20 19:44:27,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:44:27,053 INFO L470 AbstractCegarLoop]: Abstraction has 1594 states and 2616 transitions. [2022-02-20 19:44:27,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:27,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 2616 transitions. [2022-02-20 19:44:27,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 19:44:27,055 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:44:27,057 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] [2022-02-20 19:44:27,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:44:27,057 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:44:27,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:44:27,061 INFO L85 PathProgramCache]: Analyzing trace with hash -950839655, now seen corresponding path program 1 times [2022-02-20 19:44:27,061 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:44:27,061 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547632850] [2022-02-20 19:44:27,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:44:27,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:44:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:44:27,166 INFO L290 TraceCheckUtils]: 0: Hoare triple {8291#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(33, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {8291#true} is VALID [2022-02-20 19:44:27,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {8291#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {8291#true} is VALID [2022-02-20 19:44:27,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {8291#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_#t~post33#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {8291#true} is VALID [2022-02-20 19:44:27,168 INFO L290 TraceCheckUtils]: 3: Hoare triple {8291#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {8293#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:44:27,168 INFO L290 TraceCheckUtils]: 4: Hoare triple {8293#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {8294#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:44:27,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {8294#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {8295#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:44:27,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {8295#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {8292#false} is VALID [2022-02-20 19:44:27,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {8292#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;main1_~i2~0#1 := 0; {8292#false} is VALID [2022-02-20 19:44:27,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {8292#false} assume !!(main1_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {8292#false} is VALID [2022-02-20 19:44:27,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {8292#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 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {8292#false} is VALID [2022-02-20 19:44:27,170 INFO L290 TraceCheckUtils]: 10: Hoare triple {8292#false} assume !(node1_~m1~0#1 != ~nomsg~0); {8292#false} is VALID [2022-02-20 19:44:27,170 INFO L290 TraceCheckUtils]: 11: Hoare triple {8292#false} ~mode1~0 := 0; {8292#false} is VALID [2022-02-20 19:44:27,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {8292#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {8292#false} is VALID [2022-02-20 19:44:27,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {8292#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {8292#false} is VALID [2022-02-20 19:44:27,171 INFO L290 TraceCheckUtils]: 14: Hoare triple {8292#false} assume !(node2_~m2~0#1 != ~nomsg~0); {8292#false} is VALID [2022-02-20 19:44:27,171 INFO L290 TraceCheckUtils]: 15: Hoare triple {8292#false} ~mode2~0 := 0; {8292#false} is VALID [2022-02-20 19:44:27,171 INFO L290 TraceCheckUtils]: 16: Hoare triple {8292#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {8292#false} is VALID [2022-02-20 19:44:27,172 INFO L290 TraceCheckUtils]: 17: Hoare triple {8292#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {8292#false} is VALID [2022-02-20 19:44:27,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {8292#false} assume !(node3_~m3~0#1 != ~nomsg~0); {8292#false} is VALID [2022-02-20 19:44:27,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {8292#false} ~mode3~0 := 0; {8292#false} is VALID [2022-02-20 19:44:27,172 INFO L290 TraceCheckUtils]: 20: Hoare triple {8292#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {8292#false} is VALID [2022-02-20 19:44:27,172 INFO L290 TraceCheckUtils]: 21: Hoare triple {8292#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {8292#false} is VALID [2022-02-20 19:44:27,172 INFO L290 TraceCheckUtils]: 22: Hoare triple {8292#false} assume !(node4_~m4~0#1 != ~nomsg~0); {8292#false} is VALID [2022-02-20 19:44:27,173 INFO L290 TraceCheckUtils]: 23: Hoare triple {8292#false} ~mode4~0 := 0; {8292#false} is VALID [2022-02-20 19:44:27,173 INFO L290 TraceCheckUtils]: 24: Hoare triple {8292#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {8292#false} is VALID [2022-02-20 19:44:27,173 INFO L290 TraceCheckUtils]: 25: Hoare triple {8292#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {8292#false} is VALID [2022-02-20 19:44:27,173 INFO L290 TraceCheckUtils]: 26: Hoare triple {8292#false} assume !(node5_~m5~0#1 != ~nomsg~0); {8292#false} is VALID [2022-02-20 19:44:27,174 INFO L290 TraceCheckUtils]: 27: Hoare triple {8292#false} ~mode5~0 := 0; {8292#false} is VALID [2022-02-20 19:44:27,174 INFO L290 TraceCheckUtils]: 28: Hoare triple {8292#false} assume { :end_inline_node5 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {8292#false} is VALID [2022-02-20 19:44:27,174 INFO L290 TraceCheckUtils]: 29: Hoare triple {8292#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {8292#false} is VALID [2022-02-20 19:44:27,174 INFO L290 TraceCheckUtils]: 30: Hoare triple {8292#false} check_#res#1 := check_~tmp~1#1; {8292#false} is VALID [2022-02-20 19:44:27,175 INFO L290 TraceCheckUtils]: 31: Hoare triple {8292#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {8292#false} is VALID [2022-02-20 19:44:27,176 INFO L290 TraceCheckUtils]: 32: Hoare triple {8292#false} assume 0 == assert_~arg#1 % 256; {8292#false} is VALID [2022-02-20 19:44:27,179 INFO L290 TraceCheckUtils]: 33: Hoare triple {8292#false} assume !false; {8292#false} is VALID [2022-02-20 19:44:27,180 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 19:44:27,180 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:44:27,180 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547632850] [2022-02-20 19:44:27,180 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547632850] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:44:27,180 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:44:27,181 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:44:27,181 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667775483] [2022-02-20 19:44:27,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:44:27,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2022-02-20 19:44:27,182 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:44:27,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:27,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:44:27,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:44:27,213 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:44:27,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:44:27,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:44:27,215 INFO L87 Difference]: Start difference. First operand 1594 states and 2616 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:31,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:31,161 INFO L93 Difference]: Finished difference Result 1650 states and 2702 transitions. [2022-02-20 19:44:31,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:44:31,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2022-02-20 19:44:31,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:44:31,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:31,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1675 transitions. [2022-02-20 19:44:31,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:31,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1675 transitions. [2022-02-20 19:44:31,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1675 transitions. [2022-02-20 19:44:32,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1675 edges. 1675 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:44:32,494 INFO L225 Difference]: With dead ends: 1650 [2022-02-20 19:44:32,494 INFO L226 Difference]: Without dead ends: 1594 [2022-02-20 19:44:32,497 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 19:44:32,499 INFO L933 BasicCegarLoop]: 1587 mSDtfsCounter, 3 mSDsluCounter, 4727 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6314 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:44:32,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6314 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:44:32,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2022-02-20 19:44:32,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 1594. [2022-02-20 19:44:32,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:44:32,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1594 states. Second operand has 1594 states, 1592 states have (on average 1.6237437185929648) internal successors, (2585), 1593 states have internal predecessors, (2585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:32,532 INFO L74 IsIncluded]: Start isIncluded. First operand 1594 states. Second operand has 1594 states, 1592 states have (on average 1.6237437185929648) internal successors, (2585), 1593 states have internal predecessors, (2585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:32,534 INFO L87 Difference]: Start difference. First operand 1594 states. Second operand has 1594 states, 1592 states have (on average 1.6237437185929648) internal successors, (2585), 1593 states have internal predecessors, (2585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:32,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:32,605 INFO L93 Difference]: Finished difference Result 1594 states and 2585 transitions. [2022-02-20 19:44:32,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 2585 transitions. [2022-02-20 19:44:32,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:32,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:32,610 INFO L74 IsIncluded]: Start isIncluded. First operand has 1594 states, 1592 states have (on average 1.6237437185929648) internal successors, (2585), 1593 states have internal predecessors, (2585), 0 states have call successors, (0), 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 1594 states. [2022-02-20 19:44:32,612 INFO L87 Difference]: Start difference. First operand has 1594 states, 1592 states have (on average 1.6237437185929648) internal successors, (2585), 1593 states have internal predecessors, (2585), 0 states have call successors, (0), 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 1594 states. [2022-02-20 19:44:32,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:32,682 INFO L93 Difference]: Finished difference Result 1594 states and 2585 transitions. [2022-02-20 19:44:32,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 2585 transitions. [2022-02-20 19:44:32,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:32,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:32,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:44:32,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:44:32,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1594 states, 1592 states have (on average 1.6237437185929648) internal successors, (2585), 1593 states have internal predecessors, (2585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:32,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 2585 transitions. [2022-02-20 19:44:32,758 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 2585 transitions. Word has length 34 [2022-02-20 19:44:32,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:44:32,758 INFO L470 AbstractCegarLoop]: Abstraction has 1594 states and 2585 transitions. [2022-02-20 19:44:32,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:32,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 2585 transitions. [2022-02-20 19:44:32,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:44:32,762 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:44:32,762 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] [2022-02-20 19:44:32,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:44:32,762 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:44:32,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:44:32,763 INFO L85 PathProgramCache]: Analyzing trace with hash -695028240, now seen corresponding path program 1 times [2022-02-20 19:44:32,763 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:44:32,763 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985669356] [2022-02-20 19:44:32,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:44:32,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:44:32,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:44:32,873 INFO L290 TraceCheckUtils]: 0: Hoare triple {14781#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(33, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {14781#true} is VALID [2022-02-20 19:44:32,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {14781#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {14781#true} is VALID [2022-02-20 19:44:32,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {14781#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_#t~post33#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {14781#true} is VALID [2022-02-20 19:44:32,873 INFO L290 TraceCheckUtils]: 3: Hoare triple {14781#true} assume 0 == ~r1~0; {14781#true} is VALID [2022-02-20 19:44:32,874 INFO L290 TraceCheckUtils]: 4: Hoare triple {14781#true} assume ~id1~0 >= 0; {14781#true} is VALID [2022-02-20 19:44:32,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {14781#true} assume 0 == ~st1~0; {14781#true} is VALID [2022-02-20 19:44:32,874 INFO L290 TraceCheckUtils]: 6: Hoare triple {14781#true} assume ~send1~0 == ~id1~0; {14781#true} is VALID [2022-02-20 19:44:32,874 INFO L290 TraceCheckUtils]: 7: Hoare triple {14781#true} assume 0 == ~mode1~0 % 256; {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:32,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:32,875 INFO L290 TraceCheckUtils]: 9: Hoare triple {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:32,876 INFO L290 TraceCheckUtils]: 10: Hoare triple {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:32,876 INFO L290 TraceCheckUtils]: 11: Hoare triple {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:32,876 INFO L290 TraceCheckUtils]: 12: Hoare triple {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:32,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:32,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:32,878 INFO L290 TraceCheckUtils]: 15: Hoare triple {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:32,878 INFO L290 TraceCheckUtils]: 16: Hoare triple {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:32,878 INFO L290 TraceCheckUtils]: 17: Hoare triple {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:32,879 INFO L290 TraceCheckUtils]: 18: Hoare triple {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:32,879 INFO L290 TraceCheckUtils]: 19: Hoare triple {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:32,880 INFO L290 TraceCheckUtils]: 20: Hoare triple {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:32,880 INFO L290 TraceCheckUtils]: 21: Hoare triple {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:32,880 INFO L290 TraceCheckUtils]: 22: Hoare triple {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:32,881 INFO L290 TraceCheckUtils]: 23: Hoare triple {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:32,881 INFO L290 TraceCheckUtils]: 24: Hoare triple {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:32,882 INFO L290 TraceCheckUtils]: 25: Hoare triple {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:32,882 INFO L290 TraceCheckUtils]: 26: Hoare triple {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:32,882 INFO L290 TraceCheckUtils]: 27: Hoare triple {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:32,883 INFO L290 TraceCheckUtils]: 28: Hoare triple {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:32,883 INFO L290 TraceCheckUtils]: 29: Hoare triple {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:32,884 INFO L290 TraceCheckUtils]: 30: Hoare triple {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:32,884 INFO L290 TraceCheckUtils]: 31: Hoare triple {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:32,884 INFO L290 TraceCheckUtils]: 32: Hoare triple {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:32,885 INFO L290 TraceCheckUtils]: 33: Hoare triple {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:32,885 INFO L290 TraceCheckUtils]: 34: Hoare triple {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:32,886 INFO L290 TraceCheckUtils]: 35: Hoare triple {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:32,886 INFO L290 TraceCheckUtils]: 36: Hoare triple {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:32,886 INFO L290 TraceCheckUtils]: 37: Hoare triple {14783#(= (+ (* (- 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;main1_~i2~0#1 := 0; {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:32,887 INFO L290 TraceCheckUtils]: 38: Hoare triple {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main1_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {14783#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:44:32,888 INFO L290 TraceCheckUtils]: 39: Hoare triple {14783#(= (+ (* (- 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 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {14782#false} is VALID [2022-02-20 19:44:32,888 INFO L290 TraceCheckUtils]: 40: Hoare triple {14782#false} assume !(node1_~m1~0#1 != ~nomsg~0); {14782#false} is VALID [2022-02-20 19:44:32,888 INFO L290 TraceCheckUtils]: 41: Hoare triple {14782#false} ~mode1~0 := 0; {14782#false} is VALID [2022-02-20 19:44:32,888 INFO L290 TraceCheckUtils]: 42: Hoare triple {14782#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {14782#false} is VALID [2022-02-20 19:44:32,888 INFO L290 TraceCheckUtils]: 43: Hoare triple {14782#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {14782#false} is VALID [2022-02-20 19:44:32,888 INFO L290 TraceCheckUtils]: 44: Hoare triple {14782#false} assume !(node2_~m2~0#1 != ~nomsg~0); {14782#false} is VALID [2022-02-20 19:44:32,889 INFO L290 TraceCheckUtils]: 45: Hoare triple {14782#false} ~mode2~0 := 0; {14782#false} is VALID [2022-02-20 19:44:32,889 INFO L290 TraceCheckUtils]: 46: Hoare triple {14782#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {14782#false} is VALID [2022-02-20 19:44:32,889 INFO L290 TraceCheckUtils]: 47: Hoare triple {14782#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {14782#false} is VALID [2022-02-20 19:44:32,889 INFO L290 TraceCheckUtils]: 48: Hoare triple {14782#false} assume !(node3_~m3~0#1 != ~nomsg~0); {14782#false} is VALID [2022-02-20 19:44:32,889 INFO L290 TraceCheckUtils]: 49: Hoare triple {14782#false} ~mode3~0 := 0; {14782#false} is VALID [2022-02-20 19:44:32,890 INFO L290 TraceCheckUtils]: 50: Hoare triple {14782#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {14782#false} is VALID [2022-02-20 19:44:32,890 INFO L290 TraceCheckUtils]: 51: Hoare triple {14782#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {14782#false} is VALID [2022-02-20 19:44:32,890 INFO L290 TraceCheckUtils]: 52: Hoare triple {14782#false} assume !(node4_~m4~0#1 != ~nomsg~0); {14782#false} is VALID [2022-02-20 19:44:32,890 INFO L290 TraceCheckUtils]: 53: Hoare triple {14782#false} ~mode4~0 := 0; {14782#false} is VALID [2022-02-20 19:44:32,891 INFO L290 TraceCheckUtils]: 54: Hoare triple {14782#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {14782#false} is VALID [2022-02-20 19:44:32,891 INFO L290 TraceCheckUtils]: 55: Hoare triple {14782#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {14782#false} is VALID [2022-02-20 19:44:32,891 INFO L290 TraceCheckUtils]: 56: Hoare triple {14782#false} assume !(node5_~m5~0#1 != ~nomsg~0); {14782#false} is VALID [2022-02-20 19:44:32,891 INFO L290 TraceCheckUtils]: 57: Hoare triple {14782#false} ~mode5~0 := 0; {14782#false} is VALID [2022-02-20 19:44:32,891 INFO L290 TraceCheckUtils]: 58: Hoare triple {14782#false} assume { :end_inline_node5 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {14782#false} is VALID [2022-02-20 19:44:32,892 INFO L290 TraceCheckUtils]: 59: Hoare triple {14782#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {14782#false} is VALID [2022-02-20 19:44:32,892 INFO L290 TraceCheckUtils]: 60: Hoare triple {14782#false} check_#res#1 := check_~tmp~1#1; {14782#false} is VALID [2022-02-20 19:44:32,892 INFO L290 TraceCheckUtils]: 61: Hoare triple {14782#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {14782#false} is VALID [2022-02-20 19:44:32,892 INFO L290 TraceCheckUtils]: 62: Hoare triple {14782#false} assume 0 == assert_~arg#1 % 256; {14782#false} is VALID [2022-02-20 19:44:32,892 INFO L290 TraceCheckUtils]: 63: Hoare triple {14782#false} assume !false; {14782#false} is VALID [2022-02-20 19:44:32,893 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 19:44:32,893 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:44:32,893 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985669356] [2022-02-20 19:44:32,893 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985669356] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:44:32,893 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:44:32,894 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:44:32,894 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645128095] [2022-02-20 19:44:32,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:44:32,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-02-20 19:44:32,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:44:32,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:32,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:44:32,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:44:32,937 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:44:32,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:44:32,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:44:32,938 INFO L87 Difference]: Start difference. First operand 1594 states and 2585 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:34,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:34,806 INFO L93 Difference]: Finished difference Result 1692 states and 2739 transitions. [2022-02-20 19:44:34,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:44:34,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-02-20 19:44:34,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:44:34,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:34,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:44:34,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:34,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:44:34,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1712 transitions. [2022-02-20 19:44:36,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1712 edges. 1712 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:44:36,405 INFO L225 Difference]: With dead ends: 1692 [2022-02-20 19:44:36,405 INFO L226 Difference]: Without dead ends: 1640 [2022-02-20 19:44:36,405 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 19:44:36,406 INFO L933 BasicCegarLoop]: 1626 mSDtfsCounter, 1511 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1511 SdHoareTripleChecker+Valid, 1706 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 19:44:36,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1511 Valid, 1706 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:44:36,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2022-02-20 19:44:36,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1638. [2022-02-20 19:44:36,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:44:36,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1640 states. Second operand has 1638 states, 1636 states have (on average 1.6228606356968216) internal successors, (2655), 1637 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:36,440 INFO L74 IsIncluded]: Start isIncluded. First operand 1640 states. Second operand has 1638 states, 1636 states have (on average 1.6228606356968216) internal successors, (2655), 1637 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:36,442 INFO L87 Difference]: Start difference. First operand 1640 states. Second operand has 1638 states, 1636 states have (on average 1.6228606356968216) internal successors, (2655), 1637 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:36,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:36,516 INFO L93 Difference]: Finished difference Result 1640 states and 2656 transitions. [2022-02-20 19:44:36,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 2656 transitions. [2022-02-20 19:44:36,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:36,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:36,520 INFO L74 IsIncluded]: Start isIncluded. First operand has 1638 states, 1636 states have (on average 1.6228606356968216) internal successors, (2655), 1637 states have internal predecessors, (2655), 0 states have call successors, (0), 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 1640 states. [2022-02-20 19:44:36,522 INFO L87 Difference]: Start difference. First operand has 1638 states, 1636 states have (on average 1.6228606356968216) internal successors, (2655), 1637 states have internal predecessors, (2655), 0 states have call successors, (0), 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 1640 states. [2022-02-20 19:44:36,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:36,595 INFO L93 Difference]: Finished difference Result 1640 states and 2656 transitions. [2022-02-20 19:44:36,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 2656 transitions. [2022-02-20 19:44:36,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:36,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:36,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:44:36,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:44:36,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1638 states, 1636 states have (on average 1.6228606356968216) internal successors, (2655), 1637 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:36,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1638 states and 2655 transitions. [2022-02-20 19:44:36,674 INFO L78 Accepts]: Start accepts. Automaton has 1638 states and 2655 transitions. Word has length 64 [2022-02-20 19:44:36,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:44:36,674 INFO L470 AbstractCegarLoop]: Abstraction has 1638 states and 2655 transitions. [2022-02-20 19:44:36,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:36,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 2655 transitions. [2022-02-20 19:44:36,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:44:36,676 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:44:36,676 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] [2022-02-20 19:44:36,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:44:36,676 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:44:36,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:44:36,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1440610970, now seen corresponding path program 1 times [2022-02-20 19:44:36,677 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:44:36,677 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971054332] [2022-02-20 19:44:36,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:44:36,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:44:36,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:44:36,780 INFO L290 TraceCheckUtils]: 0: Hoare triple {21458#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(33, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {21458#true} is VALID [2022-02-20 19:44:36,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {21458#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {21458#true} is VALID [2022-02-20 19:44:36,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {21458#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_#t~post33#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {21458#true} is VALID [2022-02-20 19:44:36,783 INFO L290 TraceCheckUtils]: 3: Hoare triple {21458#true} assume 0 == ~r1~0; {21458#true} is VALID [2022-02-20 19:44:36,783 INFO L290 TraceCheckUtils]: 4: Hoare triple {21458#true} assume ~id1~0 >= 0; {21458#true} is VALID [2022-02-20 19:44:36,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {21458#true} assume 0 == ~st1~0; {21458#true} is VALID [2022-02-20 19:44:36,784 INFO L290 TraceCheckUtils]: 6: Hoare triple {21458#true} assume ~send1~0 == ~id1~0; {21458#true} is VALID [2022-02-20 19:44:36,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {21458#true} assume 0 == ~mode1~0 % 256; {21458#true} is VALID [2022-02-20 19:44:36,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {21458#true} assume ~id2~0 >= 0; {21458#true} is VALID [2022-02-20 19:44:36,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {21458#true} assume 0 == ~st2~0; {21458#true} is VALID [2022-02-20 19:44:36,784 INFO L290 TraceCheckUtils]: 10: Hoare triple {21458#true} assume ~send2~0 == ~id2~0; {21458#true} is VALID [2022-02-20 19:44:36,786 INFO L290 TraceCheckUtils]: 11: Hoare triple {21458#true} assume 0 == ~mode2~0 % 256; {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:36,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:36,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:36,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:36,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:36,789 INFO L290 TraceCheckUtils]: 16: Hoare triple {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:36,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:36,789 INFO L290 TraceCheckUtils]: 18: Hoare triple {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:36,791 INFO L290 TraceCheckUtils]: 19: Hoare triple {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:36,791 INFO L290 TraceCheckUtils]: 20: Hoare triple {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:36,792 INFO L290 TraceCheckUtils]: 21: Hoare triple {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:36,792 INFO L290 TraceCheckUtils]: 22: Hoare triple {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:36,792 INFO L290 TraceCheckUtils]: 23: Hoare triple {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:36,793 INFO L290 TraceCheckUtils]: 24: Hoare triple {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:36,793 INFO L290 TraceCheckUtils]: 25: Hoare triple {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:36,794 INFO L290 TraceCheckUtils]: 26: Hoare triple {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:36,794 INFO L290 TraceCheckUtils]: 27: Hoare triple {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:36,794 INFO L290 TraceCheckUtils]: 28: Hoare triple {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:36,795 INFO L290 TraceCheckUtils]: 29: Hoare triple {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:36,795 INFO L290 TraceCheckUtils]: 30: Hoare triple {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:36,795 INFO L290 TraceCheckUtils]: 31: Hoare triple {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:36,796 INFO L290 TraceCheckUtils]: 32: Hoare triple {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:36,796 INFO L290 TraceCheckUtils]: 33: Hoare triple {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:36,797 INFO L290 TraceCheckUtils]: 34: Hoare triple {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:36,797 INFO L290 TraceCheckUtils]: 35: Hoare triple {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:36,797 INFO L290 TraceCheckUtils]: 36: Hoare triple {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:36,798 INFO L290 TraceCheckUtils]: 37: Hoare triple {21460#(= (+ (* (- 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;main1_~i2~0#1 := 0; {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:36,798 INFO L290 TraceCheckUtils]: 38: Hoare triple {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(main1_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:36,799 INFO L290 TraceCheckUtils]: 39: Hoare triple {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:36,799 INFO L290 TraceCheckUtils]: 40: Hoare triple {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:36,800 INFO L290 TraceCheckUtils]: 41: Hoare triple {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:36,800 INFO L290 TraceCheckUtils]: 42: Hoare triple {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {21460#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:44:36,800 INFO L290 TraceCheckUtils]: 43: Hoare triple {21460#(= (+ (* (- 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; {21459#false} is VALID [2022-02-20 19:44:36,801 INFO L290 TraceCheckUtils]: 44: Hoare triple {21459#false} assume !(node2_~m2~0#1 != ~nomsg~0); {21459#false} is VALID [2022-02-20 19:44:36,801 INFO L290 TraceCheckUtils]: 45: Hoare triple {21459#false} ~mode2~0 := 0; {21459#false} is VALID [2022-02-20 19:44:36,801 INFO L290 TraceCheckUtils]: 46: Hoare triple {21459#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {21459#false} is VALID [2022-02-20 19:44:36,801 INFO L290 TraceCheckUtils]: 47: Hoare triple {21459#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {21459#false} is VALID [2022-02-20 19:44:36,801 INFO L290 TraceCheckUtils]: 48: Hoare triple {21459#false} assume !(node3_~m3~0#1 != ~nomsg~0); {21459#false} is VALID [2022-02-20 19:44:36,801 INFO L290 TraceCheckUtils]: 49: Hoare triple {21459#false} ~mode3~0 := 0; {21459#false} is VALID [2022-02-20 19:44:36,801 INFO L290 TraceCheckUtils]: 50: Hoare triple {21459#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {21459#false} is VALID [2022-02-20 19:44:36,802 INFO L290 TraceCheckUtils]: 51: Hoare triple {21459#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {21459#false} is VALID [2022-02-20 19:44:36,802 INFO L290 TraceCheckUtils]: 52: Hoare triple {21459#false} assume !(node4_~m4~0#1 != ~nomsg~0); {21459#false} is VALID [2022-02-20 19:44:36,802 INFO L290 TraceCheckUtils]: 53: Hoare triple {21459#false} ~mode4~0 := 0; {21459#false} is VALID [2022-02-20 19:44:36,802 INFO L290 TraceCheckUtils]: 54: Hoare triple {21459#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {21459#false} is VALID [2022-02-20 19:44:36,802 INFO L290 TraceCheckUtils]: 55: Hoare triple {21459#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {21459#false} is VALID [2022-02-20 19:44:36,802 INFO L290 TraceCheckUtils]: 56: Hoare triple {21459#false} assume !(node5_~m5~0#1 != ~nomsg~0); {21459#false} is VALID [2022-02-20 19:44:36,803 INFO L290 TraceCheckUtils]: 57: Hoare triple {21459#false} ~mode5~0 := 0; {21459#false} is VALID [2022-02-20 19:44:36,804 INFO L290 TraceCheckUtils]: 58: Hoare triple {21459#false} assume { :end_inline_node5 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {21459#false} is VALID [2022-02-20 19:44:36,804 INFO L290 TraceCheckUtils]: 59: Hoare triple {21459#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {21459#false} is VALID [2022-02-20 19:44:36,804 INFO L290 TraceCheckUtils]: 60: Hoare triple {21459#false} check_#res#1 := check_~tmp~1#1; {21459#false} is VALID [2022-02-20 19:44:36,805 INFO L290 TraceCheckUtils]: 61: Hoare triple {21459#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {21459#false} is VALID [2022-02-20 19:44:36,805 INFO L290 TraceCheckUtils]: 62: Hoare triple {21459#false} assume 0 == assert_~arg#1 % 256; {21459#false} is VALID [2022-02-20 19:44:36,805 INFO L290 TraceCheckUtils]: 63: Hoare triple {21459#false} assume !false; {21459#false} is VALID [2022-02-20 19:44:36,807 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 19:44:36,807 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:44:36,807 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971054332] [2022-02-20 19:44:36,807 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971054332] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:44:36,807 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:44:36,807 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:44:36,808 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774971442] [2022-02-20 19:44:36,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:44:36,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-02-20 19:44:36,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:44:36,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:36,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:44:36,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:44:36,853 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:44:36,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:44:36,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:44:36,854 INFO L87 Difference]: Start difference. First operand 1638 states and 2655 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:38,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:38,639 INFO L93 Difference]: Finished difference Result 1818 states and 2939 transitions. [2022-02-20 19:44:38,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:44:38,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-02-20 19:44:38,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:44:38,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:38,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:44:38,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:38,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:44:38,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1712 transitions. [2022-02-20 19:44:40,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1712 edges. 1712 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:44:40,221 INFO L225 Difference]: With dead ends: 1818 [2022-02-20 19:44:40,221 INFO L226 Difference]: Without dead ends: 1722 [2022-02-20 19:44:40,222 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 19:44:40,223 INFO L933 BasicCegarLoop]: 1621 mSDtfsCounter, 1507 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1705 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 19:44:40,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1507 Valid, 1705 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:44:40,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2022-02-20 19:44:40,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1720. [2022-02-20 19:44:40,258 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:44:40,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1722 states. Second operand has 1720 states, 1718 states have (on average 1.620488940628638) internal successors, (2784), 1719 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:40,262 INFO L74 IsIncluded]: Start isIncluded. First operand 1722 states. Second operand has 1720 states, 1718 states have (on average 1.620488940628638) internal successors, (2784), 1719 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:40,263 INFO L87 Difference]: Start difference. First operand 1722 states. Second operand has 1720 states, 1718 states have (on average 1.620488940628638) internal successors, (2784), 1719 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:40,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:40,343 INFO L93 Difference]: Finished difference Result 1722 states and 2785 transitions. [2022-02-20 19:44:40,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 2785 transitions. [2022-02-20 19:44:40,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:40,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:40,347 INFO L74 IsIncluded]: Start isIncluded. First operand has 1720 states, 1718 states have (on average 1.620488940628638) internal successors, (2784), 1719 states have internal predecessors, (2784), 0 states have call successors, (0), 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 1722 states. [2022-02-20 19:44:40,349 INFO L87 Difference]: Start difference. First operand has 1720 states, 1718 states have (on average 1.620488940628638) internal successors, (2784), 1719 states have internal predecessors, (2784), 0 states have call successors, (0), 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 1722 states. [2022-02-20 19:44:40,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:40,429 INFO L93 Difference]: Finished difference Result 1722 states and 2785 transitions. [2022-02-20 19:44:40,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 2785 transitions. [2022-02-20 19:44:40,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:40,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:40,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:44:40,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:44:40,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1720 states, 1718 states have (on average 1.620488940628638) internal successors, (2784), 1719 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:40,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1720 states and 2784 transitions. [2022-02-20 19:44:40,520 INFO L78 Accepts]: Start accepts. Automaton has 1720 states and 2784 transitions. Word has length 64 [2022-02-20 19:44:40,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:44:40,522 INFO L470 AbstractCegarLoop]: Abstraction has 1720 states and 2784 transitions. [2022-02-20 19:44:40,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:40,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 2784 transitions. [2022-02-20 19:44:40,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:44:40,523 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:44:40,523 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] [2022-02-20 19:44:40,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:44:40,523 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:44:40,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:44:40,524 INFO L85 PathProgramCache]: Analyzing trace with hash 914325468, now seen corresponding path program 1 times [2022-02-20 19:44:40,524 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:44:40,524 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200864382] [2022-02-20 19:44:40,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:44:40,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:44:40,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:44:40,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {28547#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(33, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {28547#true} is VALID [2022-02-20 19:44:40,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {28547#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {28547#true} is VALID [2022-02-20 19:44:40,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {28547#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_#t~post33#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {28547#true} is VALID [2022-02-20 19:44:40,593 INFO L290 TraceCheckUtils]: 3: Hoare triple {28547#true} assume 0 == ~r1~0; {28547#true} is VALID [2022-02-20 19:44:40,593 INFO L290 TraceCheckUtils]: 4: Hoare triple {28547#true} assume ~id1~0 >= 0; {28547#true} is VALID [2022-02-20 19:44:40,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {28547#true} assume 0 == ~st1~0; {28547#true} is VALID [2022-02-20 19:44:40,593 INFO L290 TraceCheckUtils]: 6: Hoare triple {28547#true} assume ~send1~0 == ~id1~0; {28547#true} is VALID [2022-02-20 19:44:40,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {28547#true} assume 0 == ~mode1~0 % 256; {28547#true} is VALID [2022-02-20 19:44:40,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {28547#true} assume ~id2~0 >= 0; {28547#true} is VALID [2022-02-20 19:44:40,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {28547#true} assume 0 == ~st2~0; {28547#true} is VALID [2022-02-20 19:44:40,594 INFO L290 TraceCheckUtils]: 10: Hoare triple {28547#true} assume ~send2~0 == ~id2~0; {28547#true} is VALID [2022-02-20 19:44:40,594 INFO L290 TraceCheckUtils]: 11: Hoare triple {28547#true} assume 0 == ~mode2~0 % 256; {28547#true} is VALID [2022-02-20 19:44:40,594 INFO L290 TraceCheckUtils]: 12: Hoare triple {28547#true} assume ~id3~0 >= 0; {28547#true} is VALID [2022-02-20 19:44:40,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {28547#true} assume 0 == ~st3~0; {28547#true} is VALID [2022-02-20 19:44:40,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {28547#true} assume ~send3~0 == ~id3~0; {28547#true} is VALID [2022-02-20 19:44:40,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {28547#true} assume 0 == ~mode3~0 % 256; {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:40,595 INFO L290 TraceCheckUtils]: 16: Hoare triple {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:40,595 INFO L290 TraceCheckUtils]: 17: Hoare triple {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:40,596 INFO L290 TraceCheckUtils]: 18: Hoare triple {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:40,596 INFO L290 TraceCheckUtils]: 19: Hoare triple {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:40,597 INFO L290 TraceCheckUtils]: 20: Hoare triple {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:40,597 INFO L290 TraceCheckUtils]: 21: Hoare triple {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:40,597 INFO L290 TraceCheckUtils]: 22: Hoare triple {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:40,598 INFO L290 TraceCheckUtils]: 23: Hoare triple {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:40,598 INFO L290 TraceCheckUtils]: 24: Hoare triple {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:40,598 INFO L290 TraceCheckUtils]: 25: Hoare triple {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:40,599 INFO L290 TraceCheckUtils]: 26: Hoare triple {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:40,599 INFO L290 TraceCheckUtils]: 27: Hoare triple {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:40,599 INFO L290 TraceCheckUtils]: 28: Hoare triple {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:40,600 INFO L290 TraceCheckUtils]: 29: Hoare triple {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:40,600 INFO L290 TraceCheckUtils]: 30: Hoare triple {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:40,601 INFO L290 TraceCheckUtils]: 31: Hoare triple {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:40,601 INFO L290 TraceCheckUtils]: 32: Hoare triple {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:40,601 INFO L290 TraceCheckUtils]: 33: Hoare triple {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:40,602 INFO L290 TraceCheckUtils]: 34: Hoare triple {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:40,602 INFO L290 TraceCheckUtils]: 35: Hoare triple {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:40,602 INFO L290 TraceCheckUtils]: 36: Hoare triple {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:40,603 INFO L290 TraceCheckUtils]: 37: Hoare triple {28549#(= (+ (* (- 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;main1_~i2~0#1 := 0; {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:40,603 INFO L290 TraceCheckUtils]: 38: Hoare triple {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(main1_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:40,604 INFO L290 TraceCheckUtils]: 39: Hoare triple {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:40,604 INFO L290 TraceCheckUtils]: 40: Hoare triple {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:40,604 INFO L290 TraceCheckUtils]: 41: Hoare triple {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:40,605 INFO L290 TraceCheckUtils]: 42: Hoare triple {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:40,605 INFO L290 TraceCheckUtils]: 43: Hoare triple {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:40,605 INFO L290 TraceCheckUtils]: 44: Hoare triple {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:40,606 INFO L290 TraceCheckUtils]: 45: Hoare triple {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:40,606 INFO L290 TraceCheckUtils]: 46: Hoare triple {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {28549#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:44:40,607 INFO L290 TraceCheckUtils]: 47: Hoare triple {28549#(= (+ (* (- 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; {28548#false} is VALID [2022-02-20 19:44:40,607 INFO L290 TraceCheckUtils]: 48: Hoare triple {28548#false} assume !(node3_~m3~0#1 != ~nomsg~0); {28548#false} is VALID [2022-02-20 19:44:40,607 INFO L290 TraceCheckUtils]: 49: Hoare triple {28548#false} ~mode3~0 := 0; {28548#false} is VALID [2022-02-20 19:44:40,607 INFO L290 TraceCheckUtils]: 50: Hoare triple {28548#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {28548#false} is VALID [2022-02-20 19:44:40,607 INFO L290 TraceCheckUtils]: 51: Hoare triple {28548#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {28548#false} is VALID [2022-02-20 19:44:40,607 INFO L290 TraceCheckUtils]: 52: Hoare triple {28548#false} assume !(node4_~m4~0#1 != ~nomsg~0); {28548#false} is VALID [2022-02-20 19:44:40,608 INFO L290 TraceCheckUtils]: 53: Hoare triple {28548#false} ~mode4~0 := 0; {28548#false} is VALID [2022-02-20 19:44:40,608 INFO L290 TraceCheckUtils]: 54: Hoare triple {28548#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {28548#false} is VALID [2022-02-20 19:44:40,608 INFO L290 TraceCheckUtils]: 55: Hoare triple {28548#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {28548#false} is VALID [2022-02-20 19:44:40,608 INFO L290 TraceCheckUtils]: 56: Hoare triple {28548#false} assume !(node5_~m5~0#1 != ~nomsg~0); {28548#false} is VALID [2022-02-20 19:44:40,608 INFO L290 TraceCheckUtils]: 57: Hoare triple {28548#false} ~mode5~0 := 0; {28548#false} is VALID [2022-02-20 19:44:40,608 INFO L290 TraceCheckUtils]: 58: Hoare triple {28548#false} assume { :end_inline_node5 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {28548#false} is VALID [2022-02-20 19:44:40,608 INFO L290 TraceCheckUtils]: 59: Hoare triple {28548#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {28548#false} is VALID [2022-02-20 19:44:40,608 INFO L290 TraceCheckUtils]: 60: Hoare triple {28548#false} check_#res#1 := check_~tmp~1#1; {28548#false} is VALID [2022-02-20 19:44:40,609 INFO L290 TraceCheckUtils]: 61: Hoare triple {28548#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {28548#false} is VALID [2022-02-20 19:44:40,609 INFO L290 TraceCheckUtils]: 62: Hoare triple {28548#false} assume 0 == assert_~arg#1 % 256; {28548#false} is VALID [2022-02-20 19:44:40,609 INFO L290 TraceCheckUtils]: 63: Hoare triple {28548#false} assume !false; {28548#false} is VALID [2022-02-20 19:44:40,609 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 19:44:40,609 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:44:40,609 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200864382] [2022-02-20 19:44:40,610 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200864382] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:44:40,610 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:44:40,610 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:44:40,610 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559523961] [2022-02-20 19:44:40,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:44:40,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-02-20 19:44:40,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:44:40,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:40,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:44:40,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:44:40,662 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:44:40,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:44:40,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:44:40,663 INFO L87 Difference]: Start difference. First operand 1720 states and 2784 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:42,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:42,449 INFO L93 Difference]: Finished difference Result 2052 states and 3306 transitions. [2022-02-20 19:44:42,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:44:42,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-02-20 19:44:42,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:44:42,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:42,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:44:42,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:42,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:44:42,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1712 transitions. [2022-02-20 19:44:43,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1712 edges. 1712 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:44:43,950 INFO L225 Difference]: With dead ends: 2052 [2022-02-20 19:44:43,950 INFO L226 Difference]: Without dead ends: 1874 [2022-02-20 19:44:43,951 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 19:44:43,953 INFO L933 BasicCegarLoop]: 1616 mSDtfsCounter, 1503 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 1704 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 19:44:43,954 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1503 Valid, 1704 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:44:43,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2022-02-20 19:44:44,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1872. [2022-02-20 19:44:44,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:44:44,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1874 states. Second operand has 1872 states, 1870 states have (on average 1.6149732620320856) internal successors, (3020), 1871 states have internal predecessors, (3020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:44,068 INFO L74 IsIncluded]: Start isIncluded. First operand 1874 states. Second operand has 1872 states, 1870 states have (on average 1.6149732620320856) internal successors, (3020), 1871 states have internal predecessors, (3020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:44,070 INFO L87 Difference]: Start difference. First operand 1874 states. Second operand has 1872 states, 1870 states have (on average 1.6149732620320856) internal successors, (3020), 1871 states have internal predecessors, (3020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:44,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:44,205 INFO L93 Difference]: Finished difference Result 1874 states and 3021 transitions. [2022-02-20 19:44:44,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 3021 transitions. [2022-02-20 19:44:44,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:44,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:44,210 INFO L74 IsIncluded]: Start isIncluded. First operand has 1872 states, 1870 states have (on average 1.6149732620320856) internal successors, (3020), 1871 states have internal predecessors, (3020), 0 states have call successors, (0), 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 1874 states. [2022-02-20 19:44:44,212 INFO L87 Difference]: Start difference. First operand has 1872 states, 1870 states have (on average 1.6149732620320856) internal successors, (3020), 1871 states have internal predecessors, (3020), 0 states have call successors, (0), 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 1874 states. [2022-02-20 19:44:44,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:44,301 INFO L93 Difference]: Finished difference Result 1874 states and 3021 transitions. [2022-02-20 19:44:44,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 3021 transitions. [2022-02-20 19:44:44,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:44,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:44,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:44:44,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:44:44,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1872 states, 1870 states have (on average 1.6149732620320856) internal successors, (3020), 1871 states have internal predecessors, (3020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:44,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1872 states and 3020 transitions. [2022-02-20 19:44:44,398 INFO L78 Accepts]: Start accepts. Automaton has 1872 states and 3020 transitions. Word has length 64 [2022-02-20 19:44:44,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:44:44,398 INFO L470 AbstractCegarLoop]: Abstraction has 1872 states and 3020 transitions. [2022-02-20 19:44:44,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:44,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1872 states and 3020 transitions. [2022-02-20 19:44:44,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:44:44,399 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:44:44,400 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] [2022-02-20 19:44:44,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:44:44,400 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:44:44,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:44:44,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1701027568, now seen corresponding path program 1 times [2022-02-20 19:44:44,401 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:44:44,401 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331181262] [2022-02-20 19:44:44,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:44:44,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:44:44,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:44:44,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {36406#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(33, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {36406#true} is VALID [2022-02-20 19:44:44,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {36406#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {36406#true} is VALID [2022-02-20 19:44:44,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {36406#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_#t~post33#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {36406#true} is VALID [2022-02-20 19:44:44,481 INFO L290 TraceCheckUtils]: 3: Hoare triple {36406#true} assume 0 == ~r1~0; {36406#true} is VALID [2022-02-20 19:44:44,481 INFO L290 TraceCheckUtils]: 4: Hoare triple {36406#true} assume ~id1~0 >= 0; {36406#true} is VALID [2022-02-20 19:44:44,482 INFO L290 TraceCheckUtils]: 5: Hoare triple {36406#true} assume 0 == ~st1~0; {36406#true} is VALID [2022-02-20 19:44:44,482 INFO L290 TraceCheckUtils]: 6: Hoare triple {36406#true} assume ~send1~0 == ~id1~0; {36406#true} is VALID [2022-02-20 19:44:44,482 INFO L290 TraceCheckUtils]: 7: Hoare triple {36406#true} assume 0 == ~mode1~0 % 256; {36406#true} is VALID [2022-02-20 19:44:44,483 INFO L290 TraceCheckUtils]: 8: Hoare triple {36406#true} assume ~id2~0 >= 0; {36406#true} is VALID [2022-02-20 19:44:44,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {36406#true} assume 0 == ~st2~0; {36406#true} is VALID [2022-02-20 19:44:44,483 INFO L290 TraceCheckUtils]: 10: Hoare triple {36406#true} assume ~send2~0 == ~id2~0; {36406#true} is VALID [2022-02-20 19:44:44,485 INFO L290 TraceCheckUtils]: 11: Hoare triple {36406#true} assume 0 == ~mode2~0 % 256; {36406#true} is VALID [2022-02-20 19:44:44,486 INFO L290 TraceCheckUtils]: 12: Hoare triple {36406#true} assume ~id3~0 >= 0; {36406#true} is VALID [2022-02-20 19:44:44,486 INFO L290 TraceCheckUtils]: 13: Hoare triple {36406#true} assume 0 == ~st3~0; {36406#true} is VALID [2022-02-20 19:44:44,486 INFO L290 TraceCheckUtils]: 14: Hoare triple {36406#true} assume ~send3~0 == ~id3~0; {36406#true} is VALID [2022-02-20 19:44:44,486 INFO L290 TraceCheckUtils]: 15: Hoare triple {36406#true} assume 0 == ~mode3~0 % 256; {36406#true} is VALID [2022-02-20 19:44:44,486 INFO L290 TraceCheckUtils]: 16: Hoare triple {36406#true} assume ~id4~0 >= 0; {36406#true} is VALID [2022-02-20 19:44:44,486 INFO L290 TraceCheckUtils]: 17: Hoare triple {36406#true} assume 0 == ~st4~0; {36406#true} is VALID [2022-02-20 19:44:44,486 INFO L290 TraceCheckUtils]: 18: Hoare triple {36406#true} assume ~send4~0 == ~id4~0; {36406#true} is VALID [2022-02-20 19:44:44,489 INFO L290 TraceCheckUtils]: 19: Hoare triple {36406#true} assume 0 == ~mode4~0 % 256; {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:44,489 INFO L290 TraceCheckUtils]: 20: Hoare triple {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:44,489 INFO L290 TraceCheckUtils]: 21: Hoare triple {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:44,490 INFO L290 TraceCheckUtils]: 22: Hoare triple {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:44,490 INFO L290 TraceCheckUtils]: 23: Hoare triple {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:44,491 INFO L290 TraceCheckUtils]: 24: Hoare triple {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:44,491 INFO L290 TraceCheckUtils]: 25: Hoare triple {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:44,491 INFO L290 TraceCheckUtils]: 26: Hoare triple {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:44,492 INFO L290 TraceCheckUtils]: 27: Hoare triple {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:44,492 INFO L290 TraceCheckUtils]: 28: Hoare triple {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:44,492 INFO L290 TraceCheckUtils]: 29: Hoare triple {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:44,493 INFO L290 TraceCheckUtils]: 30: Hoare triple {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:44,493 INFO L290 TraceCheckUtils]: 31: Hoare triple {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:44,494 INFO L290 TraceCheckUtils]: 32: Hoare triple {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:44,494 INFO L290 TraceCheckUtils]: 33: Hoare triple {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:44,495 INFO L290 TraceCheckUtils]: 34: Hoare triple {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:44,495 INFO L290 TraceCheckUtils]: 35: Hoare triple {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:44,496 INFO L290 TraceCheckUtils]: 36: Hoare triple {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:44,496 INFO L290 TraceCheckUtils]: 37: Hoare triple {36408#(= (+ (* (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;main1_~i2~0#1 := 0; {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:44,496 INFO L290 TraceCheckUtils]: 38: Hoare triple {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(main1_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:44,497 INFO L290 TraceCheckUtils]: 39: Hoare triple {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:44,497 INFO L290 TraceCheckUtils]: 40: Hoare triple {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:44,498 INFO L290 TraceCheckUtils]: 41: Hoare triple {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:44,498 INFO L290 TraceCheckUtils]: 42: Hoare triple {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:44,498 INFO L290 TraceCheckUtils]: 43: Hoare triple {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:44,499 INFO L290 TraceCheckUtils]: 44: Hoare triple {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:44,499 INFO L290 TraceCheckUtils]: 45: Hoare triple {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:44,500 INFO L290 TraceCheckUtils]: 46: Hoare triple {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:44,500 INFO L290 TraceCheckUtils]: 47: Hoare triple {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:44,501 INFO L290 TraceCheckUtils]: 48: Hoare triple {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite7#1 := ~p3_new~0; {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:44,501 INFO L290 TraceCheckUtils]: 49: Hoare triple {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:44,502 INFO L290 TraceCheckUtils]: 50: Hoare triple {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {36408#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:44:44,502 INFO L290 TraceCheckUtils]: 51: Hoare triple {36408#(= (+ (* (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; {36407#false} is VALID [2022-02-20 19:44:44,502 INFO L290 TraceCheckUtils]: 52: Hoare triple {36407#false} assume !(node4_~m4~0#1 != ~nomsg~0); {36407#false} is VALID [2022-02-20 19:44:44,503 INFO L290 TraceCheckUtils]: 53: Hoare triple {36407#false} ~mode4~0 := 0; {36407#false} is VALID [2022-02-20 19:44:44,503 INFO L290 TraceCheckUtils]: 54: Hoare triple {36407#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {36407#false} is VALID [2022-02-20 19:44:44,503 INFO L290 TraceCheckUtils]: 55: Hoare triple {36407#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {36407#false} is VALID [2022-02-20 19:44:44,503 INFO L290 TraceCheckUtils]: 56: Hoare triple {36407#false} assume !(node5_~m5~0#1 != ~nomsg~0); {36407#false} is VALID [2022-02-20 19:44:44,503 INFO L290 TraceCheckUtils]: 57: Hoare triple {36407#false} ~mode5~0 := 0; {36407#false} is VALID [2022-02-20 19:44:44,503 INFO L290 TraceCheckUtils]: 58: Hoare triple {36407#false} assume { :end_inline_node5 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {36407#false} is VALID [2022-02-20 19:44:44,503 INFO L290 TraceCheckUtils]: 59: Hoare triple {36407#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {36407#false} is VALID [2022-02-20 19:44:44,504 INFO L290 TraceCheckUtils]: 60: Hoare triple {36407#false} check_#res#1 := check_~tmp~1#1; {36407#false} is VALID [2022-02-20 19:44:44,504 INFO L290 TraceCheckUtils]: 61: Hoare triple {36407#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {36407#false} is VALID [2022-02-20 19:44:44,505 INFO L290 TraceCheckUtils]: 62: Hoare triple {36407#false} assume 0 == assert_~arg#1 % 256; {36407#false} is VALID [2022-02-20 19:44:44,505 INFO L290 TraceCheckUtils]: 63: Hoare triple {36407#false} assume !false; {36407#false} is VALID [2022-02-20 19:44:44,506 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 19:44:44,507 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:44:44,507 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331181262] [2022-02-20 19:44:44,507 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331181262] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:44:44,507 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:44:44,507 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:44:44,507 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247675216] [2022-02-20 19:44:44,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:44:44,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-02-20 19:44:44,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:44:44,509 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:44,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:44:44,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:44:44,558 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:44:44,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:44:44,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:44:44,560 INFO L87 Difference]: Start difference. First operand 1872 states and 3020 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:46,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:46,482 INFO L93 Difference]: Finished difference Result 2484 states and 3974 transitions. [2022-02-20 19:44:46,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:44:46,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-02-20 19:44:46,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:44:46,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:46,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:44:46,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:46,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:44:46,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1712 transitions. [2022-02-20 19:44:47,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1712 edges. 1712 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:44:47,909 INFO L225 Difference]: With dead ends: 2484 [2022-02-20 19:44:47,909 INFO L226 Difference]: Without dead ends: 2154 [2022-02-20 19:44:47,910 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 19:44:47,916 INFO L933 BasicCegarLoop]: 1611 mSDtfsCounter, 1499 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 1703 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 19:44:47,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1499 Valid, 1703 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:44:47,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2022-02-20 19:44:48,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 2152. [2022-02-20 19:44:48,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:44:48,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2154 states. Second operand has 2152 states, 2150 states have (on average 1.6037209302325581) internal successors, (3448), 2151 states have internal predecessors, (3448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:48,022 INFO L74 IsIncluded]: Start isIncluded. First operand 2154 states. Second operand has 2152 states, 2150 states have (on average 1.6037209302325581) internal successors, (3448), 2151 states have internal predecessors, (3448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:48,024 INFO L87 Difference]: Start difference. First operand 2154 states. Second operand has 2152 states, 2150 states have (on average 1.6037209302325581) internal successors, (3448), 2151 states have internal predecessors, (3448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:48,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:48,137 INFO L93 Difference]: Finished difference Result 2154 states and 3449 transitions. [2022-02-20 19:44:48,137 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 3449 transitions. [2022-02-20 19:44:48,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:48,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:48,142 INFO L74 IsIncluded]: Start isIncluded. First operand has 2152 states, 2150 states have (on average 1.6037209302325581) internal successors, (3448), 2151 states have internal predecessors, (3448), 0 states have call successors, (0), 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 2154 states. [2022-02-20 19:44:48,143 INFO L87 Difference]: Start difference. First operand has 2152 states, 2150 states have (on average 1.6037209302325581) internal successors, (3448), 2151 states have internal predecessors, (3448), 0 states have call successors, (0), 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 2154 states. [2022-02-20 19:44:48,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:48,257 INFO L93 Difference]: Finished difference Result 2154 states and 3449 transitions. [2022-02-20 19:44:48,258 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 3449 transitions. [2022-02-20 19:44:48,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:48,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:48,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:44:48,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:44:48,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2152 states, 2150 states have (on average 1.6037209302325581) internal successors, (3448), 2151 states have internal predecessors, (3448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:48,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 3448 transitions. [2022-02-20 19:44:48,386 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 3448 transitions. Word has length 64 [2022-02-20 19:44:48,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:44:48,388 INFO L470 AbstractCegarLoop]: Abstraction has 2152 states and 3448 transitions. [2022-02-20 19:44:48,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:48,388 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 3448 transitions. [2022-02-20 19:44:48,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:44:48,389 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:44:48,389 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] [2022-02-20 19:44:48,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:44:48,389 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:44:48,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:44:48,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1105068988, now seen corresponding path program 1 times [2022-02-20 19:44:48,390 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:44:48,390 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20827550] [2022-02-20 19:44:48,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:44:48,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:44:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:44:48,444 INFO L290 TraceCheckUtils]: 0: Hoare triple {45697#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(33, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {45697#true} is VALID [2022-02-20 19:44:48,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {45697#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {45697#true} is VALID [2022-02-20 19:44:48,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {45697#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_#t~post33#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {45697#true} is VALID [2022-02-20 19:44:48,445 INFO L290 TraceCheckUtils]: 3: Hoare triple {45697#true} assume 0 == ~r1~0; {45697#true} is VALID [2022-02-20 19:44:48,445 INFO L290 TraceCheckUtils]: 4: Hoare triple {45697#true} assume ~id1~0 >= 0; {45697#true} is VALID [2022-02-20 19:44:48,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {45697#true} assume 0 == ~st1~0; {45697#true} is VALID [2022-02-20 19:44:48,445 INFO L290 TraceCheckUtils]: 6: Hoare triple {45697#true} assume ~send1~0 == ~id1~0; {45697#true} is VALID [2022-02-20 19:44:48,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {45697#true} assume 0 == ~mode1~0 % 256; {45697#true} is VALID [2022-02-20 19:44:48,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {45697#true} assume ~id2~0 >= 0; {45697#true} is VALID [2022-02-20 19:44:48,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {45697#true} assume 0 == ~st2~0; {45697#true} is VALID [2022-02-20 19:44:48,446 INFO L290 TraceCheckUtils]: 10: Hoare triple {45697#true} assume ~send2~0 == ~id2~0; {45697#true} is VALID [2022-02-20 19:44:48,446 INFO L290 TraceCheckUtils]: 11: Hoare triple {45697#true} assume 0 == ~mode2~0 % 256; {45697#true} is VALID [2022-02-20 19:44:48,446 INFO L290 TraceCheckUtils]: 12: Hoare triple {45697#true} assume ~id3~0 >= 0; {45697#true} is VALID [2022-02-20 19:44:48,446 INFO L290 TraceCheckUtils]: 13: Hoare triple {45697#true} assume 0 == ~st3~0; {45697#true} is VALID [2022-02-20 19:44:48,446 INFO L290 TraceCheckUtils]: 14: Hoare triple {45697#true} assume ~send3~0 == ~id3~0; {45697#true} is VALID [2022-02-20 19:44:48,446 INFO L290 TraceCheckUtils]: 15: Hoare triple {45697#true} assume 0 == ~mode3~0 % 256; {45697#true} is VALID [2022-02-20 19:44:48,447 INFO L290 TraceCheckUtils]: 16: Hoare triple {45697#true} assume ~id4~0 >= 0; {45697#true} is VALID [2022-02-20 19:44:48,447 INFO L290 TraceCheckUtils]: 17: Hoare triple {45697#true} assume 0 == ~st4~0; {45697#true} is VALID [2022-02-20 19:44:48,447 INFO L290 TraceCheckUtils]: 18: Hoare triple {45697#true} assume ~send4~0 == ~id4~0; {45697#true} is VALID [2022-02-20 19:44:48,447 INFO L290 TraceCheckUtils]: 19: Hoare triple {45697#true} assume 0 == ~mode4~0 % 256; {45697#true} is VALID [2022-02-20 19:44:48,447 INFO L290 TraceCheckUtils]: 20: Hoare triple {45697#true} assume ~id5~0 >= 0; {45697#true} is VALID [2022-02-20 19:44:48,447 INFO L290 TraceCheckUtils]: 21: Hoare triple {45697#true} assume 0 == ~st5~0; {45697#true} is VALID [2022-02-20 19:44:48,447 INFO L290 TraceCheckUtils]: 22: Hoare triple {45697#true} assume ~send5~0 == ~id5~0; {45697#true} is VALID [2022-02-20 19:44:48,448 INFO L290 TraceCheckUtils]: 23: Hoare triple {45697#true} assume 0 == ~mode5~0 % 256; {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:48,448 INFO L290 TraceCheckUtils]: 24: Hoare triple {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:48,449 INFO L290 TraceCheckUtils]: 25: Hoare triple {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:48,449 INFO L290 TraceCheckUtils]: 26: Hoare triple {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:48,449 INFO L290 TraceCheckUtils]: 27: Hoare triple {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:48,450 INFO L290 TraceCheckUtils]: 28: Hoare triple {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:48,450 INFO L290 TraceCheckUtils]: 29: Hoare triple {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:48,450 INFO L290 TraceCheckUtils]: 30: Hoare triple {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:48,451 INFO L290 TraceCheckUtils]: 31: Hoare triple {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:48,451 INFO L290 TraceCheckUtils]: 32: Hoare triple {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:48,456 INFO L290 TraceCheckUtils]: 33: Hoare triple {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:48,457 INFO L290 TraceCheckUtils]: 34: Hoare triple {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:48,457 INFO L290 TraceCheckUtils]: 35: Hoare triple {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:48,458 INFO L290 TraceCheckUtils]: 36: Hoare triple {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:48,458 INFO L290 TraceCheckUtils]: 37: Hoare triple {45699#(= (+ (* (- 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;main1_~i2~0#1 := 0; {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:48,459 INFO L290 TraceCheckUtils]: 38: Hoare triple {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(main1_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:48,459 INFO L290 TraceCheckUtils]: 39: Hoare triple {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:48,459 INFO L290 TraceCheckUtils]: 40: Hoare triple {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:48,460 INFO L290 TraceCheckUtils]: 41: Hoare triple {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:48,460 INFO L290 TraceCheckUtils]: 42: Hoare triple {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:48,460 INFO L290 TraceCheckUtils]: 43: Hoare triple {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:48,461 INFO L290 TraceCheckUtils]: 44: Hoare triple {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:48,461 INFO L290 TraceCheckUtils]: 45: Hoare triple {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:48,462 INFO L290 TraceCheckUtils]: 46: Hoare triple {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:48,462 INFO L290 TraceCheckUtils]: 47: Hoare triple {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:48,462 INFO L290 TraceCheckUtils]: 48: Hoare triple {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite7#1 := ~p3_new~0; {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:48,463 INFO L290 TraceCheckUtils]: 49: Hoare triple {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:48,463 INFO L290 TraceCheckUtils]: 50: Hoare triple {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:48,463 INFO L290 TraceCheckUtils]: 51: Hoare triple {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:48,464 INFO L290 TraceCheckUtils]: 52: Hoare triple {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0);node4_#t~ite8#1 := ~p4_new~0; {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:48,464 INFO L290 TraceCheckUtils]: 53: Hoare triple {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:48,464 INFO L290 TraceCheckUtils]: 54: Hoare triple {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {45699#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:44:48,465 INFO L290 TraceCheckUtils]: 55: Hoare triple {45699#(= (+ (* (- 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; {45698#false} is VALID [2022-02-20 19:44:48,465 INFO L290 TraceCheckUtils]: 56: Hoare triple {45698#false} assume !(node5_~m5~0#1 != ~nomsg~0); {45698#false} is VALID [2022-02-20 19:44:48,465 INFO L290 TraceCheckUtils]: 57: Hoare triple {45698#false} ~mode5~0 := 0; {45698#false} is VALID [2022-02-20 19:44:48,470 INFO L290 TraceCheckUtils]: 58: Hoare triple {45698#false} assume { :end_inline_node5 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {45698#false} is VALID [2022-02-20 19:44:48,471 INFO L290 TraceCheckUtils]: 59: Hoare triple {45698#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {45698#false} is VALID [2022-02-20 19:44:48,471 INFO L290 TraceCheckUtils]: 60: Hoare triple {45698#false} check_#res#1 := check_~tmp~1#1; {45698#false} is VALID [2022-02-20 19:44:48,472 INFO L290 TraceCheckUtils]: 61: Hoare triple {45698#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {45698#false} is VALID [2022-02-20 19:44:48,474 INFO L290 TraceCheckUtils]: 62: Hoare triple {45698#false} assume 0 == assert_~arg#1 % 256; {45698#false} is VALID [2022-02-20 19:44:48,475 INFO L290 TraceCheckUtils]: 63: Hoare triple {45698#false} assume !false; {45698#false} is VALID [2022-02-20 19:44:48,475 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 19:44:48,475 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:44:48,475 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20827550] [2022-02-20 19:44:48,475 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20827550] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:44:48,475 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:44:48,476 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:44:48,476 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289333703] [2022-02-20 19:44:48,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:44:48,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-02-20 19:44:48,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:44:48,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:48,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:44:48,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:44:48,518 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:44:48,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:44:48,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:44:48,519 INFO L87 Difference]: Start difference. First operand 2152 states and 3448 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:50,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:50,579 INFO L93 Difference]: Finished difference Result 3276 states and 5178 transitions. [2022-02-20 19:44:50,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:44:50,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-02-20 19:44:50,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:44:50,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:50,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:44:50,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:50,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:44:50,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1712 transitions. [2022-02-20 19:44:52,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1712 edges. 1712 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:44:52,299 INFO L225 Difference]: With dead ends: 3276 [2022-02-20 19:44:52,299 INFO L226 Difference]: Without dead ends: 2666 [2022-02-20 19:44:52,303 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 19:44:52,304 INFO L933 BasicCegarLoop]: 1606 mSDtfsCounter, 1495 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1495 SdHoareTripleChecker+Valid, 1702 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 19:44:52,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1495 Valid, 1702 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:44:52,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2022-02-20 19:44:52,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2664. [2022-02-20 19:44:52,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:44:52,491 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2666 states. Second operand has 2664 states, 2662 states have (on average 1.583771600300526) internal successors, (4216), 2663 states have internal predecessors, (4216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:52,493 INFO L74 IsIncluded]: Start isIncluded. First operand 2666 states. Second operand has 2664 states, 2662 states have (on average 1.583771600300526) internal successors, (4216), 2663 states have internal predecessors, (4216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:52,495 INFO L87 Difference]: Start difference. First operand 2666 states. Second operand has 2664 states, 2662 states have (on average 1.583771600300526) internal successors, (4216), 2663 states have internal predecessors, (4216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:52,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:52,694 INFO L93 Difference]: Finished difference Result 2666 states and 4217 transitions. [2022-02-20 19:44:52,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2666 states and 4217 transitions. [2022-02-20 19:44:52,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:52,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:52,699 INFO L74 IsIncluded]: Start isIncluded. First operand has 2664 states, 2662 states have (on average 1.583771600300526) internal successors, (4216), 2663 states have internal predecessors, (4216), 0 states have call successors, (0), 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 2666 states. [2022-02-20 19:44:52,700 INFO L87 Difference]: Start difference. First operand has 2664 states, 2662 states have (on average 1.583771600300526) internal successors, (4216), 2663 states have internal predecessors, (4216), 0 states have call successors, (0), 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 2666 states. [2022-02-20 19:44:52,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:52,886 INFO L93 Difference]: Finished difference Result 2666 states and 4217 transitions. [2022-02-20 19:44:52,886 INFO L276 IsEmpty]: Start isEmpty. Operand 2666 states and 4217 transitions. [2022-02-20 19:44:52,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:52,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:52,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:44:52,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:44:52,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2664 states, 2662 states have (on average 1.583771600300526) internal successors, (4216), 2663 states have internal predecessors, (4216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:53,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 4216 transitions. [2022-02-20 19:44:53,106 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 4216 transitions. Word has length 64 [2022-02-20 19:44:53,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:44:53,106 INFO L470 AbstractCegarLoop]: Abstraction has 2664 states and 4216 transitions. [2022-02-20 19:44:53,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:53,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 4216 transitions. [2022-02-20 19:44:53,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:44:53,107 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:44:53,107 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] [2022-02-20 19:44:53,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:44:53,107 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:44:53,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:44:53,108 INFO L85 PathProgramCache]: Analyzing trace with hash 112916410, now seen corresponding path program 1 times [2022-02-20 19:44:53,108 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:44:53,108 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359299460] [2022-02-20 19:44:53,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:44:53,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:44:53,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:44:53,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {57636#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(33, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {57636#true} is VALID [2022-02-20 19:44:53,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {57636#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {57636#true} is VALID [2022-02-20 19:44:53,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {57636#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_#t~post33#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {57636#true} is VALID [2022-02-20 19:44:53,173 INFO L290 TraceCheckUtils]: 3: Hoare triple {57636#true} assume 0 == ~r1~0; {57636#true} is VALID [2022-02-20 19:44:53,173 INFO L290 TraceCheckUtils]: 4: Hoare triple {57636#true} assume ~id1~0 >= 0; {57636#true} is VALID [2022-02-20 19:44:53,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {57636#true} assume 0 == ~st1~0; {57638#(<= ~st1~0 0)} is VALID [2022-02-20 19:44:53,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {57638#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {57638#(<= ~st1~0 0)} is VALID [2022-02-20 19:44:53,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {57638#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {57638#(<= ~st1~0 0)} is VALID [2022-02-20 19:44:53,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {57638#(<= ~st1~0 0)} assume ~id2~0 >= 0; {57638#(<= ~st1~0 0)} is VALID [2022-02-20 19:44:53,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {57638#(<= ~st1~0 0)} assume 0 == ~st2~0; {57639#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,175 INFO L290 TraceCheckUtils]: 10: Hoare triple {57639#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {57639#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,175 INFO L290 TraceCheckUtils]: 11: Hoare triple {57639#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {57639#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,176 INFO L290 TraceCheckUtils]: 12: Hoare triple {57639#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {57639#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {57639#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {57640#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,176 INFO L290 TraceCheckUtils]: 14: Hoare triple {57640#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {57640#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,177 INFO L290 TraceCheckUtils]: 15: Hoare triple {57640#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {57640#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,177 INFO L290 TraceCheckUtils]: 16: Hoare triple {57640#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {57640#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,177 INFO L290 TraceCheckUtils]: 17: Hoare triple {57640#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {57641#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,178 INFO L290 TraceCheckUtils]: 18: Hoare triple {57641#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {57641#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,178 INFO L290 TraceCheckUtils]: 19: Hoare triple {57641#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {57641#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,178 INFO L290 TraceCheckUtils]: 20: Hoare triple {57641#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {57641#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,179 INFO L290 TraceCheckUtils]: 21: Hoare triple {57641#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,179 INFO L290 TraceCheckUtils]: 22: Hoare triple {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,179 INFO L290 TraceCheckUtils]: 23: Hoare triple {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,180 INFO L290 TraceCheckUtils]: 24: Hoare triple {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,180 INFO L290 TraceCheckUtils]: 25: Hoare triple {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,180 INFO L290 TraceCheckUtils]: 26: Hoare triple {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,181 INFO L290 TraceCheckUtils]: 27: Hoare triple {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,181 INFO L290 TraceCheckUtils]: 28: Hoare triple {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,181 INFO L290 TraceCheckUtils]: 29: Hoare triple {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,182 INFO L290 TraceCheckUtils]: 30: Hoare triple {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,182 INFO L290 TraceCheckUtils]: 31: Hoare triple {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,182 INFO L290 TraceCheckUtils]: 32: Hoare triple {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,183 INFO L290 TraceCheckUtils]: 33: Hoare triple {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,183 INFO L290 TraceCheckUtils]: 34: Hoare triple {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,184 INFO L290 TraceCheckUtils]: 35: Hoare triple {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,184 INFO L290 TraceCheckUtils]: 36: Hoare triple {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,184 INFO L290 TraceCheckUtils]: 37: Hoare triple {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,185 INFO L290 TraceCheckUtils]: 38: Hoare triple {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(main1_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,185 INFO L290 TraceCheckUtils]: 39: Hoare triple {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,185 INFO L290 TraceCheckUtils]: 40: Hoare triple {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,186 INFO L290 TraceCheckUtils]: 41: Hoare triple {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,186 INFO L290 TraceCheckUtils]: 42: Hoare triple {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,186 INFO L290 TraceCheckUtils]: 43: Hoare triple {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,187 INFO L290 TraceCheckUtils]: 44: Hoare triple {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,187 INFO L290 TraceCheckUtils]: 45: Hoare triple {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,187 INFO L290 TraceCheckUtils]: 46: Hoare triple {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,188 INFO L290 TraceCheckUtils]: 47: Hoare triple {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,188 INFO L290 TraceCheckUtils]: 48: Hoare triple {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite7#1 := ~p3_new~0; {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,189 INFO L290 TraceCheckUtils]: 49: Hoare triple {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,189 INFO L290 TraceCheckUtils]: 50: Hoare triple {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,189 INFO L290 TraceCheckUtils]: 51: Hoare triple {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,190 INFO L290 TraceCheckUtils]: 52: Hoare triple {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0);node4_#t~ite8#1 := ~p4_new~0; {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,190 INFO L290 TraceCheckUtils]: 53: Hoare triple {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,190 INFO L290 TraceCheckUtils]: 54: Hoare triple {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,191 INFO L290 TraceCheckUtils]: 55: Hoare triple {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode5~0 % 256); {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,191 INFO L290 TraceCheckUtils]: 56: Hoare triple {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,191 INFO L290 TraceCheckUtils]: 57: Hoare triple {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,192 INFO L290 TraceCheckUtils]: 58: Hoare triple {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node5 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:44:53,192 INFO L290 TraceCheckUtils]: 59: Hoare triple {57642#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {57637#false} is VALID [2022-02-20 19:44:53,192 INFO L290 TraceCheckUtils]: 60: Hoare triple {57637#false} check_#res#1 := check_~tmp~1#1; {57637#false} is VALID [2022-02-20 19:44:53,192 INFO L290 TraceCheckUtils]: 61: Hoare triple {57637#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {57637#false} is VALID [2022-02-20 19:44:53,193 INFO L290 TraceCheckUtils]: 62: Hoare triple {57637#false} assume 0 == assert_~arg#1 % 256; {57637#false} is VALID [2022-02-20 19:44:53,193 INFO L290 TraceCheckUtils]: 63: Hoare triple {57637#false} assume !false; {57637#false} is VALID [2022-02-20 19:44:53,193 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 19:44:53,193 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:44:53,193 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359299460] [2022-02-20 19:44:53,193 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359299460] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:44:53,194 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:44:53,194 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:44:53,194 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564630086] [2022-02-20 19:44:53,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:44:53,194 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-02-20 19:44:53,195 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:44:53,195 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:53,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:44:53,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:44:53,237 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:44:53,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:44:53,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:44:53,237 INFO L87 Difference]: Start difference. First operand 2664 states and 4216 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:07,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:07,542 INFO L93 Difference]: Finished difference Result 13884 states and 21346 transitions. [2022-02-20 19:45:07,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:45:07,543 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-02-20 19:45:07,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:45:07,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:07,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2378 transitions. [2022-02-20 19:45:07,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:07,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2378 transitions. [2022-02-20 19:45:07,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 2378 transitions. [2022-02-20 19:45:08,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2378 edges. 2378 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:13,960 INFO L225 Difference]: With dead ends: 13884 [2022-02-20 19:45:13,960 INFO L226 Difference]: Without dead ends: 12762 [2022-02-20 19:45:13,974 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-02-20 19:45:13,975 INFO L933 BasicCegarLoop]: 1552 mSDtfsCounter, 8512 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8512 SdHoareTripleChecker+Valid, 2392 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:45:13,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8512 Valid, 2392 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 19:45:13,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12762 states. [2022-02-20 19:45:15,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12762 to 3784. [2022-02-20 19:45:15,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:45:15,019 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12762 states. Second operand has 3784 states, 3782 states have (on average 1.550502379693284) internal successors, (5864), 3783 states have internal predecessors, (5864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:15,022 INFO L74 IsIncluded]: Start isIncluded. First operand 12762 states. Second operand has 3784 states, 3782 states have (on average 1.550502379693284) internal successors, (5864), 3783 states have internal predecessors, (5864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:15,025 INFO L87 Difference]: Start difference. First operand 12762 states. Second operand has 3784 states, 3782 states have (on average 1.550502379693284) internal successors, (5864), 3783 states have internal predecessors, (5864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)