./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label42.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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_label42.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 784c482e26cff2a19c87cad1ec135a12168fe327 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-25 20:27:26,103 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 20:27:26,106 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 20:27:26,171 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 20:27:26,172 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 20:27:26,178 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 20:27:26,181 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 20:27:26,188 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 20:27:26,191 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 20:27:26,198 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 20:27:26,200 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 20:27:26,205 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 20:27:26,206 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 20:27:26,210 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 20:27:26,212 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 20:27:26,213 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 20:27:26,214 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 20:27:26,215 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 20:27:26,222 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 20:27:26,224 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 20:27:26,226 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 20:27:26,227 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 20:27:26,229 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 20:27:26,230 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 20:27:26,232 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 20:27:26,233 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 20:27:26,233 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 20:27:26,234 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 20:27:26,235 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 20:27:26,236 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 20:27:26,236 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 20:27:26,237 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 20:27:26,238 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 20:27:26,239 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 20:27:26,244 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 20:27:26,244 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 20:27:26,245 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 20:27:26,245 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 20:27:26,245 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 20:27:26,246 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 20:27:26,247 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 20:27:26,251 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-25 20:27:26,283 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 20:27:26,284 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 20:27:26,290 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 20:27:26,291 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 20:27:26,291 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 20:27:26,291 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 20:27:26,292 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 20:27:26,292 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-25 20:27:26,292 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 20:27:26,292 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 20:27:26,292 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 20:27:26,293 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 20:27:26,293 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 20:27:26,293 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 20:27:26,293 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 20:27:26,294 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 20:27:26,294 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 20:27:26,294 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 20:27:26,294 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 20:27:26,295 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 20:27:26,295 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 20:27:26,295 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 20:27:26,295 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 20:27:26,295 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 20:27:26,296 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 20:27:26,296 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-25 20:27:26,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-25 20:27:26,296 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 20:27:26,297 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 20:27:26,297 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 -> 784c482e26cff2a19c87cad1ec135a12168fe327 [2020-10-25 20:27:26,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 20:27:26,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 20:27:26,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 20:27:26,735 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 20:27:26,736 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 20:27:26,737 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label42.c [2020-10-25 20:27:26,813 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60cda211a/42d95b6c92774f6c97fc4fca9db640be/FLAGc14ac794f [2020-10-25 20:27:27,561 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 20:27:27,564 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label42.c [2020-10-25 20:27:27,606 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60cda211a/42d95b6c92774f6c97fc4fca9db640be/FLAGc14ac794f [2020-10-25 20:27:27,817 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60cda211a/42d95b6c92774f6c97fc4fca9db640be [2020-10-25 20:27:27,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 20:27:27,831 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 20:27:27,835 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 20:27:27,835 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 20:27:27,842 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 20:27:27,844 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 08:27:27" (1/1) ... [2020-10-25 20:27:27,848 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cd4d32a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 08:27:27, skipping insertion in model container [2020-10-25 20:27:27,848 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 08:27:27" (1/1) ... [2020-10-25 20:27:27,857 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 20:27:27,932 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 20:27:28,393 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 20:27:28,409 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 20:27:28,518 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 20:27:28,547 INFO L208 MainTranslator]: Completed translation [2020-10-25 20:27:28,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 08:27:28 WrapperNode [2020-10-25 20:27:28,549 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 20:27:28,550 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 20:27:28,551 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 20:27:28,551 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 20:27:28,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 08:27:28" (1/1) ... [2020-10-25 20:27:28,597 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 08:27:28" (1/1) ... [2020-10-25 20:27:28,705 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 20:27:28,707 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 20:27:28,707 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 20:27:28,708 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 20:27:28,720 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 08:27:28" (1/1) ... [2020-10-25 20:27:28,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 08:27:28" (1/1) ... [2020-10-25 20:27:28,733 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 08:27:28" (1/1) ... [2020-10-25 20:27:28,734 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 08:27:28" (1/1) ... [2020-10-25 20:27:28,783 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 08:27:28" (1/1) ... [2020-10-25 20:27:28,803 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 08:27:28" (1/1) ... [2020-10-25 20:27:28,818 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 08:27:28" (1/1) ... [2020-10-25 20:27:28,837 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 20:27:28,839 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 20:27:28,840 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 20:27:28,840 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 20:27:28,843 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 08:27:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 20:27:28,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-25 20:27:28,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 20:27:28,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 20:27:28,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 20:27:30,493 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 20:27:30,493 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-10-25 20:27:30,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 08:27:30 BoogieIcfgContainer [2020-10-25 20:27:30,496 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 20:27:30,498 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 20:27:30,498 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 20:27:30,502 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 20:27:30,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 08:27:27" (1/3) ... [2020-10-25 20:27:30,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4526aae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 08:27:30, skipping insertion in model container [2020-10-25 20:27:30,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 08:27:28" (2/3) ... [2020-10-25 20:27:30,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4526aae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 08:27:30, skipping insertion in model container [2020-10-25 20:27:30,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 08:27:30" (3/3) ... [2020-10-25 20:27:30,506 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label42.c [2020-10-25 20:27:30,519 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 20:27:30,525 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-25 20:27:30,540 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-25 20:27:30,571 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 20:27:30,572 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 20:27:30,572 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 20:27:30,572 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 20:27:30,572 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 20:27:30,573 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 20:27:30,573 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 20:27:30,573 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 20:27:30,595 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states. [2020-10-25 20:27:30,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-25 20:27:30,602 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 20:27:30,603 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 20:27:30,604 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 20:27:30,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 20:27:30,611 INFO L82 PathProgramCache]: Analyzing trace with hash 156847385, now seen corresponding path program 1 times [2020-10-25 20:27:30,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 20:27:30,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729199706] [2020-10-25 20:27:30,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 20:27:30,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 20:27:30,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 20:27:30,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729199706] [2020-10-25 20:27:30,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 20:27:30,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-25 20:27:30,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270030155] [2020-10-25 20:27:30,879 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 20:27:30,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 20:27:30,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 20:27:30,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 20:27:30,905 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 3 states. [2020-10-25 20:27:32,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 20:27:32,235 INFO L93 Difference]: Finished difference Result 568 states and 982 transitions. [2020-10-25 20:27:32,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 20:27:32,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-10-25 20:27:32,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 20:27:32,278 INFO L225 Difference]: With dead ends: 568 [2020-10-25 20:27:32,278 INFO L226 Difference]: Without dead ends: 282 [2020-10-25 20:27:32,292 INFO L677 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 [2020-10-25 20:27:32,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-10-25 20:27:32,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2020-10-25 20:27:32,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-10-25 20:27:32,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 412 transitions. [2020-10-25 20:27:32,406 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 412 transitions. Word has length 17 [2020-10-25 20:27:32,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 20:27:32,406 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 412 transitions. [2020-10-25 20:27:32,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 20:27:32,407 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 412 transitions. [2020-10-25 20:27:32,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-10-25 20:27:32,412 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 20:27:32,413 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-25 20:27:32,413 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-25 20:27:32,414 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 20:27:32,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 20:27:32,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1760139052, now seen corresponding path program 1 times [2020-10-25 20:27:32,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 20:27:32,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158777573] [2020-10-25 20:27:32,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 20:27:32,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 20:27:32,655 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 20:27:32,655 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158777573] [2020-10-25 20:27:32,655 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 20:27:32,656 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-25 20:27:32,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257412956] [2020-10-25 20:27:32,658 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 20:27:32,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 20:27:32,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 20:27:32,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 20:27:32,659 INFO L87 Difference]: Start difference. First operand 282 states and 412 transitions. Second operand 3 states. [2020-10-25 20:27:33,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 20:27:33,536 INFO L93 Difference]: Finished difference Result 840 states and 1231 transitions. [2020-10-25 20:27:33,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 20:27:33,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2020-10-25 20:27:33,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 20:27:33,541 INFO L225 Difference]: With dead ends: 840 [2020-10-25 20:27:33,542 INFO L226 Difference]: Without dead ends: 560 [2020-10-25 20:27:33,544 INFO L677 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 [2020-10-25 20:27:33,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-10-25 20:27:33,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2020-10-25 20:27:33,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2020-10-25 20:27:33,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 731 transitions. [2020-10-25 20:27:33,591 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 731 transitions. Word has length 87 [2020-10-25 20:27:33,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 20:27:33,592 INFO L481 AbstractCegarLoop]: Abstraction has 560 states and 731 transitions. [2020-10-25 20:27:33,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 20:27:33,592 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 731 transitions. [2020-10-25 20:27:33,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-10-25 20:27:33,601 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 20:27:33,601 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2020-10-25 20:27:33,603 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-25 20:27:33,603 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 20:27:33,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 20:27:33,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1727089248, now seen corresponding path program 1 times [2020-10-25 20:27:33,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 20:27:33,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834450859] [2020-10-25 20:27:33,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 20:27:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 20:27:33,826 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 20:27:33,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834450859] [2020-10-25 20:27:33,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 20:27:33,828 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 20:27:33,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508812651] [2020-10-25 20:27:33,829 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 20:27:33,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 20:27:33,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 20:27:33,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 20:27:33,830 INFO L87 Difference]: Start difference. First operand 560 states and 731 transitions. Second operand 3 states. [2020-10-25 20:27:34,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 20:27:34,732 INFO L93 Difference]: Finished difference Result 1396 states and 1869 transitions. [2020-10-25 20:27:34,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 20:27:34,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2020-10-25 20:27:34,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 20:27:34,739 INFO L225 Difference]: With dead ends: 1396 [2020-10-25 20:27:34,739 INFO L226 Difference]: Without dead ends: 838 [2020-10-25 20:27:34,741 INFO L677 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 [2020-10-25 20:27:34,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2020-10-25 20:27:34,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2020-10-25 20:27:34,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2020-10-25 20:27:34,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1064 transitions. [2020-10-25 20:27:34,791 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1064 transitions. Word has length 92 [2020-10-25 20:27:34,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 20:27:34,791 INFO L481 AbstractCegarLoop]: Abstraction has 838 states and 1064 transitions. [2020-10-25 20:27:34,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 20:27:34,796 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1064 transitions. [2020-10-25 20:27:34,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-10-25 20:27:34,803 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 20:27:34,803 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 20:27:34,804 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-25 20:27:34,804 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 20:27:34,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 20:27:34,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1054526856, now seen corresponding path program 1 times [2020-10-25 20:27:34,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 20:27:34,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704941800] [2020-10-25 20:27:34,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 20:27:34,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 20:27:34,939 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 20:27:34,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704941800] [2020-10-25 20:27:34,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 20:27:34,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-25 20:27:34,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196221418] [2020-10-25 20:27:34,943 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 20:27:34,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 20:27:34,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 20:27:34,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 20:27:34,948 INFO L87 Difference]: Start difference. First operand 838 states and 1064 transitions. Second operand 3 states. [2020-10-25 20:27:35,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 20:27:35,702 INFO L93 Difference]: Finished difference Result 2230 states and 2778 transitions. [2020-10-25 20:27:35,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 20:27:35,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2020-10-25 20:27:35,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 20:27:35,717 INFO L225 Difference]: With dead ends: 2230 [2020-10-25 20:27:35,717 INFO L226 Difference]: Without dead ends: 1394 [2020-10-25 20:27:35,719 INFO L677 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 [2020-10-25 20:27:35,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-10-25 20:27:35,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1394. [2020-10-25 20:27:35,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1394 states. [2020-10-25 20:27:35,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1626 transitions. [2020-10-25 20:27:35,754 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1626 transitions. Word has length 108 [2020-10-25 20:27:35,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 20:27:35,755 INFO L481 AbstractCegarLoop]: Abstraction has 1394 states and 1626 transitions. [2020-10-25 20:27:35,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 20:27:35,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1626 transitions. [2020-10-25 20:27:35,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-10-25 20:27:35,766 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 20:27:35,766 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 20:27:35,767 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-25 20:27:35,768 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 20:27:35,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 20:27:35,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1852833333, now seen corresponding path program 1 times [2020-10-25 20:27:35,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 20:27:35,770 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342917911] [2020-10-25 20:27:35,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 20:27:35,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 20:27:36,013 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 20:27:36,014 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342917911] [2020-10-25 20:27:36,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 20:27:36,014 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-25 20:27:36,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982155899] [2020-10-25 20:27:36,016 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 20:27:36,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 20:27:36,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 20:27:36,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 20:27:36,018 INFO L87 Difference]: Start difference. First operand 1394 states and 1626 transitions. Second operand 3 states. [2020-10-25 20:27:36,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 20:27:36,800 INFO L93 Difference]: Finished difference Result 2925 states and 3399 transitions. [2020-10-25 20:27:36,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 20:27:36,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2020-10-25 20:27:36,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 20:27:36,809 INFO L225 Difference]: With dead ends: 2925 [2020-10-25 20:27:36,809 INFO L226 Difference]: Without dead ends: 1533 [2020-10-25 20:27:36,812 INFO L677 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 [2020-10-25 20:27:36,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2020-10-25 20:27:36,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1533. [2020-10-25 20:27:36,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1533 states. [2020-10-25 20:27:36,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 1770 transitions. [2020-10-25 20:27:36,849 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 1770 transitions. Word has length 109 [2020-10-25 20:27:36,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 20:27:36,850 INFO L481 AbstractCegarLoop]: Abstraction has 1533 states and 1770 transitions. [2020-10-25 20:27:36,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 20:27:36,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 1770 transitions. [2020-10-25 20:27:36,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-10-25 20:27:36,852 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 20:27:36,852 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 20:27:36,853 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-25 20:27:36,853 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 20:27:36,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 20:27:36,853 INFO L82 PathProgramCache]: Analyzing trace with hash 834609386, now seen corresponding path program 1 times [2020-10-25 20:27:36,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 20:27:36,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734826704] [2020-10-25 20:27:36,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 20:27:36,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 20:27:37,096 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 20:27:37,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734826704] [2020-10-25 20:27:37,098 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873720571] [2020-10-25 20:27:37,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 20:27:37,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 20:27:37,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-25 20:27:37,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 20:27:37,359 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-10-25 20:27:37,360 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-25 20:27:37,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2020-10-25 20:27:37,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324696080] [2020-10-25 20:27:37,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 20:27:37,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 20:27:37,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 20:27:37,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-25 20:27:37,364 INFO L87 Difference]: Start difference. First operand 1533 states and 1770 transitions. Second operand 3 states. [2020-10-25 20:27:38,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 20:27:38,288 INFO L93 Difference]: Finished difference Result 2091 states and 2444 transitions. [2020-10-25 20:27:38,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 20:27:38,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2020-10-25 20:27:38,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 20:27:38,303 INFO L225 Difference]: With dead ends: 2091 [2020-10-25 20:27:38,304 INFO L226 Difference]: Without dead ends: 2089 [2020-10-25 20:27:38,305 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-25 20:27:38,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2020-10-25 20:27:38,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 1672. [2020-10-25 20:27:38,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2020-10-25 20:27:38,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1958 transitions. [2020-10-25 20:27:38,361 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1958 transitions. Word has length 147 [2020-10-25 20:27:38,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 20:27:38,362 INFO L481 AbstractCegarLoop]: Abstraction has 1672 states and 1958 transitions. [2020-10-25 20:27:38,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 20:27:38,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1958 transitions. [2020-10-25 20:27:38,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-10-25 20:27:38,366 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 20:27:38,366 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-10-25 20:27:38,586 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-10-25 20:27:38,587 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 20:27:38,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 20:27:38,588 INFO L82 PathProgramCache]: Analyzing trace with hash 643625857, now seen corresponding path program 1 times [2020-10-25 20:27:38,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 20:27:38,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281393695] [2020-10-25 20:27:38,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 20:27:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 20:27:38,783 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 20:27:38,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281393695] [2020-10-25 20:27:38,785 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 20:27:38,785 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 20:27:38,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417953658] [2020-10-25 20:27:38,787 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 20:27:38,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 20:27:38,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 20:27:38,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 20:27:38,789 INFO L87 Difference]: Start difference. First operand 1672 states and 1958 transitions. Second operand 3 states. [2020-10-25 20:27:39,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 20:27:39,568 INFO L93 Difference]: Finished difference Result 3620 states and 4328 transitions. [2020-10-25 20:27:39,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 20:27:39,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2020-10-25 20:27:39,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 20:27:39,582 INFO L225 Difference]: With dead ends: 3620 [2020-10-25 20:27:39,582 INFO L226 Difference]: Without dead ends: 2089 [2020-10-25 20:27:39,586 INFO L677 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 [2020-10-25 20:27:39,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2020-10-25 20:27:39,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 1672. [2020-10-25 20:27:39,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2020-10-25 20:27:39,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1948 transitions. [2020-10-25 20:27:39,639 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1948 transitions. Word has length 177 [2020-10-25 20:27:39,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 20:27:39,640 INFO L481 AbstractCegarLoop]: Abstraction has 1672 states and 1948 transitions. [2020-10-25 20:27:39,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 20:27:39,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1948 transitions. [2020-10-25 20:27:39,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2020-10-25 20:27:39,645 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 20:27:39,645 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-10-25 20:27:39,645 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-25 20:27:39,646 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 20:27:39,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 20:27:39,646 INFO L82 PathProgramCache]: Analyzing trace with hash -339131996, now seen corresponding path program 1 times [2020-10-25 20:27:39,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 20:27:39,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254615926] [2020-10-25 20:27:39,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 20:27:39,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 20:27:39,739 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 20:27:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 20:27:39,841 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 20:27:39,923 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-25 20:27:39,924 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-25 20:27:39,924 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-25 20:27:40,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 08:27:40 BoogieIcfgContainer [2020-10-25 20:27:40,124 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 20:27:40,125 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 20:27:40,125 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 20:27:40,125 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 20:27:40,126 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 08:27:30" (3/4) ... [2020-10-25 20:27:40,128 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-25 20:27:40,312 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-25 20:27:40,312 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 20:27:40,315 INFO L168 Benchmark]: Toolchain (without parser) took 12489.59 ms. Allocated memory was 44.0 MB in the beginning and 184.5 MB in the end (delta: 140.5 MB). Free memory was 28.5 MB in the beginning and 61.1 MB in the end (delta: -32.6 MB). Peak memory consumption was 106.7 MB. Max. memory is 16.1 GB. [2020-10-25 20:27:40,315 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 35.7 MB. Free memory was 22.1 MB in the beginning and 22.1 MB in the end (delta: 21.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 20:27:40,316 INFO L168 Benchmark]: CACSL2BoogieTranslator took 714.44 ms. Allocated memory is still 44.0 MB. Free memory was 27.9 MB in the beginning and 19.7 MB in the end (delta: 8.2 MB). Peak memory consumption was 12.9 MB. Max. memory is 16.1 GB. [2020-10-25 20:27:40,317 INFO L168 Benchmark]: Boogie Procedure Inliner took 154.64 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 19.7 MB in the beginning and 31.8 MB in the end (delta: -12.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 16.1 GB. [2020-10-25 20:27:40,317 INFO L168 Benchmark]: Boogie Preprocessor took 130.90 ms. Allocated memory is still 54.5 MB. Free memory was 31.8 MB in the beginning and 26.6 MB in the end (delta: 5.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-25 20:27:40,318 INFO L168 Benchmark]: RCFGBuilder took 1657.49 ms. Allocated memory was 54.5 MB in the beginning and 69.2 MB in the end (delta: 14.7 MB). Free memory was 26.6 MB in the beginning and 38.7 MB in the end (delta: -12.1 MB). Peak memory consumption was 16.3 MB. Max. memory is 16.1 GB. [2020-10-25 20:27:40,318 INFO L168 Benchmark]: TraceAbstraction took 9626.54 ms. Allocated memory was 69.2 MB in the beginning and 184.5 MB in the end (delta: 115.3 MB). Free memory was 38.4 MB in the beginning and 85.2 MB in the end (delta: -46.9 MB). Peak memory consumption was 68.2 MB. Max. memory is 16.1 GB. [2020-10-25 20:27:40,319 INFO L168 Benchmark]: Witness Printer took 187.72 ms. Allocated memory is still 184.5 MB. Free memory was 85.2 MB in the beginning and 61.1 MB in the end (delta: 24.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2020-10-25 20:27:40,321 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 35.7 MB. Free memory was 22.1 MB in the beginning and 22.1 MB in the end (delta: 21.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 714.44 ms. Allocated memory is still 44.0 MB. Free memory was 27.9 MB in the beginning and 19.7 MB in the end (delta: 8.2 MB). Peak memory consumption was 12.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 154.64 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 19.7 MB in the beginning and 31.8 MB in the end (delta: -12.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 130.90 ms. Allocated memory is still 54.5 MB. Free memory was 31.8 MB in the beginning and 26.6 MB in the end (delta: 5.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1657.49 ms. Allocated memory was 54.5 MB in the beginning and 69.2 MB in the end (delta: 14.7 MB). Free memory was 26.6 MB in the beginning and 38.7 MB in the end (delta: -12.1 MB). Peak memory consumption was 16.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 9626.54 ms. Allocated memory was 69.2 MB in the beginning and 184.5 MB in the end (delta: 115.3 MB). Free memory was 38.4 MB in the beginning and 85.2 MB in the end (delta: -46.9 MB). Peak memory consumption was 68.2 MB. Max. memory is 16.1 GB. * Witness Printer took 187.72 ms. Allocated memory is still 184.5 MB. Free memory was 85.2 MB in the beginning and 61.1 MB in the end (delta: 24.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L9] int inputC = 3; [L10] int inputD = 4; [L11] int inputE = 5; [L12] int inputF = 6; [L13] int inputB = 2; [L16] int a1 = 23; [L17] int a19 = 9; [L18] int a10 = 0; [L19] int a12 = 0; [L20] int a4 = 14; VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L581] int output = -1; VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L584] COND TRUE 1 [L587] int input; [L588] input = __VERIFIER_nondet_int() [L589] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L23] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L26] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L29] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L32] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L35] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L62] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L65] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L68] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L71] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L74] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L77] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L80] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L83] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L86] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L89] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L92] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L95] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L98] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L101] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L104] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L107] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L110] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L113] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L116] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L119] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L122] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L125] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L128] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L131] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L134] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L137] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L140] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L143] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L146] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L149] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L152] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L155] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L158] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L161] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L164] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L167] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L170] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L173] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L176] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L179] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L182] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L185] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L188] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L191] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L194] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L197] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L200] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L203] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L207] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L212] COND TRUE ((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0))) [L213] a1 = (((a1 + -15535) - 211896) / 5) [L214] a10 = 2 [L216] return 22; VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L592] output = calculate_output(input) [L584] COND TRUE 1 [L587] int input; [L588] input = __VERIFIER_nondet_int() [L589] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L23] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L26] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L29] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L32] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L35] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L62] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L65] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L68] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L71] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L74] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L77] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L80] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L83] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L86] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L89] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L92] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L95] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L98] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L101] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L104] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L107] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L110] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L113] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L116] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L119] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L122] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L125] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L128] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L131] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L134] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L137] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L140] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L143] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L146] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L149] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L152] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L155] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L158] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L161] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L164] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L167] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L170] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L173] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L176] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L179] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L182] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L185] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L188] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L191] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L194] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L197] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L200] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L203] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L207] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L212] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L217] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L222] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] 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 [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L238] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L256] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L262] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L267] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L273] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L279] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L288] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L293] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L298] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L303] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L308] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L314] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L319] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L322] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L325] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L328] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L331] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L337] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L342] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L347] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L353] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L356] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L359] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L362] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L367] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L372] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L377] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L380] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L385] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L390] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L395] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L400] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L405] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) VAL [a1=-45481, a10=2, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L410] COND TRUE ((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2)))) [L411] a1 = ((((a1 % 299890)+ 300108) * 1) * 1) [L412] a10 = 0 [L413] a19 = 8 [L415] return -1; VAL [a1=254627, a10=0, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L592] output = calculate_output(input) [L584] COND TRUE 1 [L587] int input; [L588] input = __VERIFIER_nondet_int() [L589] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L23] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=254627, a10=0, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L26] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=254627, a10=0, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L29] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=254627, a10=0, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L32] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=254627, a10=0, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L35] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=254627, a10=0, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=254627, a10=0, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=254627, a10=0, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=254627, a10=0, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=254627, a10=0, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=254627, a10=0, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=254627, a10=0, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND TRUE (((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)) VAL [a1=254627, a10=0, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L4] __assert_fail("0", "Problem10_label42.c", 4, "reach_error") VAL [a1=254627, a10=0, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 207 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.3s, OverallIterations: 8, TraceHistogramMax: 3, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 659 SDtfs, 604 SDslu, 31 SDs, 0 SdLazy, 2574 SolverSat, 437 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1672occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 834 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1075 NumberOfCodeBlocks, 1075 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 876 ConstructedInterpolants, 0 QuantifiedInterpolants, 428276 SizeOfPredicates, 1 NumberOfNonLiveVariables, 237 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 164/178 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! Received shutdown request...