./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem18_label03.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/eca-rers2012/Problem18_label03.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 38485e244c681c1fbb49eda40c64ac8e945460513c205b9d5f83ef411865faaa --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 15:57:16,184 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 15:57:16,186 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 15:57:16,227 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 15:57:16,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 15:57:16,230 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 15:57:16,232 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 15:57:16,234 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 15:57:16,236 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 15:57:16,239 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 15:57:16,240 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 15:57:16,241 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 15:57:16,241 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 15:57:16,243 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 15:57:16,244 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 15:57:16,247 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 15:57:16,248 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 15:57:16,248 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 15:57:16,250 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 15:57:16,255 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 15:57:16,257 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 15:57:16,257 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 15:57:16,259 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 15:57:16,259 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 15:57:16,265 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 15:57:16,266 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 15:57:16,266 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 15:57:16,267 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 15:57:16,268 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 15:57:16,268 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 15:57:16,269 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 15:57:16,269 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 15:57:16,271 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 15:57:16,271 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 15:57:16,272 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 15:57:16,273 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 15:57:16,274 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 15:57:16,274 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 15:57:16,275 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 15:57:16,275 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 15:57:16,276 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 15:57:16,277 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 15:57:16,295 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 15:57:16,297 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 15:57:16,297 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 15:57:16,297 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 15:57:16,298 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 15:57:16,298 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 15:57:16,299 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 15:57:16,299 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 15:57:16,299 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 15:57:16,299 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 15:57:16,300 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 15:57:16,300 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 15:57:16,300 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 15:57:16,300 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 15:57:16,300 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 15:57:16,300 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 15:57:16,300 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 15:57:16,301 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 15:57:16,301 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 15:57:16,301 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 15:57:16,301 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 15:57:16,301 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 15:57:16,301 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 15:57:16,301 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 15:57:16,302 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 15:57:16,302 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 15:57:16,302 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 15:57:16,303 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 15:57:16,303 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 15:57:16,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 15:57:16,303 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 15:57:16,303 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 15:57:16,304 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 15:57:16,304 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 -> 38485e244c681c1fbb49eda40c64ac8e945460513c205b9d5f83ef411865faaa [2022-02-20 15:57:16,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 15:57:16,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 15:57:16,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 15:57:16,539 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 15:57:16,540 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 15:57:16,541 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem18_label03.c [2022-02-20 15:57:16,587 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89a4f221b/d86cd968d76242a1a133d168222d907a/FLAGe93e64999 [2022-02-20 15:57:17,123 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 15:57:17,124 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label03.c [2022-02-20 15:57:17,144 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89a4f221b/d86cd968d76242a1a133d168222d907a/FLAGe93e64999 [2022-02-20 15:57:17,611 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89a4f221b/d86cd968d76242a1a133d168222d907a [2022-02-20 15:57:17,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 15:57:17,613 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 15:57:17,616 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 15:57:17,616 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 15:57:17,618 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 15:57:17,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 03:57:17" (1/1) ... [2022-02-20 15:57:17,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a9a18d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:57:17, skipping insertion in model container [2022-02-20 15:57:17,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 03:57:17" (1/1) ... [2022-02-20 15:57:17,625 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 15:57:17,692 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 15:57:17,842 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/eca-rers2012/Problem18_label03.c[1533,1546] [2022-02-20 15:57:18,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 15:57:18,420 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 15:57:18,434 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/eca-rers2012/Problem18_label03.c[1533,1546] [2022-02-20 15:57:18,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 15:57:18,764 INFO L208 MainTranslator]: Completed translation [2022-02-20 15:57:18,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:57:18 WrapperNode [2022-02-20 15:57:18,764 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 15:57:18,766 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 15:57:18,766 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 15:57:18,766 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 15:57:18,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:57:18" (1/1) ... [2022-02-20 15:57:18,802 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:57:18" (1/1) ... [2022-02-20 15:57:19,009 INFO L137 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4132 [2022-02-20 15:57:19,009 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 15:57:19,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 15:57:19,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 15:57:19,010 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 15:57:19,016 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:57:18" (1/1) ... [2022-02-20 15:57:19,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:57:18" (1/1) ... [2022-02-20 15:57:19,078 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:57:18" (1/1) ... [2022-02-20 15:57:19,079 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:57:18" (1/1) ... [2022-02-20 15:57:19,128 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:57:18" (1/1) ... [2022-02-20 15:57:19,151 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:57:18" (1/1) ... [2022-02-20 15:57:19,162 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:57:18" (1/1) ... [2022-02-20 15:57:19,180 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 15:57:19,181 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 15:57:19,181 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 15:57:19,181 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 15:57:19,182 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:57:18" (1/1) ... [2022-02-20 15:57:19,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 15:57:19,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 15:57:19,204 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 15:57:19,222 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 15:57:19,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 15:57:19,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 15:57:19,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 15:57:19,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 15:57:19,292 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 15:57:19,293 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 15:57:23,226 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 15:57:23,240 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 15:57:23,240 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 15:57:23,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 03:57:23 BoogieIcfgContainer [2022-02-20 15:57:23,243 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 15:57:23,246 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 15:57:23,246 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 15:57:23,249 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 15:57:23,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 03:57:17" (1/3) ... [2022-02-20 15:57:23,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e432c1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 03:57:23, skipping insertion in model container [2022-02-20 15:57:23,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:57:18" (2/3) ... [2022-02-20 15:57:23,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e432c1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 03:57:23, skipping insertion in model container [2022-02-20 15:57:23,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 03:57:23" (3/3) ... [2022-02-20 15:57:23,251 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem18_label03.c [2022-02-20 15:57:23,255 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 15:57:23,255 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 15:57:23,301 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 15:57:23,312 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 15:57:23,313 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 15:57:23,356 INFO L276 IsEmpty]: Start isEmpty. Operand has 757 states, 755 states have (on average 1.9125827814569536) internal successors, (1444), 756 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:57:23,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 15:57:23,360 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 15:57:23,360 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 15:57:23,360 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 15:57:23,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 15:57:23,364 INFO L85 PathProgramCache]: Analyzing trace with hash -988188511, now seen corresponding path program 1 times [2022-02-20 15:57:23,369 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 15:57:23,370 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206451323] [2022-02-20 15:57:23,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 15:57:23,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 15:57:23,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 15:57:23,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {760#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(20, 2);call #Ultimate.allocInit(12, 3);~inputD~0 := 4;~inputA~0 := 1;~inputC~0 := 3;~inputE~0 := 5;~inputB~0 := 2;~inputF~0 := 6;~a18~0 := 9;~a24~0 := 3;~a3~0 := 99;~a15~0 := 4; {762#(<= 3 ~a24~0)} is VALID [2022-02-20 15:57:23,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {762#(<= 3 ~a24~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~ret11#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1; {762#(<= 3 ~a24~0)} is VALID [2022-02-20 15:57:23,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {762#(<= 3 ~a24~0)} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~input~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {762#(<= 3 ~a24~0)} is VALID [2022-02-20 15:57:23,526 INFO L290 TraceCheckUtils]: 3: Hoare triple {762#(<= 3 ~a24~0)} assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret8#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {762#(<= 3 ~a24~0)} is VALID [2022-02-20 15:57:23,526 INFO L290 TraceCheckUtils]: 4: Hoare triple {762#(<= 3 ~a24~0)} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {762#(<= 3 ~a24~0)} is VALID [2022-02-20 15:57:23,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {762#(<= 3 ~a24~0)} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {762#(<= 3 ~a24~0)} is VALID [2022-02-20 15:57:23,527 INFO L290 TraceCheckUtils]: 6: Hoare triple {762#(<= 3 ~a24~0)} assume !(((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {762#(<= 3 ~a24~0)} is VALID [2022-02-20 15:57:23,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {762#(<= 3 ~a24~0)} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {762#(<= 3 ~a24~0)} is VALID [2022-02-20 15:57:23,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {762#(<= 3 ~a24~0)} assume !(((0 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {762#(<= 3 ~a24~0)} is VALID [2022-02-20 15:57:23,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {762#(<= 3 ~a24~0)} assume ((0 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115; {761#false} is VALID [2022-02-20 15:57:23,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {761#false} assume !false; {761#false} is VALID [2022-02-20 15:57:23,530 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 15:57:23,531 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 15:57:23,531 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206451323] [2022-02-20 15:57:23,531 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206451323] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 15:57:23,532 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 15:57:23,532 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 15:57:23,534 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200260563] [2022-02-20 15:57:23,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 15:57:23,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-02-20 15:57:23,541 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 15:57:23,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:57:23,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 15:57:23,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 15:57:23,559 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 15:57:23,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 15:57:23,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 15:57:23,582 INFO L87 Difference]: Start difference. First operand has 757 states, 755 states have (on average 1.9125827814569536) internal successors, (1444), 756 states have internal predecessors, (1444), 0 states have call successors, (0), 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 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:57:27,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:57:27,851 INFO L93 Difference]: Finished difference Result 2205 states and 4266 transitions. [2022-02-20 15:57:27,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 15:57:27,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-02-20 15:57:27,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 15:57:27,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:57:27,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4266 transitions. [2022-02-20 15:57:27,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:57:27,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4266 transitions. [2022-02-20 15:57:27,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4266 transitions. [2022-02-20 15:57:30,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4266 edges. 4266 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 15:57:30,958 INFO L225 Difference]: With dead ends: 2205 [2022-02-20 15:57:30,959 INFO L226 Difference]: Without dead ends: 1384 [2022-02-20 15:57:30,965 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 15:57:30,969 INFO L933 BasicCegarLoop]: 421 mSDtfsCounter, 708 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2232 mSolverCounterSat, 530 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 2762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 530 IncrementalHoareTripleChecker+Valid, 2232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-02-20 15:57:30,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [708 Valid, 430 Invalid, 2762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [530 Valid, 2232 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-02-20 15:57:30,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2022-02-20 15:57:31,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1384. [2022-02-20 15:57:31,055 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 15:57:31,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1384 states. Second operand has 1384 states, 1383 states have (on average 1.6514822848879247) internal successors, (2284), 1383 states have internal predecessors, (2284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:57:31,063 INFO L74 IsIncluded]: Start isIncluded. First operand 1384 states. Second operand has 1384 states, 1383 states have (on average 1.6514822848879247) internal successors, (2284), 1383 states have internal predecessors, (2284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:57:31,065 INFO L87 Difference]: Start difference. First operand 1384 states. Second operand has 1384 states, 1383 states have (on average 1.6514822848879247) internal successors, (2284), 1383 states have internal predecessors, (2284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:57:31,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:57:31,139 INFO L93 Difference]: Finished difference Result 1384 states and 2284 transitions. [2022-02-20 15:57:31,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2284 transitions. [2022-02-20 15:57:31,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:57:31,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:57:31,147 INFO L74 IsIncluded]: Start isIncluded. First operand has 1384 states, 1383 states have (on average 1.6514822848879247) internal successors, (2284), 1383 states have internal predecessors, (2284), 0 states have call successors, (0), 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 1384 states. [2022-02-20 15:57:31,149 INFO L87 Difference]: Start difference. First operand has 1384 states, 1383 states have (on average 1.6514822848879247) internal successors, (2284), 1383 states have internal predecessors, (2284), 0 states have call successors, (0), 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 1384 states. [2022-02-20 15:57:31,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:57:31,206 INFO L93 Difference]: Finished difference Result 1384 states and 2284 transitions. [2022-02-20 15:57:31,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2284 transitions. [2022-02-20 15:57:31,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:57:31,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:57:31,209 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 15:57:31,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 15:57:31,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1383 states have (on average 1.6514822848879247) internal successors, (2284), 1383 states have internal predecessors, (2284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:57:31,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2284 transitions. [2022-02-20 15:57:31,269 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 2284 transitions. Word has length 11 [2022-02-20 15:57:31,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 15:57:31,270 INFO L470 AbstractCegarLoop]: Abstraction has 1384 states and 2284 transitions. [2022-02-20 15:57:31,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:57:31,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2284 transitions. [2022-02-20 15:57:31,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 15:57:31,272 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 15:57:31,272 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 15:57:31,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 15:57:31,272 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 15:57:31,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 15:57:31,276 INFO L85 PathProgramCache]: Analyzing trace with hash -511937001, now seen corresponding path program 1 times [2022-02-20 15:57:31,276 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 15:57:31,276 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196059676] [2022-02-20 15:57:31,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 15:57:31,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 15:57:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 15:57:31,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {7145#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(20, 2);call #Ultimate.allocInit(12, 3);~inputD~0 := 4;~inputA~0 := 1;~inputC~0 := 3;~inputE~0 := 5;~inputB~0 := 2;~inputF~0 := 6;~a18~0 := 9;~a24~0 := 3;~a3~0 := 99;~a15~0 := 4; {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {7147#(<= ~a15~0 4)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~ret11#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1; {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {7147#(<= ~a15~0 4)} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~input~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,411 INFO L290 TraceCheckUtils]: 3: Hoare triple {7147#(<= ~a15~0 4)} assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret8#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,411 INFO L290 TraceCheckUtils]: 4: Hoare triple {7147#(<= ~a15~0 4)} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {7147#(<= ~a15~0 4)} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,412 INFO L290 TraceCheckUtils]: 6: Hoare triple {7147#(<= ~a15~0 4)} assume !(((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {7147#(<= ~a15~0 4)} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {7147#(<= ~a15~0 4)} assume !(((0 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {7147#(<= ~a15~0 4)} assume !(((0 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,414 INFO L290 TraceCheckUtils]: 10: Hoare triple {7147#(<= ~a15~0 4)} assume !(((2 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {7147#(<= ~a15~0 4)} assume !(((2 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {7147#(<= ~a15~0 4)} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,415 INFO L290 TraceCheckUtils]: 13: Hoare triple {7147#(<= ~a15~0 4)} assume !(((1 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,415 INFO L290 TraceCheckUtils]: 14: Hoare triple {7147#(<= ~a15~0 4)} assume !(((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,416 INFO L290 TraceCheckUtils]: 15: Hoare triple {7147#(<= ~a15~0 4)} assume !(((0 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,418 INFO L290 TraceCheckUtils]: 16: Hoare triple {7147#(<= ~a15~0 4)} assume !(((0 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,418 INFO L290 TraceCheckUtils]: 17: Hoare triple {7147#(<= ~a15~0 4)} assume !(((0 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,419 INFO L290 TraceCheckUtils]: 18: Hoare triple {7147#(<= ~a15~0 4)} assume !(((1 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,419 INFO L290 TraceCheckUtils]: 19: Hoare triple {7147#(<= ~a15~0 4)} assume !(((0 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,420 INFO L290 TraceCheckUtils]: 20: Hoare triple {7147#(<= ~a15~0 4)} assume !(((2 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,420 INFO L290 TraceCheckUtils]: 21: Hoare triple {7147#(<= ~a15~0 4)} assume !(((1 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,420 INFO L290 TraceCheckUtils]: 22: Hoare triple {7147#(<= ~a15~0 4)} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,421 INFO L290 TraceCheckUtils]: 23: Hoare triple {7147#(<= ~a15~0 4)} assume !(((0 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,421 INFO L290 TraceCheckUtils]: 24: Hoare triple {7147#(<= ~a15~0 4)} assume !(((0 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,422 INFO L290 TraceCheckUtils]: 25: Hoare triple {7147#(<= ~a15~0 4)} assume !(((1 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,422 INFO L290 TraceCheckUtils]: 26: Hoare triple {7147#(<= ~a15~0 4)} assume !(((1 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,422 INFO L290 TraceCheckUtils]: 27: Hoare triple {7147#(<= ~a15~0 4)} assume !(((2 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,423 INFO L290 TraceCheckUtils]: 28: Hoare triple {7147#(<= ~a15~0 4)} assume !(((1 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,423 INFO L290 TraceCheckUtils]: 29: Hoare triple {7147#(<= ~a15~0 4)} assume !(((0 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,424 INFO L290 TraceCheckUtils]: 30: Hoare triple {7147#(<= ~a15~0 4)} assume !(((2 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,424 INFO L290 TraceCheckUtils]: 31: Hoare triple {7147#(<= ~a15~0 4)} assume !(((2 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,424 INFO L290 TraceCheckUtils]: 32: Hoare triple {7147#(<= ~a15~0 4)} assume !(((2 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,425 INFO L290 TraceCheckUtils]: 33: Hoare triple {7147#(<= ~a15~0 4)} assume !(((0 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,425 INFO L290 TraceCheckUtils]: 34: Hoare triple {7147#(<= ~a15~0 4)} assume !(((2 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,426 INFO L290 TraceCheckUtils]: 35: Hoare triple {7147#(<= ~a15~0 4)} assume !(((3 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,426 INFO L290 TraceCheckUtils]: 36: Hoare triple {7147#(<= ~a15~0 4)} assume !(((0 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,426 INFO L290 TraceCheckUtils]: 37: Hoare triple {7147#(<= ~a15~0 4)} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,427 INFO L290 TraceCheckUtils]: 38: Hoare triple {7147#(<= ~a15~0 4)} assume !(((2 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,427 INFO L290 TraceCheckUtils]: 39: Hoare triple {7147#(<= ~a15~0 4)} assume !(((1 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,427 INFO L290 TraceCheckUtils]: 40: Hoare triple {7147#(<= ~a15~0 4)} assume !(((0 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,428 INFO L290 TraceCheckUtils]: 41: Hoare triple {7147#(<= ~a15~0 4)} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,428 INFO L290 TraceCheckUtils]: 42: Hoare triple {7147#(<= ~a15~0 4)} assume !(((2 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,429 INFO L290 TraceCheckUtils]: 43: Hoare triple {7147#(<= ~a15~0 4)} assume !(((0 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,429 INFO L290 TraceCheckUtils]: 44: Hoare triple {7147#(<= ~a15~0 4)} assume !(((0 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,429 INFO L290 TraceCheckUtils]: 45: Hoare triple {7147#(<= ~a15~0 4)} assume !(((0 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,430 INFO L290 TraceCheckUtils]: 46: Hoare triple {7147#(<= ~a15~0 4)} assume !(((2 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,430 INFO L290 TraceCheckUtils]: 47: Hoare triple {7147#(<= ~a15~0 4)} assume !(((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,430 INFO L290 TraceCheckUtils]: 48: Hoare triple {7147#(<= ~a15~0 4)} assume !(((0 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,431 INFO L290 TraceCheckUtils]: 49: Hoare triple {7147#(<= ~a15~0 4)} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,431 INFO L290 TraceCheckUtils]: 50: Hoare triple {7147#(<= ~a15~0 4)} assume !(((0 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,432 INFO L290 TraceCheckUtils]: 51: Hoare triple {7147#(<= ~a15~0 4)} assume !(((0 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,432 INFO L290 TraceCheckUtils]: 52: Hoare triple {7147#(<= ~a15~0 4)} assume !(((2 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,432 INFO L290 TraceCheckUtils]: 53: Hoare triple {7147#(<= ~a15~0 4)} assume !(((1 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,433 INFO L290 TraceCheckUtils]: 54: Hoare triple {7147#(<= ~a15~0 4)} assume !(((1 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,433 INFO L290 TraceCheckUtils]: 55: Hoare triple {7147#(<= ~a15~0 4)} assume !(((0 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,433 INFO L290 TraceCheckUtils]: 56: Hoare triple {7147#(<= ~a15~0 4)} assume !(((1 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,434 INFO L290 TraceCheckUtils]: 57: Hoare triple {7147#(<= ~a15~0 4)} assume !(((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,434 INFO L290 TraceCheckUtils]: 58: Hoare triple {7147#(<= ~a15~0 4)} assume !(((2 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,435 INFO L290 TraceCheckUtils]: 59: Hoare triple {7147#(<= ~a15~0 4)} assume !(((0 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,435 INFO L290 TraceCheckUtils]: 60: Hoare triple {7147#(<= ~a15~0 4)} assume !(((1 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,435 INFO L290 TraceCheckUtils]: 61: Hoare triple {7147#(<= ~a15~0 4)} assume !(((2 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,436 INFO L290 TraceCheckUtils]: 62: Hoare triple {7147#(<= ~a15~0 4)} assume !(((1 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,436 INFO L290 TraceCheckUtils]: 63: Hoare triple {7147#(<= ~a15~0 4)} assume !(((2 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,436 INFO L290 TraceCheckUtils]: 64: Hoare triple {7147#(<= ~a15~0 4)} assume !(((2 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,437 INFO L290 TraceCheckUtils]: 65: Hoare triple {7147#(<= ~a15~0 4)} assume !((5 == calculate_output_~input#1 && ((~a3~0 <= 115 && 9 == ~a18~0 && 3 == ~a24~0) || (417 < ~a3~0 && 12 == ~a18~0 && 2 == ~a24~0) || (~a3~0 <= 115 && 3 == ~a24~0 && 8 == ~a18~0))) && 6 == ~a15~0); {7147#(<= ~a15~0 4)} is VALID [2022-02-20 15:57:31,438 INFO L290 TraceCheckUtils]: 66: Hoare triple {7147#(<= ~a15~0 4)} assume 5 == ~a15~0 && ((6 == calculate_output_~input#1 && (8 == ~a18~0 || 9 == ~a18~0)) && 3 == ~a24~0) && 417 < ~a3~0;~a3~0 := -249228 + (if ~a3~0 - 124953 < 0 && 0 != (~a3~0 - 124953) % 5 then 1 + (~a3~0 - 124953) / 5 else (~a3~0 - 124953) / 5);~a24~0 := 0;~a18~0 := 8;~a15~0 := 4;calculate_output_#res#1 := -1; {7146#false} is VALID [2022-02-20 15:57:31,438 INFO L290 TraceCheckUtils]: 67: Hoare triple {7146#false} main_#t~ret11#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~output~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1; {7146#false} is VALID [2022-02-20 15:57:31,438 INFO L290 TraceCheckUtils]: 68: Hoare triple {7146#false} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~input~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {7146#false} is VALID [2022-02-20 15:57:31,438 INFO L290 TraceCheckUtils]: 69: Hoare triple {7146#false} assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret8#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {7146#false} is VALID [2022-02-20 15:57:31,438 INFO L290 TraceCheckUtils]: 70: Hoare triple {7146#false} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {7146#false} is VALID [2022-02-20 15:57:31,439 INFO L290 TraceCheckUtils]: 71: Hoare triple {7146#false} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {7146#false} is VALID [2022-02-20 15:57:31,439 INFO L290 TraceCheckUtils]: 72: Hoare triple {7146#false} assume !(((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {7146#false} is VALID [2022-02-20 15:57:31,439 INFO L290 TraceCheckUtils]: 73: Hoare triple {7146#false} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {7146#false} is VALID [2022-02-20 15:57:31,439 INFO L290 TraceCheckUtils]: 74: Hoare triple {7146#false} assume !(((0 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {7146#false} is VALID [2022-02-20 15:57:31,439 INFO L290 TraceCheckUtils]: 75: Hoare triple {7146#false} assume ((0 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115; {7146#false} is VALID [2022-02-20 15:57:31,440 INFO L290 TraceCheckUtils]: 76: Hoare triple {7146#false} assume !false; {7146#false} is VALID [2022-02-20 15:57:31,440 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 15:57:31,440 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 15:57:31,441 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196059676] [2022-02-20 15:57:31,441 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196059676] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 15:57:31,441 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 15:57:31,441 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 15:57:31,441 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970972771] [2022-02-20 15:57:31,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 15:57:31,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-02-20 15:57:31,443 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 15:57:31,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:57:31,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 15:57:31,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 15:57:31,496 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 15:57:31,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 15:57:31,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 15:57:31,497 INFO L87 Difference]: Start difference. First operand 1384 states and 2284 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:57:35,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:57:35,767 INFO L93 Difference]: Finished difference Result 4146 states and 6847 transitions. [2022-02-20 15:57:35,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 15:57:35,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-02-20 15:57:35,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 15:57:35,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:57:35,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3949 transitions. [2022-02-20 15:57:35,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:57:35,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3949 transitions. [2022-02-20 15:57:35,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 3949 transitions. [2022-02-20 15:57:38,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3949 edges. 3949 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 15:57:38,552 INFO L225 Difference]: With dead ends: 4146 [2022-02-20 15:57:38,552 INFO L226 Difference]: Without dead ends: 2764 [2022-02-20 15:57:38,553 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 15:57:38,554 INFO L933 BasicCegarLoop]: 526 mSDtfsCounter, 712 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 2619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 918 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-02-20 15:57:38,555 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [712 Valid, 531 Invalid, 2619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [918 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-02-20 15:57:38,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2764 states. [2022-02-20 15:57:38,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 2764. [2022-02-20 15:57:38,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 15:57:38,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2764 states. Second operand has 2764 states, 2763 states have (on average 1.404632645674991) internal successors, (3881), 2763 states have internal predecessors, (3881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:57:38,595 INFO L74 IsIncluded]: Start isIncluded. First operand 2764 states. Second operand has 2764 states, 2763 states have (on average 1.404632645674991) internal successors, (3881), 2763 states have internal predecessors, (3881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:57:38,598 INFO L87 Difference]: Start difference. First operand 2764 states. Second operand has 2764 states, 2763 states have (on average 1.404632645674991) internal successors, (3881), 2763 states have internal predecessors, (3881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:57:38,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:57:38,819 INFO L93 Difference]: Finished difference Result 2764 states and 3881 transitions. [2022-02-20 15:57:38,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2764 states and 3881 transitions. [2022-02-20 15:57:38,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:57:38,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:57:38,826 INFO L74 IsIncluded]: Start isIncluded. First operand has 2764 states, 2763 states have (on average 1.404632645674991) internal successors, (3881), 2763 states have internal predecessors, (3881), 0 states have call successors, (0), 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 2764 states. [2022-02-20 15:57:38,829 INFO L87 Difference]: Start difference. First operand has 2764 states, 2763 states have (on average 1.404632645674991) internal successors, (3881), 2763 states have internal predecessors, (3881), 0 states have call successors, (0), 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 2764 states. [2022-02-20 15:57:39,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:57:39,025 INFO L93 Difference]: Finished difference Result 2764 states and 3881 transitions. [2022-02-20 15:57:39,026 INFO L276 IsEmpty]: Start isEmpty. Operand 2764 states and 3881 transitions. [2022-02-20 15:57:39,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:57:39,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:57:39,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 15:57:39,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 15:57:39,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2764 states, 2763 states have (on average 1.404632645674991) internal successors, (3881), 2763 states have internal predecessors, (3881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:57:39,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2764 states to 2764 states and 3881 transitions. [2022-02-20 15:57:39,238 INFO L78 Accepts]: Start accepts. Automaton has 2764 states and 3881 transitions. Word has length 77 [2022-02-20 15:57:39,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 15:57:39,239 INFO L470 AbstractCegarLoop]: Abstraction has 2764 states and 3881 transitions. [2022-02-20 15:57:39,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:57:39,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2764 states and 3881 transitions. [2022-02-20 15:57:39,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 15:57:39,240 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 15:57:39,241 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 15:57:39,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 15:57:39,241 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 15:57:39,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 15:57:39,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1188293929, now seen corresponding path program 1 times [2022-02-20 15:57:39,242 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 15:57:39,242 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306210403] [2022-02-20 15:57:39,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 15:57:39,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 15:57:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 15:57:39,354 INFO L290 TraceCheckUtils]: 0: Hoare triple {19628#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(20, 2);call #Ultimate.allocInit(12, 3);~inputD~0 := 4;~inputA~0 := 1;~inputC~0 := 3;~inputE~0 := 5;~inputB~0 := 2;~inputF~0 := 6;~a18~0 := 9;~a24~0 := 3;~a3~0 := 99;~a15~0 := 4; {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {19630#(<= ~a3~0 99)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~ret11#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1; {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {19630#(<= ~a3~0 99)} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~input~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,355 INFO L290 TraceCheckUtils]: 3: Hoare triple {19630#(<= ~a3~0 99)} assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret8#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,356 INFO L290 TraceCheckUtils]: 4: Hoare triple {19630#(<= ~a3~0 99)} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {19630#(<= ~a3~0 99)} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {19630#(<= ~a3~0 99)} assume !(((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {19630#(<= ~a3~0 99)} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {19630#(<= ~a3~0 99)} assume !(((0 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {19630#(<= ~a3~0 99)} assume !(((0 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {19630#(<= ~a3~0 99)} assume !(((2 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {19630#(<= ~a3~0 99)} assume !(((2 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {19630#(<= ~a3~0 99)} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {19630#(<= ~a3~0 99)} assume !(((1 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {19630#(<= ~a3~0 99)} assume !(((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {19630#(<= ~a3~0 99)} assume !(((0 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {19630#(<= ~a3~0 99)} assume !(((0 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,360 INFO L290 TraceCheckUtils]: 17: Hoare triple {19630#(<= ~a3~0 99)} assume !(((0 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,360 INFO L290 TraceCheckUtils]: 18: Hoare triple {19630#(<= ~a3~0 99)} assume !(((1 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,361 INFO L290 TraceCheckUtils]: 19: Hoare triple {19630#(<= ~a3~0 99)} assume !(((0 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,361 INFO L290 TraceCheckUtils]: 20: Hoare triple {19630#(<= ~a3~0 99)} assume !(((2 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,361 INFO L290 TraceCheckUtils]: 21: Hoare triple {19630#(<= ~a3~0 99)} assume !(((1 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,362 INFO L290 TraceCheckUtils]: 22: Hoare triple {19630#(<= ~a3~0 99)} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,362 INFO L290 TraceCheckUtils]: 23: Hoare triple {19630#(<= ~a3~0 99)} assume !(((0 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,362 INFO L290 TraceCheckUtils]: 24: Hoare triple {19630#(<= ~a3~0 99)} assume !(((0 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,363 INFO L290 TraceCheckUtils]: 25: Hoare triple {19630#(<= ~a3~0 99)} assume !(((1 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,363 INFO L290 TraceCheckUtils]: 26: Hoare triple {19630#(<= ~a3~0 99)} assume !(((1 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,363 INFO L290 TraceCheckUtils]: 27: Hoare triple {19630#(<= ~a3~0 99)} assume !(((2 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,364 INFO L290 TraceCheckUtils]: 28: Hoare triple {19630#(<= ~a3~0 99)} assume !(((1 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,364 INFO L290 TraceCheckUtils]: 29: Hoare triple {19630#(<= ~a3~0 99)} assume !(((0 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,364 INFO L290 TraceCheckUtils]: 30: Hoare triple {19630#(<= ~a3~0 99)} assume !(((2 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,365 INFO L290 TraceCheckUtils]: 31: Hoare triple {19630#(<= ~a3~0 99)} assume !(((2 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,365 INFO L290 TraceCheckUtils]: 32: Hoare triple {19630#(<= ~a3~0 99)} assume !(((2 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,365 INFO L290 TraceCheckUtils]: 33: Hoare triple {19630#(<= ~a3~0 99)} assume !(((0 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,366 INFO L290 TraceCheckUtils]: 34: Hoare triple {19630#(<= ~a3~0 99)} assume !(((2 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,366 INFO L290 TraceCheckUtils]: 35: Hoare triple {19630#(<= ~a3~0 99)} assume !(((3 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,366 INFO L290 TraceCheckUtils]: 36: Hoare triple {19630#(<= ~a3~0 99)} assume !(((0 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,366 INFO L290 TraceCheckUtils]: 37: Hoare triple {19630#(<= ~a3~0 99)} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,367 INFO L290 TraceCheckUtils]: 38: Hoare triple {19630#(<= ~a3~0 99)} assume !(((2 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,367 INFO L290 TraceCheckUtils]: 39: Hoare triple {19630#(<= ~a3~0 99)} assume !(((1 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,368 INFO L290 TraceCheckUtils]: 40: Hoare triple {19630#(<= ~a3~0 99)} assume !(((0 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,368 INFO L290 TraceCheckUtils]: 41: Hoare triple {19630#(<= ~a3~0 99)} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,368 INFO L290 TraceCheckUtils]: 42: Hoare triple {19630#(<= ~a3~0 99)} assume !(((2 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,369 INFO L290 TraceCheckUtils]: 43: Hoare triple {19630#(<= ~a3~0 99)} assume !(((0 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,369 INFO L290 TraceCheckUtils]: 44: Hoare triple {19630#(<= ~a3~0 99)} assume !(((0 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,369 INFO L290 TraceCheckUtils]: 45: Hoare triple {19630#(<= ~a3~0 99)} assume !(((0 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,370 INFO L290 TraceCheckUtils]: 46: Hoare triple {19630#(<= ~a3~0 99)} assume !(((2 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,370 INFO L290 TraceCheckUtils]: 47: Hoare triple {19630#(<= ~a3~0 99)} assume !(((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,370 INFO L290 TraceCheckUtils]: 48: Hoare triple {19630#(<= ~a3~0 99)} assume !(((0 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,371 INFO L290 TraceCheckUtils]: 49: Hoare triple {19630#(<= ~a3~0 99)} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,371 INFO L290 TraceCheckUtils]: 50: Hoare triple {19630#(<= ~a3~0 99)} assume !(((0 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,371 INFO L290 TraceCheckUtils]: 51: Hoare triple {19630#(<= ~a3~0 99)} assume !(((0 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,372 INFO L290 TraceCheckUtils]: 52: Hoare triple {19630#(<= ~a3~0 99)} assume !(((2 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,372 INFO L290 TraceCheckUtils]: 53: Hoare triple {19630#(<= ~a3~0 99)} assume !(((1 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,372 INFO L290 TraceCheckUtils]: 54: Hoare triple {19630#(<= ~a3~0 99)} assume !(((1 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,373 INFO L290 TraceCheckUtils]: 55: Hoare triple {19630#(<= ~a3~0 99)} assume !(((0 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,373 INFO L290 TraceCheckUtils]: 56: Hoare triple {19630#(<= ~a3~0 99)} assume !(((1 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,373 INFO L290 TraceCheckUtils]: 57: Hoare triple {19630#(<= ~a3~0 99)} assume !(((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,374 INFO L290 TraceCheckUtils]: 58: Hoare triple {19630#(<= ~a3~0 99)} assume !(((2 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,374 INFO L290 TraceCheckUtils]: 59: Hoare triple {19630#(<= ~a3~0 99)} assume !(((0 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,374 INFO L290 TraceCheckUtils]: 60: Hoare triple {19630#(<= ~a3~0 99)} assume !(((1 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,375 INFO L290 TraceCheckUtils]: 61: Hoare triple {19630#(<= ~a3~0 99)} assume !(((2 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,375 INFO L290 TraceCheckUtils]: 62: Hoare triple {19630#(<= ~a3~0 99)} assume !(((1 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,375 INFO L290 TraceCheckUtils]: 63: Hoare triple {19630#(<= ~a3~0 99)} assume !(((2 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,376 INFO L290 TraceCheckUtils]: 64: Hoare triple {19630#(<= ~a3~0 99)} assume !(((2 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,376 INFO L290 TraceCheckUtils]: 65: Hoare triple {19630#(<= ~a3~0 99)} assume !((5 == calculate_output_~input#1 && ((~a3~0 <= 115 && 9 == ~a18~0 && 3 == ~a24~0) || (417 < ~a3~0 && 12 == ~a18~0 && 2 == ~a24~0) || (~a3~0 <= 115 && 3 == ~a24~0 && 8 == ~a18~0))) && 6 == ~a15~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,376 INFO L290 TraceCheckUtils]: 66: Hoare triple {19630#(<= ~a3~0 99)} assume !(5 == ~a15~0 && ((6 == calculate_output_~input#1 && (8 == ~a18~0 || 9 == ~a18~0)) && 3 == ~a24~0) && 417 < ~a3~0); {19630#(<= ~a3~0 99)} is VALID [2022-02-20 15:57:39,377 INFO L290 TraceCheckUtils]: 67: Hoare triple {19630#(<= ~a3~0 99)} assume (4 == ~a15~0 && 4 == ~a24~0 && (11 == ~a18~0 || 12 == ~a18~0) && 5 == calculate_output_~input#1) && 115 < ~a3~0 && 306 >= ~a3~0;~a3~0 := -306309 + ~a3~0;~a24~0 := 1;~a18~0 := 9;~a15~0 := 5;calculate_output_#res#1 := 25; {19629#false} is VALID [2022-02-20 15:57:39,377 INFO L290 TraceCheckUtils]: 68: Hoare triple {19629#false} main_#t~ret11#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~output~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1; {19629#false} is VALID [2022-02-20 15:57:39,377 INFO L290 TraceCheckUtils]: 69: Hoare triple {19629#false} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~input~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {19629#false} is VALID [2022-02-20 15:57:39,378 INFO L290 TraceCheckUtils]: 70: Hoare triple {19629#false} assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret8#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {19629#false} is VALID [2022-02-20 15:57:39,378 INFO L290 TraceCheckUtils]: 71: Hoare triple {19629#false} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {19629#false} is VALID [2022-02-20 15:57:39,378 INFO L290 TraceCheckUtils]: 72: Hoare triple {19629#false} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {19629#false} is VALID [2022-02-20 15:57:39,378 INFO L290 TraceCheckUtils]: 73: Hoare triple {19629#false} assume !(((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {19629#false} is VALID [2022-02-20 15:57:39,378 INFO L290 TraceCheckUtils]: 74: Hoare triple {19629#false} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {19629#false} is VALID [2022-02-20 15:57:39,378 INFO L290 TraceCheckUtils]: 75: Hoare triple {19629#false} assume !(((0 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {19629#false} is VALID [2022-02-20 15:57:39,379 INFO L290 TraceCheckUtils]: 76: Hoare triple {19629#false} assume ((0 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115; {19629#false} is VALID [2022-02-20 15:57:39,379 INFO L290 TraceCheckUtils]: 77: Hoare triple {19629#false} assume !false; {19629#false} is VALID [2022-02-20 15:57:39,379 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 15:57:39,379 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 15:57:39,380 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306210403] [2022-02-20 15:57:39,380 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306210403] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 15:57:39,380 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 15:57:39,380 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 15:57:39,380 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352038462] [2022-02-20 15:57:39,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 15:57:39,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-02-20 15:57:39,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 15:57:39,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:57:39,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 15:57:39,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 15:57:39,432 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 15:57:39,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 15:57:39,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 15:57:39,433 INFO L87 Difference]: Start difference. First operand 2764 states and 3881 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:57:45,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:57:45,015 INFO L93 Difference]: Finished difference Result 8288 states and 11639 transitions. [2022-02-20 15:57:45,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 15:57:45,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-02-20 15:57:45,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 15:57:45,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:57:45,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3950 transitions. [2022-02-20 15:57:45,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:57:45,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3950 transitions. [2022-02-20 15:57:45,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 3950 transitions. [2022-02-20 15:57:47,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3950 edges. 3950 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 15:57:48,714 INFO L225 Difference]: With dead ends: 8288 [2022-02-20 15:57:48,714 INFO L226 Difference]: Without dead ends: 5526 [2022-02-20 15:57:48,717 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 15:57:48,717 INFO L933 BasicCegarLoop]: 428 mSDtfsCounter, 709 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1994 mSolverCounterSat, 672 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 672 IncrementalHoareTripleChecker+Valid, 1994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-02-20 15:57:48,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [709 Valid, 434 Invalid, 2666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [672 Valid, 1994 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-02-20 15:57:48,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5526 states. [2022-02-20 15:57:48,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5526 to 5524. [2022-02-20 15:57:48,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 15:57:48,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5526 states. Second operand has 5524 states, 5523 states have (on average 1.2657975737823646) internal successors, (6991), 5523 states have internal predecessors, (6991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:57:48,809 INFO L74 IsIncluded]: Start isIncluded. First operand 5526 states. Second operand has 5524 states, 5523 states have (on average 1.2657975737823646) internal successors, (6991), 5523 states have internal predecessors, (6991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:57:48,816 INFO L87 Difference]: Start difference. First operand 5526 states. Second operand has 5524 states, 5523 states have (on average 1.2657975737823646) internal successors, (6991), 5523 states have internal predecessors, (6991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:57:49,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:57:49,571 INFO L93 Difference]: Finished difference Result 5526 states and 6992 transitions. [2022-02-20 15:57:49,571 INFO L276 IsEmpty]: Start isEmpty. Operand 5526 states and 6992 transitions. [2022-02-20 15:57:49,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:57:49,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:57:49,582 INFO L74 IsIncluded]: Start isIncluded. First operand has 5524 states, 5523 states have (on average 1.2657975737823646) internal successors, (6991), 5523 states have internal predecessors, (6991), 0 states have call successors, (0), 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 5526 states. [2022-02-20 15:57:49,587 INFO L87 Difference]: Start difference. First operand has 5524 states, 5523 states have (on average 1.2657975737823646) internal successors, (6991), 5523 states have internal predecessors, (6991), 0 states have call successors, (0), 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 5526 states. [2022-02-20 15:57:50,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:57:50,356 INFO L93 Difference]: Finished difference Result 5526 states and 6992 transitions. [2022-02-20 15:57:50,356 INFO L276 IsEmpty]: Start isEmpty. Operand 5526 states and 6992 transitions. [2022-02-20 15:57:50,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:57:50,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:57:50,360 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 15:57:50,360 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 15:57:50,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5524 states, 5523 states have (on average 1.2657975737823646) internal successors, (6991), 5523 states have internal predecessors, (6991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:57:51,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5524 states to 5524 states and 6991 transitions. [2022-02-20 15:57:51,154 INFO L78 Accepts]: Start accepts. Automaton has 5524 states and 6991 transitions. Word has length 78 [2022-02-20 15:57:51,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 15:57:51,154 INFO L470 AbstractCegarLoop]: Abstraction has 5524 states and 6991 transitions. [2022-02-20 15:57:51,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:57:51,155 INFO L276 IsEmpty]: Start isEmpty. Operand 5524 states and 6991 transitions. [2022-02-20 15:57:51,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-02-20 15:57:51,157 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 15:57:51,157 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:57:51,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 15:57:51,158 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 15:57:51,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 15:57:51,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1859713544, now seen corresponding path program 1 times [2022-02-20 15:57:51,158 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 15:57:51,158 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100055058] [2022-02-20 15:57:51,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 15:57:51,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 15:57:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 15:57:51,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {44577#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(20, 2);call #Ultimate.allocInit(12, 3);~inputD~0 := 4;~inputA~0 := 1;~inputC~0 := 3;~inputE~0 := 5;~inputB~0 := 2;~inputF~0 := 6;~a18~0 := 9;~a24~0 := 3;~a3~0 := 99;~a15~0 := 4; {44577#true} is VALID [2022-02-20 15:57:51,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {44577#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~ret11#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1; {44577#true} is VALID [2022-02-20 15:57:51,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {44577#true} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~input~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {44577#true} is VALID [2022-02-20 15:57:51,304 INFO L290 TraceCheckUtils]: 3: Hoare triple {44577#true} assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret8#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {44577#true} is VALID [2022-02-20 15:57:51,304 INFO L290 TraceCheckUtils]: 4: Hoare triple {44577#true} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {44577#true} is VALID [2022-02-20 15:57:51,304 INFO L290 TraceCheckUtils]: 5: Hoare triple {44577#true} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {44577#true} assume !(((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {44577#true} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {44577#true} is VALID [2022-02-20 15:57:51,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {44577#true} assume !(((0 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {44577#true} assume !(((0 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {44577#true} is VALID [2022-02-20 15:57:51,305 INFO L290 TraceCheckUtils]: 10: Hoare triple {44577#true} assume !(((2 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {44577#true} assume !(((2 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {44577#true} is VALID [2022-02-20 15:57:51,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {44577#true} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {44577#true} assume !(((1 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,306 INFO L290 TraceCheckUtils]: 14: Hoare triple {44577#true} assume !(((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {44577#true} assume !(((0 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {44577#true} assume !(((0 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,306 INFO L290 TraceCheckUtils]: 17: Hoare triple {44577#true} assume !(((0 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {44577#true} is VALID [2022-02-20 15:57:51,306 INFO L290 TraceCheckUtils]: 18: Hoare triple {44577#true} assume !(((1 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,306 INFO L290 TraceCheckUtils]: 19: Hoare triple {44577#true} assume !(((0 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,306 INFO L290 TraceCheckUtils]: 20: Hoare triple {44577#true} assume !(((2 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,306 INFO L290 TraceCheckUtils]: 21: Hoare triple {44577#true} assume !(((1 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,306 INFO L290 TraceCheckUtils]: 22: Hoare triple {44577#true} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,307 INFO L290 TraceCheckUtils]: 23: Hoare triple {44577#true} assume !(((0 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,307 INFO L290 TraceCheckUtils]: 24: Hoare triple {44577#true} assume !(((0 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {44577#true} is VALID [2022-02-20 15:57:51,307 INFO L290 TraceCheckUtils]: 25: Hoare triple {44577#true} assume !(((1 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,307 INFO L290 TraceCheckUtils]: 26: Hoare triple {44577#true} assume !(((1 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,307 INFO L290 TraceCheckUtils]: 27: Hoare triple {44577#true} assume !(((2 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,307 INFO L290 TraceCheckUtils]: 28: Hoare triple {44577#true} assume !(((1 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,307 INFO L290 TraceCheckUtils]: 29: Hoare triple {44577#true} assume !(((0 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,307 INFO L290 TraceCheckUtils]: 30: Hoare triple {44577#true} assume !(((2 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,307 INFO L290 TraceCheckUtils]: 31: Hoare triple {44577#true} assume !(((2 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,307 INFO L290 TraceCheckUtils]: 32: Hoare triple {44577#true} assume !(((2 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,307 INFO L290 TraceCheckUtils]: 33: Hoare triple {44577#true} assume !(((0 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,308 INFO L290 TraceCheckUtils]: 34: Hoare triple {44577#true} assume !(((2 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,308 INFO L290 TraceCheckUtils]: 35: Hoare triple {44577#true} assume !(((3 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {44577#true} is VALID [2022-02-20 15:57:51,308 INFO L290 TraceCheckUtils]: 36: Hoare triple {44577#true} assume !(((0 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,308 INFO L290 TraceCheckUtils]: 37: Hoare triple {44577#true} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,308 INFO L290 TraceCheckUtils]: 38: Hoare triple {44577#true} assume !(((2 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,308 INFO L290 TraceCheckUtils]: 39: Hoare triple {44577#true} assume !(((1 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {44577#true} is VALID [2022-02-20 15:57:51,308 INFO L290 TraceCheckUtils]: 40: Hoare triple {44577#true} assume !(((0 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,308 INFO L290 TraceCheckUtils]: 41: Hoare triple {44577#true} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,308 INFO L290 TraceCheckUtils]: 42: Hoare triple {44577#true} assume !(((2 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {44577#true} is VALID [2022-02-20 15:57:51,308 INFO L290 TraceCheckUtils]: 43: Hoare triple {44577#true} assume !(((0 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,308 INFO L290 TraceCheckUtils]: 44: Hoare triple {44577#true} assume !(((0 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,308 INFO L290 TraceCheckUtils]: 45: Hoare triple {44577#true} assume !(((0 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,309 INFO L290 TraceCheckUtils]: 46: Hoare triple {44577#true} assume !(((2 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,309 INFO L290 TraceCheckUtils]: 47: Hoare triple {44577#true} assume !(((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {44577#true} is VALID [2022-02-20 15:57:51,309 INFO L290 TraceCheckUtils]: 48: Hoare triple {44577#true} assume !(((0 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,309 INFO L290 TraceCheckUtils]: 49: Hoare triple {44577#true} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,309 INFO L290 TraceCheckUtils]: 50: Hoare triple {44577#true} assume !(((0 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,309 INFO L290 TraceCheckUtils]: 51: Hoare triple {44577#true} assume !(((0 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {44577#true} is VALID [2022-02-20 15:57:51,309 INFO L290 TraceCheckUtils]: 52: Hoare triple {44577#true} assume !(((2 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,309 INFO L290 TraceCheckUtils]: 53: Hoare triple {44577#true} assume !(((1 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {44577#true} is VALID [2022-02-20 15:57:51,309 INFO L290 TraceCheckUtils]: 54: Hoare triple {44577#true} assume !(((1 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,309 INFO L290 TraceCheckUtils]: 55: Hoare triple {44577#true} assume !(((0 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,309 INFO L290 TraceCheckUtils]: 56: Hoare triple {44577#true} assume !(((1 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {44577#true} is VALID [2022-02-20 15:57:51,310 INFO L290 TraceCheckUtils]: 57: Hoare triple {44577#true} assume !(((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,310 INFO L290 TraceCheckUtils]: 58: Hoare triple {44577#true} assume !(((2 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,310 INFO L290 TraceCheckUtils]: 59: Hoare triple {44577#true} assume !(((0 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {44577#true} is VALID [2022-02-20 15:57:51,310 INFO L290 TraceCheckUtils]: 60: Hoare triple {44577#true} assume !(((1 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,310 INFO L290 TraceCheckUtils]: 61: Hoare triple {44577#true} assume !(((2 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,310 INFO L290 TraceCheckUtils]: 62: Hoare triple {44577#true} assume !(((1 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,310 INFO L290 TraceCheckUtils]: 63: Hoare triple {44577#true} assume !(((2 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {44577#true} is VALID [2022-02-20 15:57:51,310 INFO L290 TraceCheckUtils]: 64: Hoare triple {44577#true} assume !(((2 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {44577#true} is VALID [2022-02-20 15:57:51,310 INFO L290 TraceCheckUtils]: 65: Hoare triple {44577#true} assume !((5 == calculate_output_~input#1 && ((~a3~0 <= 115 && 9 == ~a18~0 && 3 == ~a24~0) || (417 < ~a3~0 && 12 == ~a18~0 && 2 == ~a24~0) || (~a3~0 <= 115 && 3 == ~a24~0 && 8 == ~a18~0))) && 6 == ~a15~0); {44577#true} is VALID [2022-02-20 15:57:51,310 INFO L290 TraceCheckUtils]: 66: Hoare triple {44577#true} assume !(5 == ~a15~0 && ((6 == calculate_output_~input#1 && (8 == ~a18~0 || 9 == ~a18~0)) && 3 == ~a24~0) && 417 < ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,310 INFO L290 TraceCheckUtils]: 67: Hoare triple {44577#true} assume !((4 == ~a15~0 && 4 == ~a24~0 && (11 == ~a18~0 || 12 == ~a18~0) && 5 == calculate_output_~input#1) && 115 < ~a3~0 && 306 >= ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,310 INFO L290 TraceCheckUtils]: 68: Hoare triple {44577#true} assume !((4 == ~a24~0 && (3 == calculate_output_~input#1 && (9 == ~a18~0 || 10 == ~a18~0)) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,311 INFO L290 TraceCheckUtils]: 69: Hoare triple {44577#true} assume !(~a3~0 <= 115 && ((5 == calculate_output_~input#1 && (9 == ~a18~0 || 10 == ~a18~0)) && 5 == ~a15~0) && 1 == ~a24~0); {44577#true} is VALID [2022-02-20 15:57:51,311 INFO L290 TraceCheckUtils]: 70: Hoare triple {44577#true} assume !((10 == ~a18~0 && (417 < ~a3~0 && 3 == calculate_output_~input#1) && 5 == ~a15~0) && 3 == ~a24~0); {44577#true} is VALID [2022-02-20 15:57:51,311 INFO L290 TraceCheckUtils]: 71: Hoare triple {44577#true} assume !((((((8 == ~a18~0 || 9 == ~a18~0) || 10 == ~a18~0) && 2 == calculate_output_~input#1) && 4 == ~a15~0) && 4 == ~a24~0) && 306 < ~a3~0 && 417 >= ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,311 INFO L290 TraceCheckUtils]: 72: Hoare triple {44577#true} assume !(((((11 == ~a18~0 || 12 == ~a18~0) && 5 == calculate_output_~input#1) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0) && 3 == ~a24~0); {44577#true} is VALID [2022-02-20 15:57:51,311 INFO L290 TraceCheckUtils]: 73: Hoare triple {44577#true} assume !(12 == ~a18~0 && ((6 == calculate_output_~input#1 && ~a3~0 <= 115) && 2 == ~a24~0) && 5 == ~a15~0); {44577#true} is VALID [2022-02-20 15:57:51,311 INFO L290 TraceCheckUtils]: 74: Hoare triple {44577#true} assume !((417 < ~a3~0 && (((10 == ~a18~0 || 11 == ~a18~0) || 12 == ~a18~0) && 6 == calculate_output_~input#1) && 0 == ~a24~0) && 5 == ~a15~0); {44577#true} is VALID [2022-02-20 15:57:51,311 INFO L290 TraceCheckUtils]: 75: Hoare triple {44577#true} assume !(2 == ~a24~0 && (2 == calculate_output_~input#1 && ((12 == ~a18~0 && 306 < ~a3~0 && 417 >= ~a3~0) || (8 == ~a18~0 && 417 < ~a3~0))) && 6 == ~a15~0); {44577#true} is VALID [2022-02-20 15:57:51,312 INFO L290 TraceCheckUtils]: 76: Hoare triple {44577#true} assume !(6 == ~a15~0 && ((((8 == ~a18~0 || 9 == ~a18~0) || 10 == ~a18~0) && 3 == calculate_output_~input#1) && 115 < ~a3~0 && 306 >= ~a3~0) && 1 == ~a24~0); {44577#true} is VALID [2022-02-20 15:57:51,312 INFO L290 TraceCheckUtils]: 77: Hoare triple {44577#true} assume !((0 == ~a24~0 && 6 == ~a15~0 && 2 == calculate_output_~input#1 && (9 == ~a18~0 || 10 == ~a18~0)) && 115 < ~a3~0 && 306 >= ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,312 INFO L290 TraceCheckUtils]: 78: Hoare triple {44577#true} assume !((306 < ~a3~0 && 417 >= ~a3~0) && (5 == ~a15~0 && 2 == calculate_output_~input#1 && 12 == ~a18~0) && 3 == ~a24~0); {44577#true} is VALID [2022-02-20 15:57:51,312 INFO L290 TraceCheckUtils]: 79: Hoare triple {44577#true} assume !(5 == ~a15~0 && 2 == ~a24~0 && (306 < ~a3~0 && 417 >= ~a3~0) && (9 == ~a18~0 || 10 == ~a18~0) && 5 == calculate_output_~input#1); {44577#true} is VALID [2022-02-20 15:57:51,312 INFO L290 TraceCheckUtils]: 80: Hoare triple {44577#true} assume !(1 == ~a24~0 && (4 == calculate_output_~input#1 && (((11 == ~a18~0 && 115 < ~a3~0 && 306 >= ~a3~0) || (12 == ~a18~0 && 115 < ~a3~0 && 306 >= ~a3~0)) || (8 == ~a18~0 && 306 < ~a3~0 && 417 >= ~a3~0))) && 5 == ~a15~0); {44577#true} is VALID [2022-02-20 15:57:51,312 INFO L290 TraceCheckUtils]: 81: Hoare triple {44577#true} assume !((1 == ~a24~0 && (~a3~0 <= 115 && 6 == calculate_output_~input#1) && 5 == ~a15~0) && 11 == ~a18~0); {44577#true} is VALID [2022-02-20 15:57:51,313 INFO L290 TraceCheckUtils]: 82: Hoare triple {44577#true} assume !(10 == ~a18~0 && (306 < ~a3~0 && 417 >= ~a3~0) && 6 == ~a15~0 && 0 == ~a24~0 && 1 == calculate_output_~input#1); {44577#true} is VALID [2022-02-20 15:57:51,313 INFO L290 TraceCheckUtils]: 83: Hoare triple {44577#true} assume !(3 == ~a24~0 && 6 == ~a15~0 && (4 == calculate_output_~input#1 && (10 == ~a18~0 || 11 == ~a18~0)) && 417 < ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,313 INFO L290 TraceCheckUtils]: 84: Hoare triple {44577#true} assume !(((((((306 < ~a3~0 && 417 >= ~a3~0) && 12 == ~a18~0) || (8 == ~a18~0 && 417 < ~a3~0)) || (417 < ~a3~0 && 9 == ~a18~0)) && 2 == calculate_output_~input#1) && 3 == ~a24~0) && 6 == ~a15~0); {44577#true} is VALID [2022-02-20 15:57:51,313 INFO L290 TraceCheckUtils]: 85: Hoare triple {44577#true} assume !(4 == ~a24~0 && 4 == ~a15~0 && (306 < ~a3~0 && 417 >= ~a3~0) && (10 == ~a18~0 || 8 == ~a18~0 || 9 == ~a18~0) && 1 == calculate_output_~input#1); {44577#true} is VALID [2022-02-20 15:57:51,313 INFO L290 TraceCheckUtils]: 86: Hoare triple {44577#true} assume !(4 == ~a15~0 && ((306 < ~a3~0 && 417 >= ~a3~0) && 1 == calculate_output_~input#1 && (10 == ~a18~0 || 8 == ~a18~0 || 9 == ~a18~0)) && 3 == ~a24~0); {44577#true} is VALID [2022-02-20 15:57:51,314 INFO L290 TraceCheckUtils]: 87: Hoare triple {44577#true} assume !(2 == ~a24~0 && 6 == ~a15~0 && 417 < ~a3~0 && ((9 == ~a18~0 || 10 == ~a18~0) || 11 == ~a18~0) && 2 == calculate_output_~input#1); {44577#true} is VALID [2022-02-20 15:57:51,314 INFO L290 TraceCheckUtils]: 88: Hoare triple {44577#true} assume !((((6 == calculate_output_~input#1 && ((9 == ~a18~0 || 10 == ~a18~0) || 11 == ~a18~0)) && 2 == ~a24~0) && 6 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,314 INFO L290 TraceCheckUtils]: 89: Hoare triple {44577#true} assume !((6 == ~a15~0 && 0 == ~a24~0 && (11 == ~a18~0 || 12 == ~a18~0) && 1 == calculate_output_~input#1) && 306 < ~a3~0 && 417 >= ~a3~0); {44577#true} is VALID [2022-02-20 15:57:51,314 INFO L290 TraceCheckUtils]: 90: Hoare triple {44577#true} assume !(5 == ~a15~0 && 12 == ~a18~0 && (~a3~0 <= 115 && 1 == calculate_output_~input#1) && 2 == ~a24~0); {44577#true} is VALID [2022-02-20 15:57:51,314 INFO L290 TraceCheckUtils]: 91: Hoare triple {44577#true} assume !((3 == ~a24~0 && 4 == calculate_output_~input#1 && ((9 == ~a18~0 && 417 < ~a3~0) || ((306 < ~a3~0 && 417 >= ~a3~0) && 12 == ~a18~0) || (417 < ~a3~0 && 8 == ~a18~0))) && 6 == ~a15~0); {44577#true} is VALID [2022-02-20 15:57:51,315 INFO L290 TraceCheckUtils]: 92: Hoare triple {44577#true} assume !(((1 == ~a24~0 && 1 == calculate_output_~input#1 && 8 == ~a18~0) && ~a3~0 <= 115) && 5 == ~a15~0); {44577#true} is VALID [2022-02-20 15:57:51,316 INFO L290 TraceCheckUtils]: 93: Hoare triple {44577#true} assume 4 == ~a15~0 && ((((12 == ~a18~0 && 3 == ~a24~0) && 417 < ~a3~0) || ((4 == ~a24~0 && 8 == ~a18~0) && ~a3~0 <= 115)) || ((4 == ~a24~0 && 9 == ~a18~0) && ~a3~0 <= 115)) && 5 == calculate_output_~input#1;~a3~0 := (if -18815 + (if 9 * ~a3~0 < 0 && 0 != 9 * ~a3~0 % 10 then 1 + 9 * ~a3~0 / 10 else 9 * ~a3~0 / 10) < 0 && 0 != (-18815 + (if 9 * ~a3~0 < 0 && 0 != 9 * ~a3~0 % 10 then 1 + 9 * ~a3~0 / 10 else 9 * ~a3~0 / 10)) % 5 then 1 + (-18815 + (if 9 * ~a3~0 < 0 && 0 != 9 * ~a3~0 % 10 then 1 + 9 * ~a3~0 / 10 else 9 * ~a3~0 / 10)) / 5 else (-18815 + (if 9 * ~a3~0 < 0 && 0 != 9 * ~a3~0 % 10 then 1 + 9 * ~a3~0 / 10 else 9 * ~a3~0 / 10)) / 5) - 203034;~a24~0 := 0;~a18~0 := 8;calculate_output_#res#1 := -1; {44579#(<= ~a18~0 8)} is VALID [2022-02-20 15:57:51,316 INFO L290 TraceCheckUtils]: 94: Hoare triple {44579#(<= ~a18~0 8)} main_#t~ret11#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~output~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1; {44579#(<= ~a18~0 8)} is VALID [2022-02-20 15:57:51,316 INFO L290 TraceCheckUtils]: 95: Hoare triple {44579#(<= ~a18~0 8)} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~input~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {44579#(<= ~a18~0 8)} is VALID [2022-02-20 15:57:51,317 INFO L290 TraceCheckUtils]: 96: Hoare triple {44579#(<= ~a18~0 8)} assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret8#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {44579#(<= ~a18~0 8)} is VALID [2022-02-20 15:57:51,317 INFO L290 TraceCheckUtils]: 97: Hoare triple {44579#(<= ~a18~0 8)} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {44579#(<= ~a18~0 8)} is VALID [2022-02-20 15:57:51,317 INFO L290 TraceCheckUtils]: 98: Hoare triple {44579#(<= ~a18~0 8)} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {44579#(<= ~a18~0 8)} is VALID [2022-02-20 15:57:51,318 INFO L290 TraceCheckUtils]: 99: Hoare triple {44579#(<= ~a18~0 8)} assume !(((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {44579#(<= ~a18~0 8)} is VALID [2022-02-20 15:57:51,318 INFO L290 TraceCheckUtils]: 100: Hoare triple {44579#(<= ~a18~0 8)} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {44579#(<= ~a18~0 8)} is VALID [2022-02-20 15:57:51,318 INFO L290 TraceCheckUtils]: 101: Hoare triple {44579#(<= ~a18~0 8)} assume !(((0 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {44579#(<= ~a18~0 8)} is VALID [2022-02-20 15:57:51,319 INFO L290 TraceCheckUtils]: 102: Hoare triple {44579#(<= ~a18~0 8)} assume ((0 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115; {44578#false} is VALID [2022-02-20 15:57:51,319 INFO L290 TraceCheckUtils]: 103: Hoare triple {44578#false} assume !false; {44578#false} is VALID [2022-02-20 15:57:51,319 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 15:57:51,319 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 15:57:51,319 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100055058] [2022-02-20 15:57:51,320 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100055058] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 15:57:51,320 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 15:57:51,320 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 15:57:51,320 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332757522] [2022-02-20 15:57:51,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 15:57:51,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2022-02-20 15:57:51,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 15:57:51,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:57:51,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 15:57:51,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 15:57:51,385 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 15:57:51,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 15:57:51,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 15:57:51,386 INFO L87 Difference]: Start difference. First operand 5524 states and 6991 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:58:03,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:58:03,212 INFO L93 Difference]: Finished difference Result 16566 states and 20968 transitions. [2022-02-20 15:58:03,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 15:58:03,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2022-02-20 15:58:03,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 15:58:03,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:58:03,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3949 transitions. [2022-02-20 15:58:03,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:58:03,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3949 transitions. [2022-02-20 15:58:03,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 3949 transitions. [2022-02-20 15:58:05,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3949 edges. 3949 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 15:58:09,402 INFO L225 Difference]: With dead ends: 16566 [2022-02-20 15:58:09,402 INFO L226 Difference]: Without dead ends: 11044 [2022-02-20 15:58:09,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 15:58:09,429 INFO L933 BasicCegarLoop]: 1285 mSDtfsCounter, 686 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 766 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 2721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 766 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-02-20 15:58:09,432 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [686 Valid, 1292 Invalid, 2721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [766 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-02-20 15:58:09,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11044 states. [2022-02-20 15:58:09,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11044 to 9664. [2022-02-20 15:58:09,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 15:58:09,601 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11044 states. Second operand has 9664 states, 9663 states have (on average 1.208423884921867) internal successors, (11677), 9663 states have internal predecessors, (11677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:58:09,612 INFO L74 IsIncluded]: Start isIncluded. First operand 11044 states. Second operand has 9664 states, 9663 states have (on average 1.208423884921867) internal successors, (11677), 9663 states have internal predecessors, (11677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:58:09,624 INFO L87 Difference]: Start difference. First operand 11044 states. Second operand has 9664 states, 9663 states have (on average 1.208423884921867) internal successors, (11677), 9663 states have internal predecessors, (11677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:58:12,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:58:12,851 INFO L93 Difference]: Finished difference Result 11044 states and 13105 transitions. [2022-02-20 15:58:12,851 INFO L276 IsEmpty]: Start isEmpty. Operand 11044 states and 13105 transitions. [2022-02-20 15:58:12,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:58:12,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:58:12,887 INFO L74 IsIncluded]: Start isIncluded. First operand has 9664 states, 9663 states have (on average 1.208423884921867) internal successors, (11677), 9663 states have internal predecessors, (11677), 0 states have call successors, (0), 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 11044 states. [2022-02-20 15:58:12,898 INFO L87 Difference]: Start difference. First operand has 9664 states, 9663 states have (on average 1.208423884921867) internal successors, (11677), 9663 states have internal predecessors, (11677), 0 states have call successors, (0), 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 11044 states. [2022-02-20 15:58:16,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:58:16,153 INFO L93 Difference]: Finished difference Result 11044 states and 13105 transitions. [2022-02-20 15:58:16,153 INFO L276 IsEmpty]: Start isEmpty. Operand 11044 states and 13105 transitions. [2022-02-20 15:58:16,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:58:16,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:58:16,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 15:58:16,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 15:58:16,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9664 states, 9663 states have (on average 1.208423884921867) internal successors, (11677), 9663 states have internal predecessors, (11677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:58:18,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9664 states to 9664 states and 11677 transitions. [2022-02-20 15:58:18,997 INFO L78 Accepts]: Start accepts. Automaton has 9664 states and 11677 transitions. Word has length 104 [2022-02-20 15:58:18,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 15:58:18,998 INFO L470 AbstractCegarLoop]: Abstraction has 9664 states and 11677 transitions. [2022-02-20 15:58:18,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:58:18,998 INFO L276 IsEmpty]: Start isEmpty. Operand 9664 states and 11677 transitions. [2022-02-20 15:58:18,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-02-20 15:58:18,999 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 15:58:18,999 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:58:18,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 15:58:18,999 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 15:58:18,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 15:58:18,999 INFO L85 PathProgramCache]: Analyzing trace with hash 304287769, now seen corresponding path program 1 times [2022-02-20 15:58:18,999 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 15:58:19,000 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106940488] [2022-02-20 15:58:19,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 15:58:19,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 15:58:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 15:58:19,214 INFO L290 TraceCheckUtils]: 0: Hoare triple {93052#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(20, 2);call #Ultimate.allocInit(12, 3);~inputD~0 := 4;~inputA~0 := 1;~inputC~0 := 3;~inputE~0 := 5;~inputB~0 := 2;~inputF~0 := 6;~a18~0 := 9;~a24~0 := 3;~a3~0 := 99;~a15~0 := 4; {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~ret11#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1; {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~input~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,216 INFO L290 TraceCheckUtils]: 3: Hoare triple {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret8#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,216 INFO L290 TraceCheckUtils]: 4: Hoare triple {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,217 INFO L290 TraceCheckUtils]: 6: Hoare triple {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,218 INFO L290 TraceCheckUtils]: 8: Hoare triple {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((0 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((0 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,219 INFO L290 TraceCheckUtils]: 10: Hoare triple {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((2 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((2 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,220 INFO L290 TraceCheckUtils]: 13: Hoare triple {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((0 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,222 INFO L290 TraceCheckUtils]: 16: Hoare triple {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((0 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,222 INFO L290 TraceCheckUtils]: 17: Hoare triple {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((0 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,222 INFO L290 TraceCheckUtils]: 18: Hoare triple {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,223 INFO L290 TraceCheckUtils]: 19: Hoare triple {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((0 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,223 INFO L290 TraceCheckUtils]: 20: Hoare triple {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((2 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,224 INFO L290 TraceCheckUtils]: 21: Hoare triple {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,224 INFO L290 TraceCheckUtils]: 22: Hoare triple {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,225 INFO L290 TraceCheckUtils]: 23: Hoare triple {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((0 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,225 INFO L290 TraceCheckUtils]: 24: Hoare triple {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((0 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,225 INFO L290 TraceCheckUtils]: 25: Hoare triple {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,226 INFO L290 TraceCheckUtils]: 26: Hoare triple {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,226 INFO L290 TraceCheckUtils]: 27: Hoare triple {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((2 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,227 INFO L290 TraceCheckUtils]: 28: Hoare triple {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,227 INFO L290 TraceCheckUtils]: 29: Hoare triple {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((0 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,228 INFO L290 TraceCheckUtils]: 30: Hoare triple {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((2 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,228 INFO L290 TraceCheckUtils]: 31: Hoare triple {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((2 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,229 INFO L290 TraceCheckUtils]: 32: Hoare triple {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((2 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,229 INFO L290 TraceCheckUtils]: 33: Hoare triple {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((0 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,229 INFO L290 TraceCheckUtils]: 34: Hoare triple {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((2 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,230 INFO L290 TraceCheckUtils]: 35: Hoare triple {93054#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} assume !(((3 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,230 INFO L290 TraceCheckUtils]: 36: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((0 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,231 INFO L290 TraceCheckUtils]: 37: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,231 INFO L290 TraceCheckUtils]: 38: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((2 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,232 INFO L290 TraceCheckUtils]: 39: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,232 INFO L290 TraceCheckUtils]: 40: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((0 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,232 INFO L290 TraceCheckUtils]: 41: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,233 INFO L290 TraceCheckUtils]: 42: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((2 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,233 INFO L290 TraceCheckUtils]: 43: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((0 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,234 INFO L290 TraceCheckUtils]: 44: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((0 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,234 INFO L290 TraceCheckUtils]: 45: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((0 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,235 INFO L290 TraceCheckUtils]: 46: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((2 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,235 INFO L290 TraceCheckUtils]: 47: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,235 INFO L290 TraceCheckUtils]: 48: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((0 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,236 INFO L290 TraceCheckUtils]: 49: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,236 INFO L290 TraceCheckUtils]: 50: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((0 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,236 INFO L290 TraceCheckUtils]: 51: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((0 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,237 INFO L290 TraceCheckUtils]: 52: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((2 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,237 INFO L290 TraceCheckUtils]: 53: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,238 INFO L290 TraceCheckUtils]: 54: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,238 INFO L290 TraceCheckUtils]: 55: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((0 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,238 INFO L290 TraceCheckUtils]: 56: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,239 INFO L290 TraceCheckUtils]: 57: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,239 INFO L290 TraceCheckUtils]: 58: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((2 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,240 INFO L290 TraceCheckUtils]: 59: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((0 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,240 INFO L290 TraceCheckUtils]: 60: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,241 INFO L290 TraceCheckUtils]: 61: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((2 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,241 INFO L290 TraceCheckUtils]: 62: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,241 INFO L290 TraceCheckUtils]: 63: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((2 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,242 INFO L290 TraceCheckUtils]: 64: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((2 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,242 INFO L290 TraceCheckUtils]: 65: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !((5 == calculate_output_~input#1 && ((~a3~0 <= 115 && 9 == ~a18~0 && 3 == ~a24~0) || (417 < ~a3~0 && 12 == ~a18~0 && 2 == ~a24~0) || (~a3~0 <= 115 && 3 == ~a24~0 && 8 == ~a18~0))) && 6 == ~a15~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,243 INFO L290 TraceCheckUtils]: 66: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(5 == ~a15~0 && ((6 == calculate_output_~input#1 && (8 == ~a18~0 || 9 == ~a18~0)) && 3 == ~a24~0) && 417 < ~a3~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,243 INFO L290 TraceCheckUtils]: 67: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !((4 == ~a15~0 && 4 == ~a24~0 && (11 == ~a18~0 || 12 == ~a18~0) && 5 == calculate_output_~input#1) && 115 < ~a3~0 && 306 >= ~a3~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,244 INFO L290 TraceCheckUtils]: 68: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !((4 == ~a24~0 && (3 == calculate_output_~input#1 && (9 == ~a18~0 || 10 == ~a18~0)) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,244 INFO L290 TraceCheckUtils]: 69: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(~a3~0 <= 115 && ((5 == calculate_output_~input#1 && (9 == ~a18~0 || 10 == ~a18~0)) && 5 == ~a15~0) && 1 == ~a24~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,245 INFO L290 TraceCheckUtils]: 70: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !((10 == ~a18~0 && (417 < ~a3~0 && 3 == calculate_output_~input#1) && 5 == ~a15~0) && 3 == ~a24~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,246 INFO L290 TraceCheckUtils]: 71: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !((((((8 == ~a18~0 || 9 == ~a18~0) || 10 == ~a18~0) && 2 == calculate_output_~input#1) && 4 == ~a15~0) && 4 == ~a24~0) && 306 < ~a3~0 && 417 >= ~a3~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,247 INFO L290 TraceCheckUtils]: 72: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((((11 == ~a18~0 || 12 == ~a18~0) && 5 == calculate_output_~input#1) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0) && 3 == ~a24~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,247 INFO L290 TraceCheckUtils]: 73: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(12 == ~a18~0 && ((6 == calculate_output_~input#1 && ~a3~0 <= 115) && 2 == ~a24~0) && 5 == ~a15~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,248 INFO L290 TraceCheckUtils]: 74: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !((417 < ~a3~0 && (((10 == ~a18~0 || 11 == ~a18~0) || 12 == ~a18~0) && 6 == calculate_output_~input#1) && 0 == ~a24~0) && 5 == ~a15~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,248 INFO L290 TraceCheckUtils]: 75: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(2 == ~a24~0 && (2 == calculate_output_~input#1 && ((12 == ~a18~0 && 306 < ~a3~0 && 417 >= ~a3~0) || (8 == ~a18~0 && 417 < ~a3~0))) && 6 == ~a15~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,248 INFO L290 TraceCheckUtils]: 76: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(6 == ~a15~0 && ((((8 == ~a18~0 || 9 == ~a18~0) || 10 == ~a18~0) && 3 == calculate_output_~input#1) && 115 < ~a3~0 && 306 >= ~a3~0) && 1 == ~a24~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,249 INFO L290 TraceCheckUtils]: 77: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !((0 == ~a24~0 && 6 == ~a15~0 && 2 == calculate_output_~input#1 && (9 == ~a18~0 || 10 == ~a18~0)) && 115 < ~a3~0 && 306 >= ~a3~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,249 INFO L290 TraceCheckUtils]: 78: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !((306 < ~a3~0 && 417 >= ~a3~0) && (5 == ~a15~0 && 2 == calculate_output_~input#1 && 12 == ~a18~0) && 3 == ~a24~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,250 INFO L290 TraceCheckUtils]: 79: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(5 == ~a15~0 && 2 == ~a24~0 && (306 < ~a3~0 && 417 >= ~a3~0) && (9 == ~a18~0 || 10 == ~a18~0) && 5 == calculate_output_~input#1); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,250 INFO L290 TraceCheckUtils]: 80: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(1 == ~a24~0 && (4 == calculate_output_~input#1 && (((11 == ~a18~0 && 115 < ~a3~0 && 306 >= ~a3~0) || (12 == ~a18~0 && 115 < ~a3~0 && 306 >= ~a3~0)) || (8 == ~a18~0 && 306 < ~a3~0 && 417 >= ~a3~0))) && 5 == ~a15~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,251 INFO L290 TraceCheckUtils]: 81: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !((1 == ~a24~0 && (~a3~0 <= 115 && 6 == calculate_output_~input#1) && 5 == ~a15~0) && 11 == ~a18~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,251 INFO L290 TraceCheckUtils]: 82: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(10 == ~a18~0 && (306 < ~a3~0 && 417 >= ~a3~0) && 6 == ~a15~0 && 0 == ~a24~0 && 1 == calculate_output_~input#1); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,251 INFO L290 TraceCheckUtils]: 83: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(3 == ~a24~0 && 6 == ~a15~0 && (4 == calculate_output_~input#1 && (10 == ~a18~0 || 11 == ~a18~0)) && 417 < ~a3~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,252 INFO L290 TraceCheckUtils]: 84: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((((((306 < ~a3~0 && 417 >= ~a3~0) && 12 == ~a18~0) || (8 == ~a18~0 && 417 < ~a3~0)) || (417 < ~a3~0 && 9 == ~a18~0)) && 2 == calculate_output_~input#1) && 3 == ~a24~0) && 6 == ~a15~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,252 INFO L290 TraceCheckUtils]: 85: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(4 == ~a24~0 && 4 == ~a15~0 && (306 < ~a3~0 && 417 >= ~a3~0) && (10 == ~a18~0 || 8 == ~a18~0 || 9 == ~a18~0) && 1 == calculate_output_~input#1); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,253 INFO L290 TraceCheckUtils]: 86: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(4 == ~a15~0 && ((306 < ~a3~0 && 417 >= ~a3~0) && 1 == calculate_output_~input#1 && (10 == ~a18~0 || 8 == ~a18~0 || 9 == ~a18~0)) && 3 == ~a24~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,253 INFO L290 TraceCheckUtils]: 87: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(2 == ~a24~0 && 6 == ~a15~0 && 417 < ~a3~0 && ((9 == ~a18~0 || 10 == ~a18~0) || 11 == ~a18~0) && 2 == calculate_output_~input#1); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,254 INFO L290 TraceCheckUtils]: 88: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !((((6 == calculate_output_~input#1 && ((9 == ~a18~0 || 10 == ~a18~0) || 11 == ~a18~0)) && 2 == ~a24~0) && 6 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,254 INFO L290 TraceCheckUtils]: 89: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !((6 == ~a15~0 && 0 == ~a24~0 && (11 == ~a18~0 || 12 == ~a18~0) && 1 == calculate_output_~input#1) && 306 < ~a3~0 && 417 >= ~a3~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,254 INFO L290 TraceCheckUtils]: 90: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(5 == ~a15~0 && 12 == ~a18~0 && (~a3~0 <= 115 && 1 == calculate_output_~input#1) && 2 == ~a24~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,255 INFO L290 TraceCheckUtils]: 91: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !((3 == ~a24~0 && 4 == calculate_output_~input#1 && ((9 == ~a18~0 && 417 < ~a3~0) || ((306 < ~a3~0 && 417 >= ~a3~0) && 12 == ~a18~0) || (417 < ~a3~0 && 8 == ~a18~0))) && 6 == ~a15~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,255 INFO L290 TraceCheckUtils]: 92: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && 1 == calculate_output_~input#1 && 8 == ~a18~0) && ~a3~0 <= 115) && 5 == ~a15~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,256 INFO L290 TraceCheckUtils]: 93: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(4 == ~a15~0 && ((((12 == ~a18~0 && 3 == ~a24~0) && 417 < ~a3~0) || ((4 == ~a24~0 && 8 == ~a18~0) && ~a3~0 <= 115)) || ((4 == ~a24~0 && 9 == ~a18~0) && ~a3~0 <= 115)) && 5 == calculate_output_~input#1); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,256 INFO L290 TraceCheckUtils]: 94: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !((0 == ~a24~0 && 6 == ~a15~0 && 3 == calculate_output_~input#1 && (11 == ~a18~0 || 12 == ~a18~0)) && 306 < ~a3~0 && 417 >= ~a3~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,261 INFO L290 TraceCheckUtils]: 95: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !((115 < ~a3~0 && 306 >= ~a3~0) && 0 == ~a24~0 && 6 == ~a15~0 && 1 == calculate_output_~input#1 && (9 == ~a18~0 || 10 == ~a18~0)); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,262 INFO L290 TraceCheckUtils]: 96: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((2 == ~a24~0 && 5 == ~a15~0 && 2 == calculate_output_~input#1) && ~a3~0 <= 115) && 9 == ~a18~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,263 INFO L290 TraceCheckUtils]: 97: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(0 == ~a24~0 && (6 == ~a15~0 && (9 == ~a18~0 || 10 == ~a18~0) && 5 == calculate_output_~input#1) && 115 < ~a3~0 && 306 >= ~a3~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,263 INFO L290 TraceCheckUtils]: 98: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(4 == ~a15~0 && (4 == ~a24~0 && (9 == ~a18~0 || 10 == ~a18~0) && 4 == calculate_output_~input#1) && 417 < ~a3~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,264 INFO L290 TraceCheckUtils]: 99: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(5 == ~a15~0 && 417 < ~a3~0 && 1 == ~a24~0 && 6 == calculate_output_~input#1 && 11 == ~a18~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,264 INFO L290 TraceCheckUtils]: 100: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((((417 < ~a3~0 && 3 == ~a24~0 && 12 == ~a18~0) || ((4 == ~a24~0 && 8 == ~a18~0) && ~a3~0 <= 115)) || (~a3~0 <= 115 && 4 == ~a24~0 && 9 == ~a18~0)) && 2 == calculate_output_~input#1) && 5 == ~a15~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,265 INFO L290 TraceCheckUtils]: 101: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(5 == ~a15~0 && (((10 == ~a18~0 || 11 == ~a18~0) && 3 == calculate_output_~input#1) && 3 == ~a24~0) && ~a3~0 <= 115); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,265 INFO L290 TraceCheckUtils]: 102: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !((((417 < ~a3~0 && 5 == ~a15~0 && 11 == ~a18~0 && 4 == ~a24~0) || (417 < ~a3~0 && 5 == ~a15~0 && 4 == ~a24~0 && 12 == ~a18~0)) || (~a3~0 <= 115 && 6 == ~a15~0 && 8 == ~a18~0 && 0 == ~a24~0)) && 1 == calculate_output_~input#1); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,266 INFO L290 TraceCheckUtils]: 103: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(6 == ~a15~0 && ((~a3~0 <= 115 && 9 == ~a18~0 && 1 == ~a24~0) || (417 < ~a3~0 && 12 == ~a18~0 && 0 == ~a24~0) || (~a3~0 <= 115 && 8 == ~a18~0 && 1 == ~a24~0)) && 2 == calculate_output_~input#1); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,266 INFO L290 TraceCheckUtils]: 104: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !((4 == ~a24~0 && ((417 < ~a3~0 && 8 == ~a18~0) || ((306 < ~a3~0 && 417 >= ~a3~0) && 11 == ~a18~0) || ((306 < ~a3~0 && 417 >= ~a3~0) && 12 == ~a18~0)) && 2 == calculate_output_~input#1) && 4 == ~a15~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,267 INFO L290 TraceCheckUtils]: 105: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(11 == ~a18~0 && (1 == ~a24~0 && 3 == calculate_output_~input#1 && 6 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,267 INFO L290 TraceCheckUtils]: 106: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !((306 < ~a3~0 && 417 >= ~a3~0) && 5 == ~a15~0 && ((9 == ~a18~0 || 10 == ~a18~0) && 5 == calculate_output_~input#1) && 1 == ~a24~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,268 INFO L290 TraceCheckUtils]: 107: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((((8 == ~a18~0 && 417 < ~a3~0) || ((306 < ~a3~0 && 417 >= ~a3~0) && 11 == ~a18~0) || (12 == ~a18~0 && 306 < ~a3~0 && 417 >= ~a3~0)) && 3 == calculate_output_~input#1) && 3 == ~a24~0) && 4 == ~a15~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,268 INFO L290 TraceCheckUtils]: 108: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !((306 < ~a3~0 && 417 >= ~a3~0) && (((11 == ~a18~0 || 12 == ~a18~0) && 3 == calculate_output_~input#1) && 0 == ~a24~0) && 5 == ~a15~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,269 INFO L290 TraceCheckUtils]: 109: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !((~a3~0 <= 115 && (2 == calculate_output_~input#1 && 12 == ~a18~0) && 2 == ~a24~0) && 6 == ~a15~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,269 INFO L290 TraceCheckUtils]: 110: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !((115 < ~a3~0 && 306 >= ~a3~0) && (6 == ~a15~0 && 1 == calculate_output_~input#1 && 0 == ~a24~0) && 11 == ~a18~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,270 INFO L290 TraceCheckUtils]: 111: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(3 == ~a24~0 && 4 == ~a15~0 && (4 == calculate_output_~input#1 && (11 == ~a18~0 || 12 == ~a18~0)) && 115 < ~a3~0 && 306 >= ~a3~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,270 INFO L290 TraceCheckUtils]: 112: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((((9 == ~a18~0 || 10 == ~a18~0) && 5 == calculate_output_~input#1) && 417 < ~a3~0) && 5 == ~a15~0) && 1 == ~a24~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,271 INFO L290 TraceCheckUtils]: 113: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !((6 == ~a15~0 && (6 == calculate_output_~input#1 && ((10 == ~a18~0 || 11 == ~a18~0) || 12 == ~a18~0)) && ~a3~0 <= 115) && 1 == ~a24~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,271 INFO L290 TraceCheckUtils]: 114: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !((3 == ~a24~0 && (((9 == ~a18~0 || 10 == ~a18~0) || 11 == ~a18~0) && 4 == calculate_output_~input#1) && 417 < ~a3~0) && 4 == ~a15~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,272 INFO L290 TraceCheckUtils]: 115: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((1 == ~a24~0 && (11 == ~a18~0 || 12 == ~a18~0) && 4 == calculate_output_~input#1) && 6 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,272 INFO L290 TraceCheckUtils]: 116: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(5 == ~a15~0 && (2 == ~a24~0 && 2 == calculate_output_~input#1 && 12 == ~a18~0) && ~a3~0 <= 115); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,273 INFO L290 TraceCheckUtils]: 117: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume !(((306 < ~a3~0 && 417 >= ~a3~0) && ((9 == ~a18~0 || 10 == ~a18~0) && 4 == calculate_output_~input#1) && 2 == ~a24~0) && 5 == ~a15~0); {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:19,274 INFO L290 TraceCheckUtils]: 118: Hoare triple {93055#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} assume 4 == ~a15~0 && ((((12 == ~a18~0 && 3 == ~a24~0) && 417 < ~a3~0) || (~a3~0 <= 115 && 4 == ~a24~0 && 8 == ~a18~0)) || ((4 == ~a24~0 && 9 == ~a18~0) && ~a3~0 <= 115)) && 2 == calculate_output_~input#1;~a3~0 := -3 + ((if ~a3~0 < 0 && 0 != ~a3~0 % 300057 then ~a3~0 % 300057 - 300057 else ~a3~0 % 300057) - 299941);~a24~0 := 0;~a18~0 := 10;~a15~0 := 5;calculate_output_#res#1 := 25; {93053#false} is VALID [2022-02-20 15:58:19,274 INFO L290 TraceCheckUtils]: 119: Hoare triple {93053#false} main_#t~ret11#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~output~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1; {93053#false} is VALID [2022-02-20 15:58:19,274 INFO L290 TraceCheckUtils]: 120: Hoare triple {93053#false} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~input~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {93053#false} is VALID [2022-02-20 15:58:19,274 INFO L290 TraceCheckUtils]: 121: Hoare triple {93053#false} assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret8#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {93053#false} is VALID [2022-02-20 15:58:19,275 INFO L290 TraceCheckUtils]: 122: Hoare triple {93053#false} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {93053#false} is VALID [2022-02-20 15:58:19,275 INFO L290 TraceCheckUtils]: 123: Hoare triple {93053#false} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {93053#false} is VALID [2022-02-20 15:58:19,275 INFO L290 TraceCheckUtils]: 124: Hoare triple {93053#false} assume !(((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {93053#false} is VALID [2022-02-20 15:58:19,275 INFO L290 TraceCheckUtils]: 125: Hoare triple {93053#false} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {93053#false} is VALID [2022-02-20 15:58:19,275 INFO L290 TraceCheckUtils]: 126: Hoare triple {93053#false} assume !(((0 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {93053#false} is VALID [2022-02-20 15:58:19,275 INFO L290 TraceCheckUtils]: 127: Hoare triple {93053#false} assume ((0 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115; {93053#false} is VALID [2022-02-20 15:58:19,275 INFO L290 TraceCheckUtils]: 128: Hoare triple {93053#false} assume !false; {93053#false} is VALID [2022-02-20 15:58:19,276 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 15:58:19,276 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 15:58:19,277 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106940488] [2022-02-20 15:58:19,277 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106940488] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 15:58:19,277 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 15:58:19,277 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 15:58:19,277 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974866530] [2022-02-20 15:58:19,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 15:58:19,278 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 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 129 [2022-02-20 15:58:19,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 15:58:19,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 15:58:19,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 15:58:19,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 15:58:19,366 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 15:58:19,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 15:58:19,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 15:58:19,367 INFO L87 Difference]: Start difference. First operand 9664 states and 11677 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)