./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label46.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/Problem10_label46.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 55bb0b6283aff4abf5faadff9f7f9aff6ee42cf1532c03b428b7b431fbde06be --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 15:22:48,396 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 15:22:48,398 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 15:22:48,439 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 15:22:48,440 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 15:22:48,443 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 15:22:48,444 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 15:22:48,446 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 15:22:48,448 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 15:22:48,452 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 15:22:48,453 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 15:22:48,454 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 15:22:48,454 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 15:22:48,456 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 15:22:48,457 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 15:22:48,460 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 15:22:48,461 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 15:22:48,462 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 15:22:48,464 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 15:22:48,469 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 15:22:48,469 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 15:22:48,470 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 15:22:48,472 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 15:22:48,472 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 15:22:48,478 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 15:22:48,478 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 15:22:48,478 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 15:22:48,480 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 15:22:48,480 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 15:22:48,482 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 15:22:48,482 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 15:22:48,483 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 15:22:48,484 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 15:22:48,485 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 15:22:48,486 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 15:22:48,486 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 15:22:48,486 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 15:22:48,487 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 15:22:48,491 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 15:22:48,492 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 15:22:48,492 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 15:22:48,493 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:22:48,516 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 15:22:48,516 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 15:22:48,516 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 15:22:48,517 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 15:22:48,517 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 15:22:48,517 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 15:22:48,518 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 15:22:48,518 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 15:22:48,518 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 15:22:48,519 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 15:22:48,519 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 15:22:48,519 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 15:22:48,520 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 15:22:48,520 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 15:22:48,520 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 15:22:48,520 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 15:22:48,520 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 15:22:48,521 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 15:22:48,521 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 15:22:48,521 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 15:22:48,521 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 15:22:48,521 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 15:22:48,522 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 15:22:48,522 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 15:22:48,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 15:22:48,522 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 15:22:48,522 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 15:22:48,522 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 15:22:48,523 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 15:22:48,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 15:22:48,523 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 15:22:48,523 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 15:22:48,523 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 15:22:48,524 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 -> 55bb0b6283aff4abf5faadff9f7f9aff6ee42cf1532c03b428b7b431fbde06be [2022-02-20 15:22:48,709 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 15:22:48,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 15:22:48,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 15:22:48,728 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 15:22:48,728 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 15:22:48,729 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label46.c [2022-02-20 15:22:48,784 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58a29a49e/c5c379fb58f1485dbbc4eb913cd7a57f/FLAGbad5d9a49 [2022-02-20 15:22:49,187 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 15:22:49,192 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label46.c [2022-02-20 15:22:49,217 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58a29a49e/c5c379fb58f1485dbbc4eb913cd7a57f/FLAGbad5d9a49 [2022-02-20 15:22:49,537 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58a29a49e/c5c379fb58f1485dbbc4eb913cd7a57f [2022-02-20 15:22:49,539 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 15:22:49,540 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 15:22:49,541 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 15:22:49,541 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 15:22:49,544 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 15:22:49,545 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 03:22:49" (1/1) ... [2022-02-20 15:22:49,546 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ff4b26a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:22:49, skipping insertion in model container [2022-02-20 15:22:49,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 03:22:49" (1/1) ... [2022-02-20 15:22:49,556 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 15:22:49,606 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 15:22:49,793 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/Problem10_label46.c[2596,2609] [2022-02-20 15:22:50,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 15:22:50,016 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 15:22:50,041 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/Problem10_label46.c[2596,2609] [2022-02-20 15:22:50,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 15:22:50,141 INFO L208 MainTranslator]: Completed translation [2022-02-20 15:22:50,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:22:50 WrapperNode [2022-02-20 15:22:50,141 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 15:22:50,143 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 15:22:50,143 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 15:22:50,143 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 15:22:50,148 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:22:50" (1/1) ... [2022-02-20 15:22:50,164 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:22:50" (1/1) ... [2022-02-20 15:22:50,238 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 597 [2022-02-20 15:22:50,238 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 15:22:50,239 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 15:22:50,239 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 15:22:50,239 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 15:22:50,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:22:50" (1/1) ... [2022-02-20 15:22:50,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:22:50" (1/1) ... [2022-02-20 15:22:50,254 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:22:50" (1/1) ... [2022-02-20 15:22:50,254 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:22:50" (1/1) ... [2022-02-20 15:22:50,317 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:22:50" (1/1) ... [2022-02-20 15:22:50,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:22:50" (1/1) ... [2022-02-20 15:22:50,328 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:22:50" (1/1) ... [2022-02-20 15:22:50,352 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 15:22:50,353 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 15:22:50,353 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 15:22:50,354 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 15:22:50,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:22:50" (1/1) ... [2022-02-20 15:22:50,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 15:22:50,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 15:22:50,402 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:22:50,430 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:22:50,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 15:22:50,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 15:22:50,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 15:22:50,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 15:22:50,512 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 15:22:50,513 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 15:22:52,012 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 15:22:52,019 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 15:22:52,019 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 15:22:52,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 03:22:52 BoogieIcfgContainer [2022-02-20 15:22:52,021 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 15:22:52,023 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 15:22:52,023 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 15:22:52,025 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 15:22:52,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 03:22:49" (1/3) ... [2022-02-20 15:22:52,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@359356ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 03:22:52, skipping insertion in model container [2022-02-20 15:22:52,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 03:22:50" (2/3) ... [2022-02-20 15:22:52,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@359356ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 03:22:52, skipping insertion in model container [2022-02-20 15:22:52,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 03:22:52" (3/3) ... [2022-02-20 15:22:52,028 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label46.c [2022-02-20 15:22:52,031 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 15:22:52,032 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 15:22:52,066 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 15:22:52,075 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:22:52,075 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 15:22:52,094 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 0 states have call successors, (0), 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:22:52,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 15:22:52,099 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 15:22:52,099 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 15:22:52,100 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 15:22:52,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 15:22:52,104 INFO L85 PathProgramCache]: Analyzing trace with hash -85512855, now seen corresponding path program 1 times [2022-02-20 15:22:52,112 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 15:22:52,112 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192213823] [2022-02-20 15:22:52,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 15:22:52,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 15:22:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 15:22:52,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {209#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);~inputC~0 := 3;~inputD~0 := 4;~inputE~0 := 5;~inputF~0 := 6;~inputB~0 := 2;~a1~0 := 23;~a19~0 := 9;~a10~0 := 0;~a12~0 := 0;~a4~0 := 14; {211#(= ~a10~0 0)} is VALID [2022-02-20 15:22:52,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {211#(= ~a10~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1; {211#(= ~a10~0 0)} is VALID [2022-02-20 15:22:52,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {211#(= ~a10~0 0)} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {211#(= ~a10~0 0)} is VALID [2022-02-20 15:22:52,296 INFO L290 TraceCheckUtils]: 3: Hoare triple {211#(= ~a10~0 0)} assume !((((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_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {211#(= ~a10~0 0)} is VALID [2022-02-20 15:22:52,296 INFO L290 TraceCheckUtils]: 4: Hoare triple {211#(= ~a10~0 0)} assume !((((4 == ~a10~0 && 0 == ~a12~0) && 38 < ~a1~0 && 218 >= ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {211#(= ~a10~0 0)} is VALID [2022-02-20 15:22:52,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {211#(= ~a10~0 0)} assume !((((2 == ~a10~0 && 0 == ~a12~0) && -13 < ~a1~0 && 38 >= ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {211#(= ~a10~0 0)} is VALID [2022-02-20 15:22:52,297 INFO L290 TraceCheckUtils]: 6: Hoare triple {211#(= ~a10~0 0)} assume !((((0 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 6 == ~a19~0); {211#(= ~a10~0 0)} is VALID [2022-02-20 15:22:52,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {211#(= ~a10~0 0)} assume !((((2 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {211#(= ~a10~0 0)} is VALID [2022-02-20 15:22:52,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {211#(= ~a10~0 0)} assume !((((4 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 6 == ~a19~0); {211#(= ~a10~0 0)} is VALID [2022-02-20 15:22:52,299 INFO L290 TraceCheckUtils]: 9: Hoare triple {211#(= ~a10~0 0)} assume !((((2 == ~a10~0 && 0 == ~a12~0) && -13 < ~a1~0 && 38 >= ~a1~0) && 14 == ~a4~0) && 7 == ~a19~0); {211#(= ~a10~0 0)} is VALID [2022-02-20 15:22:52,300 INFO L290 TraceCheckUtils]: 10: Hoare triple {211#(= ~a10~0 0)} assume !((((3 == ~a10~0 && 0 == ~a12~0) && -13 < ~a1~0 && 38 >= ~a1~0) && 14 == ~a4~0) && 6 == ~a19~0); {211#(= ~a10~0 0)} is VALID [2022-02-20 15:22:52,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {211#(= ~a10~0 0)} assume !((((4 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {211#(= ~a10~0 0)} is VALID [2022-02-20 15:22:52,305 INFO L290 TraceCheckUtils]: 12: Hoare triple {211#(= ~a10~0 0)} assume !((((1 == ~a10~0 && 0 == ~a12~0) && -13 < ~a1~0 && 38 >= ~a1~0) && 14 == ~a4~0) && 7 == ~a19~0); {211#(= ~a10~0 0)} is VALID [2022-02-20 15:22:52,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {211#(= ~a10~0 0)} assume !((((2 == ~a10~0 && 0 == ~a12~0) && 38 < ~a1~0 && 218 >= ~a1~0) && 14 == ~a4~0) && 7 == ~a19~0); {211#(= ~a10~0 0)} is VALID [2022-02-20 15:22:52,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {211#(= ~a10~0 0)} assume !((((1 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 7 == ~a19~0); {211#(= ~a10~0 0)} is VALID [2022-02-20 15:22:52,308 INFO L290 TraceCheckUtils]: 15: Hoare triple {211#(= ~a10~0 0)} assume !((((0 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {211#(= ~a10~0 0)} is VALID [2022-02-20 15:22:52,308 INFO L290 TraceCheckUtils]: 16: Hoare triple {211#(= ~a10~0 0)} assume !((((4 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 8 == ~a19~0); {211#(= ~a10~0 0)} is VALID [2022-02-20 15:22:52,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {211#(= ~a10~0 0)} assume !((((2 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 8 == ~a19~0); {211#(= ~a10~0 0)} is VALID [2022-02-20 15:22:52,310 INFO L290 TraceCheckUtils]: 18: Hoare triple {211#(= ~a10~0 0)} assume !((((0 == ~a10~0 && 0 == ~a12~0) && 38 < ~a1~0 && 218 >= ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {211#(= ~a10~0 0)} is VALID [2022-02-20 15:22:52,310 INFO L290 TraceCheckUtils]: 19: Hoare triple {211#(= ~a10~0 0)} assume (((1 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0; {210#false} is VALID [2022-02-20 15:22:52,311 INFO L290 TraceCheckUtils]: 20: Hoare triple {210#false} assume !false; {210#false} is VALID [2022-02-20 15:22:52,312 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:22:52,313 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 15:22:52,313 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192213823] [2022-02-20 15:22:52,314 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192213823] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 15:22:52,314 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 15:22:52,314 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 15:22:52,317 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597679525] [2022-02-20 15:22:52,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 15:22:52,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-02-20 15:22:52,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 15:22:52,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 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:22:52,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 15:22:52,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 15:22:52,351 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 15:22:52,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 15:22:52,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 15:22:52,381 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 0 states have call successors, (0), 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 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 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:22:53,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:22:53,562 INFO L93 Difference]: Finished difference Result 552 states and 966 transitions. [2022-02-20 15:22:53,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 15:22:53,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-02-20 15:22:53,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 15:22:53,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 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:22:53,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 966 transitions. [2022-02-20 15:22:53,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 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:22:53,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 966 transitions. [2022-02-20 15:22:53,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 966 transitions. [2022-02-20 15:22:54,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 966 edges. 966 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 15:22:54,420 INFO L225 Difference]: With dead ends: 552 [2022-02-20 15:22:54,420 INFO L226 Difference]: Without dead ends: 282 [2022-02-20 15:22:54,424 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:22:54,426 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 142 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 15:22:54,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 120 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 15:22:54,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-02-20 15:22:54,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2022-02-20 15:22:54,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 15:22:54,462 INFO L82 GeneralOperation]: Start isEquivalent. First operand 282 states. Second operand has 282 states, 281 states have (on average 1.3416370106761566) internal successors, (377), 281 states have internal predecessors, (377), 0 states have call successors, (0), 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:22:54,463 INFO L74 IsIncluded]: Start isIncluded. First operand 282 states. Second operand has 282 states, 281 states have (on average 1.3416370106761566) internal successors, (377), 281 states have internal predecessors, (377), 0 states have call successors, (0), 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:22:54,463 INFO L87 Difference]: Start difference. First operand 282 states. Second operand has 282 states, 281 states have (on average 1.3416370106761566) internal successors, (377), 281 states have internal predecessors, (377), 0 states have call successors, (0), 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:22:54,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:22:54,475 INFO L93 Difference]: Finished difference Result 282 states and 377 transitions. [2022-02-20 15:22:54,476 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 377 transitions. [2022-02-20 15:22:54,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:22:54,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:22:54,478 INFO L74 IsIncluded]: Start isIncluded. First operand has 282 states, 281 states have (on average 1.3416370106761566) internal successors, (377), 281 states have internal predecessors, (377), 0 states have call successors, (0), 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 282 states. [2022-02-20 15:22:54,479 INFO L87 Difference]: Start difference. First operand has 282 states, 281 states have (on average 1.3416370106761566) internal successors, (377), 281 states have internal predecessors, (377), 0 states have call successors, (0), 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 282 states. [2022-02-20 15:22:54,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:22:54,490 INFO L93 Difference]: Finished difference Result 282 states and 377 transitions. [2022-02-20 15:22:54,490 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 377 transitions. [2022-02-20 15:22:54,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:22:54,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:22:54,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 15:22:54,492 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 15:22:54,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.3416370106761566) internal successors, (377), 281 states have internal predecessors, (377), 0 states have call successors, (0), 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:22:54,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 377 transitions. [2022-02-20 15:22:54,504 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 377 transitions. Word has length 21 [2022-02-20 15:22:54,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 15:22:54,504 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 377 transitions. [2022-02-20 15:22:54,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 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:22:54,505 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 377 transitions. [2022-02-20 15:22:54,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-02-20 15:22:54,507 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 15:22:54,507 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 15:22:54,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 15:22:54,507 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 15:22:54,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 15:22:54,508 INFO L85 PathProgramCache]: Analyzing trace with hash -86180708, now seen corresponding path program 1 times [2022-02-20 15:22:54,508 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 15:22:54,508 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935741543] [2022-02-20 15:22:54,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 15:22:54,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 15:22:54,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 15:22:54,649 INFO L290 TraceCheckUtils]: 0: Hoare triple {1625#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);~inputC~0 := 3;~inputD~0 := 4;~inputE~0 := 5;~inputF~0 := 6;~inputB~0 := 2;~a1~0 := 23;~a19~0 := 9;~a10~0 := 0;~a12~0 := 0;~a4~0 := 14; {1625#true} is VALID [2022-02-20 15:22:54,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {1625#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1; {1625#true} is VALID [2022-02-20 15:22:54,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {1625#true} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1625#true} is VALID [2022-02-20 15:22:54,650 INFO L290 TraceCheckUtils]: 3: Hoare triple {1625#true} assume !((((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_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {1625#true} is VALID [2022-02-20 15:22:54,650 INFO L290 TraceCheckUtils]: 4: Hoare triple {1625#true} assume !((((4 == ~a10~0 && 0 == ~a12~0) && 38 < ~a1~0 && 218 >= ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {1625#true} assume !((((2 == ~a10~0 && 0 == ~a12~0) && -13 < ~a1~0 && 38 >= ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,651 INFO L290 TraceCheckUtils]: 6: Hoare triple {1625#true} assume !((((0 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 6 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {1625#true} assume !((((2 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {1625#true} assume !((((4 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 6 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {1625#true} assume !((((2 == ~a10~0 && 0 == ~a12~0) && -13 < ~a1~0 && 38 >= ~a1~0) && 14 == ~a4~0) && 7 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,652 INFO L290 TraceCheckUtils]: 10: Hoare triple {1625#true} assume !((((3 == ~a10~0 && 0 == ~a12~0) && -13 < ~a1~0 && 38 >= ~a1~0) && 14 == ~a4~0) && 6 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {1625#true} assume !((((4 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {1625#true} assume !((((1 == ~a10~0 && 0 == ~a12~0) && -13 < ~a1~0 && 38 >= ~a1~0) && 14 == ~a4~0) && 7 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,653 INFO L290 TraceCheckUtils]: 13: Hoare triple {1625#true} assume !((((2 == ~a10~0 && 0 == ~a12~0) && 38 < ~a1~0 && 218 >= ~a1~0) && 14 == ~a4~0) && 7 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {1625#true} assume !((((1 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 7 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,653 INFO L290 TraceCheckUtils]: 15: Hoare triple {1625#true} assume !((((0 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,653 INFO L290 TraceCheckUtils]: 16: Hoare triple {1625#true} assume !((((4 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 8 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,653 INFO L290 TraceCheckUtils]: 17: Hoare triple {1625#true} assume !((((2 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 8 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,654 INFO L290 TraceCheckUtils]: 18: Hoare triple {1625#true} assume !((((0 == ~a10~0 && 0 == ~a12~0) && 38 < ~a1~0 && 218 >= ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,654 INFO L290 TraceCheckUtils]: 19: Hoare triple {1625#true} assume !((((1 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,654 INFO L290 TraceCheckUtils]: 20: Hoare triple {1625#true} assume !((((2 == ~a10~0 && 0 == ~a12~0) && 38 < ~a1~0 && 218 >= ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,654 INFO L290 TraceCheckUtils]: 21: Hoare triple {1625#true} assume !((((4 == ~a10~0 && 0 == ~a12~0) && -13 < ~a1~0 && 38 >= ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,655 INFO L290 TraceCheckUtils]: 22: Hoare triple {1625#true} assume !((((1 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 6 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,655 INFO L290 TraceCheckUtils]: 23: Hoare triple {1625#true} assume !((((3 == ~a10~0 && 0 == ~a12~0) && -13 < ~a1~0 && 38 >= ~a1~0) && 14 == ~a4~0) && 7 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,655 INFO L290 TraceCheckUtils]: 24: Hoare triple {1625#true} assume !((((0 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 8 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,655 INFO L290 TraceCheckUtils]: 25: Hoare triple {1625#true} assume !((((0 == ~a10~0 && 0 == ~a12~0) && 38 < ~a1~0 && 218 >= ~a1~0) && 14 == ~a4~0) && 7 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,656 INFO L290 TraceCheckUtils]: 26: Hoare triple {1625#true} assume !((((0 == ~a10~0 && 0 == ~a12~0) && -13 < ~a1~0 && 38 >= ~a1~0) && 14 == ~a4~0) && 7 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,656 INFO L290 TraceCheckUtils]: 27: Hoare triple {1625#true} assume !((((0 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 7 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,656 INFO L290 TraceCheckUtils]: 28: Hoare triple {1625#true} assume !((((4 == ~a10~0 && 0 == ~a12~0) && 38 < ~a1~0 && 218 >= ~a1~0) && 14 == ~a4~0) && 6 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,656 INFO L290 TraceCheckUtils]: 29: Hoare triple {1625#true} assume !((((3 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 6 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,657 INFO L290 TraceCheckUtils]: 30: Hoare triple {1625#true} assume !((((4 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 7 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,657 INFO L290 TraceCheckUtils]: 31: Hoare triple {1625#true} assume !((((4 == ~a10~0 && 0 == ~a12~0) && -13 < ~a1~0 && 38 >= ~a1~0) && 14 == ~a4~0) && 6 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,657 INFO L290 TraceCheckUtils]: 32: Hoare triple {1625#true} assume !((((2 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 7 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,657 INFO L290 TraceCheckUtils]: 33: Hoare triple {1625#true} assume !((((1 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 8 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,658 INFO L290 TraceCheckUtils]: 34: Hoare triple {1625#true} assume !((((1 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 6 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,658 INFO L290 TraceCheckUtils]: 35: Hoare triple {1625#true} assume !((((0 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 7 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,658 INFO L290 TraceCheckUtils]: 36: Hoare triple {1625#true} assume !((((1 == ~a10~0 && 0 == ~a12~0) && 38 < ~a1~0 && 218 >= ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,658 INFO L290 TraceCheckUtils]: 37: Hoare triple {1625#true} assume !((((4 == ~a10~0 && 0 == ~a12~0) && -13 < ~a1~0 && 38 >= ~a1~0) && 14 == ~a4~0) && 7 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,659 INFO L290 TraceCheckUtils]: 38: Hoare triple {1625#true} assume !((((2 == ~a10~0 && 0 == ~a12~0) && -13 < ~a1~0 && 38 >= ~a1~0) && 14 == ~a4~0) && 6 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,659 INFO L290 TraceCheckUtils]: 39: Hoare triple {1625#true} assume !((((3 == ~a10~0 && 0 == ~a12~0) && -13 < ~a1~0 && 38 >= ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,659 INFO L290 TraceCheckUtils]: 40: Hoare triple {1625#true} assume !((((3 == ~a10~0 && 0 == ~a12~0) && 38 < ~a1~0 && 218 >= ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,659 INFO L290 TraceCheckUtils]: 41: Hoare triple {1625#true} assume !((((3 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 7 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,659 INFO L290 TraceCheckUtils]: 42: Hoare triple {1625#true} assume !((((3 == ~a10~0 && 0 == ~a12~0) && 38 < ~a1~0 && 218 >= ~a1~0) && 14 == ~a4~0) && 7 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,660 INFO L290 TraceCheckUtils]: 43: Hoare triple {1625#true} assume !((((2 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 6 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,660 INFO L290 TraceCheckUtils]: 44: Hoare triple {1625#true} assume !((((1 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 7 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,660 INFO L290 TraceCheckUtils]: 45: Hoare triple {1625#true} assume !((((0 == ~a10~0 && 0 == ~a12~0) && -13 < ~a1~0 && 38 >= ~a1~0) && 14 == ~a4~0) && 6 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,660 INFO L290 TraceCheckUtils]: 46: Hoare triple {1625#true} assume !((((2 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 6 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,661 INFO L290 TraceCheckUtils]: 47: Hoare triple {1625#true} assume !((((0 == ~a10~0 && 0 == ~a12~0) && -13 < ~a1~0 && 38 >= ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,661 INFO L290 TraceCheckUtils]: 48: Hoare triple {1625#true} assume !((((3 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 8 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,661 INFO L290 TraceCheckUtils]: 49: Hoare triple {1625#true} assume !((((4 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 7 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,662 INFO L290 TraceCheckUtils]: 50: Hoare triple {1625#true} assume !((((1 == ~a10~0 && 0 == ~a12~0) && 38 < ~a1~0 && 218 >= ~a1~0) && 14 == ~a4~0) && 6 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,662 INFO L290 TraceCheckUtils]: 51: Hoare triple {1625#true} assume !((((0 == ~a10~0 && 0 == ~a12~0) && 38 < ~a1~0 && 218 >= ~a1~0) && 14 == ~a4~0) && 6 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,662 INFO L290 TraceCheckUtils]: 52: Hoare triple {1625#true} assume !((((4 == ~a10~0 && 0 == ~a12~0) && 38 < ~a1~0 && 218 >= ~a1~0) && 14 == ~a4~0) && 7 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,662 INFO L290 TraceCheckUtils]: 53: Hoare triple {1625#true} assume !((((3 == ~a10~0 && 0 == ~a12~0) && 38 < ~a1~0 && 218 >= ~a1~0) && 14 == ~a4~0) && 6 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,662 INFO L290 TraceCheckUtils]: 54: Hoare triple {1625#true} assume !((((2 == ~a10~0 && 0 == ~a12~0) && 38 < ~a1~0 && 218 >= ~a1~0) && 14 == ~a4~0) && 6 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,663 INFO L290 TraceCheckUtils]: 55: Hoare triple {1625#true} assume !((((1 == ~a10~0 && 0 == ~a12~0) && -13 < ~a1~0 && 38 >= ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,663 INFO L290 TraceCheckUtils]: 56: Hoare triple {1625#true} assume !((((4 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 6 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,663 INFO L290 TraceCheckUtils]: 57: Hoare triple {1625#true} assume !((((0 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 6 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,663 INFO L290 TraceCheckUtils]: 58: Hoare triple {1625#true} assume !((((2 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 7 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,664 INFO L290 TraceCheckUtils]: 59: Hoare triple {1625#true} assume !((((3 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 6 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,664 INFO L290 TraceCheckUtils]: 60: Hoare triple {1625#true} assume !((((3 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,664 INFO L290 TraceCheckUtils]: 61: Hoare triple {1625#true} assume !((((3 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 7 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,664 INFO L290 TraceCheckUtils]: 62: Hoare triple {1625#true} assume !((((1 == ~a10~0 && 0 == ~a12~0) && 38 < ~a1~0 && 218 >= ~a1~0) && 14 == ~a4~0) && 7 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,665 INFO L290 TraceCheckUtils]: 63: Hoare triple {1625#true} assume !((((0 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 9 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,665 INFO L290 TraceCheckUtils]: 64: Hoare triple {1625#true} assume !((((1 == ~a10~0 && 0 == ~a12~0) && -13 < ~a1~0 && 38 >= ~a1~0) && 14 == ~a4~0) && 6 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,665 INFO L290 TraceCheckUtils]: 65: Hoare triple {1625#true} assume !((4 == ~a10~0 && 218 < ~a1~0 && (4 == calculate_output_~input#1 && 0 == ~a12~0) && 14 == ~a4~0) && 9 == ~a19~0); {1625#true} is VALID [2022-02-20 15:22:54,666 INFO L290 TraceCheckUtils]: 66: Hoare triple {1625#true} assume 14 == ~a4~0 && (0 == ~a12~0 && (((-13 < ~a1~0 && 38 >= ~a1~0) || (38 < ~a1~0 && 218 >= ~a1~0)) && 4 == calculate_output_~input#1) && 9 == ~a19~0) && 0 == ~a10~0;~a1~0 := (if -15535 + ~a1~0 - 211896 < 0 && 0 != (-15535 + ~a1~0 - 211896) % 5 then 1 + (-15535 + ~a1~0 - 211896) / 5 else (-15535 + ~a1~0 - 211896) / 5);~a10~0 := 2;calculate_output_#res#1 := 22; {1627#(= ~a10~0 2)} is VALID [2022-02-20 15:22:54,668 INFO L290 TraceCheckUtils]: 67: Hoare triple {1627#(= ~a10~0 2)} main_#t~ret7#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main_#t~ret7#1 && main_#t~ret7#1 <= 2147483647;main_~output~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1; {1627#(= ~a10~0 2)} is VALID [2022-02-20 15:22:54,668 INFO L290 TraceCheckUtils]: 68: Hoare triple {1627#(= ~a10~0 2)} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1627#(= ~a10~0 2)} is VALID [2022-02-20 15:22:54,669 INFO L290 TraceCheckUtils]: 69: Hoare triple {1627#(= ~a10~0 2)} assume !((((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_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {1627#(= ~a10~0 2)} is VALID [2022-02-20 15:22:54,670 INFO L290 TraceCheckUtils]: 70: Hoare triple {1627#(= ~a10~0 2)} assume !((((4 == ~a10~0 && 0 == ~a12~0) && 38 < ~a1~0 && 218 >= ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {1627#(= ~a10~0 2)} is VALID [2022-02-20 15:22:54,671 INFO L290 TraceCheckUtils]: 71: Hoare triple {1627#(= ~a10~0 2)} assume !((((2 == ~a10~0 && 0 == ~a12~0) && -13 < ~a1~0 && 38 >= ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {1627#(= ~a10~0 2)} is VALID [2022-02-20 15:22:54,672 INFO L290 TraceCheckUtils]: 72: Hoare triple {1627#(= ~a10~0 2)} assume !((((0 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 6 == ~a19~0); {1627#(= ~a10~0 2)} is VALID [2022-02-20 15:22:54,672 INFO L290 TraceCheckUtils]: 73: Hoare triple {1627#(= ~a10~0 2)} assume !((((2 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {1627#(= ~a10~0 2)} is VALID [2022-02-20 15:22:54,673 INFO L290 TraceCheckUtils]: 74: Hoare triple {1627#(= ~a10~0 2)} assume !((((4 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 6 == ~a19~0); {1627#(= ~a10~0 2)} is VALID [2022-02-20 15:22:54,673 INFO L290 TraceCheckUtils]: 75: Hoare triple {1627#(= ~a10~0 2)} assume !((((2 == ~a10~0 && 0 == ~a12~0) && -13 < ~a1~0 && 38 >= ~a1~0) && 14 == ~a4~0) && 7 == ~a19~0); {1627#(= ~a10~0 2)} is VALID [2022-02-20 15:22:54,674 INFO L290 TraceCheckUtils]: 76: Hoare triple {1627#(= ~a10~0 2)} assume !((((3 == ~a10~0 && 0 == ~a12~0) && -13 < ~a1~0 && 38 >= ~a1~0) && 14 == ~a4~0) && 6 == ~a19~0); {1627#(= ~a10~0 2)} is VALID [2022-02-20 15:22:54,674 INFO L290 TraceCheckUtils]: 77: Hoare triple {1627#(= ~a10~0 2)} assume !((((4 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {1627#(= ~a10~0 2)} is VALID [2022-02-20 15:22:54,674 INFO L290 TraceCheckUtils]: 78: Hoare triple {1627#(= ~a10~0 2)} assume !((((1 == ~a10~0 && 0 == ~a12~0) && -13 < ~a1~0 && 38 >= ~a1~0) && 14 == ~a4~0) && 7 == ~a19~0); {1627#(= ~a10~0 2)} is VALID [2022-02-20 15:22:54,675 INFO L290 TraceCheckUtils]: 79: Hoare triple {1627#(= ~a10~0 2)} assume !((((2 == ~a10~0 && 0 == ~a12~0) && 38 < ~a1~0 && 218 >= ~a1~0) && 14 == ~a4~0) && 7 == ~a19~0); {1627#(= ~a10~0 2)} is VALID [2022-02-20 15:22:54,675 INFO L290 TraceCheckUtils]: 80: Hoare triple {1627#(= ~a10~0 2)} assume !((((1 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 7 == ~a19~0); {1627#(= ~a10~0 2)} is VALID [2022-02-20 15:22:54,678 INFO L290 TraceCheckUtils]: 81: Hoare triple {1627#(= ~a10~0 2)} assume !((((0 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {1627#(= ~a10~0 2)} is VALID [2022-02-20 15:22:54,678 INFO L290 TraceCheckUtils]: 82: Hoare triple {1627#(= ~a10~0 2)} assume !((((4 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 8 == ~a19~0); {1627#(= ~a10~0 2)} is VALID [2022-02-20 15:22:54,679 INFO L290 TraceCheckUtils]: 83: Hoare triple {1627#(= ~a10~0 2)} assume !((((2 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 8 == ~a19~0); {1627#(= ~a10~0 2)} is VALID [2022-02-20 15:22:54,679 INFO L290 TraceCheckUtils]: 84: Hoare triple {1627#(= ~a10~0 2)} assume !((((0 == ~a10~0 && 0 == ~a12~0) && 38 < ~a1~0 && 218 >= ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {1627#(= ~a10~0 2)} is VALID [2022-02-20 15:22:54,680 INFO L290 TraceCheckUtils]: 85: Hoare triple {1627#(= ~a10~0 2)} assume (((1 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0; {1626#false} is VALID [2022-02-20 15:22:54,680 INFO L290 TraceCheckUtils]: 86: Hoare triple {1626#false} assume !false; {1626#false} is VALID [2022-02-20 15:22:54,681 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 15:22:54,681 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 15:22:54,681 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935741543] [2022-02-20 15:22:54,681 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935741543] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 15:22:54,681 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 15:22:54,682 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 15:22:54,682 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439411022] [2022-02-20 15:22:54,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 15:22:54,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2022-02-20 15:22:54,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 15:22:54,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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:22:54,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 15:22:54,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 15:22:54,759 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 15:22:54,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 15:22:54,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 15:22:54,760 INFO L87 Difference]: Start difference. First operand 282 states and 377 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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:22:55,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:22:55,601 INFO L93 Difference]: Finished difference Result 701 states and 967 transitions. [2022-02-20 15:22:55,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 15:22:55,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2022-02-20 15:22:55,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 15:22:55,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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:22:55,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 649 transitions. [2022-02-20 15:22:55,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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:22:55,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 649 transitions. [2022-02-20 15:22:55,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 649 transitions. [2022-02-20 15:22:56,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 649 edges. 649 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 15:22:56,239 INFO L225 Difference]: With dead ends: 701 [2022-02-20 15:22:56,239 INFO L226 Difference]: Without dead ends: 421 [2022-02-20 15:22:56,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 15:22:56,241 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 125 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 15:22:56,242 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 215 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 15:22:56,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2022-02-20 15:22:56,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2022-02-20 15:22:56,255 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 15:22:56,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 421 states. Second operand has 421 states, 420 states have (on average 1.2523809523809524) internal successors, (526), 420 states have internal predecessors, (526), 0 states have call successors, (0), 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:22:56,257 INFO L74 IsIncluded]: Start isIncluded. First operand 421 states. Second operand has 421 states, 420 states have (on average 1.2523809523809524) internal successors, (526), 420 states have internal predecessors, (526), 0 states have call successors, (0), 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:22:56,258 INFO L87 Difference]: Start difference. First operand 421 states. Second operand has 421 states, 420 states have (on average 1.2523809523809524) internal successors, (526), 420 states have internal predecessors, (526), 0 states have call successors, (0), 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:22:56,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:22:56,272 INFO L93 Difference]: Finished difference Result 421 states and 526 transitions. [2022-02-20 15:22:56,272 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 526 transitions. [2022-02-20 15:22:56,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:22:56,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:22:56,274 INFO L74 IsIncluded]: Start isIncluded. First operand has 421 states, 420 states have (on average 1.2523809523809524) internal successors, (526), 420 states have internal predecessors, (526), 0 states have call successors, (0), 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 421 states. [2022-02-20 15:22:56,275 INFO L87 Difference]: Start difference. First operand has 421 states, 420 states have (on average 1.2523809523809524) internal successors, (526), 420 states have internal predecessors, (526), 0 states have call successors, (0), 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 421 states. [2022-02-20 15:22:56,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:22:56,290 INFO L93 Difference]: Finished difference Result 421 states and 526 transitions. [2022-02-20 15:22:56,290 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 526 transitions. [2022-02-20 15:22:56,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:22:56,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:22:56,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 15:22:56,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 15:22:56,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.2523809523809524) internal successors, (526), 420 states have internal predecessors, (526), 0 states have call successors, (0), 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:22:56,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 526 transitions. [2022-02-20 15:22:56,306 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 526 transitions. Word has length 87 [2022-02-20 15:22:56,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 15:22:56,307 INFO L470 AbstractCegarLoop]: Abstraction has 421 states and 526 transitions. [2022-02-20 15:22:56,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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:22:56,308 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 526 transitions. [2022-02-20 15:22:56,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-02-20 15:22:56,309 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 15:22:56,310 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 15:22:56,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 15:22:56,310 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 15:22:56,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 15:22:56,311 INFO L85 PathProgramCache]: Analyzing trace with hash -236744949, now seen corresponding path program 1 times [2022-02-20 15:22:56,311 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 15:22:56,311 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821284131] [2022-02-20 15:22:56,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 15:22:56,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 15:22:56,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 15:22:56,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {3610#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);~inputC~0 := 3;~inputD~0 := 4;~inputE~0 := 5;~inputF~0 := 6;~inputB~0 := 2;~a1~0 := 23;~a19~0 := 9;~a10~0 := 0;~a12~0 := 0;~a4~0 := 14; {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1; {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,467 INFO L290 TraceCheckUtils]: 3: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((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_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,467 INFO L290 TraceCheckUtils]: 4: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((4 == ~a10~0 && 0 == ~a12~0) && 38 < ~a1~0 && 218 >= ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((2 == ~a10~0 && 0 == ~a12~0) && -13 < ~a1~0 && 38 >= ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((0 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 6 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,469 INFO L290 TraceCheckUtils]: 7: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((2 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,469 INFO L290 TraceCheckUtils]: 8: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((4 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 6 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((2 == ~a10~0 && 0 == ~a12~0) && -13 < ~a1~0 && 38 >= ~a1~0) && 14 == ~a4~0) && 7 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,470 INFO L290 TraceCheckUtils]: 10: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((3 == ~a10~0 && 0 == ~a12~0) && -13 < ~a1~0 && 38 >= ~a1~0) && 14 == ~a4~0) && 6 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,471 INFO L290 TraceCheckUtils]: 11: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((4 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,471 INFO L290 TraceCheckUtils]: 12: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((1 == ~a10~0 && 0 == ~a12~0) && -13 < ~a1~0 && 38 >= ~a1~0) && 14 == ~a4~0) && 7 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,472 INFO L290 TraceCheckUtils]: 13: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((2 == ~a10~0 && 0 == ~a12~0) && 38 < ~a1~0 && 218 >= ~a1~0) && 14 == ~a4~0) && 7 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((1 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 7 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,473 INFO L290 TraceCheckUtils]: 15: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((0 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,473 INFO L290 TraceCheckUtils]: 16: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((4 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 8 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,474 INFO L290 TraceCheckUtils]: 17: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((2 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 8 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,475 INFO L290 TraceCheckUtils]: 18: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((0 == ~a10~0 && 0 == ~a12~0) && 38 < ~a1~0 && 218 >= ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,475 INFO L290 TraceCheckUtils]: 19: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((1 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,476 INFO L290 TraceCheckUtils]: 20: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((2 == ~a10~0 && 0 == ~a12~0) && 38 < ~a1~0 && 218 >= ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,476 INFO L290 TraceCheckUtils]: 21: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((4 == ~a10~0 && 0 == ~a12~0) && -13 < ~a1~0 && 38 >= ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,477 INFO L290 TraceCheckUtils]: 22: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((1 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 6 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,477 INFO L290 TraceCheckUtils]: 23: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((3 == ~a10~0 && 0 == ~a12~0) && -13 < ~a1~0 && 38 >= ~a1~0) && 14 == ~a4~0) && 7 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,478 INFO L290 TraceCheckUtils]: 24: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((0 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 8 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,478 INFO L290 TraceCheckUtils]: 25: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((0 == ~a10~0 && 0 == ~a12~0) && 38 < ~a1~0 && 218 >= ~a1~0) && 14 == ~a4~0) && 7 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,479 INFO L290 TraceCheckUtils]: 26: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((0 == ~a10~0 && 0 == ~a12~0) && -13 < ~a1~0 && 38 >= ~a1~0) && 14 == ~a4~0) && 7 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,480 INFO L290 TraceCheckUtils]: 27: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((0 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 7 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,480 INFO L290 TraceCheckUtils]: 28: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((4 == ~a10~0 && 0 == ~a12~0) && 38 < ~a1~0 && 218 >= ~a1~0) && 14 == ~a4~0) && 6 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,481 INFO L290 TraceCheckUtils]: 29: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((3 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 6 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,481 INFO L290 TraceCheckUtils]: 30: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((4 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 7 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,482 INFO L290 TraceCheckUtils]: 31: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((4 == ~a10~0 && 0 == ~a12~0) && -13 < ~a1~0 && 38 >= ~a1~0) && 14 == ~a4~0) && 6 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,482 INFO L290 TraceCheckUtils]: 32: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((2 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 7 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,483 INFO L290 TraceCheckUtils]: 33: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((1 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 8 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,483 INFO L290 TraceCheckUtils]: 34: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((1 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 6 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,484 INFO L290 TraceCheckUtils]: 35: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((0 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 7 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,484 INFO L290 TraceCheckUtils]: 36: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((1 == ~a10~0 && 0 == ~a12~0) && 38 < ~a1~0 && 218 >= ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,485 INFO L290 TraceCheckUtils]: 37: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((4 == ~a10~0 && 0 == ~a12~0) && -13 < ~a1~0 && 38 >= ~a1~0) && 14 == ~a4~0) && 7 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,486 INFO L290 TraceCheckUtils]: 38: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((2 == ~a10~0 && 0 == ~a12~0) && -13 < ~a1~0 && 38 >= ~a1~0) && 14 == ~a4~0) && 6 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,486 INFO L290 TraceCheckUtils]: 39: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((3 == ~a10~0 && 0 == ~a12~0) && -13 < ~a1~0 && 38 >= ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,487 INFO L290 TraceCheckUtils]: 40: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((3 == ~a10~0 && 0 == ~a12~0) && 38 < ~a1~0 && 218 >= ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,487 INFO L290 TraceCheckUtils]: 41: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((3 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 7 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,488 INFO L290 TraceCheckUtils]: 42: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((3 == ~a10~0 && 0 == ~a12~0) && 38 < ~a1~0 && 218 >= ~a1~0) && 14 == ~a4~0) && 7 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,488 INFO L290 TraceCheckUtils]: 43: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((2 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 6 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,489 INFO L290 TraceCheckUtils]: 44: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((1 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 7 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,489 INFO L290 TraceCheckUtils]: 45: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((0 == ~a10~0 && 0 == ~a12~0) && -13 < ~a1~0 && 38 >= ~a1~0) && 14 == ~a4~0) && 6 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,490 INFO L290 TraceCheckUtils]: 46: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((2 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 6 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,491 INFO L290 TraceCheckUtils]: 47: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((0 == ~a10~0 && 0 == ~a12~0) && -13 < ~a1~0 && 38 >= ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,491 INFO L290 TraceCheckUtils]: 48: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((3 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 8 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,492 INFO L290 TraceCheckUtils]: 49: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((4 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 7 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,492 INFO L290 TraceCheckUtils]: 50: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((1 == ~a10~0 && 0 == ~a12~0) && 38 < ~a1~0 && 218 >= ~a1~0) && 14 == ~a4~0) && 6 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,493 INFO L290 TraceCheckUtils]: 51: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((0 == ~a10~0 && 0 == ~a12~0) && 38 < ~a1~0 && 218 >= ~a1~0) && 14 == ~a4~0) && 6 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,493 INFO L290 TraceCheckUtils]: 52: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((4 == ~a10~0 && 0 == ~a12~0) && 38 < ~a1~0 && 218 >= ~a1~0) && 14 == ~a4~0) && 7 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,494 INFO L290 TraceCheckUtils]: 53: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((3 == ~a10~0 && 0 == ~a12~0) && 38 < ~a1~0 && 218 >= ~a1~0) && 14 == ~a4~0) && 6 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,495 INFO L290 TraceCheckUtils]: 54: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((2 == ~a10~0 && 0 == ~a12~0) && 38 < ~a1~0 && 218 >= ~a1~0) && 14 == ~a4~0) && 6 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,495 INFO L290 TraceCheckUtils]: 55: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((1 == ~a10~0 && 0 == ~a12~0) && -13 < ~a1~0 && 38 >= ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,496 INFO L290 TraceCheckUtils]: 56: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((4 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 6 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,496 INFO L290 TraceCheckUtils]: 57: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((0 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 6 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,497 INFO L290 TraceCheckUtils]: 58: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((2 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 7 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,497 INFO L290 TraceCheckUtils]: 59: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((3 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 6 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,498 INFO L290 TraceCheckUtils]: 60: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((3 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,498 INFO L290 TraceCheckUtils]: 61: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((3 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 7 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,499 INFO L290 TraceCheckUtils]: 62: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((1 == ~a10~0 && 0 == ~a12~0) && 38 < ~a1~0 && 218 >= ~a1~0) && 14 == ~a4~0) && 7 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,499 INFO L290 TraceCheckUtils]: 63: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((0 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 9 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,500 INFO L290 TraceCheckUtils]: 64: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((((1 == ~a10~0 && 0 == ~a12~0) && -13 < ~a1~0 && 38 >= ~a1~0) && 14 == ~a4~0) && 6 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,500 INFO L290 TraceCheckUtils]: 65: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((4 == ~a10~0 && 218 < ~a1~0 && (4 == calculate_output_~input#1 && 0 == ~a12~0) && 14 == ~a4~0) && 9 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,507 INFO L290 TraceCheckUtils]: 66: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !(14 == ~a4~0 && (0 == ~a12~0 && (((-13 < ~a1~0 && 38 >= ~a1~0) || (38 < ~a1~0 && 218 >= ~a1~0)) && 4 == calculate_output_~input#1) && 9 == ~a19~0) && 0 == ~a10~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,508 INFO L290 TraceCheckUtils]: 67: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !(((14 == ~a4~0 && 10 == ~a19~0 && 1 == ~a10~0 && 2 == calculate_output_~input#1) && 0 == ~a12~0) && 218 < ~a1~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,509 INFO L290 TraceCheckUtils]: 68: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !(0 == ~a12~0 && 9 == ~a19~0 && 1 == ~a10~0 && (218 < ~a1~0 && 3 == calculate_output_~input#1) && 14 == ~a4~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,509 INFO L290 TraceCheckUtils]: 69: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !(10 == ~a19~0 && (14 == ~a4~0 && (((0 == ~a10~0 && 38 < ~a1~0 && 218 >= ~a1~0) || (0 == ~a10~0 && 218 < ~a1~0)) || (1 == ~a10~0 && ~a1~0 <= -13)) && 5 == calculate_output_~input#1) && 0 == ~a12~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,510 INFO L290 TraceCheckUtils]: 70: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !(0 == ~a12~0 && 9 == ~a19~0 && (14 == ~a4~0 && 2 == calculate_output_~input#1 && ((-13 < ~a1~0 && 38 >= ~a1~0) || (38 < ~a1~0 && 218 >= ~a1~0))) && 3 == ~a10~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,510 INFO L290 TraceCheckUtils]: 71: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !(0 == ~a12~0 && ((14 == ~a4~0 && 3 == calculate_output_~input#1 && (~a1~0 <= -13 || (-13 < ~a1~0 && 38 >= ~a1~0))) && 2 == ~a10~0) && 9 == ~a19~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,511 INFO L290 TraceCheckUtils]: 72: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume !((0 == ~a12~0 && (-13 < ~a1~0 && 38 >= ~a1~0) && (3 == calculate_output_~input#1 && 10 == ~a19~0) && 14 == ~a4~0) && 1 == ~a10~0); {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} is VALID [2022-02-20 15:22:56,512 INFO L290 TraceCheckUtils]: 73: Hoare triple {3612#(and (<= ~a1~0 23) (<= 23 ~a1~0))} assume (9 == ~a19~0 && (6 == calculate_output_~input#1 && ((218 < ~a1~0 && 0 == ~a10~0) || (~a1~0 <= -13 && 1 == ~a10~0))) && 14 == ~a4~0) && 0 == ~a12~0;~a1~0 := (if (if ~a1~0 < 0 && 0 != ~a1~0 % 25 then ~a1~0 % 25 - 25 else ~a1~0 % 25) - -13 - 42605 < 0 && 0 != ((if ~a1~0 < 0 && 0 != ~a1~0 % 25 then ~a1~0 % 25 - 25 else ~a1~0 % 25) - -13 - 42605) % 5 then 1 + ((if ~a1~0 < 0 && 0 != ~a1~0 % 25 then ~a1~0 % 25 - 25 else ~a1~0 % 25) - -13 - 42605) / 5 else ((if ~a1~0 < 0 && 0 != ~a1~0 % 25 then ~a1~0 % 25 - 25 else ~a1~0 % 25) - -13 - 42605) / 5) - -8517;~a10~0 := 3;calculate_output_#res#1 := 26; {3611#false} is VALID [2022-02-20 15:22:56,512 INFO L290 TraceCheckUtils]: 74: Hoare triple {3611#false} main_#t~ret7#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main_#t~ret7#1 && main_#t~ret7#1 <= 2147483647;main_~output~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1; {3611#false} is VALID [2022-02-20 15:22:56,512 INFO L290 TraceCheckUtils]: 75: Hoare triple {3611#false} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {3611#false} is VALID [2022-02-20 15:22:56,513 INFO L290 TraceCheckUtils]: 76: Hoare triple {3611#false} assume !((((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_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {3611#false} is VALID [2022-02-20 15:22:56,513 INFO L290 TraceCheckUtils]: 77: Hoare triple {3611#false} assume !((((4 == ~a10~0 && 0 == ~a12~0) && 38 < ~a1~0 && 218 >= ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {3611#false} is VALID [2022-02-20 15:22:56,513 INFO L290 TraceCheckUtils]: 78: Hoare triple {3611#false} assume !((((2 == ~a10~0 && 0 == ~a12~0) && -13 < ~a1~0 && 38 >= ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {3611#false} is VALID [2022-02-20 15:22:56,513 INFO L290 TraceCheckUtils]: 79: Hoare triple {3611#false} assume !((((0 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 6 == ~a19~0); {3611#false} is VALID [2022-02-20 15:22:56,513 INFO L290 TraceCheckUtils]: 80: Hoare triple {3611#false} assume !((((2 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {3611#false} is VALID [2022-02-20 15:22:56,513 INFO L290 TraceCheckUtils]: 81: Hoare triple {3611#false} assume !((((4 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 6 == ~a19~0); {3611#false} is VALID [2022-02-20 15:22:56,513 INFO L290 TraceCheckUtils]: 82: Hoare triple {3611#false} assume !((((2 == ~a10~0 && 0 == ~a12~0) && -13 < ~a1~0 && 38 >= ~a1~0) && 14 == ~a4~0) && 7 == ~a19~0); {3611#false} is VALID [2022-02-20 15:22:56,513 INFO L290 TraceCheckUtils]: 83: Hoare triple {3611#false} assume !((((3 == ~a10~0 && 0 == ~a12~0) && -13 < ~a1~0 && 38 >= ~a1~0) && 14 == ~a4~0) && 6 == ~a19~0); {3611#false} is VALID [2022-02-20 15:22:56,513 INFO L290 TraceCheckUtils]: 84: Hoare triple {3611#false} assume !((((4 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {3611#false} is VALID [2022-02-20 15:22:56,514 INFO L290 TraceCheckUtils]: 85: Hoare triple {3611#false} assume !((((1 == ~a10~0 && 0 == ~a12~0) && -13 < ~a1~0 && 38 >= ~a1~0) && 14 == ~a4~0) && 7 == ~a19~0); {3611#false} is VALID [2022-02-20 15:22:56,514 INFO L290 TraceCheckUtils]: 86: Hoare triple {3611#false} assume !((((2 == ~a10~0 && 0 == ~a12~0) && 38 < ~a1~0 && 218 >= ~a1~0) && 14 == ~a4~0) && 7 == ~a19~0); {3611#false} is VALID [2022-02-20 15:22:56,514 INFO L290 TraceCheckUtils]: 87: Hoare triple {3611#false} assume !((((1 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 7 == ~a19~0); {3611#false} is VALID [2022-02-20 15:22:56,514 INFO L290 TraceCheckUtils]: 88: Hoare triple {3611#false} assume !((((0 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {3611#false} is VALID [2022-02-20 15:22:56,514 INFO L290 TraceCheckUtils]: 89: Hoare triple {3611#false} assume !((((4 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 8 == ~a19~0); {3611#false} is VALID [2022-02-20 15:22:56,514 INFO L290 TraceCheckUtils]: 90: Hoare triple {3611#false} assume !((((2 == ~a10~0 && 0 == ~a12~0) && ~a1~0 <= -13) && 14 == ~a4~0) && 8 == ~a19~0); {3611#false} is VALID [2022-02-20 15:22:56,514 INFO L290 TraceCheckUtils]: 91: Hoare triple {3611#false} assume !((((0 == ~a10~0 && 0 == ~a12~0) && 38 < ~a1~0 && 218 >= ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0); {3611#false} is VALID [2022-02-20 15:22:56,514 INFO L290 TraceCheckUtils]: 92: Hoare triple {3611#false} assume (((1 == ~a10~0 && 0 == ~a12~0) && 218 < ~a1~0) && 14 == ~a4~0) && 8 == ~a19~0; {3611#false} is VALID [2022-02-20 15:22:56,514 INFO L290 TraceCheckUtils]: 93: Hoare triple {3611#false} assume !false; {3611#false} is VALID [2022-02-20 15:22:56,515 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 15:22:56,516 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 15:22:56,516 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821284131] [2022-02-20 15:22:56,516 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821284131] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 15:22:56,516 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 15:22:56,516 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 15:22:56,516 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949134112] [2022-02-20 15:22:56,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 15:22:56,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2022-02-20 15:22:56,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 15:22:56,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 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:22:56,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 15:22:56,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 15:22:56,599 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 15:22:56,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 15:22:56,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 15:22:56,600 INFO L87 Difference]: Start difference. First operand 421 states and 526 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 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:22:57,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:22:57,333 INFO L93 Difference]: Finished difference Result 979 states and 1209 transitions. [2022-02-20 15:22:57,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 15:22:57,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2022-02-20 15:22:57,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 15:22:57,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 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:22:57,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 593 transitions. [2022-02-20 15:22:57,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 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:22:57,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 593 transitions. [2022-02-20 15:22:57,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 593 transitions. [2022-02-20 15:22:57,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 593 edges. 593 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 15:22:57,797 INFO L225 Difference]: With dead ends: 979 [2022-02-20 15:22:57,797 INFO L226 Difference]: Without dead ends: 560 [2022-02-20 15:22:57,798 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:22:57,799 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 68 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 15:22:57,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 77 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 15:22:57,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2022-02-20 15:22:57,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2022-02-20 15:22:57,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 15:22:57,812 INFO L82 GeneralOperation]: Start isEquivalent. First operand 560 states. Second operand has 560 states, 559 states have (on average 1.2075134168157424) internal successors, (675), 559 states have internal predecessors, (675), 0 states have call successors, (0), 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:22:57,814 INFO L74 IsIncluded]: Start isIncluded. First operand 560 states. Second operand has 560 states, 559 states have (on average 1.2075134168157424) internal successors, (675), 559 states have internal predecessors, (675), 0 states have call successors, (0), 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:22:57,815 INFO L87 Difference]: Start difference. First operand 560 states. Second operand has 560 states, 559 states have (on average 1.2075134168157424) internal successors, (675), 559 states have internal predecessors, (675), 0 states have call successors, (0), 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:22:57,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:22:57,833 INFO L93 Difference]: Finished difference Result 560 states and 675 transitions. [2022-02-20 15:22:57,833 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 675 transitions. [2022-02-20 15:22:57,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:22:57,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:22:57,835 INFO L74 IsIncluded]: Start isIncluded. First operand has 560 states, 559 states have (on average 1.2075134168157424) internal successors, (675), 559 states have internal predecessors, (675), 0 states have call successors, (0), 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 560 states. [2022-02-20 15:22:57,836 INFO L87 Difference]: Start difference. First operand has 560 states, 559 states have (on average 1.2075134168157424) internal successors, (675), 559 states have internal predecessors, (675), 0 states have call successors, (0), 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 560 states. [2022-02-20 15:22:57,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 15:22:57,855 INFO L93 Difference]: Finished difference Result 560 states and 675 transitions. [2022-02-20 15:22:57,855 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 675 transitions. [2022-02-20 15:22:57,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 15:22:57,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 15:22:57,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 15:22:57,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 15:22:57,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.2075134168157424) internal successors, (675), 559 states have internal predecessors, (675), 0 states have call successors, (0), 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:22:57,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 675 transitions. [2022-02-20 15:22:57,877 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 675 transitions. Word has length 94 [2022-02-20 15:22:57,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 15:22:57,877 INFO L470 AbstractCegarLoop]: Abstraction has 560 states and 675 transitions. [2022-02-20 15:22:57,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 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:22:57,877 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 675 transitions. [2022-02-20 15:22:57,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-02-20 15:22:57,878 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 15:22:57,879 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 15:22:57,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 15:22:57,879 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 15:22:57,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 15:22:57,880 INFO L85 PathProgramCache]: Analyzing trace with hash 404934448, now seen corresponding path program 1 times [2022-02-20 15:22:57,880 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 15:22:57,880 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588523852] [2022-02-20 15:22:57,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 15:22:57,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 15:22:57,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 15:22:57,950 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 15:22:57,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 15:22:57,999 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 15:22:57,999 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 15:22:58,000 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 15:22:58,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 15:22:58,004 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-20 15:22:58,006 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 15:22:58,086 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 15:22:58,086 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 15:22:58,087 WARN L170 areAnnotationChecker]: L592-2 has no Hoare annotation [2022-02-20 15:22:58,087 WARN L170 areAnnotationChecker]: L592-2 has no Hoare annotation [2022-02-20 15:22:58,087 WARN L170 areAnnotationChecker]: L592-2 has no Hoare annotation [2022-02-20 15:22:58,087 WARN L170 areAnnotationChecker]: L586 has no Hoare annotation [2022-02-20 15:22:58,087 WARN L170 areAnnotationChecker]: L597 has no Hoare annotation [2022-02-20 15:22:58,087 WARN L170 areAnnotationChecker]: L597 has no Hoare annotation [2022-02-20 15:22:58,087 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 15:22:58,087 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 15:22:58,087 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 15:22:58,087 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-02-20 15:22:58,087 WARN L170 areAnnotationChecker]: L31-2 has no Hoare annotation [2022-02-20 15:22:58,087 WARN L170 areAnnotationChecker]: L31-2 has no Hoare annotation [2022-02-20 15:22:58,087 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-02-20 15:22:58,088 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-02-20 15:22:58,088 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-02-20 15:22:58,088 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 15:22:58,088 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-02-20 15:22:58,088 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-02-20 15:22:58,088 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-02-20 15:22:58,088 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2022-02-20 15:22:58,088 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2022-02-20 15:22:58,088 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 15:22:58,088 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2022-02-20 15:22:58,088 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2022-02-20 15:22:58,088 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-02-20 15:22:58,089 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-02-20 15:22:58,089 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-02-20 15:22:58,089 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-02-20 15:22:58,089 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-02-20 15:22:58,089 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-02-20 15:22:58,089 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-02-20 15:22:58,089 WARN L170 areAnnotationChecker]: L52-1 has no Hoare annotation [2022-02-20 15:22:58,089 WARN L170 areAnnotationChecker]: L52-1 has no Hoare annotation [2022-02-20 15:22:58,089 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2022-02-20 15:22:58,089 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2022-02-20 15:22:58,089 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2022-02-20 15:22:58,089 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-02-20 15:22:58,090 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2022-02-20 15:22:58,090 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2022-02-20 15:22:58,090 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2022-02-20 15:22:58,090 WARN L170 areAnnotationChecker]: L61-1 has no Hoare annotation [2022-02-20 15:22:58,090 WARN L170 areAnnotationChecker]: L61-1 has no Hoare annotation [2022-02-20 15:22:58,090 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2022-02-20 15:22:58,090 WARN L170 areAnnotationChecker]: L64-1 has no Hoare annotation [2022-02-20 15:22:58,090 WARN L170 areAnnotationChecker]: L64-1 has no Hoare annotation [2022-02-20 15:22:58,095 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-02-20 15:22:58,095 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 15:22:58,095 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 15:22:58,095 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-02-20 15:22:58,095 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2022-02-20 15:22:58,095 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2022-02-20 15:22:58,096 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2022-02-20 15:22:58,096 WARN L170 areAnnotationChecker]: L73-1 has no Hoare annotation [2022-02-20 15:22:58,096 WARN L170 areAnnotationChecker]: L73-1 has no Hoare annotation [2022-02-20 15:22:58,096 WARN L170 areAnnotationChecker]: L77 has no Hoare annotation [2022-02-20 15:22:58,096 WARN L170 areAnnotationChecker]: L77 has no Hoare annotation [2022-02-20 15:22:58,096 WARN L170 areAnnotationChecker]: L76-1 has no Hoare annotation [2022-02-20 15:22:58,096 WARN L170 areAnnotationChecker]: L76-1 has no Hoare annotation [2022-02-20 15:22:58,096 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 15:22:58,096 WARN L170 areAnnotationChecker]: L79-1 has no Hoare annotation [2022-02-20 15:22:58,096 WARN L170 areAnnotationChecker]: L79-1 has no Hoare annotation [2022-02-20 15:22:58,096 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2022-02-20 15:22:58,096 WARN L170 areAnnotationChecker]: L82-1 has no Hoare annotation [2022-02-20 15:22:58,096 WARN L170 areAnnotationChecker]: L82-1 has no Hoare annotation [2022-02-20 15:22:58,097 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2022-02-20 15:22:58,097 WARN L170 areAnnotationChecker]: L85-1 has no Hoare annotation [2022-02-20 15:22:58,097 WARN L170 areAnnotationChecker]: L85-1 has no Hoare annotation [2022-02-20 15:22:58,097 WARN L170 areAnnotationChecker]: L89 has no Hoare annotation [2022-02-20 15:22:58,097 WARN L170 areAnnotationChecker]: L88-1 has no Hoare annotation [2022-02-20 15:22:58,097 WARN L170 areAnnotationChecker]: L88-1 has no Hoare annotation [2022-02-20 15:22:58,097 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2022-02-20 15:22:58,097 WARN L170 areAnnotationChecker]: L91-1 has no Hoare annotation [2022-02-20 15:22:58,097 WARN L170 areAnnotationChecker]: L91-1 has no Hoare annotation [2022-02-20 15:22:58,097 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2022-02-20 15:22:58,097 WARN L170 areAnnotationChecker]: L94-1 has no Hoare annotation [2022-02-20 15:22:58,097 WARN L170 areAnnotationChecker]: L94-1 has no Hoare annotation [2022-02-20 15:22:58,097 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2022-02-20 15:22:58,097 WARN L170 areAnnotationChecker]: L97-1 has no Hoare annotation [2022-02-20 15:22:58,098 WARN L170 areAnnotationChecker]: L97-1 has no Hoare annotation [2022-02-20 15:22:58,098 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2022-02-20 15:22:58,098 WARN L170 areAnnotationChecker]: L100-1 has no Hoare annotation [2022-02-20 15:22:58,098 WARN L170 areAnnotationChecker]: L100-1 has no Hoare annotation [2022-02-20 15:22:58,098 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2022-02-20 15:22:58,098 WARN L170 areAnnotationChecker]: L103-1 has no Hoare annotation [2022-02-20 15:22:58,098 WARN L170 areAnnotationChecker]: L103-1 has no Hoare annotation [2022-02-20 15:22:58,098 WARN L170 areAnnotationChecker]: L107 has no Hoare annotation [2022-02-20 15:22:58,098 WARN L170 areAnnotationChecker]: L106-1 has no Hoare annotation [2022-02-20 15:22:58,098 WARN L170 areAnnotationChecker]: L106-1 has no Hoare annotation [2022-02-20 15:22:58,098 WARN L170 areAnnotationChecker]: L110 has no Hoare annotation [2022-02-20 15:22:58,098 WARN L170 areAnnotationChecker]: L109-1 has no Hoare annotation [2022-02-20 15:22:58,098 WARN L170 areAnnotationChecker]: L109-1 has no Hoare annotation [2022-02-20 15:22:58,098 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-02-20 15:22:58,099 WARN L170 areAnnotationChecker]: L112-1 has no Hoare annotation [2022-02-20 15:22:58,099 WARN L170 areAnnotationChecker]: L112-1 has no Hoare annotation [2022-02-20 15:22:58,099 WARN L170 areAnnotationChecker]: L116 has no Hoare annotation [2022-02-20 15:22:58,099 WARN L170 areAnnotationChecker]: L115-1 has no Hoare annotation [2022-02-20 15:22:58,099 WARN L170 areAnnotationChecker]: L115-1 has no Hoare annotation [2022-02-20 15:22:58,099 WARN L170 areAnnotationChecker]: L119 has no Hoare annotation [2022-02-20 15:22:58,099 WARN L170 areAnnotationChecker]: L118-1 has no Hoare annotation [2022-02-20 15:22:58,099 WARN L170 areAnnotationChecker]: L118-1 has no Hoare annotation [2022-02-20 15:22:58,099 WARN L170 areAnnotationChecker]: L122 has no Hoare annotation [2022-02-20 15:22:58,099 WARN L170 areAnnotationChecker]: L121-1 has no Hoare annotation [2022-02-20 15:22:58,099 WARN L170 areAnnotationChecker]: L121-1 has no Hoare annotation [2022-02-20 15:22:58,099 WARN L170 areAnnotationChecker]: L125 has no Hoare annotation [2022-02-20 15:22:58,099 WARN L170 areAnnotationChecker]: L124-1 has no Hoare annotation [2022-02-20 15:22:58,100 WARN L170 areAnnotationChecker]: L124-1 has no Hoare annotation [2022-02-20 15:22:58,100 WARN L170 areAnnotationChecker]: L128 has no Hoare annotation [2022-02-20 15:22:58,100 WARN L170 areAnnotationChecker]: L127-1 has no Hoare annotation [2022-02-20 15:22:58,100 WARN L170 areAnnotationChecker]: L127-1 has no Hoare annotation [2022-02-20 15:22:58,100 WARN L170 areAnnotationChecker]: L131 has no Hoare annotation [2022-02-20 15:22:58,100 WARN L170 areAnnotationChecker]: L130-1 has no Hoare annotation [2022-02-20 15:22:58,100 WARN L170 areAnnotationChecker]: L130-1 has no Hoare annotation [2022-02-20 15:22:58,100 WARN L170 areAnnotationChecker]: L134 has no Hoare annotation [2022-02-20 15:22:58,100 WARN L170 areAnnotationChecker]: L133-1 has no Hoare annotation [2022-02-20 15:22:58,100 WARN L170 areAnnotationChecker]: L133-1 has no Hoare annotation [2022-02-20 15:22:58,100 WARN L170 areAnnotationChecker]: L137 has no Hoare annotation [2022-02-20 15:22:58,100 WARN L170 areAnnotationChecker]: L136-1 has no Hoare annotation [2022-02-20 15:22:58,100 WARN L170 areAnnotationChecker]: L136-1 has no Hoare annotation [2022-02-20 15:22:58,100 WARN L170 areAnnotationChecker]: L140 has no Hoare annotation [2022-02-20 15:22:58,101 WARN L170 areAnnotationChecker]: L139-1 has no Hoare annotation [2022-02-20 15:22:58,101 WARN L170 areAnnotationChecker]: L139-1 has no Hoare annotation [2022-02-20 15:22:58,101 WARN L170 areAnnotationChecker]: L143 has no Hoare annotation [2022-02-20 15:22:58,101 WARN L170 areAnnotationChecker]: L142-1 has no Hoare annotation [2022-02-20 15:22:58,101 WARN L170 areAnnotationChecker]: L142-1 has no Hoare annotation [2022-02-20 15:22:58,101 WARN L170 areAnnotationChecker]: L146 has no Hoare annotation [2022-02-20 15:22:58,101 WARN L170 areAnnotationChecker]: L145-1 has no Hoare annotation [2022-02-20 15:22:58,101 WARN L170 areAnnotationChecker]: L145-1 has no Hoare annotation [2022-02-20 15:22:58,101 WARN L170 areAnnotationChecker]: L149 has no Hoare annotation [2022-02-20 15:22:58,101 WARN L170 areAnnotationChecker]: L148-1 has no Hoare annotation [2022-02-20 15:22:58,101 WARN L170 areAnnotationChecker]: L148-1 has no Hoare annotation [2022-02-20 15:22:58,101 WARN L170 areAnnotationChecker]: L152 has no Hoare annotation [2022-02-20 15:22:58,101 WARN L170 areAnnotationChecker]: L151-1 has no Hoare annotation [2022-02-20 15:22:58,102 WARN L170 areAnnotationChecker]: L151-1 has no Hoare annotation [2022-02-20 15:22:58,102 WARN L170 areAnnotationChecker]: L155 has no Hoare annotation [2022-02-20 15:22:58,102 WARN L170 areAnnotationChecker]: L154-1 has no Hoare annotation [2022-02-20 15:22:58,102 WARN L170 areAnnotationChecker]: L154-1 has no Hoare annotation [2022-02-20 15:22:58,102 WARN L170 areAnnotationChecker]: L158 has no Hoare annotation [2022-02-20 15:22:58,102 WARN L170 areAnnotationChecker]: L157-1 has no Hoare annotation [2022-02-20 15:22:58,102 WARN L170 areAnnotationChecker]: L157-1 has no Hoare annotation [2022-02-20 15:22:58,102 WARN L170 areAnnotationChecker]: L161 has no Hoare annotation [2022-02-20 15:22:58,102 WARN L170 areAnnotationChecker]: L160-1 has no Hoare annotation [2022-02-20 15:22:58,102 WARN L170 areAnnotationChecker]: L160-1 has no Hoare annotation [2022-02-20 15:22:58,102 WARN L170 areAnnotationChecker]: L164 has no Hoare annotation [2022-02-20 15:22:58,102 WARN L170 areAnnotationChecker]: L163-1 has no Hoare annotation [2022-02-20 15:22:58,102 WARN L170 areAnnotationChecker]: L163-1 has no Hoare annotation [2022-02-20 15:22:58,102 WARN L170 areAnnotationChecker]: L167 has no Hoare annotation [2022-02-20 15:22:58,103 WARN L170 areAnnotationChecker]: L166-1 has no Hoare annotation [2022-02-20 15:22:58,103 WARN L170 areAnnotationChecker]: L166-1 has no Hoare annotation [2022-02-20 15:22:58,103 WARN L170 areAnnotationChecker]: L170 has no Hoare annotation [2022-02-20 15:22:58,103 WARN L170 areAnnotationChecker]: L169-1 has no Hoare annotation [2022-02-20 15:22:58,103 WARN L170 areAnnotationChecker]: L169-1 has no Hoare annotation [2022-02-20 15:22:58,103 WARN L170 areAnnotationChecker]: L173 has no Hoare annotation [2022-02-20 15:22:58,103 WARN L170 areAnnotationChecker]: L172-1 has no Hoare annotation [2022-02-20 15:22:58,103 WARN L170 areAnnotationChecker]: L172-1 has no Hoare annotation [2022-02-20 15:22:58,103 WARN L170 areAnnotationChecker]: L176 has no Hoare annotation [2022-02-20 15:22:58,103 WARN L170 areAnnotationChecker]: L175-1 has no Hoare annotation [2022-02-20 15:22:58,103 WARN L170 areAnnotationChecker]: L175-1 has no Hoare annotation [2022-02-20 15:22:58,103 WARN L170 areAnnotationChecker]: L179 has no Hoare annotation [2022-02-20 15:22:58,103 WARN L170 areAnnotationChecker]: L178-1 has no Hoare annotation [2022-02-20 15:22:58,104 WARN L170 areAnnotationChecker]: L178-1 has no Hoare annotation [2022-02-20 15:22:58,104 WARN L170 areAnnotationChecker]: L182 has no Hoare annotation [2022-02-20 15:22:58,104 WARN L170 areAnnotationChecker]: L181-1 has no Hoare annotation [2022-02-20 15:22:58,104 WARN L170 areAnnotationChecker]: L181-1 has no Hoare annotation [2022-02-20 15:22:58,104 WARN L170 areAnnotationChecker]: L185 has no Hoare annotation [2022-02-20 15:22:58,104 WARN L170 areAnnotationChecker]: L184-1 has no Hoare annotation [2022-02-20 15:22:58,104 WARN L170 areAnnotationChecker]: L184-1 has no Hoare annotation [2022-02-20 15:22:58,104 WARN L170 areAnnotationChecker]: L188 has no Hoare annotation [2022-02-20 15:22:58,104 WARN L170 areAnnotationChecker]: L187-1 has no Hoare annotation [2022-02-20 15:22:58,104 WARN L170 areAnnotationChecker]: L187-1 has no Hoare annotation [2022-02-20 15:22:58,104 WARN L170 areAnnotationChecker]: L191 has no Hoare annotation [2022-02-20 15:22:58,104 WARN L170 areAnnotationChecker]: L190-1 has no Hoare annotation [2022-02-20 15:22:58,104 WARN L170 areAnnotationChecker]: L190-1 has no Hoare annotation [2022-02-20 15:22:58,104 WARN L170 areAnnotationChecker]: L194 has no Hoare annotation [2022-02-20 15:22:58,105 WARN L170 areAnnotationChecker]: L193-1 has no Hoare annotation [2022-02-20 15:22:58,105 WARN L170 areAnnotationChecker]: L193-1 has no Hoare annotation [2022-02-20 15:22:58,105 WARN L170 areAnnotationChecker]: L197 has no Hoare annotation [2022-02-20 15:22:58,105 WARN L170 areAnnotationChecker]: L196-1 has no Hoare annotation [2022-02-20 15:22:58,105 WARN L170 areAnnotationChecker]: L196-1 has no Hoare annotation [2022-02-20 15:22:58,105 WARN L170 areAnnotationChecker]: L200 has no Hoare annotation [2022-02-20 15:22:58,105 WARN L170 areAnnotationChecker]: L199-1 has no Hoare annotation [2022-02-20 15:22:58,105 WARN L170 areAnnotationChecker]: L199-1 has no Hoare annotation [2022-02-20 15:22:58,105 WARN L170 areAnnotationChecker]: L203 has no Hoare annotation [2022-02-20 15:22:58,105 WARN L170 areAnnotationChecker]: L202-1 has no Hoare annotation [2022-02-20 15:22:58,105 WARN L170 areAnnotationChecker]: L202-1 has no Hoare annotation [2022-02-20 15:22:58,105 WARN L170 areAnnotationChecker]: L206 has no Hoare annotation [2022-02-20 15:22:58,105 WARN L170 areAnnotationChecker]: L205-1 has no Hoare annotation [2022-02-20 15:22:58,105 WARN L170 areAnnotationChecker]: L205-1 has no Hoare annotation [2022-02-20 15:22:58,106 WARN L170 areAnnotationChecker]: L209 has no Hoare annotation [2022-02-20 15:22:58,106 WARN L170 areAnnotationChecker]: L208-1 has no Hoare annotation [2022-02-20 15:22:58,106 WARN L170 areAnnotationChecker]: L208-1 has no Hoare annotation [2022-02-20 15:22:58,106 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2022-02-20 15:22:58,106 WARN L170 areAnnotationChecker]: L211-1 has no Hoare annotation [2022-02-20 15:22:58,106 WARN L170 areAnnotationChecker]: L211-1 has no Hoare annotation [2022-02-20 15:22:58,106 WARN L170 areAnnotationChecker]: L583 has no Hoare annotation [2022-02-20 15:22:58,106 WARN L170 areAnnotationChecker]: L220 has no Hoare annotation [2022-02-20 15:22:58,106 WARN L170 areAnnotationChecker]: L220 has no Hoare annotation [2022-02-20 15:22:58,106 WARN L170 areAnnotationChecker]: L225 has no Hoare annotation [2022-02-20 15:22:58,106 WARN L170 areAnnotationChecker]: L225 has no Hoare annotation [2022-02-20 15:22:58,106 WARN L170 areAnnotationChecker]: L230 has no Hoare annotation [2022-02-20 15:22:58,106 WARN L170 areAnnotationChecker]: L230 has no Hoare annotation [2022-02-20 15:22:58,106 WARN L170 areAnnotationChecker]: L235 has no Hoare annotation [2022-02-20 15:22:58,107 WARN L170 areAnnotationChecker]: L235 has no Hoare annotation [2022-02-20 15:22:58,107 WARN L170 areAnnotationChecker]: L241 has no Hoare annotation [2022-02-20 15:22:58,107 WARN L170 areAnnotationChecker]: L241 has no Hoare annotation [2022-02-20 15:22:58,107 WARN L170 areAnnotationChecker]: L246 has no Hoare annotation [2022-02-20 15:22:58,107 WARN L170 areAnnotationChecker]: L246 has no Hoare annotation [2022-02-20 15:22:58,107 WARN L170 areAnnotationChecker]: L249 has no Hoare annotation [2022-02-20 15:22:58,107 WARN L170 areAnnotationChecker]: L249 has no Hoare annotation [2022-02-20 15:22:58,107 WARN L170 areAnnotationChecker]: L254 has no Hoare annotation [2022-02-20 15:22:58,107 WARN L170 areAnnotationChecker]: L254 has no Hoare annotation [2022-02-20 15:22:58,107 WARN L170 areAnnotationChecker]: L259 has no Hoare annotation [2022-02-20 15:22:58,107 WARN L170 areAnnotationChecker]: L259 has no Hoare annotation [2022-02-20 15:22:58,107 WARN L170 areAnnotationChecker]: L264 has no Hoare annotation [2022-02-20 15:22:58,107 WARN L170 areAnnotationChecker]: L264 has no Hoare annotation [2022-02-20 15:22:58,108 WARN L170 areAnnotationChecker]: L270 has no Hoare annotation [2022-02-20 15:22:58,108 WARN L170 areAnnotationChecker]: L270 has no Hoare annotation [2022-02-20 15:22:58,108 WARN L170 areAnnotationChecker]: L275 has no Hoare annotation [2022-02-20 15:22:58,108 WARN L170 areAnnotationChecker]: L275 has no Hoare annotation [2022-02-20 15:22:58,108 WARN L170 areAnnotationChecker]: L281 has no Hoare annotation [2022-02-20 15:22:58,108 WARN L170 areAnnotationChecker]: L281 has no Hoare annotation [2022-02-20 15:22:58,108 WARN L170 areAnnotationChecker]: L287 has no Hoare annotation [2022-02-20 15:22:58,108 WARN L170 areAnnotationChecker]: L287 has no Hoare annotation [2022-02-20 15:22:58,108 WARN L170 areAnnotationChecker]: L293 has no Hoare annotation [2022-02-20 15:22:58,108 WARN L170 areAnnotationChecker]: L293 has no Hoare annotation [2022-02-20 15:22:58,108 WARN L170 areAnnotationChecker]: L296 has no Hoare annotation [2022-02-20 15:22:58,108 WARN L170 areAnnotationChecker]: L296 has no Hoare annotation [2022-02-20 15:22:58,108 WARN L170 areAnnotationChecker]: L301 has no Hoare annotation [2022-02-20 15:22:58,108 WARN L170 areAnnotationChecker]: L301 has no Hoare annotation [2022-02-20 15:22:58,109 WARN L170 areAnnotationChecker]: L306 has no Hoare annotation [2022-02-20 15:22:58,109 WARN L170 areAnnotationChecker]: L306 has no Hoare annotation [2022-02-20 15:22:58,109 WARN L170 areAnnotationChecker]: L311 has no Hoare annotation [2022-02-20 15:22:58,109 WARN L170 areAnnotationChecker]: L311 has no Hoare annotation [2022-02-20 15:22:58,109 WARN L170 areAnnotationChecker]: L316 has no Hoare annotation [2022-02-20 15:22:58,109 WARN L170 areAnnotationChecker]: L316 has no Hoare annotation [2022-02-20 15:22:58,109 WARN L170 areAnnotationChecker]: L322 has no Hoare annotation [2022-02-20 15:22:58,109 WARN L170 areAnnotationChecker]: L322 has no Hoare annotation [2022-02-20 15:22:58,109 WARN L170 areAnnotationChecker]: L327 has no Hoare annotation [2022-02-20 15:22:58,109 WARN L170 areAnnotationChecker]: L327 has no Hoare annotation [2022-02-20 15:22:58,109 WARN L170 areAnnotationChecker]: L330 has no Hoare annotation [2022-02-20 15:22:58,109 WARN L170 areAnnotationChecker]: L330 has no Hoare annotation [2022-02-20 15:22:58,109 WARN L170 areAnnotationChecker]: L333 has no Hoare annotation [2022-02-20 15:22:58,109 WARN L170 areAnnotationChecker]: L333 has no Hoare annotation [2022-02-20 15:22:58,110 WARN L170 areAnnotationChecker]: L336 has no Hoare annotation [2022-02-20 15:22:58,110 WARN L170 areAnnotationChecker]: L336 has no Hoare annotation [2022-02-20 15:22:58,110 WARN L170 areAnnotationChecker]: L339 has no Hoare annotation [2022-02-20 15:22:58,110 WARN L170 areAnnotationChecker]: L339 has no Hoare annotation [2022-02-20 15:22:58,110 WARN L170 areAnnotationChecker]: L345 has no Hoare annotation [2022-02-20 15:22:58,110 WARN L170 areAnnotationChecker]: L345 has no Hoare annotation [2022-02-20 15:22:58,110 WARN L170 areAnnotationChecker]: L350 has no Hoare annotation [2022-02-20 15:22:58,110 WARN L170 areAnnotationChecker]: L350 has no Hoare annotation [2022-02-20 15:22:58,110 WARN L170 areAnnotationChecker]: L355 has no Hoare annotation [2022-02-20 15:22:58,110 WARN L170 areAnnotationChecker]: L355 has no Hoare annotation [2022-02-20 15:22:58,110 WARN L170 areAnnotationChecker]: L361 has no Hoare annotation [2022-02-20 15:22:58,111 WARN L170 areAnnotationChecker]: L361 has no Hoare annotation [2022-02-20 15:22:58,112 WARN L170 areAnnotationChecker]: L364 has no Hoare annotation [2022-02-20 15:22:58,112 WARN L170 areAnnotationChecker]: L364 has no Hoare annotation [2022-02-20 15:22:58,112 WARN L170 areAnnotationChecker]: L367 has no Hoare annotation [2022-02-20 15:22:58,112 WARN L170 areAnnotationChecker]: L367 has no Hoare annotation [2022-02-20 15:22:58,112 WARN L170 areAnnotationChecker]: L370 has no Hoare annotation [2022-02-20 15:22:58,112 WARN L170 areAnnotationChecker]: L370 has no Hoare annotation [2022-02-20 15:22:58,112 WARN L170 areAnnotationChecker]: L375 has no Hoare annotation [2022-02-20 15:22:58,112 WARN L170 areAnnotationChecker]: L375 has no Hoare annotation [2022-02-20 15:22:58,112 WARN L170 areAnnotationChecker]: L380 has no Hoare annotation [2022-02-20 15:22:58,112 WARN L170 areAnnotationChecker]: L380 has no Hoare annotation [2022-02-20 15:22:58,112 WARN L170 areAnnotationChecker]: L385 has no Hoare annotation [2022-02-20 15:22:58,112 WARN L170 areAnnotationChecker]: L385 has no Hoare annotation [2022-02-20 15:22:58,112 WARN L170 areAnnotationChecker]: L388 has no Hoare annotation [2022-02-20 15:22:58,112 WARN L170 areAnnotationChecker]: L388 has no Hoare annotation [2022-02-20 15:22:58,113 WARN L170 areAnnotationChecker]: L393 has no Hoare annotation [2022-02-20 15:22:58,113 WARN L170 areAnnotationChecker]: L393 has no Hoare annotation [2022-02-20 15:22:58,113 WARN L170 areAnnotationChecker]: L398 has no Hoare annotation [2022-02-20 15:22:58,113 WARN L170 areAnnotationChecker]: L398 has no Hoare annotation [2022-02-20 15:22:58,113 WARN L170 areAnnotationChecker]: L403 has no Hoare annotation [2022-02-20 15:22:58,113 WARN L170 areAnnotationChecker]: L403 has no Hoare annotation [2022-02-20 15:22:58,113 WARN L170 areAnnotationChecker]: L408 has no Hoare annotation [2022-02-20 15:22:58,113 WARN L170 areAnnotationChecker]: L408 has no Hoare annotation [2022-02-20 15:22:58,113 WARN L170 areAnnotationChecker]: L413 has no Hoare annotation [2022-02-20 15:22:58,113 WARN L170 areAnnotationChecker]: L413 has no Hoare annotation [2022-02-20 15:22:58,113 WARN L170 areAnnotationChecker]: L418 has no Hoare annotation [2022-02-20 15:22:58,113 WARN L170 areAnnotationChecker]: L418 has no Hoare annotation [2022-02-20 15:22:58,113 WARN L170 areAnnotationChecker]: L424 has no Hoare annotation [2022-02-20 15:22:58,113 WARN L170 areAnnotationChecker]: L424 has no Hoare annotation [2022-02-20 15:22:58,114 WARN L170 areAnnotationChecker]: L429 has no Hoare annotation [2022-02-20 15:22:58,114 WARN L170 areAnnotationChecker]: L429 has no Hoare annotation [2022-02-20 15:22:58,114 WARN L170 areAnnotationChecker]: L435 has no Hoare annotation [2022-02-20 15:22:58,114 WARN L170 areAnnotationChecker]: L435 has no Hoare annotation [2022-02-20 15:22:58,114 WARN L170 areAnnotationChecker]: L440 has no Hoare annotation [2022-02-20 15:22:58,114 WARN L170 areAnnotationChecker]: L440 has no Hoare annotation [2022-02-20 15:22:58,114 WARN L170 areAnnotationChecker]: L446 has no Hoare annotation [2022-02-20 15:22:58,114 WARN L170 areAnnotationChecker]: L446 has no Hoare annotation [2022-02-20 15:22:58,114 WARN L170 areAnnotationChecker]: L452 has no Hoare annotation [2022-02-20 15:22:58,114 WARN L170 areAnnotationChecker]: L452 has no Hoare annotation [2022-02-20 15:22:58,114 WARN L170 areAnnotationChecker]: L458 has no Hoare annotation [2022-02-20 15:22:58,114 WARN L170 areAnnotationChecker]: L458 has no Hoare annotation [2022-02-20 15:22:58,114 WARN L170 areAnnotationChecker]: L464 has no Hoare annotation [2022-02-20 15:22:58,114 WARN L170 areAnnotationChecker]: L464 has no Hoare annotation [2022-02-20 15:22:58,115 WARN L170 areAnnotationChecker]: L470 has no Hoare annotation [2022-02-20 15:22:58,115 WARN L170 areAnnotationChecker]: L470 has no Hoare annotation [2022-02-20 15:22:58,115 WARN L170 areAnnotationChecker]: L475 has no Hoare annotation [2022-02-20 15:22:58,115 WARN L170 areAnnotationChecker]: L475 has no Hoare annotation [2022-02-20 15:22:58,115 WARN L170 areAnnotationChecker]: L481 has no Hoare annotation [2022-02-20 15:22:58,115 WARN L170 areAnnotationChecker]: L481 has no Hoare annotation [2022-02-20 15:22:58,115 WARN L170 areAnnotationChecker]: L486 has no Hoare annotation [2022-02-20 15:22:58,115 WARN L170 areAnnotationChecker]: L486 has no Hoare annotation [2022-02-20 15:22:58,115 WARN L170 areAnnotationChecker]: L491 has no Hoare annotation [2022-02-20 15:22:58,115 WARN L170 areAnnotationChecker]: L491 has no Hoare annotation [2022-02-20 15:22:58,115 WARN L170 areAnnotationChecker]: L497 has no Hoare annotation [2022-02-20 15:22:58,115 WARN L170 areAnnotationChecker]: L497 has no Hoare annotation [2022-02-20 15:22:58,115 WARN L170 areAnnotationChecker]: L503 has no Hoare annotation [2022-02-20 15:22:58,115 WARN L170 areAnnotationChecker]: L503 has no Hoare annotation [2022-02-20 15:22:58,116 WARN L170 areAnnotationChecker]: L509 has no Hoare annotation [2022-02-20 15:22:58,116 WARN L170 areAnnotationChecker]: L509 has no Hoare annotation [2022-02-20 15:22:58,116 WARN L170 areAnnotationChecker]: L514 has no Hoare annotation [2022-02-20 15:22:58,116 WARN L170 areAnnotationChecker]: L514 has no Hoare annotation [2022-02-20 15:22:58,116 WARN L170 areAnnotationChecker]: L519 has no Hoare annotation [2022-02-20 15:22:58,116 WARN L170 areAnnotationChecker]: L519 has no Hoare annotation [2022-02-20 15:22:58,116 WARN L170 areAnnotationChecker]: L524 has no Hoare annotation [2022-02-20 15:22:58,116 WARN L170 areAnnotationChecker]: L524 has no Hoare annotation [2022-02-20 15:22:58,116 WARN L170 areAnnotationChecker]: L527 has no Hoare annotation [2022-02-20 15:22:58,116 WARN L170 areAnnotationChecker]: L527 has no Hoare annotation [2022-02-20 15:22:58,116 WARN L170 areAnnotationChecker]: L533 has no Hoare annotation [2022-02-20 15:22:58,116 WARN L170 areAnnotationChecker]: L533 has no Hoare annotation [2022-02-20 15:22:58,116 WARN L170 areAnnotationChecker]: L536 has no Hoare annotation [2022-02-20 15:22:58,116 WARN L170 areAnnotationChecker]: L536 has no Hoare annotation [2022-02-20 15:22:58,117 WARN L170 areAnnotationChecker]: L539 has no Hoare annotation [2022-02-20 15:22:58,117 WARN L170 areAnnotationChecker]: L539 has no Hoare annotation [2022-02-20 15:22:58,117 WARN L170 areAnnotationChecker]: L544 has no Hoare annotation [2022-02-20 15:22:58,117 WARN L170 areAnnotationChecker]: L544 has no Hoare annotation [2022-02-20 15:22:58,117 WARN L170 areAnnotationChecker]: L550 has no Hoare annotation [2022-02-20 15:22:58,117 WARN L170 areAnnotationChecker]: L550 has no Hoare annotation [2022-02-20 15:22:58,117 WARN L170 areAnnotationChecker]: L555 has no Hoare annotation [2022-02-20 15:22:58,117 WARN L170 areAnnotationChecker]: L555 has no Hoare annotation [2022-02-20 15:22:58,117 WARN L170 areAnnotationChecker]: L558 has no Hoare annotation [2022-02-20 15:22:58,117 WARN L170 areAnnotationChecker]: L558 has no Hoare annotation [2022-02-20 15:22:58,117 WARN L170 areAnnotationChecker]: L564 has no Hoare annotation [2022-02-20 15:22:58,117 WARN L170 areAnnotationChecker]: L564 has no Hoare annotation [2022-02-20 15:22:58,117 WARN L170 areAnnotationChecker]: L567 has no Hoare annotation [2022-02-20 15:22:58,117 WARN L170 areAnnotationChecker]: L567 has no Hoare annotation [2022-02-20 15:22:58,118 WARN L170 areAnnotationChecker]: L573 has no Hoare annotation [2022-02-20 15:22:58,118 WARN L170 areAnnotationChecker]: L573 has no Hoare annotation [2022-02-20 15:22:58,118 WARN L170 areAnnotationChecker]: L579 has no Hoare annotation [2022-02-20 15:22:58,118 WARN L170 areAnnotationChecker]: L579 has no Hoare annotation [2022-02-20 15:22:58,118 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 15:22:58,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 03:22:58 BoogieIcfgContainer [2022-02-20 15:22:58,120 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 15:22:58,120 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 15:22:58,120 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 15:22:58,120 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 15:22:58,121 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 03:22:52" (3/4) ... [2022-02-20 15:22:58,122 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-20 15:22:58,224 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 15:22:58,224 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 15:22:58,226 INFO L158 Benchmark]: Toolchain (without parser) took 8685.34ms. Allocated memory was 104.9MB in the beginning and 182.5MB in the end (delta: 77.6MB). Free memory was 64.1MB in the beginning and 143.2MB in the end (delta: -79.1MB). Peak memory consumption was 92.7MB. Max. memory is 16.1GB. [2022-02-20 15:22:58,226 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 15:22:58,226 INFO L158 Benchmark]: CACSL2BoogieTranslator took 600.97ms. Allocated memory is still 104.9MB. Free memory was 63.9MB in the beginning and 54.8MB in the end (delta: 9.1MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2022-02-20 15:22:58,226 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.42ms. Allocated memory is still 104.9MB. Free memory was 54.8MB in the beginning and 42.1MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 15:22:58,227 INFO L158 Benchmark]: Boogie Preprocessor took 113.45ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 42.1MB in the beginning and 95.3MB in the end (delta: -53.3MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2022-02-20 15:22:58,227 INFO L158 Benchmark]: RCFGBuilder took 1667.90ms. Allocated memory is still 125.8MB. Free memory was 95.3MB in the beginning and 89.0MB in the end (delta: 6.3MB). Peak memory consumption was 52.9MB. Max. memory is 16.1GB. [2022-02-20 15:22:58,227 INFO L158 Benchmark]: TraceAbstraction took 6097.08ms. Allocated memory was 125.8MB in the beginning and 182.5MB in the end (delta: 56.6MB). Free memory was 88.1MB in the beginning and 57.7MB in the end (delta: 30.4MB). Peak memory consumption was 86.7MB. Max. memory is 16.1GB. [2022-02-20 15:22:58,228 INFO L158 Benchmark]: Witness Printer took 104.10ms. Allocated memory is still 182.5MB. Free memory was 57.7MB in the beginning and 143.2MB in the end (delta: -85.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 15:22:58,230 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 600.97ms. Allocated memory is still 104.9MB. Free memory was 63.9MB in the beginning and 54.8MB in the end (delta: 9.1MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.42ms. Allocated memory is still 104.9MB. Free memory was 54.8MB in the beginning and 42.1MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 113.45ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 42.1MB in the beginning and 95.3MB in the end (delta: -53.3MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. * RCFGBuilder took 1667.90ms. Allocated memory is still 125.8MB. Free memory was 95.3MB in the beginning and 89.0MB in the end (delta: 6.3MB). Peak memory consumption was 52.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6097.08ms. Allocated memory was 125.8MB in the beginning and 182.5MB in the end (delta: 56.6MB). Free memory was 88.1MB in the beginning and 57.7MB in the end (delta: 30.4MB). Peak memory consumption was 86.7MB. Max. memory is 16.1GB. * Witness Printer took 104.10ms. Allocated memory is still 182.5MB. Free memory was 57.7MB in the beginning and 143.2MB in the end (delta: -85.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 77]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int inputC = 3; [L18] int inputD = 4; [L19] int inputE = 5; [L20] int inputF = 6; [L21] int inputB = 2; [L24] int a1 = 23; [L25] int a19 = 9; [L26] int a10 = 0; [L27] int a12 = 0; [L28] int a4 = 14; VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L589] int output = -1; VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L600] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND TRUE (((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0)) [L265] a1 = (((a1 / 5) + 110755) + 220746) [L266] a10 = 1 [L267] a19 = 8 [L269] return -1; VAL [\old(input)=5, \result=-1, a1=331505, a10=1, a12=0, a19=8, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] RET, EXPR calculate_output(input) [L600] output = calculate_output(input) [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L600] CALL calculate_output(input) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND TRUE (((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)) VAL [\old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L77] reach_error() VAL [\old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 335 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 335 mSDsluCounter, 412 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 224 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1112 IncrementalHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 224 mSolverCounterUnsat, 396 mSDtfsCounter, 1112 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=560occurred in iteration=3, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 298 NumberOfCodeBlocks, 298 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 199 ConstructedInterpolants, 0 QuantifiedInterpolants, 713 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 36/36 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-02-20 15:22:58,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE