./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 a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_51523d00-0837-4b2b-91b0-c1c98e6e0af2/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_51523d00-0837-4b2b-91b0-c1c98e6e0af2/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_51523d00-0837-4b2b-91b0-c1c98e6e0af2/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_51523d00-0837-4b2b-91b0-c1c98e6e0af2/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label46.c -s /tmp/vcloud-vcloud-master/worker/run_dir_51523d00-0837-4b2b-91b0-c1c98e6e0af2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_51523d00-0837-4b2b-91b0-c1c98e6e0af2/bin/uautomizer --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 c6f6561f4b0a79bdec08c2e8bb87c04c8a7e3de7 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-a4ecdab [2020-11-30 01:26:55,085 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 01:26:55,088 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 01:26:55,156 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 01:26:55,156 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 01:26:55,158 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 01:26:55,161 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 01:26:55,164 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 01:26:55,173 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 01:26:55,180 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 01:26:55,189 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 01:26:55,194 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 01:26:55,195 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 01:26:55,198 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 01:26:55,201 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 01:26:55,204 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 01:26:55,207 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 01:26:55,209 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 01:26:55,217 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 01:26:55,220 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 01:26:55,222 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 01:26:55,227 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 01:26:55,230 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 01:26:55,231 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 01:26:55,244 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 01:26:55,250 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 01:26:55,251 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 01:26:55,252 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 01:26:55,254 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 01:26:55,256 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 01:26:55,257 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 01:26:55,258 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 01:26:55,261 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 01:26:55,262 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 01:26:55,264 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 01:26:55,264 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 01:26:55,265 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 01:26:55,266 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 01:26:55,266 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 01:26:55,267 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 01:26:55,268 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 01:26:55,272 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_51523d00-0837-4b2b-91b0-c1c98e6e0af2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-30 01:26:55,323 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 01:26:55,323 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 01:26:55,326 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 01:26:55,326 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 01:26:55,327 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 01:26:55,327 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 01:26:55,327 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 01:26:55,328 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 01:26:55,328 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 01:26:55,328 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 01:26:55,329 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 01:26:55,330 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 01:26:55,330 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 01:26:55,330 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 01:26:55,331 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 01:26:55,331 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 01:26:55,331 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 01:26:55,332 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 01:26:55,332 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 01:26:55,332 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 01:26:55,332 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 01:26:55,333 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 01:26:55,333 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 01:26:55,333 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 01:26:55,334 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 01:26:55,334 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 01:26:55,334 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 01:26:55,334 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 01:26:55,335 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 01:26:55,335 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:/tmp/vcloud-vcloud-master/worker/run_dir_51523d00-0837-4b2b-91b0-c1c98e6e0af2/bin/uautomizer/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 -> /tmp/vcloud-vcloud-master/worker/run_dir_51523d00-0837-4b2b-91b0-c1c98e6e0af2/bin/uautomizer 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 -> c6f6561f4b0a79bdec08c2e8bb87c04c8a7e3de7 [2020-11-30 01:26:55,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 01:26:55,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 01:26:55,682 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 01:26:55,685 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 01:26:55,686 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 01:26:55,688 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_51523d00-0837-4b2b-91b0-c1c98e6e0af2/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem10_label46.c [2020-11-30 01:26:55,805 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_51523d00-0837-4b2b-91b0-c1c98e6e0af2/bin/uautomizer/data/e1da9abe1/b824a1ac67194e2f82ac1c0d17017955/FLAGb95416554 [2020-11-30 01:26:56,624 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 01:26:56,625 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_51523d00-0837-4b2b-91b0-c1c98e6e0af2/sv-benchmarks/c/eca-rers2012/Problem10_label46.c [2020-11-30 01:26:56,658 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_51523d00-0837-4b2b-91b0-c1c98e6e0af2/bin/uautomizer/data/e1da9abe1/b824a1ac67194e2f82ac1c0d17017955/FLAGb95416554 [2020-11-30 01:26:56,858 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_51523d00-0837-4b2b-91b0-c1c98e6e0af2/bin/uautomizer/data/e1da9abe1/b824a1ac67194e2f82ac1c0d17017955 [2020-11-30 01:26:56,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 01:26:56,871 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 01:26:56,889 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 01:26:56,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 01:26:56,893 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 01:26:56,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:26:56" (1/1) ... [2020-11-30 01:26:56,896 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21a4f3f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:26:56, skipping insertion in model container [2020-11-30 01:26:56,897 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:26:56" (1/1) ... [2020-11-30 01:26:56,906 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 01:26:56,982 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 01:26:57,620 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:26:57,633 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 01:26:57,823 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:26:57,853 INFO L208 MainTranslator]: Completed translation [2020-11-30 01:26:57,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:26:57 WrapperNode [2020-11-30 01:26:57,854 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 01:26:57,856 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 01:26:57,856 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 01:26:57,856 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 01:26:57,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:26:57" (1/1) ... [2020-11-30 01:26:57,892 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:26:57" (1/1) ... [2020-11-30 01:26:57,973 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 01:26:57,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 01:26:57,976 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 01:26:57,976 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 01:26:57,987 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:26:57" (1/1) ... [2020-11-30 01:26:57,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:26:57" (1/1) ... [2020-11-30 01:26:58,009 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:26:57" (1/1) ... [2020-11-30 01:26:58,015 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:26:57" (1/1) ... [2020-11-30 01:26:58,057 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:26:57" (1/1) ... [2020-11-30 01:26:58,078 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:26:57" (1/1) ... [2020-11-30 01:26:58,101 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:26:57" (1/1) ... [2020-11-30 01:26:58,111 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 01:26:58,125 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 01:26:58,125 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 01:26:58,125 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 01:26:58,127 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:26:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_51523d00-0837-4b2b-91b0-c1c98e6e0af2/bin/uautomizer/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-11-30 01:26:58,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 01:26:58,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 01:26:58,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 01:26:58,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 01:27:00,231 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 01:27:00,231 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-11-30 01:27:00,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:27:00 BoogieIcfgContainer [2020-11-30 01:27:00,236 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 01:27:00,239 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 01:27:00,240 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 01:27:00,248 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 01:27:00,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 01:26:56" (1/3) ... [2020-11-30 01:27:00,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3878ae9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:27:00, skipping insertion in model container [2020-11-30 01:27:00,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:26:57" (2/3) ... [2020-11-30 01:27:00,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3878ae9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:27:00, skipping insertion in model container [2020-11-30 01:27:00,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:27:00" (3/3) ... [2020-11-30 01:27:00,253 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label46.c [2020-11-30 01:27:00,268 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 01:27:00,274 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-30 01:27:00,289 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-30 01:27:00,340 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 01:27:00,340 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 01:27:00,340 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 01:27:00,341 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 01:27:00,341 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 01:27:00,341 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 01:27:00,341 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 01:27:00,341 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 01:27:00,371 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states. [2020-11-30 01:27:00,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-30 01:27:00,382 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:00,383 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-11-30 01:27:00,383 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:27:00,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:00,392 INFO L82 PathProgramCache]: Analyzing trace with hash -85512855, now seen corresponding path program 1 times [2020-11-30 01:27:00,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:00,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019585434] [2020-11-30 01:27:00,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:00,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:00,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019585434] [2020-11-30 01:27:00,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:27:00,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:27:00,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804516276] [2020-11-30 01:27:00,767 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:27:00,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:00,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:27:00,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:27:00,790 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 3 states. [2020-11-30 01:27:02,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:02,176 INFO L93 Difference]: Finished difference Result 553 states and 967 transitions. [2020-11-30 01:27:02,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:27:02,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-11-30 01:27:02,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:02,202 INFO L225 Difference]: With dead ends: 553 [2020-11-30 01:27:02,203 INFO L226 Difference]: Without dead ends: 282 [2020-11-30 01:27:02,207 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-11-30 01:27:02,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-11-30 01:27:02,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2020-11-30 01:27:02,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-11-30 01:27:02,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 377 transitions. [2020-11-30 01:27:02,287 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 377 transitions. Word has length 21 [2020-11-30 01:27:02,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:02,288 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 377 transitions. [2020-11-30 01:27:02,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:27:02,288 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 377 transitions. [2020-11-30 01:27:02,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-11-30 01:27:02,292 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:02,293 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-11-30 01:27:02,293 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 01:27:02,293 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:27:02,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:02,294 INFO L82 PathProgramCache]: Analyzing trace with hash 497315674, now seen corresponding path program 1 times [2020-11-30 01:27:02,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:02,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134561466] [2020-11-30 01:27:02,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:02,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:02,569 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:02,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134561466] [2020-11-30 01:27:02,570 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:27:02,570 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:27:02,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277118472] [2020-11-30 01:27:02,572 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:27:02,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:02,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:27:02,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:27:02,574 INFO L87 Difference]: Start difference. First operand 282 states and 377 transitions. Second operand 3 states. [2020-11-30 01:27:05,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:05,946 INFO L93 Difference]: Finished difference Result 701 states and 967 transitions. [2020-11-30 01:27:05,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:27:05,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2020-11-30 01:27:05,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:05,954 INFO L225 Difference]: With dead ends: 701 [2020-11-30 01:27:05,955 INFO L226 Difference]: Without dead ends: 421 [2020-11-30 01:27:05,965 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-11-30 01:27:05,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2020-11-30 01:27:06,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2020-11-30 01:27:06,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2020-11-30 01:27:06,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 526 transitions. [2020-11-30 01:27:06,018 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 526 transitions. Word has length 87 [2020-11-30 01:27:06,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:06,020 INFO L481 AbstractCegarLoop]: Abstraction has 421 states and 526 transitions. [2020-11-30 01:27:06,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:27:06,020 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 526 transitions. [2020-11-30 01:27:06,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-11-30 01:27:06,025 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:06,026 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-11-30 01:27:06,026 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 01:27:06,026 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:27:06,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:06,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1582417931, now seen corresponding path program 1 times [2020-11-30 01:27:06,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:06,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750720323] [2020-11-30 01:27:06,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:06,271 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:06,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750720323] [2020-11-30 01:27:06,272 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:27:06,272 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:27:06,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056423320] [2020-11-30 01:27:06,273 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:27:06,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:06,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:27:06,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:27:06,281 INFO L87 Difference]: Start difference. First operand 421 states and 526 transitions. Second operand 3 states. [2020-11-30 01:27:07,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:07,293 INFO L93 Difference]: Finished difference Result 979 states and 1209 transitions. [2020-11-30 01:27:07,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:27:07,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2020-11-30 01:27:07,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:07,299 INFO L225 Difference]: With dead ends: 979 [2020-11-30 01:27:07,299 INFO L226 Difference]: Without dead ends: 560 [2020-11-30 01:27:07,301 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-11-30 01:27:07,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-11-30 01:27:07,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2020-11-30 01:27:07,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2020-11-30 01:27:07,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 675 transitions. [2020-11-30 01:27:07,376 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 675 transitions. Word has length 94 [2020-11-30 01:27:07,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:07,377 INFO L481 AbstractCegarLoop]: Abstraction has 560 states and 675 transitions. [2020-11-30 01:27:07,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:27:07,377 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 675 transitions. [2020-11-30 01:27:07,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-11-30 01:27:07,379 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:07,379 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-11-30 01:27:07,380 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 01:27:07,380 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:27:07,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:07,381 INFO L82 PathProgramCache]: Analyzing trace with hash 173826032, now seen corresponding path program 1 times [2020-11-30 01:27:07,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:07,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232043250] [2020-11-30 01:27:07,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:07,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:27:07,452 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:27:07,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:27:07,533 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:27:07,593 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:27:07,593 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 01:27:07,594 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 01:27:07,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 01:27:07 BoogieIcfgContainer [2020-11-30 01:27:07,778 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 01:27:07,779 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 01:27:07,779 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 01:27:07,779 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 01:27:07,780 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:27:00" (3/4) ... [2020-11-30 01:27:07,782 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-30 01:27:07,902 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_51523d00-0837-4b2b-91b0-c1c98e6e0af2/bin/uautomizer/witness.graphml [2020-11-30 01:27:07,902 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 01:27:07,909 INFO L168 Benchmark]: Toolchain (without parser) took 11032.43 ms. Allocated memory was 102.8 MB in the beginning and 155.2 MB in the end (delta: 52.4 MB). Free memory was 68.8 MB in the beginning and 68.2 MB in the end (delta: 665.5 kB). Peak memory consumption was 52.7 MB. Max. memory is 16.1 GB. [2020-11-30 01:27:07,909 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 73.4 MB. Free memory is still 33.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:27:07,910 INFO L168 Benchmark]: CACSL2BoogieTranslator took 966.19 ms. Allocated memory is still 102.8 MB. Free memory was 68.7 MB in the beginning and 63.0 MB in the end (delta: 5.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-30 01:27:07,910 INFO L168 Benchmark]: Boogie Procedure Inliner took 117.26 ms. Allocated memory is still 102.8 MB. Free memory was 63.0 MB in the beginning and 55.1 MB in the end (delta: 7.9 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-11-30 01:27:07,911 INFO L168 Benchmark]: Boogie Preprocessor took 136.94 ms. Allocated memory is still 102.8 MB. Free memory was 55.1 MB in the beginning and 50.0 MB in the end (delta: 5.1 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-11-30 01:27:07,911 INFO L168 Benchmark]: RCFGBuilder took 2111.59 ms. Allocated memory was 102.8 MB in the beginning and 127.9 MB in the end (delta: 25.2 MB). Free memory was 50.0 MB in the beginning and 93.8 MB in the end (delta: -43.9 MB). Peak memory consumption was 29.6 MB. Max. memory is 16.1 GB. [2020-11-30 01:27:07,912 INFO L168 Benchmark]: TraceAbstraction took 7538.98 ms. Allocated memory was 127.9 MB in the beginning and 155.2 MB in the end (delta: 27.3 MB). Free memory was 93.0 MB in the beginning and 80.8 MB in the end (delta: 12.2 MB). Peak memory consumption was 40.1 MB. Max. memory is 16.1 GB. [2020-11-30 01:27:07,912 INFO L168 Benchmark]: Witness Printer took 124.13 ms. Allocated memory is still 155.2 MB. Free memory was 80.8 MB in the beginning and 68.2 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-30 01:27:07,915 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.31 ms. Allocated memory is still 73.4 MB. Free memory is still 33.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 966.19 ms. Allocated memory is still 102.8 MB. Free memory was 68.7 MB in the beginning and 63.0 MB in the end (delta: 5.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 117.26 ms. Allocated memory is still 102.8 MB. Free memory was 63.0 MB in the beginning and 55.1 MB in the end (delta: 7.9 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 136.94 ms. Allocated memory is still 102.8 MB. Free memory was 55.1 MB in the beginning and 50.0 MB in the end (delta: 5.1 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2111.59 ms. Allocated memory was 102.8 MB in the beginning and 127.9 MB in the end (delta: 25.2 MB). Free memory was 50.0 MB in the beginning and 93.8 MB in the end (delta: -43.9 MB). Peak memory consumption was 29.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 7538.98 ms. Allocated memory was 127.9 MB in the beginning and 155.2 MB in the end (delta: 27.3 MB). Free memory was 93.0 MB in the beginning and 80.8 MB in the end (delta: 12.2 MB). Peak memory consumption was 40.1 MB. Max. memory is 16.1 GB. * Witness Printer took 124.13 ms. Allocated memory is still 155.2 MB. Free memory was 80.8 MB in the beginning and 68.2 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: 12]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int inputC = 3; [L18] int inputD = 4; [L19] int inputE = 5; [L20] int inputF = 6; [L21] int inputB = 2; [L24] int a1 = 23; [L25] int a19 = 9; [L26] int a10 = 0; [L27] int a12 = 0; [L28] int a4 = 14; VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L589] int output = -1; VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] 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] [L34] 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] [L37] 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] [L40] 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] [L43] 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] [L46] 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] [L49] 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] [L52] 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] [L55] 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] [L58] 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] [L61] 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] [L64] 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] [L67] 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] [L70] 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] [L73] 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] [L76] 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] [L79] 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] [L82] 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] [L85] 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] [L88] 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] [L91] 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] [L94] 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] [L97] 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] [L100] 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] [L103] 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] [L106] 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] [L109] 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] [L112] 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] [L115] 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] [L118] 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] [L121] 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] [L124] 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] [L127] 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] [L130] 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] [L133] 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] [L136] 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] [L139] 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] [L142] 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] [L145] 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] [L148] 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] [L151] 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] [L154] 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] [L157] 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] [L160] 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] [L163] 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] [L166] 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] [L169] 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] [L172] 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] [L175] 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] [L178] 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] [L181] 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] [L184] 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] [L187] 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] [L190] 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] [L193] 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] [L196] 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] [L199] 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] [L202] 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] [L205] 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] [L208] 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] [L211] 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] [L215] 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] [L220] 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] [L225] 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] [L230] 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] [L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [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) && ((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] [L246] 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] [L249] 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] [L254] 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] [L259] 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] [L264] COND TRUE (((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0)) [L265] a1 = (((a1 / 5) + 110755) + 220746) [L266] a10 = 1 [L267] a19 = 8 [L269] return -1; VAL [a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] output = calculate_output(input) [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] 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] [L34] 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] [L37] 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] [L40] 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] [L43] 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] [L46] 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] [L49] 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] [L52] 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] [L55] 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] [L58] 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] [L61] 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] [L64] 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] [L67] 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] [L70] 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] [L73] 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] [L76] 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] [L12] __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: 7.2s, OverallIterations: 4, TraceHistogramMax: 2, AutomataDifference: 5.8s, 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.7s 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.2s SatisfiabilityAnalysisTime, 0.4s 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...