./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem18_label09.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_label09.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 8238f3d69c5a2ce68eeddb740d20da5e42c16de126d9f09bc4b980c86c1ce0e1 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 15:57:54,127 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 15:57:54,129 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 15:57:54,153 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 15:57:54,154 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 15:57:54,155 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 15:57:54,156 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 15:57:54,157 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 15:57:54,159 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 15:57:54,159 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 15:57:54,160 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 15:57:54,161 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 15:57:54,162 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 15:57:54,162 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 15:57:54,163 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 15:57:54,164 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 15:57:54,165 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 15:57:54,166 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 15:57:54,167 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 15:57:54,169 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 15:57:54,170 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 15:57:54,171 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 15:57:54,173 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 15:57:54,173 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 15:57:54,176 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 15:57:54,176 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 15:57:54,176 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 15:57:54,177 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 15:57:54,178 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 15:57:54,178 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 15:57:54,179 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 15:57:54,183 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 15:57:54,184 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 15:57:54,190 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 15:57:54,191 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 15:57:54,191 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 15:57:54,192 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 15:57:54,192 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 15:57:54,192 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 15:57:54,193 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 15:57:54,194 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 15:57:54,195 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:54,230 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 15:57:54,230 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 15:57:54,230 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 15:57:54,231 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 15:57:54,231 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 15:57:54,231 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 15:57:54,232 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 15:57:54,232 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 15:57:54,232 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 15:57:54,232 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 15:57:54,232 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 15:57:54,232 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 15:57:54,232 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 15:57:54,233 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 15:57:54,233 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 15:57:54,233 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 15:57:54,233 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 15:57:54,233 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 15:57:54,233 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 15:57:54,233 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 15:57:54,233 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 15:57:54,233 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 15:57:54,234 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 15:57:54,234 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 15:57:54,234 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 15:57:54,234 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 15:57:54,234 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 15:57:54,234 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 15:57:54,234 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 15:57:54,234 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 15:57:54,234 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 15:57:54,235 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 15:57:54,235 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 15:57:54,235 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 -> 8238f3d69c5a2ce68eeddb740d20da5e42c16de126d9f09bc4b980c86c1ce0e1 [2022-02-20 15:57:54,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 15:57:54,480 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 15:57:54,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 15:57:54,483 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 15:57:54,484 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 15:57:54,485 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem18_label09.c [2022-02-20 15:57:54,543 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f131ede09/b07c57b112944d09830e76be48de4852/FLAGe1af7b17c [2022-02-20 15:57:55,127 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 15:57:55,128 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label09.c [2022-02-20 15:57:55,157 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f131ede09/b07c57b112944d09830e76be48de4852/FLAGe1af7b17c [2022-02-20 15:57:55,556 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f131ede09/b07c57b112944d09830e76be48de4852 [2022-02-20 15:57:55,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 15:57:55,560 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 15:57:55,561 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 15:57:55,562 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 15:57:55,569 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 15:57:55,570 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 03:57:55" (1/1) ... [2022-02-20 15:57:55,571 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28572ec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:57:55, skipping insertion in model container [2022-02-20 15:57:55,571 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 03:57:55" (1/1) ... [2022-02-20 15:57:55,576 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 15:57:55,663 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 15:57:55,786 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_label09.c[1446,1459] [2022-02-20 15:57:56,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 15:57:56,516 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 15:57:56,536 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_label09.c[1446,1459] [2022-02-20 15:57:56,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 15:57:56,975 INFO L208 MainTranslator]: Completed translation [2022-02-20 15:57:56,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:57:56 WrapperNode [2022-02-20 15:57:56,976 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 15:57:56,978 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 15:57:56,979 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 15:57:56,979 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 15:57:56,984 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:56" (1/1) ... [2022-02-20 15:57:57,040 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:56" (1/1) ... [2022-02-20 15:57:57,268 INFO L137 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4132 [2022-02-20 15:57:57,269 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 15:57:57,270 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 15:57:57,270 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 15:57:57,270 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 15:57:57,277 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:56" (1/1) ... [2022-02-20 15:57:57,278 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:56" (1/1) ... [2022-02-20 15:57:57,341 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:56" (1/1) ... [2022-02-20 15:57:57,344 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:56" (1/1) ... [2022-02-20 15:57:57,434 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:56" (1/1) ... [2022-02-20 15:57:57,462 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:56" (1/1) ... [2022-02-20 15:57:57,478 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:56" (1/1) ... [2022-02-20 15:57:57,500 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 15:57:57,501 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 15:57:57,501 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 15:57:57,502 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 15:57:57,503 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:57:56" (1/1) ... [2022-02-20 15:57:57,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 15:57:57,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 15:57:57,609 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:57,670 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:57,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 15:57:57,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 15:57:57,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 15:57:57,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 15:57:57,769 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 15:57:57,770 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 15:58:02,487 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 15:58:02,505 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 15:58:02,505 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 15:58:02,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 03:58:02 BoogieIcfgContainer [2022-02-20 15:58:02,508 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 15:58:02,510 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 15:58:02,510 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 15:58:02,512 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 15:58:02,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 03:57:55" (1/3) ... [2022-02-20 15:58:02,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a65b236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 03:58:02, skipping insertion in model container [2022-02-20 15:58:02,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:57:56" (2/3) ... [2022-02-20 15:58:02,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a65b236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 03:58:02, skipping insertion in model container [2022-02-20 15:58:02,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 03:58:02" (3/3) ... [2022-02-20 15:58:02,516 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem18_label09.c [2022-02-20 15:58:02,522 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 15:58:02,523 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 15:58:02,585 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 15:58:02,601 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:58:02,605 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 15:58:02,645 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:58:02,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 15:58:02,649 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 15:58:02,649 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 15:58:02,650 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 15:58:02,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 15:58:02,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1417350502, now seen corresponding path program 1 times [2022-02-20 15:58:02,662 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 15:58:02,662 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876014693] [2022-02-20 15:58:02,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 15:58:02,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 15:58:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 15:58:02,832 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#(<= 9 ~a18~0)} is VALID [2022-02-20 15:58:02,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {762#(<= 9 ~a18~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#(<= 9 ~a18~0)} is VALID [2022-02-20 15:58:02,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {762#(<= 9 ~a18~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#(<= 9 ~a18~0)} is VALID [2022-02-20 15:58:02,834 INFO L290 TraceCheckUtils]: 3: Hoare triple {762#(<= 9 ~a18~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#(<= 9 ~a18~0)} is VALID [2022-02-20 15:58:02,834 INFO L290 TraceCheckUtils]: 4: Hoare triple {762#(<= 9 ~a18~0)} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {762#(<= 9 ~a18~0)} is VALID [2022-02-20 15:58:02,835 INFO L290 TraceCheckUtils]: 5: Hoare triple {762#(<= 9 ~a18~0)} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {762#(<= 9 ~a18~0)} is VALID [2022-02-20 15:58:02,836 INFO L290 TraceCheckUtils]: 6: Hoare triple {762#(<= 9 ~a18~0)} assume !(((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {762#(<= 9 ~a18~0)} is VALID [2022-02-20 15:58:02,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {762#(<= 9 ~a18~0)} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {762#(<= 9 ~a18~0)} is VALID [2022-02-20 15:58:02,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {762#(<= 9 ~a18~0)} assume ((0 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0; {761#false} is VALID [2022-02-20 15:58:02,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {761#false} assume !false; {761#false} is VALID [2022-02-20 15:58:02,838 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:58:02,839 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 15:58:02,839 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876014693] [2022-02-20 15:58:02,840 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876014693] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 15:58:02,840 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 15:58:02,840 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 15:58:02,841 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646335834] [2022-02-20 15:58:02,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 15:58:02,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-02-20 15:58:02,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 15:58:02,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have 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:02,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 15:58:02,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 15:58:02,868 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 15:58:02,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 15:58:02,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 15:58:02,895 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.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have 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:07,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:58:07,912 INFO L93 Difference]: Finished difference Result 2205 states and 4266 transitions. [2022-02-20 15:58:07,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 15:58:07,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-02-20 15:58:07,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 15:58:07,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have 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:07,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4266 transitions. [2022-02-20 15:58:07,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have 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:08,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4266 transitions. [2022-02-20 15:58:08,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4266 transitions. [2022-02-20 15:58:11,022 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:58:11,342 INFO L225 Difference]: With dead ends: 2205 [2022-02-20 15:58:11,342 INFO L226 Difference]: Without dead ends: 1384 [2022-02-20 15:58:11,350 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:58:11,354 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 753 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2402 mSolverCounterSat, 547 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 2949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 547 IncrementalHoareTripleChecker+Valid, 2402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-02-20 15:58:11,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [753 Valid, 71 Invalid, 2949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [547 Valid, 2402 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-02-20 15:58:11,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2022-02-20 15:58:11,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1384. [2022-02-20 15:58:11,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 15:58:11,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1384 states. Second operand has 1384 states, 1383 states have (on average 1.8770788141720895) internal successors, (2596), 1383 states have internal predecessors, (2596), 0 states have call successors, (0), 0 states have 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:11,457 INFO L74 IsIncluded]: Start isIncluded. First operand 1384 states. Second operand has 1384 states, 1383 states have (on average 1.8770788141720895) internal successors, (2596), 1383 states have internal predecessors, (2596), 0 states have call successors, (0), 0 states have 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:11,460 INFO L87 Difference]: Start difference. First operand 1384 states. Second operand has 1384 states, 1383 states have (on average 1.8770788141720895) internal successors, (2596), 1383 states have internal predecessors, (2596), 0 states have call successors, (0), 0 states have 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:11,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:58:11,619 INFO L93 Difference]: Finished difference Result 1384 states and 2596 transitions. [2022-02-20 15:58:11,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2596 transitions. [2022-02-20 15:58:11,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:58:11,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:58:11,629 INFO L74 IsIncluded]: Start isIncluded. First operand has 1384 states, 1383 states have (on average 1.8770788141720895) internal successors, (2596), 1383 states have internal predecessors, (2596), 0 states have call successors, (0), 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:58:11,631 INFO L87 Difference]: Start difference. First operand has 1384 states, 1383 states have (on average 1.8770788141720895) internal successors, (2596), 1383 states have internal predecessors, (2596), 0 states have call successors, (0), 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:58:11,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:58:11,718 INFO L93 Difference]: Finished difference Result 1384 states and 2596 transitions. [2022-02-20 15:58:11,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2596 transitions. [2022-02-20 15:58:11,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:58:11,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:58:11,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 15:58:11,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 15:58:11,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1383 states have (on average 1.8770788141720895) internal successors, (2596), 1383 states have internal predecessors, (2596), 0 states have call successors, (0), 0 states have 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:11,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2596 transitions. [2022-02-20 15:58:11,818 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 2596 transitions. Word has length 10 [2022-02-20 15:58:11,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 15:58:11,819 INFO L470 AbstractCegarLoop]: Abstraction has 1384 states and 2596 transitions. [2022-02-20 15:58:11,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have 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:11,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2596 transitions. [2022-02-20 15:58:11,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-20 15:58:11,821 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 15:58:11,821 INFO L514 BasicCegarLoop]: trace histogram [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:58:11,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 15:58:11,822 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 15:58:11,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 15:58:11,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1120386966, now seen corresponding path program 1 times [2022-02-20 15:58:11,824 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 15:58:11,824 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774160870] [2022-02-20 15:58:11,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 15:58:11,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 15:58:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 15:58:11,994 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:58:11,995 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:58:11,996 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:58:11,996 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:58:11,997 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:58:11,997 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:58:11,997 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:58:12,002 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:58:12,004 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:58:12,004 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:58:12,004 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:58:12,005 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:58:12,005 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:58:12,010 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:58:12,010 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:58:12,011 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:58:12,011 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:58:12,012 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:58:12,012 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:58:12,012 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:58:12,013 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:58:12,013 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:58:12,014 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:58:12,014 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:58:12,015 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:58:12,015 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:58:12,016 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:58:12,016 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:58:12,017 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:58:12,018 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:58:12,018 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:58:12,019 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:58:12,019 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:58:12,020 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:58:12,020 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:58:12,021 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:58:12,021 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:58:12,022 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:58:12,022 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:58:12,028 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:58:12,029 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:58:12,030 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:58:12,030 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:58:12,031 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:58:12,031 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:58:12,031 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:58:12,032 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:58:12,032 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:58:12,033 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:58:12,033 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:58:12,034 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:58:12,034 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:58:12,035 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:58:12,035 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:58:12,036 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:58:12,036 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:58:12,037 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:58:12,037 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:58:12,037 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:58:12,038 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:58:12,038 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:58:12,039 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:58:12,039 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:58:12,040 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:58:12,040 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:58:12,041 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;~a3~0 := 300208 + (if (if 9 * ~a3~0 < 0 && 0 != 9 * ~a3~0 % 10 then 1 + 9 * ~a3~0 / 10 else 9 * ~a3~0 / 10) < 0 && 0 != (if 9 * ~a3~0 < 0 && 0 != 9 * ~a3~0 % 10 then 1 + 9 * ~a3~0 / 10 else 9 * ~a3~0 / 10) % 299791 then (if 9 * ~a3~0 < 0 && 0 != 9 * ~a3~0 % 10 then 1 + 9 * ~a3~0 / 10 else 9 * ~a3~0 / 10) % 299791 - 299791 else (if 9 * ~a3~0 < 0 && 0 != 9 * ~a3~0 % 10 then 1 + 9 * ~a3~0 / 10 else 9 * ~a3~0 / 10) % 299791);~a24~0 := 3;~a18~0 := 8;~a15~0 := 4;calculate_output_#res#1 := 22; {7146#false} is VALID [2022-02-20 15:58:12,041 INFO L290 TraceCheckUtils]: 66: 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:58:12,042 INFO L290 TraceCheckUtils]: 67: 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:58:12,042 INFO L290 TraceCheckUtils]: 68: 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:58:12,042 INFO L290 TraceCheckUtils]: 69: 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:58:12,042 INFO L290 TraceCheckUtils]: 70: 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:58:12,044 INFO L290 TraceCheckUtils]: 71: 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:58:12,044 INFO L290 TraceCheckUtils]: 72: 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:58:12,044 INFO L290 TraceCheckUtils]: 73: 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:58:12,044 INFO L290 TraceCheckUtils]: 74: Hoare triple {7146#false} assume !false; {7146#false} is VALID [2022-02-20 15:58:12,046 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 15:58:12,046 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 15:58:12,047 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774160870] [2022-02-20 15:58:12,047 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774160870] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 15:58:12,047 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 15:58:12,048 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 15:58:12,048 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877159051] [2022-02-20 15:58:12,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 15:58:12,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2022-02-20 15:58:12,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 15:58:12,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have 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,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 15:58:12,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 15:58:12,105 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 15:58:12,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 15:58:12,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 15:58:12,107 INFO L87 Difference]: Start difference. First operand 1384 states and 2596 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have 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:16,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:58:16,558 INFO L93 Difference]: Finished difference Result 4146 states and 7783 transitions. [2022-02-20 15:58:16,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 15:58:16,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2022-02-20 15:58:16,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 15:58:16,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have 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:16,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3949 transitions. [2022-02-20 15:58:16,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have 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:16,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3949 transitions. [2022-02-20 15:58:16,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 3949 transitions. [2022-02-20 15:58:19,406 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:19,634 INFO L225 Difference]: With dead ends: 4146 [2022-02-20 15:58:19,635 INFO L226 Difference]: Without dead ends: 2764 [2022-02-20 15:58:19,637 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:58:19,638 INFO L933 BasicCegarLoop]: 532 mSDtfsCounter, 709 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1703 mSolverCounterSat, 918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 2621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 918 IncrementalHoareTripleChecker+Valid, 1703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-02-20 15:58:19,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [709 Valid, 537 Invalid, 2621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [918 Valid, 1703 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-02-20 15:58:19,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2764 states. [2022-02-20 15:58:19,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 2764. [2022-02-20 15:58:19,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 15:58:19,703 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2764 states. Second operand has 2764 states, 2763 states have (on average 1.5153818313427434) internal successors, (4187), 2763 states have internal predecessors, (4187), 0 states have call successors, (0), 0 states have 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,710 INFO L74 IsIncluded]: Start isIncluded. First operand 2764 states. Second operand has 2764 states, 2763 states have (on average 1.5153818313427434) internal successors, (4187), 2763 states have internal predecessors, (4187), 0 states have call successors, (0), 0 states have 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,717 INFO L87 Difference]: Start difference. First operand 2764 states. Second operand has 2764 states, 2763 states have (on average 1.5153818313427434) internal successors, (4187), 2763 states have internal predecessors, (4187), 0 states have call successors, (0), 0 states have 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:20,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:58:20,023 INFO L93 Difference]: Finished difference Result 2764 states and 4187 transitions. [2022-02-20 15:58:20,024 INFO L276 IsEmpty]: Start isEmpty. Operand 2764 states and 4187 transitions. [2022-02-20 15:58:20,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:58:20,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:58:20,033 INFO L74 IsIncluded]: Start isIncluded. First operand has 2764 states, 2763 states have (on average 1.5153818313427434) internal successors, (4187), 2763 states have internal predecessors, (4187), 0 states have call successors, (0), 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:58:20,038 INFO L87 Difference]: Start difference. First operand has 2764 states, 2763 states have (on average 1.5153818313427434) internal successors, (4187), 2763 states have internal predecessors, (4187), 0 states have call successors, (0), 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:58:20,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:58:20,259 INFO L93 Difference]: Finished difference Result 2764 states and 4187 transitions. [2022-02-20 15:58:20,259 INFO L276 IsEmpty]: Start isEmpty. Operand 2764 states and 4187 transitions. [2022-02-20 15:58:20,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:58:20,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:58:20,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 15:58:20,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 15:58:20,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2764 states, 2763 states have (on average 1.5153818313427434) internal successors, (4187), 2763 states have internal predecessors, (4187), 0 states have call successors, (0), 0 states have 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:20,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2764 states to 2764 states and 4187 transitions. [2022-02-20 15:58:20,468 INFO L78 Accepts]: Start accepts. Automaton has 2764 states and 4187 transitions. Word has length 75 [2022-02-20 15:58:20,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 15:58:20,469 INFO L470 AbstractCegarLoop]: Abstraction has 2764 states and 4187 transitions. [2022-02-20 15:58:20,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have 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:20,469 INFO L276 IsEmpty]: Start isEmpty. Operand 2764 states and 4187 transitions. [2022-02-20 15:58:20,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 15:58:20,471 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 15:58:20,471 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-20 15:58:20,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 15:58:20,471 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 15:58:20,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 15:58:20,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1612276894, now seen corresponding path program 1 times [2022-02-20 15:58:20,472 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 15:58:20,473 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707841222] [2022-02-20 15:58:20,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 15:58:20,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 15:58:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 15:58:20,588 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#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {19630#(<= ~a24~0 3)} 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#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {19630#(<= ~a24~0 3)} 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#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,589 INFO L290 TraceCheckUtils]: 3: Hoare triple {19630#(<= ~a24~0 3)} 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#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,590 INFO L290 TraceCheckUtils]: 4: Hoare triple {19630#(<= ~a24~0 3)} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,590 INFO L290 TraceCheckUtils]: 5: Hoare triple {19630#(<= ~a24~0 3)} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,590 INFO L290 TraceCheckUtils]: 6: Hoare triple {19630#(<= ~a24~0 3)} assume !(((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {19630#(<= ~a24~0 3)} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {19630#(<= ~a24~0 3)} assume !(((0 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,592 INFO L290 TraceCheckUtils]: 9: Hoare triple {19630#(<= ~a24~0 3)} assume !(((0 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,592 INFO L290 TraceCheckUtils]: 10: Hoare triple {19630#(<= ~a24~0 3)} assume !(((2 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {19630#(<= ~a24~0 3)} assume !(((2 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,593 INFO L290 TraceCheckUtils]: 12: Hoare triple {19630#(<= ~a24~0 3)} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {19630#(<= ~a24~0 3)} assume !(((1 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {19630#(<= ~a24~0 3)} assume !(((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,594 INFO L290 TraceCheckUtils]: 15: Hoare triple {19630#(<= ~a24~0 3)} assume !(((0 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,595 INFO L290 TraceCheckUtils]: 16: Hoare triple {19630#(<= ~a24~0 3)} assume !(((0 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,595 INFO L290 TraceCheckUtils]: 17: Hoare triple {19630#(<= ~a24~0 3)} assume !(((0 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,595 INFO L290 TraceCheckUtils]: 18: Hoare triple {19630#(<= ~a24~0 3)} assume !(((1 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,598 INFO L290 TraceCheckUtils]: 19: Hoare triple {19630#(<= ~a24~0 3)} assume !(((0 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,598 INFO L290 TraceCheckUtils]: 20: Hoare triple {19630#(<= ~a24~0 3)} assume !(((2 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,598 INFO L290 TraceCheckUtils]: 21: Hoare triple {19630#(<= ~a24~0 3)} assume !(((1 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,599 INFO L290 TraceCheckUtils]: 22: Hoare triple {19630#(<= ~a24~0 3)} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,600 INFO L290 TraceCheckUtils]: 23: Hoare triple {19630#(<= ~a24~0 3)} assume !(((0 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,601 INFO L290 TraceCheckUtils]: 24: Hoare triple {19630#(<= ~a24~0 3)} assume !(((0 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,601 INFO L290 TraceCheckUtils]: 25: Hoare triple {19630#(<= ~a24~0 3)} assume !(((1 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,602 INFO L290 TraceCheckUtils]: 26: Hoare triple {19630#(<= ~a24~0 3)} assume !(((1 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,603 INFO L290 TraceCheckUtils]: 27: Hoare triple {19630#(<= ~a24~0 3)} assume !(((2 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,603 INFO L290 TraceCheckUtils]: 28: Hoare triple {19630#(<= ~a24~0 3)} assume !(((1 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,612 INFO L290 TraceCheckUtils]: 29: Hoare triple {19630#(<= ~a24~0 3)} assume !(((0 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,612 INFO L290 TraceCheckUtils]: 30: Hoare triple {19630#(<= ~a24~0 3)} assume !(((2 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,612 INFO L290 TraceCheckUtils]: 31: Hoare triple {19630#(<= ~a24~0 3)} assume !(((2 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,613 INFO L290 TraceCheckUtils]: 32: Hoare triple {19630#(<= ~a24~0 3)} assume !(((2 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,613 INFO L290 TraceCheckUtils]: 33: Hoare triple {19630#(<= ~a24~0 3)} assume !(((0 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,614 INFO L290 TraceCheckUtils]: 34: Hoare triple {19630#(<= ~a24~0 3)} assume !(((2 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,614 INFO L290 TraceCheckUtils]: 35: Hoare triple {19630#(<= ~a24~0 3)} assume !(((3 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,614 INFO L290 TraceCheckUtils]: 36: Hoare triple {19630#(<= ~a24~0 3)} assume !(((0 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,615 INFO L290 TraceCheckUtils]: 37: Hoare triple {19630#(<= ~a24~0 3)} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,617 INFO L290 TraceCheckUtils]: 38: Hoare triple {19630#(<= ~a24~0 3)} assume !(((2 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,618 INFO L290 TraceCheckUtils]: 39: Hoare triple {19630#(<= ~a24~0 3)} assume !(((1 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,618 INFO L290 TraceCheckUtils]: 40: Hoare triple {19630#(<= ~a24~0 3)} assume !(((0 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,618 INFO L290 TraceCheckUtils]: 41: Hoare triple {19630#(<= ~a24~0 3)} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,619 INFO L290 TraceCheckUtils]: 42: Hoare triple {19630#(<= ~a24~0 3)} assume !(((2 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,619 INFO L290 TraceCheckUtils]: 43: Hoare triple {19630#(<= ~a24~0 3)} assume !(((0 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,620 INFO L290 TraceCheckUtils]: 44: Hoare triple {19630#(<= ~a24~0 3)} assume !(((0 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,620 INFO L290 TraceCheckUtils]: 45: Hoare triple {19630#(<= ~a24~0 3)} assume !(((0 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,620 INFO L290 TraceCheckUtils]: 46: Hoare triple {19630#(<= ~a24~0 3)} assume !(((2 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,621 INFO L290 TraceCheckUtils]: 47: Hoare triple {19630#(<= ~a24~0 3)} assume !(((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,621 INFO L290 TraceCheckUtils]: 48: Hoare triple {19630#(<= ~a24~0 3)} assume !(((0 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,622 INFO L290 TraceCheckUtils]: 49: Hoare triple {19630#(<= ~a24~0 3)} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,622 INFO L290 TraceCheckUtils]: 50: Hoare triple {19630#(<= ~a24~0 3)} assume !(((0 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,622 INFO L290 TraceCheckUtils]: 51: Hoare triple {19630#(<= ~a24~0 3)} assume !(((0 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,623 INFO L290 TraceCheckUtils]: 52: Hoare triple {19630#(<= ~a24~0 3)} assume !(((2 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,623 INFO L290 TraceCheckUtils]: 53: Hoare triple {19630#(<= ~a24~0 3)} assume !(((1 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,624 INFO L290 TraceCheckUtils]: 54: Hoare triple {19630#(<= ~a24~0 3)} assume !(((1 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,624 INFO L290 TraceCheckUtils]: 55: Hoare triple {19630#(<= ~a24~0 3)} assume !(((0 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,625 INFO L290 TraceCheckUtils]: 56: Hoare triple {19630#(<= ~a24~0 3)} assume !(((1 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,625 INFO L290 TraceCheckUtils]: 57: Hoare triple {19630#(<= ~a24~0 3)} assume !(((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,625 INFO L290 TraceCheckUtils]: 58: Hoare triple {19630#(<= ~a24~0 3)} assume !(((2 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,626 INFO L290 TraceCheckUtils]: 59: Hoare triple {19630#(<= ~a24~0 3)} assume !(((0 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,626 INFO L290 TraceCheckUtils]: 60: Hoare triple {19630#(<= ~a24~0 3)} assume !(((1 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,627 INFO L290 TraceCheckUtils]: 61: Hoare triple {19630#(<= ~a24~0 3)} assume !(((2 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,627 INFO L290 TraceCheckUtils]: 62: Hoare triple {19630#(<= ~a24~0 3)} assume !(((1 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,627 INFO L290 TraceCheckUtils]: 63: Hoare triple {19630#(<= ~a24~0 3)} assume !(((2 == ~a24~0 && 10 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,628 INFO L290 TraceCheckUtils]: 64: Hoare triple {19630#(<= ~a24~0 3)} assume !(((2 == ~a24~0 && 12 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,628 INFO L290 TraceCheckUtils]: 65: Hoare triple {19630#(<= ~a24~0 3)} 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#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,629 INFO L290 TraceCheckUtils]: 66: Hoare triple {19630#(<= ~a24~0 3)} assume !(5 == ~a15~0 && ((6 == calculate_output_~input#1 && (8 == ~a18~0 || 9 == ~a18~0)) && 3 == ~a24~0) && 417 < ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,629 INFO L290 TraceCheckUtils]: 67: Hoare triple {19630#(<= ~a24~0 3)} assume !((4 == ~a15~0 && 4 == ~a24~0 && (11 == ~a18~0 || 12 == ~a18~0) && 5 == calculate_output_~input#1) && 115 < ~a3~0 && 306 >= ~a3~0); {19630#(<= ~a24~0 3)} is VALID [2022-02-20 15:58:20,630 INFO L290 TraceCheckUtils]: 68: Hoare triple {19630#(<= ~a24~0 3)} assume (4 == ~a24~0 && (3 == calculate_output_~input#1 && (9 == ~a18~0 || 10 == ~a18~0)) && 4 == ~a15~0) && 115 < ~a3~0 && 306 >= ~a3~0;~a3~0 := -3 * (191394 + ~a3~0);~a24~0 := 1;~a18~0 := 8;~a15~0 := 5;calculate_output_#res#1 := 21; {19629#false} is VALID [2022-02-20 15:58:20,630 INFO L290 TraceCheckUtils]: 69: 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:58:20,630 INFO L290 TraceCheckUtils]: 70: 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:58:20,630 INFO L290 TraceCheckUtils]: 71: 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:58:20,630 INFO L290 TraceCheckUtils]: 72: 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:58:20,631 INFO L290 TraceCheckUtils]: 73: 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:58:20,631 INFO L290 TraceCheckUtils]: 74: 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:58:20,631 INFO L290 TraceCheckUtils]: 75: 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:58:20,631 INFO L290 TraceCheckUtils]: 76: 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:58:20,631 INFO L290 TraceCheckUtils]: 77: Hoare triple {19629#false} assume !false; {19629#false} is VALID [2022-02-20 15:58:20,632 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 15:58:20,632 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 15:58:20,632 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707841222] [2022-02-20 15:58:20,632 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707841222] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 15:58:20,633 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 15:58:20,633 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 15:58:20,634 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465188512] [2022-02-20 15:58:20,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 15:58:20,634 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:58:20,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 15:58:20,636 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:58:20,687 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:58:20,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 15:58:20,687 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 15:58:20,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 15:58:20,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 15:58:20,688 INFO L87 Difference]: Start difference. First operand 2764 states and 4187 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:58:26,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:58:26,505 INFO L93 Difference]: Finished difference Result 8286 states and 12556 transitions. [2022-02-20 15:58:26,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 15:58:26,505 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:58:26,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 15:58:26,506 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:58:26,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3949 transitions. [2022-02-20 15:58:26,525 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:58:26,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3949 transitions. [2022-02-20 15:58:26,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 3949 transitions. [2022-02-20 15:58:29,306 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:30,141 INFO L225 Difference]: With dead ends: 8286 [2022-02-20 15:58:30,141 INFO L226 Difference]: Without dead ends: 5524 [2022-02-20 15:58:30,145 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:58:30,146 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 732 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1934 mSolverCounterSat, 1075 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 3009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1075 IncrementalHoareTripleChecker+Valid, 1934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-02-20 15:58:30,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [732 Valid, 109 Invalid, 3009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1075 Valid, 1934 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-02-20 15:58:30,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5524 states. [2022-02-20 15:58:30,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5524 to 5524. [2022-02-20 15:58:30,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 15:58:30,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5524 states. Second operand has 5524 states, 5523 states have (on average 1.463516204961072) internal successors, (8083), 5523 states have internal predecessors, (8083), 0 states have call successors, (0), 0 states have 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:30,261 INFO L74 IsIncluded]: Start isIncluded. First operand 5524 states. Second operand has 5524 states, 5523 states have (on average 1.463516204961072) internal successors, (8083), 5523 states have internal predecessors, (8083), 0 states have call successors, (0), 0 states have 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:30,267 INFO L87 Difference]: Start difference. First operand 5524 states. Second operand has 5524 states, 5523 states have (on average 1.463516204961072) internal successors, (8083), 5523 states have internal predecessors, (8083), 0 states have call successors, (0), 0 states have 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:31,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:58:31,189 INFO L93 Difference]: Finished difference Result 5524 states and 8083 transitions. [2022-02-20 15:58:31,189 INFO L276 IsEmpty]: Start isEmpty. Operand 5524 states and 8083 transitions. [2022-02-20 15:58:31,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:58:31,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:58:31,204 INFO L74 IsIncluded]: Start isIncluded. First operand has 5524 states, 5523 states have (on average 1.463516204961072) internal successors, (8083), 5523 states have internal predecessors, (8083), 0 states have call successors, (0), 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 5524 states. [2022-02-20 15:58:31,211 INFO L87 Difference]: Start difference. First operand has 5524 states, 5523 states have (on average 1.463516204961072) internal successors, (8083), 5523 states have internal predecessors, (8083), 0 states have call successors, (0), 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 5524 states. [2022-02-20 15:58:32,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:58:32,020 INFO L93 Difference]: Finished difference Result 5524 states and 8083 transitions. [2022-02-20 15:58:32,020 INFO L276 IsEmpty]: Start isEmpty. Operand 5524 states and 8083 transitions. [2022-02-20 15:58:32,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:58:32,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:58:32,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 15:58:32,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 15:58:32,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5524 states, 5523 states have (on average 1.463516204961072) internal successors, (8083), 5523 states have internal predecessors, (8083), 0 states have call successors, (0), 0 states have 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:32,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5524 states to 5524 states and 8083 transitions. [2022-02-20 15:58:32,941 INFO L78 Accepts]: Start accepts. Automaton has 5524 states and 8083 transitions. Word has length 78 [2022-02-20 15:58:32,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 15:58:32,942 INFO L470 AbstractCegarLoop]: Abstraction has 5524 states and 8083 transitions. [2022-02-20 15:58:32,942 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:58:32,942 INFO L276 IsEmpty]: Start isEmpty. Operand 5524 states and 8083 transitions. [2022-02-20 15:58:32,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-02-20 15:58:32,944 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 15:58:32,944 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-20 15:58:32,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 15:58:32,944 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 15:58:32,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 15:58:32,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1046866268, now seen corresponding path program 1 times [2022-02-20 15:58:32,945 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 15:58:32,945 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268862986] [2022-02-20 15:58:32,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 15:58:32,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 15:58:33,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 15:58:33,141 INFO L290 TraceCheckUtils]: 0: Hoare triple {44571#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; {44573#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {44573#(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; {44573#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {44573#(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; {44573#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,143 INFO L290 TraceCheckUtils]: 3: Hoare triple {44573#(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; {44573#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,144 INFO L290 TraceCheckUtils]: 4: Hoare triple {44573#(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); {44573#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,144 INFO L290 TraceCheckUtils]: 5: Hoare triple {44573#(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); {44573#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {44573#(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); {44573#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {44573#(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); {44573#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,146 INFO L290 TraceCheckUtils]: 8: Hoare triple {44573#(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); {44573#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {44573#(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); {44573#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,147 INFO L290 TraceCheckUtils]: 10: Hoare triple {44573#(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); {44573#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {44573#(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); {44573#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,148 INFO L290 TraceCheckUtils]: 12: Hoare triple {44573#(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); {44573#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,148 INFO L290 TraceCheckUtils]: 13: Hoare triple {44573#(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); {44573#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,149 INFO L290 TraceCheckUtils]: 14: Hoare triple {44573#(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); {44573#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,149 INFO L290 TraceCheckUtils]: 15: Hoare triple {44573#(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); {44573#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {44573#(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); {44573#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,150 INFO L290 TraceCheckUtils]: 17: Hoare triple {44573#(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); {44573#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,151 INFO L290 TraceCheckUtils]: 18: Hoare triple {44573#(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); {44573#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,152 INFO L290 TraceCheckUtils]: 19: Hoare triple {44573#(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); {44573#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {44573#(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); {44573#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,153 INFO L290 TraceCheckUtils]: 21: Hoare triple {44573#(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); {44573#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,153 INFO L290 TraceCheckUtils]: 22: Hoare triple {44573#(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); {44573#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,154 INFO L290 TraceCheckUtils]: 23: Hoare triple {44573#(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); {44573#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,154 INFO L290 TraceCheckUtils]: 24: Hoare triple {44573#(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); {44573#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,155 INFO L290 TraceCheckUtils]: 25: Hoare triple {44573#(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); {44573#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,155 INFO L290 TraceCheckUtils]: 26: Hoare triple {44573#(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); {44573#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,156 INFO L290 TraceCheckUtils]: 27: Hoare triple {44573#(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); {44573#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,156 INFO L290 TraceCheckUtils]: 28: Hoare triple {44573#(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); {44573#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,157 INFO L290 TraceCheckUtils]: 29: Hoare triple {44573#(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); {44573#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,157 INFO L290 TraceCheckUtils]: 30: Hoare triple {44573#(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); {44573#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,158 INFO L290 TraceCheckUtils]: 31: Hoare triple {44573#(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); {44573#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,158 INFO L290 TraceCheckUtils]: 32: Hoare triple {44573#(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); {44573#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,159 INFO L290 TraceCheckUtils]: 33: Hoare triple {44573#(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); {44573#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,160 INFO L290 TraceCheckUtils]: 34: Hoare triple {44573#(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); {44573#(and (= (+ ~a24~0 (- 3)) 0) (= (+ ~a15~0 (- 4)) 0) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,160 INFO L290 TraceCheckUtils]: 35: Hoare triple {44573#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,161 INFO L290 TraceCheckUtils]: 36: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,161 INFO L290 TraceCheckUtils]: 37: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,162 INFO L290 TraceCheckUtils]: 38: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,162 INFO L290 TraceCheckUtils]: 39: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,163 INFO L290 TraceCheckUtils]: 40: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,163 INFO L290 TraceCheckUtils]: 41: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,164 INFO L290 TraceCheckUtils]: 42: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,165 INFO L290 TraceCheckUtils]: 43: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,165 INFO L290 TraceCheckUtils]: 44: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,166 INFO L290 TraceCheckUtils]: 45: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,166 INFO L290 TraceCheckUtils]: 46: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,167 INFO L290 TraceCheckUtils]: 47: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,167 INFO L290 TraceCheckUtils]: 48: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,168 INFO L290 TraceCheckUtils]: 49: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,168 INFO L290 TraceCheckUtils]: 50: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,169 INFO L290 TraceCheckUtils]: 51: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,169 INFO L290 TraceCheckUtils]: 52: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,170 INFO L290 TraceCheckUtils]: 53: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,170 INFO L290 TraceCheckUtils]: 54: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,171 INFO L290 TraceCheckUtils]: 55: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,172 INFO L290 TraceCheckUtils]: 56: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,172 INFO L290 TraceCheckUtils]: 57: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,173 INFO L290 TraceCheckUtils]: 58: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,173 INFO L290 TraceCheckUtils]: 59: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,174 INFO L290 TraceCheckUtils]: 60: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,174 INFO L290 TraceCheckUtils]: 61: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,175 INFO L290 TraceCheckUtils]: 62: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,175 INFO L290 TraceCheckUtils]: 63: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,176 INFO L290 TraceCheckUtils]: 64: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,176 INFO L290 TraceCheckUtils]: 65: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,177 INFO L290 TraceCheckUtils]: 66: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,178 INFO L290 TraceCheckUtils]: 67: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,178 INFO L290 TraceCheckUtils]: 68: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,179 INFO L290 TraceCheckUtils]: 69: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,179 INFO L290 TraceCheckUtils]: 70: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,180 INFO L290 TraceCheckUtils]: 71: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,207 INFO L290 TraceCheckUtils]: 72: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,207 INFO L290 TraceCheckUtils]: 73: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,208 INFO L290 TraceCheckUtils]: 74: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,209 INFO L290 TraceCheckUtils]: 75: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,209 INFO L290 TraceCheckUtils]: 76: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,210 INFO L290 TraceCheckUtils]: 77: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,210 INFO L290 TraceCheckUtils]: 78: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,211 INFO L290 TraceCheckUtils]: 79: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,212 INFO L290 TraceCheckUtils]: 80: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,212 INFO L290 TraceCheckUtils]: 81: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,213 INFO L290 TraceCheckUtils]: 82: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,213 INFO L290 TraceCheckUtils]: 83: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,214 INFO L290 TraceCheckUtils]: 84: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,215 INFO L290 TraceCheckUtils]: 85: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,215 INFO L290 TraceCheckUtils]: 86: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,216 INFO L290 TraceCheckUtils]: 87: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,216 INFO L290 TraceCheckUtils]: 88: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,217 INFO L290 TraceCheckUtils]: 89: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,217 INFO L290 TraceCheckUtils]: 90: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,218 INFO L290 TraceCheckUtils]: 91: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,219 INFO L290 TraceCheckUtils]: 92: Hoare triple {44574#(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); {44574#(and (not (= (+ ~a18~0 (- 8)) 0)) (<= ~a24~0 3) (<= ~a3~0 99))} is VALID [2022-02-20 15:58:33,220 INFO L290 TraceCheckUtils]: 93: Hoare triple {44574#(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;~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; {44572#false} is VALID [2022-02-20 15:58:33,220 INFO L290 TraceCheckUtils]: 94: Hoare triple {44572#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; {44572#false} is VALID [2022-02-20 15:58:33,220 INFO L290 TraceCheckUtils]: 95: Hoare triple {44572#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; {44572#false} is VALID [2022-02-20 15:58:33,220 INFO L290 TraceCheckUtils]: 96: Hoare triple {44572#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; {44572#false} is VALID [2022-02-20 15:58:33,221 INFO L290 TraceCheckUtils]: 97: Hoare triple {44572#false} assume !(((1 == ~a24~0 && 9 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {44572#false} is VALID [2022-02-20 15:58:33,221 INFO L290 TraceCheckUtils]: 98: Hoare triple {44572#false} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {44572#false} is VALID [2022-02-20 15:58:33,221 INFO L290 TraceCheckUtils]: 99: Hoare triple {44572#false} assume !(((2 == ~a24~0 && 11 == ~a18~0) && 4 == ~a15~0) && 417 < ~a3~0); {44572#false} is VALID [2022-02-20 15:58:33,221 INFO L290 TraceCheckUtils]: 100: Hoare triple {44572#false} assume !(((1 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && ~a3~0 <= 115); {44572#false} is VALID [2022-02-20 15:58:33,221 INFO L290 TraceCheckUtils]: 101: Hoare triple {44572#false} assume ((0 == ~a24~0 && 8 == ~a18~0) && 4 == ~a15~0) && 306 < ~a3~0 && 417 >= ~a3~0; {44572#false} is VALID [2022-02-20 15:58:33,221 INFO L290 TraceCheckUtils]: 102: Hoare triple {44572#false} assume !false; {44572#false} is VALID [2022-02-20 15:58:33,222 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 15:58:33,222 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 15:58:33,223 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268862986] [2022-02-20 15:58:33,223 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268862986] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 15:58:33,223 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 15:58:33,223 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 15:58:33,223 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221669244] [2022-02-20 15:58:33,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 15:58:33,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2022-02-20 15:58:33,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 15:58:33,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 25.75) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have 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:33,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 15:58:33,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 15:58:33,298 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 15:58:33,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 15:58:33,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 15:58:33,299 INFO L87 Difference]: Start difference. First operand 5524 states and 8083 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have 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:45,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:58:45,178 INFO L93 Difference]: Finished difference Result 13116 states and 18840 transitions. [2022-02-20 15:58:45,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 15:58:45,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2022-02-20 15:58:45,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 15:58:45,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have 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:45,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4566 transitions. [2022-02-20 15:58:45,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have 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:45,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4566 transitions. [2022-02-20 15:58:45,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 4566 transitions. [2022-02-20 15:58:48,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4566 edges. 4566 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 15:58:50,136 INFO L225 Difference]: With dead ends: 13116 [2022-02-20 15:58:50,136 INFO L226 Difference]: Without dead ends: 7594 [2022-02-20 15:58:50,142 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 15:58:50,144 INFO L933 BasicCegarLoop]: 624 mSDtfsCounter, 1922 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4348 mSolverCounterSat, 436 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1922 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 4784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 436 IncrementalHoareTripleChecker+Valid, 4348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-02-20 15:58:50,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1922 Valid, 641 Invalid, 4784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [436 Valid, 4348 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-02-20 15:58:50,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7594 states. [2022-02-20 15:58:50,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7594 to 6904. [2022-02-20 15:58:50,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 15:58:50,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7594 states. Second operand has 6904 states, 6903 states have (on average 1.3925829349558163) internal successors, (9613), 6903 states have internal predecessors, (9613), 0 states have call successors, (0), 0 states have 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:50,325 INFO L74 IsIncluded]: Start isIncluded. First operand 7594 states. Second operand has 6904 states, 6903 states have (on average 1.3925829349558163) internal successors, (9613), 6903 states have internal predecessors, (9613), 0 states have call successors, (0), 0 states have 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:50,335 INFO L87 Difference]: Start difference. First operand 7594 states. Second operand has 6904 states, 6903 states have (on average 1.3925829349558163) internal successors, (9613), 6903 states have internal predecessors, (9613), 0 states have call successors, (0), 0 states have 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:51,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:58:51,921 INFO L93 Difference]: Finished difference Result 7594 states and 10315 transitions. [2022-02-20 15:58:51,921 INFO L276 IsEmpty]: Start isEmpty. Operand 7594 states and 10315 transitions. [2022-02-20 15:58:51,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:58:51,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:58:51,940 INFO L74 IsIncluded]: Start isIncluded. First operand has 6904 states, 6903 states have (on average 1.3925829349558163) internal successors, (9613), 6903 states have internal predecessors, (9613), 0 states have call successors, (0), 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 7594 states. [2022-02-20 15:58:51,950 INFO L87 Difference]: Start difference. First operand has 6904 states, 6903 states have (on average 1.3925829349558163) internal successors, (9613), 6903 states have internal predecessors, (9613), 0 states have call successors, (0), 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 7594 states. [2022-02-20 15:58:53,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:58:53,604 INFO L93 Difference]: Finished difference Result 7594 states and 10315 transitions. [2022-02-20 15:58:53,604 INFO L276 IsEmpty]: Start isEmpty. Operand 7594 states and 10315 transitions. [2022-02-20 15:58:53,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:58:53,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:58:53,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 15:58:53,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 15:58:53,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6904 states, 6903 states have (on average 1.3925829349558163) internal successors, (9613), 6903 states have internal predecessors, (9613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)