./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label07.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.8.ufo.UNBOUNDED.pals+Problem12_label07.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 4d62395951f99c0a3c43b690318a4d5480f589d72fceef9ee8ca741a4c7ef736 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:53:29,059 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:53:29,062 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:53:29,091 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:53:29,091 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:53:29,092 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:53:29,094 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:53:29,095 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:53:29,096 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:53:29,097 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:53:29,098 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:53:29,103 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:53:29,104 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:53:29,107 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:53:29,108 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:53:29,110 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:53:29,111 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:53:29,116 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:53:29,118 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:53:29,119 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:53:29,123 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:53:29,125 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:53:29,126 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:53:29,127 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:53:29,129 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:53:29,133 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:53:29,134 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:53:29,135 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:53:29,136 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:53:29,137 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:53:29,137 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:53:29,137 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:53:29,138 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:53:29,139 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:53:29,141 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:53:29,141 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:53:29,142 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:53:29,142 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:53:29,142 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:53:29,143 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:53:29,144 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:53:29,145 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:53:29,174 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:53:29,175 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:53:29,175 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:53:29,175 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:53:29,176 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:53:29,176 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:53:29,177 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:53:29,177 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:53:29,177 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:53:29,177 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:53:29,178 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:53:29,178 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:53:29,179 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:53:29,179 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:53:29,179 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:53:29,179 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:53:29,179 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:53:29,179 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:53:29,180 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:53:29,180 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:53:29,180 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:53:29,180 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:53:29,180 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:53:29,181 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:53:29,181 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:53:29,181 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:53:29,181 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:53:29,181 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:53:29,181 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:53:29,182 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:53:29,182 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:53:29,182 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:53:29,182 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:53:29,182 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 -> 4d62395951f99c0a3c43b690318a4d5480f589d72fceef9ee8ca741a4c7ef736 [2022-02-20 19:53:29,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:53:29,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:53:29,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:53:29,397 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:53:29,398 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:53:29,399 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label07.c [2022-02-20 19:53:29,455 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fd2ae025/dd1e97731d614857933be76d599981f4/FLAG613c3a2ce [2022-02-20 19:53:30,151 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:53:30,152 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label07.c [2022-02-20 19:53:30,187 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fd2ae025/dd1e97731d614857933be76d599981f4/FLAG613c3a2ce [2022-02-20 19:53:30,472 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fd2ae025/dd1e97731d614857933be76d599981f4 [2022-02-20 19:53:30,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:53:30,476 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:53:30,477 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:53:30,477 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:53:30,479 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:53:30,481 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:53:30" (1/1) ... [2022-02-20 19:53:30,482 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70e7a684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:30, skipping insertion in model container [2022-02-20 19:53:30,482 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:53:30" (1/1) ... [2022-02-20 19:53:30,488 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:53:30,586 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:53:30,903 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.8.ufo.UNBOUNDED.pals+Problem12_label07.c[26888,26901] [2022-02-20 19:53:30,925 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.8.ufo.UNBOUNDED.pals+Problem12_label07.c[27730,27743] [2022-02-20 19:53:31,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:53:31,672 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:53:31,729 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.8.ufo.UNBOUNDED.pals+Problem12_label07.c[26888,26901] [2022-02-20 19:53:31,743 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.8.ufo.UNBOUNDED.pals+Problem12_label07.c[27730,27743] [2022-02-20 19:53:32,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:53:32,150 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:53:32,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:32 WrapperNode [2022-02-20 19:53:32,151 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:53:32,152 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:53:32,152 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:53:32,153 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:53:32,159 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:53:32" (1/1) ... [2022-02-20 19:53:32,210 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:53:32" (1/1) ... [2022-02-20 19:53:32,702 INFO L137 Inliner]: procedures = 40, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5279 [2022-02-20 19:53:32,703 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:53:32,704 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:53:32,704 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:53:32,704 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:53:32,711 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:32" (1/1) ... [2022-02-20 19:53:32,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:32" (1/1) ... [2022-02-20 19:53:32,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:32" (1/1) ... [2022-02-20 19:53:32,793 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:32" (1/1) ... [2022-02-20 19:53:33,038 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:32" (1/1) ... [2022-02-20 19:53:33,071 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:32" (1/1) ... [2022-02-20 19:53:33,094 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:32" (1/1) ... [2022-02-20 19:53:33,153 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:53:33,155 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:53:33,156 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:53:33,156 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:53:33,157 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:32" (1/1) ... [2022-02-20 19:53:33,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:53:33,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:53:33,189 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:53:33,210 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:53:33,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:53:33,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:53:33,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:53:33,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:53:33,393 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:53:33,394 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:53:42,021 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:53:42,045 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:53:42,046 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:53:42,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:53:42 BoogieIcfgContainer [2022-02-20 19:53:42,050 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:53:42,051 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:53:42,051 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:53:42,054 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:53:42,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:53:30" (1/3) ... [2022-02-20 19:53:42,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f464133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:53:42, skipping insertion in model container [2022-02-20 19:53:42,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:32" (2/3) ... [2022-02-20 19:53:42,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f464133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:53:42, skipping insertion in model container [2022-02-20 19:53:42,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:53:42" (3/3) ... [2022-02-20 19:53:42,057 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label07.c [2022-02-20 19:53:42,062 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:53:42,063 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:53:42,119 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:53:42,136 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:53:42,138 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:53:42,184 INFO L276 IsEmpty]: Start isEmpty. Operand has 965 states, 962 states have (on average 1.8960498960498962) internal successors, (1824), 964 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have 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:53:42,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 19:53:42,188 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:42,189 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:53:42,189 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:42,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:42,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1816105685, now seen corresponding path program 1 times [2022-02-20 19:53:42,203 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:42,204 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596302068] [2022-02-20 19:53:42,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:42,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:42,506 INFO L290 TraceCheckUtils]: 0: Hoare triple {968#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(32, 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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~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; {970#(<= ~a7~0 13)} is VALID [2022-02-20 19:53:42,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {970#(<= ~a7~0 13)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {970#(<= ~a7~0 13)} is VALID [2022-02-20 19:53:42,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {970#(<= ~a7~0 13)} assume !(0 != main_#t~nondet62#1);havoc main_#t~nondet62#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet60#1, main2_#t~ret61#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {970#(<= ~a7~0 13)} is VALID [2022-02-20 19:53:42,508 INFO L290 TraceCheckUtils]: 3: Hoare triple {970#(<= ~a7~0 13)} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet60#1 && main2_#t~nondet60#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet60#1;havoc main2_#t~nondet60#1; {970#(<= ~a7~0 13)} is VALID [2022-02-20 19:53:42,508 INFO L290 TraceCheckUtils]: 4: Hoare triple {970#(<= ~a7~0 13)} 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~ret57#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {970#(<= ~a7~0 13)} is VALID [2022-02-20 19:53:42,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {970#(<= ~a7~0 13)} assume (((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {969#false} is VALID [2022-02-20 19:53:42,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {969#false} assume !false; {969#false} is VALID [2022-02-20 19:53:42,510 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:53:42,511 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:42,511 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596302068] [2022-02-20 19:53:42,511 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596302068] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:42,512 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:42,512 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:53:42,513 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401297720] [2022-02-20 19:53:42,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:42,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-02-20 19:53:42,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:42,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have 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:53:42,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:42,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:53:42,531 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:42,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:53:42,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:53:42,554 INFO L87 Difference]: Start difference. First operand has 965 states, 962 states have (on average 1.8960498960498962) internal successors, (1824), 964 states have internal predecessors, (1824), 0 states have call successors, (0), 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 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have 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:53:48,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:48,751 INFO L93 Difference]: Finished difference Result 2616 states and 5018 transitions. [2022-02-20 19:53:48,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:53:48,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-02-20 19:53:48,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:48,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have 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:53:48,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5018 transitions. [2022-02-20 19:53:48,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have 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:53:48,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5018 transitions. [2022-02-20 19:53:48,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 5018 transitions. [2022-02-20 19:53:52,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5018 edges. 5018 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:53,023 INFO L225 Difference]: With dead ends: 2616 [2022-02-20 19:53:53,024 INFO L226 Difference]: Without dead ends: 1650 [2022-02-20 19:53:53,034 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:53:53,038 INFO L933 BasicCegarLoop]: 345 mSDtfsCounter, 1105 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 1058 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1105 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 3395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1058 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:53:53,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1105 Valid, 356 Invalid, 3395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1058 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-02-20 19:53:53,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2022-02-20 19:53:53,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1650. [2022-02-20 19:53:53,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:53:53,160 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1650 states. Second operand has 1650 states, 1648 states have (on average 1.8604368932038835) internal successors, (3066), 1649 states have internal predecessors, (3066), 0 states have call successors, (0), 0 states have 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:53:53,164 INFO L74 IsIncluded]: Start isIncluded. First operand 1650 states. Second operand has 1650 states, 1648 states have (on average 1.8604368932038835) internal successors, (3066), 1649 states have internal predecessors, (3066), 0 states have call successors, (0), 0 states have 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:53:53,167 INFO L87 Difference]: Start difference. First operand 1650 states. Second operand has 1650 states, 1648 states have (on average 1.8604368932038835) internal successors, (3066), 1649 states have internal predecessors, (3066), 0 states have call successors, (0), 0 states have 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:53:53,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:53,302 INFO L93 Difference]: Finished difference Result 1650 states and 3066 transitions. [2022-02-20 19:53:53,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 3066 transitions. [2022-02-20 19:53:53,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:53,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:53,319 INFO L74 IsIncluded]: Start isIncluded. First operand has 1650 states, 1648 states have (on average 1.8604368932038835) internal successors, (3066), 1649 states have internal predecessors, (3066), 0 states have call successors, (0), 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 1650 states. [2022-02-20 19:53:53,324 INFO L87 Difference]: Start difference. First operand has 1650 states, 1648 states have (on average 1.8604368932038835) internal successors, (3066), 1649 states have internal predecessors, (3066), 0 states have call successors, (0), 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 1650 states. [2022-02-20 19:53:53,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:53,463 INFO L93 Difference]: Finished difference Result 1650 states and 3066 transitions. [2022-02-20 19:53:53,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 3066 transitions. [2022-02-20 19:53:53,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:53,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:53,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:53:53,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:53:53,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1650 states, 1648 states have (on average 1.8604368932038835) internal successors, (3066), 1649 states have internal predecessors, (3066), 0 states have call successors, (0), 0 states have 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:53:53,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1650 states and 3066 transitions. [2022-02-20 19:53:53,600 INFO L78 Accepts]: Start accepts. Automaton has 1650 states and 3066 transitions. Word has length 7 [2022-02-20 19:53:53,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:53:53,601 INFO L470 AbstractCegarLoop]: Abstraction has 1650 states and 3066 transitions. [2022-02-20 19:53:53,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have 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:53:53,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 3066 transitions. [2022-02-20 19:53:53,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 19:53:53,602 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:53,602 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] [2022-02-20 19:53:53,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:53:53,603 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:53,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:53,604 INFO L85 PathProgramCache]: Analyzing trace with hash 2117945689, now seen corresponding path program 1 times [2022-02-20 19:53:53,604 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:53,604 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258051096] [2022-02-20 19:53:53,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:53,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:53,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:53,713 INFO L290 TraceCheckUtils]: 0: Hoare triple {8603#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(32, 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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~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; {8603#true} is VALID [2022-02-20 19:53:53,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {8603#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {8603#true} is VALID [2022-02-20 19:53:53,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {8603#true} assume 0 != main_#t~nondet62#1;havoc main_#t~nondet62#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {8603#true} is VALID [2022-02-20 19:53:53,729 INFO L290 TraceCheckUtils]: 3: Hoare triple {8603#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {8605#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:53:53,729 INFO L290 TraceCheckUtils]: 4: Hoare triple {8605#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {8606#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:53:53,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {8606#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#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; {8607#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:53:53,730 INFO L290 TraceCheckUtils]: 6: Hoare triple {8607#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {8604#false} is VALID [2022-02-20 19:53:53,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {8604#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {8604#false} is VALID [2022-02-20 19:53:53,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {8604#false} assume !false;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; {8604#false} is VALID [2022-02-20 19:53:53,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {8604#false} assume !(0 != ~mode1~0 % 256); {8604#false} is VALID [2022-02-20 19:53:53,732 INFO L290 TraceCheckUtils]: 10: Hoare triple {8604#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {8604#false} is VALID [2022-02-20 19:53:53,732 INFO L290 TraceCheckUtils]: 11: Hoare triple {8604#false} ~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; {8604#false} is VALID [2022-02-20 19:53:53,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {8604#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; {8604#false} is VALID [2022-02-20 19:53:53,733 INFO L290 TraceCheckUtils]: 13: Hoare triple {8604#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {8604#false} is VALID [2022-02-20 19:53:53,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {8604#false} assume !(node2_~m2~0#1 != ~nomsg~0); {8604#false} is VALID [2022-02-20 19:53:53,733 INFO L290 TraceCheckUtils]: 15: Hoare triple {8604#false} ~mode2~0 := 0; {8604#false} is VALID [2022-02-20 19:53:53,733 INFO L290 TraceCheckUtils]: 16: Hoare triple {8604#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; {8604#false} is VALID [2022-02-20 19:53:53,734 INFO L290 TraceCheckUtils]: 17: Hoare triple {8604#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {8604#false} is VALID [2022-02-20 19:53:53,734 INFO L290 TraceCheckUtils]: 18: Hoare triple {8604#false} assume !(node3_~m3~0#1 != ~nomsg~0); {8604#false} is VALID [2022-02-20 19:53:53,734 INFO L290 TraceCheckUtils]: 19: Hoare triple {8604#false} ~mode3~0 := 0; {8604#false} is VALID [2022-02-20 19:53:53,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {8604#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; {8604#false} is VALID [2022-02-20 19:53:53,735 INFO L290 TraceCheckUtils]: 21: Hoare triple {8604#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {8604#false} is VALID [2022-02-20 19:53:53,735 INFO L290 TraceCheckUtils]: 22: Hoare triple {8604#false} assume !(node4_~m4~0#1 != ~nomsg~0); {8604#false} is VALID [2022-02-20 19:53:53,735 INFO L290 TraceCheckUtils]: 23: Hoare triple {8604#false} ~mode4~0 := 0; {8604#false} is VALID [2022-02-20 19:53:53,735 INFO L290 TraceCheckUtils]: 24: Hoare triple {8604#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; {8604#false} is VALID [2022-02-20 19:53:53,736 INFO L290 TraceCheckUtils]: 25: Hoare triple {8604#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {8604#false} is VALID [2022-02-20 19:53:53,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {8604#false} assume !(node5_~m5~0#1 != ~nomsg~0); {8604#false} is VALID [2022-02-20 19:53:53,736 INFO L290 TraceCheckUtils]: 27: Hoare triple {8604#false} ~mode5~0 := 0; {8604#false} is VALID [2022-02-20 19:53:53,736 INFO L290 TraceCheckUtils]: 28: Hoare triple {8604#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {8604#false} is VALID [2022-02-20 19:53:53,737 INFO L290 TraceCheckUtils]: 29: Hoare triple {8604#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {8604#false} is VALID [2022-02-20 19:53:53,737 INFO L290 TraceCheckUtils]: 30: Hoare triple {8604#false} assume !(node6_~m6~0#1 != ~nomsg~0); {8604#false} is VALID [2022-02-20 19:53:53,737 INFO L290 TraceCheckUtils]: 31: Hoare triple {8604#false} ~mode6~0 := 0; {8604#false} is VALID [2022-02-20 19:53:53,737 INFO L290 TraceCheckUtils]: 32: Hoare triple {8604#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {8604#false} is VALID [2022-02-20 19:53:53,738 INFO L290 TraceCheckUtils]: 33: Hoare triple {8604#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {8604#false} is VALID [2022-02-20 19:53:53,738 INFO L290 TraceCheckUtils]: 34: Hoare triple {8604#false} assume !(node7_~m7~0#1 != ~nomsg~0); {8604#false} is VALID [2022-02-20 19:53:53,738 INFO L290 TraceCheckUtils]: 35: Hoare triple {8604#false} ~mode7~0 := 0; {8604#false} is VALID [2022-02-20 19:53:53,738 INFO L290 TraceCheckUtils]: 36: Hoare triple {8604#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {8604#false} is VALID [2022-02-20 19:53:53,738 INFO L290 TraceCheckUtils]: 37: Hoare triple {8604#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {8604#false} is VALID [2022-02-20 19:53:53,739 INFO L290 TraceCheckUtils]: 38: Hoare triple {8604#false} assume !(node8_~m8~0#1 != ~nomsg~0); {8604#false} is VALID [2022-02-20 19:53:53,739 INFO L290 TraceCheckUtils]: 39: Hoare triple {8604#false} ~mode8~0 := 0; {8604#false} is VALID [2022-02-20 19:53:53,739 INFO L290 TraceCheckUtils]: 40: Hoare triple {8604#false} assume { :end_inline_node8 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {8604#false} is VALID [2022-02-20 19:53:53,740 INFO L290 TraceCheckUtils]: 41: Hoare triple {8604#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {8604#false} is VALID [2022-02-20 19:53:53,740 INFO L290 TraceCheckUtils]: 42: Hoare triple {8604#false} check_#res#1 := check_~tmp~1#1; {8604#false} is VALID [2022-02-20 19:53:53,740 INFO L290 TraceCheckUtils]: 43: Hoare triple {8604#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#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; {8604#false} is VALID [2022-02-20 19:53:53,740 INFO L290 TraceCheckUtils]: 44: Hoare triple {8604#false} assume 0 == assert_~arg#1 % 256; {8604#false} is VALID [2022-02-20 19:53:53,741 INFO L290 TraceCheckUtils]: 45: Hoare triple {8604#false} assume !false; {8604#false} is VALID [2022-02-20 19:53:53,741 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:53:53,741 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:53,742 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258051096] [2022-02-20 19:53:53,742 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258051096] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:53,742 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:53,742 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:53:53,742 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593190430] [2022-02-20 19:53:53,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:53,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2022-02-20 19:53:53,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:53,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:53:53,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:53,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:53:53,778 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:53,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:53:53,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:53:53,779 INFO L87 Difference]: Start difference. First operand 1650 states and 3066 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:53:58,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:58,322 INFO L93 Difference]: Finished difference Result 1732 states and 3194 transitions. [2022-02-20 19:53:58,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:53:58,323 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2022-02-20 19:53:58,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:58,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:53:58,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1819 transitions. [2022-02-20 19:53:58,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:53:58,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1819 transitions. [2022-02-20 19:53:58,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1819 transitions. [2022-02-20 19:53:59,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1819 edges. 1819 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:59,896 INFO L225 Difference]: With dead ends: 1732 [2022-02-20 19:53:59,896 INFO L226 Difference]: Without dead ends: 1650 [2022-02-20 19:53:59,896 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:53:59,897 INFO L933 BasicCegarLoop]: 1689 mSDtfsCounter, 3 mSDsluCounter, 5003 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6692 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:53:59,898 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6692 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:53:59,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2022-02-20 19:53:59,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1650. [2022-02-20 19:53:59,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:53:59,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1650 states. Second operand has 1650 states, 1648 states have (on average 1.8234223300970873) internal successors, (3005), 1649 states have internal predecessors, (3005), 0 states have call successors, (0), 0 states have 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:53:59,944 INFO L74 IsIncluded]: Start isIncluded. First operand 1650 states. Second operand has 1650 states, 1648 states have (on average 1.8234223300970873) internal successors, (3005), 1649 states have internal predecessors, (3005), 0 states have call successors, (0), 0 states have 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:53:59,947 INFO L87 Difference]: Start difference. First operand 1650 states. Second operand has 1650 states, 1648 states have (on average 1.8234223300970873) internal successors, (3005), 1649 states have internal predecessors, (3005), 0 states have call successors, (0), 0 states have 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:54:00,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:00,079 INFO L93 Difference]: Finished difference Result 1650 states and 3005 transitions. [2022-02-20 19:54:00,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 3005 transitions. [2022-02-20 19:54:00,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:00,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:00,087 INFO L74 IsIncluded]: Start isIncluded. First operand has 1650 states, 1648 states have (on average 1.8234223300970873) internal successors, (3005), 1649 states have internal predecessors, (3005), 0 states have call successors, (0), 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 1650 states. [2022-02-20 19:54:00,091 INFO L87 Difference]: Start difference. First operand has 1650 states, 1648 states have (on average 1.8234223300970873) internal successors, (3005), 1649 states have internal predecessors, (3005), 0 states have call successors, (0), 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 1650 states. [2022-02-20 19:54:00,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:00,218 INFO L93 Difference]: Finished difference Result 1650 states and 3005 transitions. [2022-02-20 19:54:00,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 3005 transitions. [2022-02-20 19:54:00,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:00,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:00,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:00,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:00,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1650 states, 1648 states have (on average 1.8234223300970873) internal successors, (3005), 1649 states have internal predecessors, (3005), 0 states have call successors, (0), 0 states have 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:54:00,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1650 states and 3005 transitions. [2022-02-20 19:54:00,364 INFO L78 Accepts]: Start accepts. Automaton has 1650 states and 3005 transitions. Word has length 46 [2022-02-20 19:54:00,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:00,365 INFO L470 AbstractCegarLoop]: Abstraction has 1650 states and 3005 transitions. [2022-02-20 19:54:00,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:54:00,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 3005 transitions. [2022-02-20 19:54:00,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-20 19:54:00,369 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:00,369 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:54:00,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:54:00,369 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:00,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:00,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1422063224, now seen corresponding path program 1 times [2022-02-20 19:54:00,370 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:00,371 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017820694] [2022-02-20 19:54:00,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:00,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:00,522 INFO L290 TraceCheckUtils]: 0: Hoare triple {15352#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(32, 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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~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; {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {15354#(<= ~a2~0 170)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {15354#(<= ~a2~0 170)} assume !(0 != main_#t~nondet62#1);havoc main_#t~nondet62#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet60#1, main2_#t~ret61#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,524 INFO L290 TraceCheckUtils]: 3: Hoare triple {15354#(<= ~a2~0 170)} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet60#1 && main2_#t~nondet60#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet60#1;havoc main2_#t~nondet60#1; {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,524 INFO L290 TraceCheckUtils]: 4: Hoare triple {15354#(<= ~a2~0 170)} 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~ret57#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {15354#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,525 INFO L290 TraceCheckUtils]: 6: Hoare triple {15354#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {15354#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {15354#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {15354#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,527 INFO L290 TraceCheckUtils]: 10: Hoare triple {15354#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {15354#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,528 INFO L290 TraceCheckUtils]: 12: Hoare triple {15354#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,528 INFO L290 TraceCheckUtils]: 13: Hoare triple {15354#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {15354#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,529 INFO L290 TraceCheckUtils]: 15: Hoare triple {15354#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,529 INFO L290 TraceCheckUtils]: 16: Hoare triple {15354#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,530 INFO L290 TraceCheckUtils]: 17: Hoare triple {15354#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,530 INFO L290 TraceCheckUtils]: 18: Hoare triple {15354#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,531 INFO L290 TraceCheckUtils]: 19: Hoare triple {15354#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,531 INFO L290 TraceCheckUtils]: 20: Hoare triple {15354#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,532 INFO L290 TraceCheckUtils]: 21: Hoare triple {15354#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,532 INFO L290 TraceCheckUtils]: 22: Hoare triple {15354#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,532 INFO L290 TraceCheckUtils]: 23: Hoare triple {15354#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,533 INFO L290 TraceCheckUtils]: 24: Hoare triple {15354#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,533 INFO L290 TraceCheckUtils]: 25: Hoare triple {15354#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,534 INFO L290 TraceCheckUtils]: 26: Hoare triple {15354#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,534 INFO L290 TraceCheckUtils]: 27: Hoare triple {15354#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,534 INFO L290 TraceCheckUtils]: 28: Hoare triple {15354#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,535 INFO L290 TraceCheckUtils]: 29: Hoare triple {15354#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,535 INFO L290 TraceCheckUtils]: 30: Hoare triple {15354#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,536 INFO L290 TraceCheckUtils]: 31: Hoare triple {15354#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,536 INFO L290 TraceCheckUtils]: 32: Hoare triple {15354#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,537 INFO L290 TraceCheckUtils]: 33: Hoare triple {15354#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,537 INFO L290 TraceCheckUtils]: 34: Hoare triple {15354#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,537 INFO L290 TraceCheckUtils]: 35: Hoare triple {15354#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,538 INFO L290 TraceCheckUtils]: 36: Hoare triple {15354#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,538 INFO L290 TraceCheckUtils]: 37: Hoare triple {15354#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,539 INFO L290 TraceCheckUtils]: 38: Hoare triple {15354#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,539 INFO L290 TraceCheckUtils]: 39: Hoare triple {15354#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,539 INFO L290 TraceCheckUtils]: 40: Hoare triple {15354#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,540 INFO L290 TraceCheckUtils]: 41: Hoare triple {15354#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,540 INFO L290 TraceCheckUtils]: 42: Hoare triple {15354#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,541 INFO L290 TraceCheckUtils]: 43: Hoare triple {15354#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,541 INFO L290 TraceCheckUtils]: 44: Hoare triple {15354#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,542 INFO L290 TraceCheckUtils]: 45: Hoare triple {15354#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,542 INFO L290 TraceCheckUtils]: 46: Hoare triple {15354#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,542 INFO L290 TraceCheckUtils]: 47: Hoare triple {15354#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,543 INFO L290 TraceCheckUtils]: 48: Hoare triple {15354#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,543 INFO L290 TraceCheckUtils]: 49: Hoare triple {15354#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,544 INFO L290 TraceCheckUtils]: 50: Hoare triple {15354#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,544 INFO L290 TraceCheckUtils]: 51: Hoare triple {15354#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,544 INFO L290 TraceCheckUtils]: 52: Hoare triple {15354#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,545 INFO L290 TraceCheckUtils]: 53: Hoare triple {15354#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,545 INFO L290 TraceCheckUtils]: 54: Hoare triple {15354#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,546 INFO L290 TraceCheckUtils]: 55: Hoare triple {15354#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,546 INFO L290 TraceCheckUtils]: 56: Hoare triple {15354#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,546 INFO L290 TraceCheckUtils]: 57: Hoare triple {15354#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,547 INFO L290 TraceCheckUtils]: 58: Hoare triple {15354#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,547 INFO L290 TraceCheckUtils]: 59: Hoare triple {15354#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,548 INFO L290 TraceCheckUtils]: 60: Hoare triple {15354#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,548 INFO L290 TraceCheckUtils]: 61: Hoare triple {15354#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,549 INFO L290 TraceCheckUtils]: 62: Hoare triple {15354#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,549 INFO L290 TraceCheckUtils]: 63: Hoare triple {15354#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,549 INFO L290 TraceCheckUtils]: 64: Hoare triple {15354#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,550 INFO L290 TraceCheckUtils]: 65: Hoare triple {15354#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,550 INFO L290 TraceCheckUtils]: 66: Hoare triple {15354#(<= ~a2~0 170)} assume !((((189 < ~a2~0 && 281 >= ~a2~0) && 4 == calculate_output_~input#1 && ((12 == ~a7~0 && 255 < ~a17~0) || (13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a7~0))) && 4 == ~a5~0) && 14 == ~a24~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,551 INFO L290 TraceCheckUtils]: 67: Hoare triple {15354#(<= ~a2~0 170)} assume !(((13 == ~a24~0 && (2 == calculate_output_~input#1 && (13 == ~a7~0 || 14 == ~a7~0)) && 3 == ~a5~0) && ~a17~0 <= -108) && 189 < ~a2~0 && 281 >= ~a2~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,551 INFO L290 TraceCheckUtils]: 68: Hoare triple {15354#(<= ~a2~0 170)} assume !((((((12 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a7~0) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a7~0)) && 1 == calculate_output_~input#1) && 14 == ~a24~0) && 189 < ~a2~0 && 281 >= ~a2~0) && 5 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,551 INFO L290 TraceCheckUtils]: 69: Hoare triple {15354#(<= ~a2~0 170)} assume !((((189 < ~a2~0 && 281 >= ~a2~0) && (((~a17~0 <= -108 && 13 == ~a7~0) || (~a17~0 <= -108 && 14 == ~a7~0)) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 12 == ~a7~0)) && 4 == calculate_output_~input#1) && 3 == ~a5~0) && 14 == ~a24~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,552 INFO L290 TraceCheckUtils]: 70: Hoare triple {15354#(<= ~a2~0 170)} assume !(6 == ~a5~0 && (13 == ~a24~0 && 6 == calculate_output_~input#1 && (((13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || (14 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0)) || (255 < ~a17~0 && 12 == ~a7~0))) && ~a2~0 <= 189); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,552 INFO L290 TraceCheckUtils]: 71: Hoare triple {15354#(<= ~a2~0 170)} assume !((13 == ~a24~0 && (189 < ~a2~0 && 281 >= ~a2~0) && (((13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a7~0)) || (255 < ~a17~0 && 12 == ~a7~0)) && 3 == calculate_output_~input#1) && 6 == ~a5~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,553 INFO L290 TraceCheckUtils]: 72: Hoare triple {15354#(<= ~a2~0 170)} assume !(4 == ~a5~0 && ~a2~0 <= 189 && ((1 == calculate_output_~input#1 && (13 == ~a7~0 || 14 == ~a7~0)) && ~a17~0 <= -108) && 15 == ~a24~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,553 INFO L290 TraceCheckUtils]: 73: Hoare triple {15354#(<= ~a2~0 170)} assume !(15 == ~a24~0 && (((189 < ~a2~0 && 281 >= ~a2~0) && 1 == calculate_output_~input#1 && 4 == ~a5~0) && 13 == ~a7~0) && 255 < ~a17~0); {15354#(<= ~a2~0 170)} is VALID [2022-02-20 19:54:00,554 INFO L290 TraceCheckUtils]: 74: Hoare triple {15354#(<= ~a2~0 170)} assume 4 == ~a5~0 && (189 < ~a2~0 && 281 >= ~a2~0) && 14 == ~a24~0 && (((-108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a7~0) || (12 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0)) && 4 == calculate_output_~input#1;~a2~0 := -503579 + ~a2~0;~a17~0 := -274764 + (if 5 * ~a17~0 < 0 && 0 != 5 * ~a17~0 % 5 then 1 + 5 * ~a17~0 / 5 else 5 * ~a17~0 / 5);~a7~0 := 14;~a24~0 := 15;~a5~0 := 5;calculate_output_#res#1 := -1; {15353#false} is VALID [2022-02-20 19:54:00,554 INFO L290 TraceCheckUtils]: 75: Hoare triple {15353#false} main2_#t~ret61#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main2_#t~ret61#1 && main2_#t~ret61#1 <= 2147483647;main2_~output~0#1 := main2_#t~ret61#1;havoc main2_#t~ret61#1; {15353#false} is VALID [2022-02-20 19:54:00,555 INFO L290 TraceCheckUtils]: 76: Hoare triple {15353#false} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet60#1 && main2_#t~nondet60#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet60#1;havoc main2_#t~nondet60#1; {15353#false} is VALID [2022-02-20 19:54:00,555 INFO L290 TraceCheckUtils]: 77: Hoare triple {15353#false} 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~ret57#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {15353#false} is VALID [2022-02-20 19:54:00,555 INFO L290 TraceCheckUtils]: 78: Hoare triple {15353#false} assume (((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {15353#false} is VALID [2022-02-20 19:54:00,555 INFO L290 TraceCheckUtils]: 79: Hoare triple {15353#false} assume !false; {15353#false} is VALID [2022-02-20 19:54:00,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:54:00,556 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:00,556 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017820694] [2022-02-20 19:54:00,557 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017820694] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:00,557 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:00,557 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:54:00,557 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133098222] [2022-02-20 19:54:00,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:00,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2022-02-20 19:54:00,558 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:00,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:00,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:00,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:54:00,612 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:00,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:54:00,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:54:00,613 INFO L87 Difference]: Start difference. First operand 1650 states and 3005 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:05,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:05,922 INFO L93 Difference]: Finished difference Result 4658 states and 8629 transitions. [2022-02-20 19:54:05,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:54:05,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2022-02-20 19:54:05,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:05,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:05,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4504 transitions. [2022-02-20 19:54:05,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:05,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4504 transitions. [2022-02-20 19:54:05,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4504 transitions. [2022-02-20 19:54:09,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4504 edges. 4504 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:09,724 INFO L225 Difference]: With dead ends: 4658 [2022-02-20 19:54:09,724 INFO L226 Difference]: Without dead ends: 3154 [2022-02-20 19:54:09,725 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:54:09,727 INFO L933 BasicCegarLoop]: 538 mSDtfsCounter, 1108 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1108 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 2859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:09,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1108 Valid, 545 Invalid, 2859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-02-20 19:54:09,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3154 states. [2022-02-20 19:54:09,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3154 to 3152. [2022-02-20 19:54:09,806 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:09,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3154 states. Second operand has 3152 states, 3150 states have (on average 1.6387301587301588) internal successors, (5162), 3151 states have internal predecessors, (5162), 0 states have call successors, (0), 0 states have 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:54:09,832 INFO L74 IsIncluded]: Start isIncluded. First operand 3154 states. Second operand has 3152 states, 3150 states have (on average 1.6387301587301588) internal successors, (5162), 3151 states have internal predecessors, (5162), 0 states have call successors, (0), 0 states have 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:54:09,838 INFO L87 Difference]: Start difference. First operand 3154 states. Second operand has 3152 states, 3150 states have (on average 1.6387301587301588) internal successors, (5162), 3151 states have internal predecessors, (5162), 0 states have call successors, (0), 0 states have 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:54:10,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:10,250 INFO L93 Difference]: Finished difference Result 3154 states and 5163 transitions. [2022-02-20 19:54:10,250 INFO L276 IsEmpty]: Start isEmpty. Operand 3154 states and 5163 transitions. [2022-02-20 19:54:10,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:10,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:10,260 INFO L74 IsIncluded]: Start isIncluded. First operand has 3152 states, 3150 states have (on average 1.6387301587301588) internal successors, (5162), 3151 states have internal predecessors, (5162), 0 states have call successors, (0), 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 3154 states. [2022-02-20 19:54:10,265 INFO L87 Difference]: Start difference. First operand has 3152 states, 3150 states have (on average 1.6387301587301588) internal successors, (5162), 3151 states have internal predecessors, (5162), 0 states have call successors, (0), 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 3154 states. [2022-02-20 19:54:10,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:10,574 INFO L93 Difference]: Finished difference Result 3154 states and 5163 transitions. [2022-02-20 19:54:10,574 INFO L276 IsEmpty]: Start isEmpty. Operand 3154 states and 5163 transitions. [2022-02-20 19:54:10,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:10,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:10,578 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:10,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:10,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3152 states, 3150 states have (on average 1.6387301587301588) internal successors, (5162), 3151 states have internal predecessors, (5162), 0 states have call successors, (0), 0 states have 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:54:10,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3152 states to 3152 states and 5162 transitions. [2022-02-20 19:54:10,903 INFO L78 Accepts]: Start accepts. Automaton has 3152 states and 5162 transitions. Word has length 80 [2022-02-20 19:54:10,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:10,904 INFO L470 AbstractCegarLoop]: Abstraction has 3152 states and 5162 transitions. [2022-02-20 19:54:10,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:10,904 INFO L276 IsEmpty]: Start isEmpty. Operand 3152 states and 5162 transitions. [2022-02-20 19:54:10,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-02-20 19:54:10,905 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:10,906 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:10,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:54:10,906 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:10,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:10,907 INFO L85 PathProgramCache]: Analyzing trace with hash 315323888, now seen corresponding path program 1 times [2022-02-20 19:54:10,907 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:10,907 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44800060] [2022-02-20 19:54:10,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:10,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:11,158 INFO L290 TraceCheckUtils]: 0: Hoare triple {29549#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(32, 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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~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; {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:11,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:11,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !(0 != main_#t~nondet62#1);havoc main_#t~nondet62#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet60#1, main2_#t~ret61#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:11,160 INFO L290 TraceCheckUtils]: 3: Hoare triple {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet60#1 && main2_#t~nondet60#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet60#1;havoc main2_#t~nondet60#1; {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:11,161 INFO L290 TraceCheckUtils]: 4: Hoare triple {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 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~ret57#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:11,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:11,162 INFO L290 TraceCheckUtils]: 6: Hoare triple {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:11,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:11,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:11,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:11,164 INFO L290 TraceCheckUtils]: 10: Hoare triple {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:11,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:11,166 INFO L290 TraceCheckUtils]: 12: Hoare triple {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:11,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:11,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:11,167 INFO L290 TraceCheckUtils]: 15: Hoare triple {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:11,168 INFO L290 TraceCheckUtils]: 16: Hoare triple {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:11,168 INFO L290 TraceCheckUtils]: 17: Hoare triple {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:11,169 INFO L290 TraceCheckUtils]: 18: Hoare triple {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:11,169 INFO L290 TraceCheckUtils]: 19: Hoare triple {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:11,170 INFO L290 TraceCheckUtils]: 20: Hoare triple {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:11,170 INFO L290 TraceCheckUtils]: 21: Hoare triple {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:11,171 INFO L290 TraceCheckUtils]: 22: Hoare triple {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:11,171 INFO L290 TraceCheckUtils]: 23: Hoare triple {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:11,172 INFO L290 TraceCheckUtils]: 24: Hoare triple {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:11,172 INFO L290 TraceCheckUtils]: 25: Hoare triple {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:11,173 INFO L290 TraceCheckUtils]: 26: Hoare triple {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:11,173 INFO L290 TraceCheckUtils]: 27: Hoare triple {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:11,174 INFO L290 TraceCheckUtils]: 28: Hoare triple {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:11,175 INFO L290 TraceCheckUtils]: 29: Hoare triple {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:11,176 INFO L290 TraceCheckUtils]: 30: Hoare triple {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:11,176 INFO L290 TraceCheckUtils]: 31: Hoare triple {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:11,183 INFO L290 TraceCheckUtils]: 32: Hoare triple {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:11,184 INFO L290 TraceCheckUtils]: 33: Hoare triple {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:11,185 INFO L290 TraceCheckUtils]: 34: Hoare triple {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:11,185 INFO L290 TraceCheckUtils]: 35: Hoare triple {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:11,186 INFO L290 TraceCheckUtils]: 36: Hoare triple {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:11,186 INFO L290 TraceCheckUtils]: 37: Hoare triple {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:11,187 INFO L290 TraceCheckUtils]: 38: Hoare triple {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:11,188 INFO L290 TraceCheckUtils]: 39: Hoare triple {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:11,188 INFO L290 TraceCheckUtils]: 40: Hoare triple {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:11,189 INFO L290 TraceCheckUtils]: 41: Hoare triple {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:11,189 INFO L290 TraceCheckUtils]: 42: Hoare triple {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:11,190 INFO L290 TraceCheckUtils]: 43: Hoare triple {29551#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 4 == ~a5~0); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,190 INFO L290 TraceCheckUtils]: 44: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,191 INFO L290 TraceCheckUtils]: 45: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,191 INFO L290 TraceCheckUtils]: 46: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,192 INFO L290 TraceCheckUtils]: 47: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,192 INFO L290 TraceCheckUtils]: 48: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,193 INFO L290 TraceCheckUtils]: 49: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,193 INFO L290 TraceCheckUtils]: 50: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,193 INFO L290 TraceCheckUtils]: 51: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,194 INFO L290 TraceCheckUtils]: 52: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,194 INFO L290 TraceCheckUtils]: 53: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,194 INFO L290 TraceCheckUtils]: 54: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,195 INFO L290 TraceCheckUtils]: 55: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,195 INFO L290 TraceCheckUtils]: 56: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,196 INFO L290 TraceCheckUtils]: 57: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,196 INFO L290 TraceCheckUtils]: 58: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,196 INFO L290 TraceCheckUtils]: 59: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,197 INFO L290 TraceCheckUtils]: 60: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,197 INFO L290 TraceCheckUtils]: 61: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,197 INFO L290 TraceCheckUtils]: 62: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,198 INFO L290 TraceCheckUtils]: 63: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,198 INFO L290 TraceCheckUtils]: 64: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,198 INFO L290 TraceCheckUtils]: 65: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,199 INFO L290 TraceCheckUtils]: 66: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((189 < ~a2~0 && 281 >= ~a2~0) && 4 == calculate_output_~input#1 && ((12 == ~a7~0 && 255 < ~a17~0) || (13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a7~0))) && 4 == ~a5~0) && 14 == ~a24~0); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,199 INFO L290 TraceCheckUtils]: 67: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume !(((13 == ~a24~0 && (2 == calculate_output_~input#1 && (13 == ~a7~0 || 14 == ~a7~0)) && 3 == ~a5~0) && ~a17~0 <= -108) && 189 < ~a2~0 && 281 >= ~a2~0); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,199 INFO L290 TraceCheckUtils]: 68: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((((12 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a7~0) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a7~0)) && 1 == calculate_output_~input#1) && 14 == ~a24~0) && 189 < ~a2~0 && 281 >= ~a2~0) && 5 == ~a5~0); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,200 INFO L290 TraceCheckUtils]: 69: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((189 < ~a2~0 && 281 >= ~a2~0) && (((~a17~0 <= -108 && 13 == ~a7~0) || (~a17~0 <= -108 && 14 == ~a7~0)) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 12 == ~a7~0)) && 4 == calculate_output_~input#1) && 3 == ~a5~0) && 14 == ~a24~0); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,200 INFO L290 TraceCheckUtils]: 70: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume !(6 == ~a5~0 && (13 == ~a24~0 && 6 == calculate_output_~input#1 && (((13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || (14 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0)) || (255 < ~a17~0 && 12 == ~a7~0))) && ~a2~0 <= 189); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,200 INFO L290 TraceCheckUtils]: 71: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume !((13 == ~a24~0 && (189 < ~a2~0 && 281 >= ~a2~0) && (((13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a7~0)) || (255 < ~a17~0 && 12 == ~a7~0)) && 3 == calculate_output_~input#1) && 6 == ~a5~0); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,201 INFO L290 TraceCheckUtils]: 72: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume !(4 == ~a5~0 && ~a2~0 <= 189 && ((1 == calculate_output_~input#1 && (13 == ~a7~0 || 14 == ~a7~0)) && ~a17~0 <= -108) && 15 == ~a24~0); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,201 INFO L290 TraceCheckUtils]: 73: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume !(15 == ~a24~0 && (((189 < ~a2~0 && 281 >= ~a2~0) && 1 == calculate_output_~input#1 && 4 == ~a5~0) && 13 == ~a7~0) && 255 < ~a17~0); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,202 INFO L290 TraceCheckUtils]: 74: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume !(4 == ~a5~0 && (189 < ~a2~0 && 281 >= ~a2~0) && 14 == ~a24~0 && (((-108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a7~0) || (12 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0)) && 4 == calculate_output_~input#1); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,202 INFO L290 TraceCheckUtils]: 75: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume !(((5 == ~a5~0 && ~a2~0 <= 189 && 1 == calculate_output_~input#1 && 15 == ~a24~0) && 255 < ~a17~0) && 14 == ~a7~0); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,202 INFO L290 TraceCheckUtils]: 76: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume !((~a17~0 <= -108 && (189 < ~a2~0 && 281 >= ~a2~0) && ((14 == ~a7~0 || 12 == ~a7~0 || 13 == ~a7~0) && 1 == calculate_output_~input#1) && 15 == ~a24~0) && 5 == ~a5~0); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,203 INFO L290 TraceCheckUtils]: 77: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume !((~a17~0 <= -108 && ((189 < ~a2~0 && 281 >= ~a2~0) && (12 == ~a7~0 || 13 == ~a7~0) && 5 == calculate_output_~input#1) && 13 == ~a24~0) && 6 == ~a5~0); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,203 INFO L290 TraceCheckUtils]: 78: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume !((13 == ~a24~0 && ~a17~0 <= -108 && (4 == ~a5~0 && 2 == calculate_output_~input#1) && 189 < ~a2~0 && 281 >= ~a2~0) && 12 == ~a7~0); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,204 INFO L290 TraceCheckUtils]: 79: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume !((3 == ~a5~0 && (-108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0 && (12 == ~a7~0 || 13 == ~a7~0) && 4 == calculate_output_~input#1) && 189 < ~a2~0 && 281 >= ~a2~0); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,204 INFO L290 TraceCheckUtils]: 80: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume !((111 < ~a17~0 && 255 >= ~a17~0) && 4 == ~a5~0 && ~a2~0 <= 189 && 15 == ~a24~0 && (13 == ~a7~0 || 14 == ~a7~0) && 5 == calculate_output_~input#1); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,204 INFO L290 TraceCheckUtils]: 81: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume !(~a2~0 <= 189 && (((((-108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a7~0) || ((111 < ~a17~0 && 255 >= ~a17~0) && 12 == ~a7~0)) && 6 == calculate_output_~input#1) && 7 == ~a5~0) && 13 == ~a24~0); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,205 INFO L290 TraceCheckUtils]: 82: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume !(((((13 == ~a24~0 && ~a17~0 <= -108 && 13 == ~a7~0) && 5 == ~a5~0) || (4 == ~a5~0 && 15 == ~a24~0 && 14 == ~a7~0 && 255 < ~a17~0) || (5 == ~a5~0 && 13 == ~a24~0 && 12 == ~a7~0 && ~a17~0 <= -108)) && 1 == calculate_output_~input#1) && 189 < ~a2~0 && 281 >= ~a2~0); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,205 INFO L290 TraceCheckUtils]: 83: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume !(((13 == ~a24~0 && ((13 == ~a7~0 || 14 == ~a7~0) && 5 == calculate_output_~input#1) && 189 < ~a2~0 && 281 >= ~a2~0) && 3 == ~a5~0) && ~a17~0 <= -108); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,206 INFO L290 TraceCheckUtils]: 84: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume !((4 == ~a5~0 && ((5 == calculate_output_~input#1 && (12 == ~a7~0 || 13 == ~a7~0)) && 14 == ~a24~0) && 189 < ~a2~0 && 281 >= ~a2~0) && ~a17~0 <= -108); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,206 INFO L290 TraceCheckUtils]: 85: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume !(14 == ~a24~0 && 3 == ~a5~0 && ((((-108 < ~a17~0 && 111 >= ~a17~0) && 12 == ~a7~0) || (~a17~0 <= -108 && 13 == ~a7~0) || (14 == ~a7~0 && ~a17~0 <= -108)) && 2 == calculate_output_~input#1) && 189 < ~a2~0 && 281 >= ~a2~0); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,206 INFO L290 TraceCheckUtils]: 86: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume !(((4 == ~a5~0 && (1 == calculate_output_~input#1 && 15 == ~a24~0) && -108 < ~a17~0 && 111 >= ~a17~0) && ~a2~0 <= 189) && 12 == ~a7~0); {29552#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:54:11,207 INFO L290 TraceCheckUtils]: 87: Hoare triple {29552#(not (= (+ ~a7~0 (- 12)) 0))} assume ~a2~0 <= 189 && (4 == ~a5~0 && (2 == calculate_output_~input#1 && 15 == ~a24~0) && 12 == ~a7~0) && -108 < ~a17~0 && 111 >= ~a17~0;~a7~0 := 14;~a24~0 := 13;~a5~0 := 5;calculate_output_#res#1 := 26; {29550#false} is VALID [2022-02-20 19:54:11,207 INFO L290 TraceCheckUtils]: 88: Hoare triple {29550#false} main2_#t~ret61#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main2_#t~ret61#1 && main2_#t~ret61#1 <= 2147483647;main2_~output~0#1 := main2_#t~ret61#1;havoc main2_#t~ret61#1; {29550#false} is VALID [2022-02-20 19:54:11,207 INFO L290 TraceCheckUtils]: 89: Hoare triple {29550#false} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet60#1 && main2_#t~nondet60#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet60#1;havoc main2_#t~nondet60#1; {29550#false} is VALID [2022-02-20 19:54:11,207 INFO L290 TraceCheckUtils]: 90: Hoare triple {29550#false} 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~ret57#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {29550#false} is VALID [2022-02-20 19:54:11,207 INFO L290 TraceCheckUtils]: 91: Hoare triple {29550#false} assume (((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {29550#false} is VALID [2022-02-20 19:54:11,207 INFO L290 TraceCheckUtils]: 92: Hoare triple {29550#false} assume !false; {29550#false} is VALID [2022-02-20 19:54:11,208 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:54:11,208 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:11,209 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44800060] [2022-02-20 19:54:11,209 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44800060] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:11,209 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:11,209 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:54:11,209 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257025177] [2022-02-20 19:54:11,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:11,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2022-02-20 19:54:11,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:11,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have 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:54:11,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:11,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:54:11,279 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:11,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:54:11,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:54:11,280 INFO L87 Difference]: Start difference. First operand 3152 states and 5162 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have 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:54:23,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:23,456 INFO L93 Difference]: Finished difference Result 8411 states and 13620 transitions. [2022-02-20 19:54:23,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 19:54:23,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2022-02-20 19:54:23,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:23,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have 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:54:23,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5499 transitions. [2022-02-20 19:54:23,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have 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:54:23,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5499 transitions. [2022-02-20 19:54:23,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 5499 transitions.