./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label46.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_label46.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 496456cc96c293c6493a50b0bede6c5345c5a0c5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:28,507 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 20:27:28,512 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 20:27:28,580 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 20:27:28,581 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 20:27:28,588 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 20:27:28,591 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 20:27:28,600 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 20:27:28,608 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 20:27:28,611 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 20:27:28,613 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 20:27:28,614 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 20:27:28,615 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 20:27:28,624 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 20:27:28,626 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 20:27:28,629 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 20:27:28,631 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 20:27:28,637 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 20:27:28,639 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 20:27:28,646 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 20:27:28,653 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 20:27:28,655 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 20:27:28,656 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 20:27:28,657 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 20:27:28,660 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 20:27:28,661 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 20:27:28,661 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 20:27:28,662 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 20:27:28,663 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 20:27:28,664 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 20:27:28,665 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 20:27:28,666 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 20:27:28,667 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 20:27:28,668 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 20:27:28,669 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 20:27:28,669 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 20:27:28,670 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 20:27:28,670 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 20:27:28,671 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 20:27:28,672 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 20:27:28,673 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 20:27:28,674 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:28,704 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 20:27:28,704 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 20:27:28,707 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 20:27:28,707 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 20:27:28,708 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 20:27:28,708 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 20:27:28,708 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 20:27:28,708 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-25 20:27:28,709 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 20:27:28,709 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 20:27:28,709 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 20:27:28,709 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 20:27:28,709 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 20:27:28,709 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 20:27:28,710 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 20:27:28,710 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 20:27:28,710 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 20:27:28,710 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 20:27:28,710 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 20:27:28,711 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 20:27:28,711 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 20:27:28,711 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 20:27:28,711 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 20:27:28,712 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 20:27:28,712 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 20:27:28,712 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-25 20:27:28,712 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-25 20:27:28,712 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 20:27:28,713 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 20:27:28,713 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 -> 496456cc96c293c6493a50b0bede6c5345c5a0c5 [2020-10-25 20:27:29,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 20:27:29,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 20:27:29,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 20:27:29,147 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 20:27:29,148 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 20:27:29,149 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label46.c [2020-10-25 20:27:29,254 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5d1a6e6c/cb84dc6f33414df290f0a1c756af420e/FLAG5af721527 [2020-10-25 20:27:30,098 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 20:27:30,099 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label46.c [2020-10-25 20:27:30,156 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5d1a6e6c/cb84dc6f33414df290f0a1c756af420e/FLAG5af721527 [2020-10-25 20:27:30,321 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5d1a6e6c/cb84dc6f33414df290f0a1c756af420e [2020-10-25 20:27:30,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 20:27:30,333 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 20:27:30,335 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 20:27:30,335 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 20:27:30,342 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 20:27:30,343 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 08:27:30" (1/1) ... [2020-10-25 20:27:30,347 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@103e149e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 08:27:30, skipping insertion in model container [2020-10-25 20:27:30,347 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 08:27:30" (1/1) ... [2020-10-25 20:27:30,357 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 20:27:30,437 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 20:27:30,882 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 20:27:30,893 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 20:27:31,047 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 20:27:31,078 INFO L208 MainTranslator]: Completed translation [2020-10-25 20:27:31,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 08:27:31 WrapperNode [2020-10-25 20:27:31,079 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 20:27:31,081 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 20:27:31,081 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 20:27:31,081 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 20:27:31,090 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:31" (1/1) ... [2020-10-25 20:27:31,133 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:31" (1/1) ... [2020-10-25 20:27:31,231 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 20:27:31,233 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 20:27:31,234 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 20:27:31,235 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 20:27:31,245 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:31" (1/1) ... [2020-10-25 20:27:31,245 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:31" (1/1) ... [2020-10-25 20:27:31,258 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:31" (1/1) ... [2020-10-25 20:27:31,258 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:31" (1/1) ... [2020-10-25 20:27:31,290 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:31" (1/1) ... [2020-10-25 20:27:31,301 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:31" (1/1) ... [2020-10-25 20:27:31,315 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:31" (1/1) ... [2020-10-25 20:27:31,342 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 20:27:31,346 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 20:27:31,346 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 20:27:31,346 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 20:27:31,347 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 08:27:31" (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:31,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-25 20:27:31,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 20:27:31,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 20:27:31,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 20:27:33,043 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 20:27:33,044 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-10-25 20:27:33,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 08:27:33 BoogieIcfgContainer [2020-10-25 20:27:33,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 20:27:33,051 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 20:27:33,053 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 20:27:33,057 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 20:27:33,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 08:27:30" (1/3) ... [2020-10-25 20:27:33,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@282bea2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 08:27:33, skipping insertion in model container [2020-10-25 20:27:33,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 08:27:31" (2/3) ... [2020-10-25 20:27:33,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@282bea2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 08:27:33, skipping insertion in model container [2020-10-25 20:27:33,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 08:27:33" (3/3) ... [2020-10-25 20:27:33,061 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label46.c [2020-10-25 20:27:33,075 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 20:27:33,082 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-25 20:27:33,097 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-25 20:27:33,133 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 20:27:33,134 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 20:27:33,134 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 20:27:33,134 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 20:27:33,134 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 20:27:33,134 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 20:27:33,134 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 20:27:33,134 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 20:27:33,157 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states. [2020-10-25 20:27:33,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-25 20:27:33,163 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 20:27:33,164 INFO L422 BasicCegarLoop]: trace histogram [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,165 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 20:27:33,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 20:27:33,172 INFO L82 PathProgramCache]: Analyzing trace with hash -85512855, now seen corresponding path program 1 times [2020-10-25 20:27:33,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 20:27:33,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891564447] [2020-10-25 20:27:33,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 20:27:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 20:27:33,436 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:33,437 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891564447] [2020-10-25 20:27:33,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 20:27:33,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-25 20:27:33,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042479057] [2020-10-25 20:27:33,444 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 20:27:33,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 20:27:33,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 20:27:33,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 20:27:33,464 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 3 states. [2020-10-25 20:27:34,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 20:27:34,645 INFO L93 Difference]: Finished difference Result 553 states and 967 transitions. [2020-10-25 20:27:34,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 20:27:34,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-10-25 20:27:34,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 20:27:34,663 INFO L225 Difference]: With dead ends: 553 [2020-10-25 20:27:34,664 INFO L226 Difference]: Without dead ends: 282 [2020-10-25 20:27:34,669 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:34,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-10-25 20:27:34,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2020-10-25 20:27:34,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-10-25 20:27:34,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 377 transitions. [2020-10-25 20:27:34,736 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 377 transitions. Word has length 21 [2020-10-25 20:27:34,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 20:27:34,737 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 377 transitions. [2020-10-25 20:27:34,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 20:27:34,738 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 377 transitions. [2020-10-25 20:27:34,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-10-25 20:27:34,742 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 20:27:34,742 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 20:27:34,743 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-25 20:27:34,743 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 20:27:34,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 20:27:34,744 INFO L82 PathProgramCache]: Analyzing trace with hash 497315674, now seen corresponding path program 1 times [2020-10-25 20:27:34,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 20:27:34,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619231102] [2020-10-25 20:27:34,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 20:27:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 20:27:34,975 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 20:27:34,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619231102] [2020-10-25 20:27:34,976 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 20:27:34,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 20:27:34,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815564557] [2020-10-25 20:27:34,979 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 20:27:34,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 20:27:34,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 20:27:34,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 20:27:34,981 INFO L87 Difference]: Start difference. First operand 282 states and 377 transitions. Second operand 3 states. [2020-10-25 20:27:37,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 20:27:37,955 INFO L93 Difference]: Finished difference Result 701 states and 967 transitions. [2020-10-25 20:27:37,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 20:27:37,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2020-10-25 20:27:37,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 20:27:37,960 INFO L225 Difference]: With dead ends: 701 [2020-10-25 20:27:37,960 INFO L226 Difference]: Without dead ends: 421 [2020-10-25 20:27:37,963 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:37,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2020-10-25 20:27:37,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2020-10-25 20:27:37,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2020-10-25 20:27:37,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 526 transitions. [2020-10-25 20:27:38,000 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 526 transitions. Word has length 87 [2020-10-25 20:27:38,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 20:27:38,001 INFO L481 AbstractCegarLoop]: Abstraction has 421 states and 526 transitions. [2020-10-25 20:27:38,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 20:27:38,001 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 526 transitions. [2020-10-25 20:27:38,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-10-25 20:27:38,005 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 20:27:38,005 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 20:27:38,006 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-25 20:27:38,006 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 20:27:38,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 20:27:38,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1582417931, now seen corresponding path program 1 times [2020-10-25 20:27:38,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 20:27:38,008 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585201637] [2020-10-25 20:27:38,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 20:27:38,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 20:27:38,203 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 20:27:38,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585201637] [2020-10-25 20:27:38,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 20:27:38,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-25 20:27:38,205 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489140355] [2020-10-25 20:27:38,205 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 20:27:38,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 20:27:38,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 20:27:38,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 20:27:38,207 INFO L87 Difference]: Start difference. First operand 421 states and 526 transitions. Second operand 3 states. [2020-10-25 20:27:39,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 20:27:39,234 INFO L93 Difference]: Finished difference Result 979 states and 1209 transitions. [2020-10-25 20:27:39,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 20:27:39,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2020-10-25 20:27:39,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 20:27:39,242 INFO L225 Difference]: With dead ends: 979 [2020-10-25 20:27:39,242 INFO L226 Difference]: Without dead ends: 560 [2020-10-25 20:27:39,246 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:39,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-10-25 20:27:39,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2020-10-25 20:27:39,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2020-10-25 20:27:39,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 675 transitions. [2020-10-25 20:27:39,298 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 675 transitions. Word has length 94 [2020-10-25 20:27:39,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 20:27:39,299 INFO L481 AbstractCegarLoop]: Abstraction has 560 states and 675 transitions. [2020-10-25 20:27:39,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 20:27:39,299 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 675 transitions. [2020-10-25 20:27:39,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-10-25 20:27:39,303 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 20:27:39,303 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 20:27:39,303 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-25 20:27:39,304 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 20:27:39,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 20:27:39,305 INFO L82 PathProgramCache]: Analyzing trace with hash 173826032, now seen corresponding path program 1 times [2020-10-25 20:27:39,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 20:27:39,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475845640] [2020-10-25 20:27:39,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 20:27:39,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 20:27:39,357 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 20:27:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 20:27:39,394 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 20:27:39,440 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-25 20:27:39,440 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-25 20:27:39,440 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-25 20:27:39,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 08:27:39 BoogieIcfgContainer [2020-10-25 20:27:39,567 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 20:27:39,568 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 20:27:39,568 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 20:27:39,568 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 20:27:39,569 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:33" (3/4) ... [2020-10-25 20:27:39,571 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-25 20:27:39,740 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-25 20:27:39,740 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 20:27:39,743 INFO L168 Benchmark]: Toolchain (without parser) took 9414.92 ms. Allocated memory was 54.5 MB in the beginning and 119.5 MB in the end (delta: 65.0 MB). Free memory was 38.3 MB in the beginning and 56.5 MB in the end (delta: -18.2 MB). Peak memory consumption was 45.8 MB. Max. memory is 16.1 GB. [2020-10-25 20:27:39,743 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 44.0 MB. Free memory was 22.1 MB in the beginning and 22.0 MB in the end (delta: 32.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 20:27:39,744 INFO L168 Benchmark]: CACSL2BoogieTranslator took 745.08 ms. Allocated memory is still 54.5 MB. Free memory was 37.7 MB in the beginning and 24.5 MB in the end (delta: 13.2 MB). Peak memory consumption was 15.9 MB. Max. memory is 16.1 GB. [2020-10-25 20:27:39,744 INFO L168 Benchmark]: Boogie Procedure Inliner took 150.76 ms. Allocated memory is still 54.5 MB. Free memory was 24.5 MB in the beginning and 30.2 MB in the end (delta: -5.7 MB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. [2020-10-25 20:27:39,745 INFO L168 Benchmark]: Boogie Preprocessor took 109.24 ms. Allocated memory is still 54.5 MB. Free memory was 30.2 MB in the beginning and 24.9 MB in the end (delta: 5.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-25 20:27:39,745 INFO L168 Benchmark]: RCFGBuilder took 1702.53 ms. Allocated memory was 54.5 MB in the beginning and 81.8 MB in the end (delta: 27.3 MB). Free memory was 24.9 MB in the beginning and 43.2 MB in the end (delta: -18.4 MB). Peak memory consumption was 15.0 MB. Max. memory is 16.1 GB. [2020-10-25 20:27:39,746 INFO L168 Benchmark]: TraceAbstraction took 6515.58 ms. Allocated memory was 81.8 MB in the beginning and 119.5 MB in the end (delta: 37.7 MB). Free memory was 42.5 MB in the beginning and 69.1 MB in the end (delta: -26.6 MB). Peak memory consumption was 9.5 MB. Max. memory is 16.1 GB. [2020-10-25 20:27:39,746 INFO L168 Benchmark]: Witness Printer took 172.80 ms. Allocated memory is still 119.5 MB. Free memory was 69.1 MB in the beginning and 56.5 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-10-25 20:27:39,749 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.22 ms. Allocated memory is still 44.0 MB. Free memory was 22.1 MB in the beginning and 22.0 MB in the end (delta: 32.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 745.08 ms. Allocated memory is still 54.5 MB. Free memory was 37.7 MB in the beginning and 24.5 MB in the end (delta: 13.2 MB). Peak memory consumption was 15.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 150.76 ms. Allocated memory is still 54.5 MB. Free memory was 24.5 MB in the beginning and 30.2 MB in the end (delta: -5.7 MB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 109.24 ms. Allocated memory is still 54.5 MB. Free memory was 30.2 MB in the beginning and 24.9 MB in the end (delta: 5.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1702.53 ms. Allocated memory was 54.5 MB in the beginning and 81.8 MB in the end (delta: 27.3 MB). Free memory was 24.9 MB in the beginning and 43.2 MB in the end (delta: -18.4 MB). Peak memory consumption was 15.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 6515.58 ms. Allocated memory was 81.8 MB in the beginning and 119.5 MB in the end (delta: 37.7 MB). Free memory was 42.5 MB in the beginning and 69.1 MB in the end (delta: -26.6 MB). Peak memory consumption was 9.5 MB. Max. memory is 16.1 GB. * Witness Printer took 172.80 ms. Allocated memory is still 119.5 MB. Free memory was 69.1 MB in the beginning and 56.5 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 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 FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [a1=23, a10=0, 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=23, a10=0, 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=23, a10=0, 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=23, a10=0, 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=23, a10=0, 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=23, a10=0, 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=23, a10=0, 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=23, a10=0, 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=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L256] COND TRUE (((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0)) [L257] a1 = (((a1 / 5) + 110755) + 220746) [L258] a10 = 1 [L259] a19 = 8 [L261] return -1; VAL [a1=331505, a10=1, 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=331505, a10=1, 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=331505, a10=1, 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=331505, a10=1, 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=331505, a10=1, 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=331505, a10=1, 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=331505, a10=1, 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=331505, a10=1, 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=331505, a10=1, 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=331505, a10=1, 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=331505, a10=1, 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=331505, a10=1, a12=0, a19=8, 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=331505, a10=1, a12=0, a19=8, 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=331505, a10=1, a12=0, a19=8, 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=331505, a10=1, a12=0, a19=8, 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=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L68] COND TRUE (((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)) VAL [a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L4] __assert_fail("0", "Problem10_label46.c", 4, "reach_error") VAL [a1=331505, a10=1, 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: 6.3s, OverallIterations: 4, TraceHistogramMax: 2, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 396 SDtfs, 335 SDslu, 16 SDs, 0 SdLazy, 1111 SolverSat, 224 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=560occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 298 NumberOfCodeBlocks, 298 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 199 ConstructedInterpolants, 0 QuantifiedInterpolants, 61207 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 36/36 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...