java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label00_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ddc4263 [2018-08-08 06:09:39,344 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-08-08 06:09:39,347 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-08-08 06:09:39,359 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-08-08 06:09:39,359 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-08-08 06:09:39,361 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-08-08 06:09:39,362 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-08-08 06:09:39,363 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-08-08 06:09:39,365 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-08-08 06:09:39,366 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-08-08 06:09:39,367 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-08-08 06:09:39,367 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-08-08 06:09:39,368 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-08-08 06:09:39,369 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-08-08 06:09:39,370 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-08-08 06:09:39,371 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-08-08 06:09:39,372 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-08-08 06:09:39,374 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-08-08 06:09:39,376 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-08-08 06:09:39,377 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-08-08 06:09:39,378 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-08-08 06:09:39,380 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-08-08 06:09:39,382 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-08-08 06:09:39,383 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-08-08 06:09:39,383 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-08-08 06:09:39,384 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-08-08 06:09:39,385 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-08-08 06:09:39,386 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-08-08 06:09:39,387 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-08-08 06:09:39,388 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-08-08 06:09:39,388 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-08-08 06:09:39,389 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-08-08 06:09:39,389 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-08-08 06:09:39,389 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-08-08 06:09:39,390 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-08-08 06:09:39,391 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-08-08 06:09:39,391 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf [2018-08-08 06:09:39,406 INFO L110 SettingsManager]: Loading preferences was successful [2018-08-08 06:09:39,407 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-08-08 06:09:39,408 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-08-08 06:09:39,408 INFO L133 SettingsManager]: * User list type=DISABLED [2018-08-08 06:09:39,408 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-08-08 06:09:39,408 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-08-08 06:09:39,409 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-08-08 06:09:39,409 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-08-08 06:09:39,409 INFO L133 SettingsManager]: * Log string format=TERM [2018-08-08 06:09:39,409 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-08-08 06:09:39,409 INFO L133 SettingsManager]: * Interval Domain=false [2018-08-08 06:09:39,410 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-08-08 06:09:39,410 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-08-08 06:09:39,410 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-08-08 06:09:39,411 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-08-08 06:09:39,411 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-08-08 06:09:39,411 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-08-08 06:09:39,411 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-08-08 06:09:39,411 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-08-08 06:09:39,414 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-08-08 06:09:39,414 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-08-08 06:09:39,414 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-08-08 06:09:39,415 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-08-08 06:09:39,415 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-08-08 06:09:39,415 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-08-08 06:09:39,415 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-08-08 06:09:39,416 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-08-08 06:09:39,416 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-08-08 06:09:39,416 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-08-08 06:09:39,416 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-08-08 06:09:39,416 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-08-08 06:09:39,417 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-08-08 06:09:39,417 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-08-08 06:09:39,461 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-08-08 06:09:39,478 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-08-08 06:09:39,482 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-08-08 06:09:39,483 INFO L271 PluginConnector]: Initializing CDTParser... [2018-08-08 06:09:39,484 INFO L276 PluginConnector]: CDTParser initialized [2018-08-08 06:09:39,485 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label00_true-unreach-call_false-termination.c [2018-08-08 06:09:39,839 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f567ac99/95b2afa8f60e48a5ad6f2916ea4e4b88/FLAG9f301346b [2018-08-08 06:09:40,156 INFO L276 CDTParser]: Found 1 translation units. [2018-08-08 06:09:40,157 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label00_true-unreach-call_false-termination.c [2018-08-08 06:09:40,178 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f567ac99/95b2afa8f60e48a5ad6f2916ea4e4b88/FLAG9f301346b [2018-08-08 06:09:40,199 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f567ac99/95b2afa8f60e48a5ad6f2916ea4e4b88 [2018-08-08 06:09:40,213 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-08-08 06:09:40,217 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-08-08 06:09:40,218 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-08-08 06:09:40,218 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-08-08 06:09:40,228 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-08-08 06:09:40,229 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.08 06:09:40" (1/1) ... [2018-08-08 06:09:40,233 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@235327a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 06:09:40, skipping insertion in model container [2018-08-08 06:09:40,233 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.08 06:09:40" (1/1) ... [2018-08-08 06:09:40,485 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-08-08 06:09:40,859 INFO L175 PostProcessor]: Settings: Checked method=main [2018-08-08 06:09:40,878 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-08-08 06:09:40,993 INFO L175 PostProcessor]: Settings: Checked method=main [2018-08-08 06:09:41,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 06:09:41 WrapperNode [2018-08-08 06:09:41,039 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-08-08 06:09:41,040 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-08-08 06:09:41,040 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-08-08 06:09:41,040 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-08-08 06:09:41,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 06:09:41" (1/1) ... [2018-08-08 06:09:41,076 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 06:09:41" (1/1) ... [2018-08-08 06:09:41,140 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-08-08 06:09:41,141 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-08-08 06:09:41,141 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-08-08 06:09:41,141 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-08-08 06:09:41,151 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 06:09:41" (1/1) ... [2018-08-08 06:09:41,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 06:09:41" (1/1) ... [2018-08-08 06:09:41,158 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 06:09:41" (1/1) ... [2018-08-08 06:09:41,158 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 06:09:41" (1/1) ... [2018-08-08 06:09:41,369 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 06:09:41" (1/1) ... [2018-08-08 06:09:41,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 06:09:41" (1/1) ... [2018-08-08 06:09:41,389 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 06:09:41" (1/1) ... [2018-08-08 06:09:41,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-08-08 06:09:41,399 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-08-08 06:09:41,399 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-08-08 06:09:41,399 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-08-08 06:09:41,400 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 06:09:41" (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 [2018-08-08 06:09:41,478 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output [2018-08-08 06:09:41,478 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output [2018-08-08 06:09:41,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-08-08 06:09:41,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-08-08 06:09:41,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-08-08 06:09:41,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-08-08 06:09:41,479 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-08-08 06:09:41,479 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-08-08 06:09:44,848 INFO L273 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-08-08 06:09:44,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.08 06:09:44 BoogieIcfgContainer [2018-08-08 06:09:44,849 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-08-08 06:09:44,851 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-08-08 06:09:44,851 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-08-08 06:09:44,854 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-08-08 06:09:44,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.08 06:09:40" (1/3) ... [2018-08-08 06:09:44,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a925059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.08 06:09:44, skipping insertion in model container [2018-08-08 06:09:44,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 06:09:41" (2/3) ... [2018-08-08 06:09:44,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a925059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.08 06:09:44, skipping insertion in model container [2018-08-08 06:09:44,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.08 06:09:44" (3/3) ... [2018-08-08 06:09:44,861 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label00_true-unreach-call_false-termination.c [2018-08-08 06:09:44,872 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-08-08 06:09:44,889 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-08-08 06:09:44,945 INFO L129 ementStrategyFactory]: Using default assertion order modulation [2018-08-08 06:09:44,946 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-08-08 06:09:44,946 INFO L382 AbstractCegarLoop]: Hoare is true [2018-08-08 06:09:44,946 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-08-08 06:09:44,946 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-08-08 06:09:44,946 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-08-08 06:09:44,947 INFO L386 AbstractCegarLoop]: Difference is false [2018-08-08 06:09:44,947 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-08-08 06:09:44,947 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-08-08 06:09:44,974 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-08-08 06:09:44,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-08-08 06:09:44,984 INFO L368 BasicCegarLoop]: Found error trace [2018-08-08 06:09:44,986 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-08-08 06:09:44,989 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-08-08 06:09:44,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1106902020, now seen corresponding path program 1 times [2018-08-08 06:09:44,998 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-08-08 06:09:44,999 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2018-08-08 06:09:45,003 INFO L202 CegarAbsIntRunner]: [0], [7], [15], [23], [31], [39], [47], [55], [63], [71], [79], [87], [95], [103], [111], [119], [127], [135], [143], [151], [159], [167], [175], [183], [191], [199], [207], [215], [223], [231], [239], [247], [255], [263], [271], [279], [287], [295], [303], [311], [319], [327], [335], [343], [351], [359], [367], [375], [379], [381], [947], [948], [952], [956], [962], [966], [973], [974], [975], [977] [2018-08-08 06:09:45,068 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-08-08 06:09:45,069 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-08-08 06:09:46,714 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-08-08 06:09:46,716 INFO L272 AbstractInterpreter]: Visited 59 different actions 59 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-08-08 06:09:46,734 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-08-08 06:09:47,556 INFO L232 lantSequenceWeakener]: Weakened 58 states. On average, predicates are now at 80.69% of their original sizes. [2018-08-08 06:09:47,556 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-08-08 06:09:47,878 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-08-08 06:09:47,879 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-08-08 06:09:47,880 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-08-08 06:09:47,880 INFO L262 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-08-08 06:09:47,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-08-08 06:09:47,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-08-08 06:09:47,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-08-08 06:09:47,898 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 6 states. [2018-08-08 06:09:53,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-08-08 06:09:53,514 INFO L93 Difference]: Finished difference Result 693 states and 1229 transitions. [2018-08-08 06:09:53,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-08-08 06:09:53,517 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-08-08 06:09:53,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-08-08 06:09:53,536 INFO L225 Difference]: With dead ends: 693 [2018-08-08 06:09:53,537 INFO L226 Difference]: Without dead ends: 436 [2018-08-08 06:09:53,544 INFO L603 BasicCegarLoop]: 2 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-08-08 06:09:53,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-08-08 06:09:53,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434. [2018-08-08 06:09:53,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-08-08 06:09:53,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 615 transitions. [2018-08-08 06:09:53,644 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 615 transitions. Word has length 60 [2018-08-08 06:09:53,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-08-08 06:09:53,645 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 615 transitions. [2018-08-08 06:09:53,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-08-08 06:09:53,645 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 615 transitions. [2018-08-08 06:09:53,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-08-08 06:09:53,657 INFO L368 BasicCegarLoop]: Found error trace [2018-08-08 06:09:53,658 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-08-08 06:09:53,658 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-08-08 06:09:53,660 INFO L82 PathProgramCache]: Analyzing trace with hash 644554089, now seen corresponding path program 1 times [2018-08-08 06:09:53,660 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-08-08 06:09:53,660 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 146 with the following transitions: [2018-08-08 06:09:53,661 INFO L202 CegarAbsIntRunner]: [0], [7], [15], [23], [31], [39], [47], [55], [63], [71], [79], [87], [95], [103], [111], [119], [127], [135], [143], [151], [159], [167], [175], [183], [191], [199], [207], [215], [223], [231], [239], [247], [255], [263], [271], [279], [287], [295], [303], [311], [319], [327], [335], [343], [351], [359], [367], [375], [379], [381], [384], [392], [400], [408], [416], [424], [432], [440], [448], [456], [464], [472], [480], [488], [493], [497], [501], [505], [509], [513], [517], [521], [525], [529], [533], [537], [541], [545], [549], [552], [946], [947], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-08-08 06:09:53,673 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-08-08 06:09:53,673 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-08-08 06:10:02,439 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-08-08 06:10:02,440 INFO L272 AbstractInterpreter]: Visited 92 different actions 177 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-08-08 06:10:02,449 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-08-08 06:10:06,433 INFO L232 lantSequenceWeakener]: Weakened 143 states. On average, predicates are now at 78.75% of their original sizes. [2018-08-08 06:10:06,433 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-08-08 06:10:08,380 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-08-08 06:10:08,380 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-08-08 06:10:08,381 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-08-08 06:10:08,381 INFO L262 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-08-08 06:10:08,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-08-08 06:10:08,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-08-08 06:10:08,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-08-08 06:10:08,383 INFO L87 Difference]: Start difference. First operand 434 states and 615 transitions. Second operand 11 states. [2018-08-08 06:10:23,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-08-08 06:10:23,558 INFO L93 Difference]: Finished difference Result 1051 states and 1763 transitions. [2018-08-08 06:10:23,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-08-08 06:10:23,560 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 145 [2018-08-08 06:10:23,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-08-08 06:10:23,566 INFO L225 Difference]: With dead ends: 1051 [2018-08-08 06:10:23,566 INFO L226 Difference]: Without dead ends: 806 [2018-08-08 06:10:23,571 INFO L603 BasicCegarLoop]: 2 DeclaredPredicates, 151 GetRequests, 87 SyntacticMatches, 48 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-08-08 06:10:23,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2018-08-08 06:10:23,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 803. [2018-08-08 06:10:23,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2018-08-08 06:10:23,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1002 transitions. [2018-08-08 06:10:23,626 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1002 transitions. Word has length 145 [2018-08-08 06:10:23,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-08-08 06:10:23,627 INFO L480 AbstractCegarLoop]: Abstraction has 803 states and 1002 transitions. [2018-08-08 06:10:23,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-08-08 06:10:23,628 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1002 transitions. [2018-08-08 06:10:23,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-08-08 06:10:23,633 INFO L368 BasicCegarLoop]: Found error trace [2018-08-08 06:10:23,633 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-08-08 06:10:23,634 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-08-08 06:10:23,634 INFO L82 PathProgramCache]: Analyzing trace with hash 952759573, now seen corresponding path program 1 times [2018-08-08 06:10:23,634 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-08-08 06:10:23,635 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 172 with the following transitions: [2018-08-08 06:10:23,635 INFO L202 CegarAbsIntRunner]: [0], [7], [15], [23], [31], [39], [47], [55], [63], [71], [79], [87], [95], [103], [111], [119], [127], [135], [143], [151], [159], [167], [175], [183], [191], [199], [207], [215], [223], [231], [239], [247], [255], [263], [271], [279], [287], [295], [303], [311], [319], [327], [335], [343], [351], [359], [367], [375], [379], [381], [384], [392], [400], [408], [416], [424], [432], [440], [448], [456], [464], [472], [480], [488], [493], [497], [501], [505], [509], [513], [517], [521], [525], [529], [533], [537], [541], [545], [549], [553], [557], [561], [565], [569], [573], [577], [581], [585], [589], [593], [597], [601], [605], [609], [613], [617], [621], [625], [629], [633], [637], [641], [645], [649], [653], [656], [946], [947], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-08-08 06:10:23,641 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-08-08 06:10:23,641 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-08-08 06:10:42,940 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-08-08 06:10:42,940 INFO L272 AbstractInterpreter]: Visited 118 different actions 230 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-08-08 06:10:42,949 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-08-08 06:10:51,304 INFO L232 lantSequenceWeakener]: Weakened 169 states. On average, predicates are now at 78.52% of their original sizes. [2018-08-08 06:10:51,304 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-08-08 06:10:52,857 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-08-08 06:10:52,857 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-08-08 06:10:52,857 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-08-08 06:10:52,858 INFO L262 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-08-08 06:10:52,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-08-08 06:10:52,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-08-08 06:10:52,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-08-08 06:10:52,859 INFO L87 Difference]: Start difference. First operand 803 states and 1002 transitions. Second operand 11 states. [2018-08-08 06:11:04,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-08-08 06:11:04,863 INFO L93 Difference]: Finished difference Result 1236 states and 1786 transitions. [2018-08-08 06:11:04,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-08-08 06:11:04,868 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 171 [2018-08-08 06:11:04,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-08-08 06:11:04,876 INFO L225 Difference]: With dead ends: 1236 [2018-08-08 06:11:04,876 INFO L226 Difference]: Without dead ends: 991 [2018-08-08 06:11:04,879 INFO L603 BasicCegarLoop]: 2 DeclaredPredicates, 178 GetRequests, 113 SyntacticMatches, 48 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-08-08 06:11:04,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2018-08-08 06:11:04,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 988. [2018-08-08 06:11:04,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2018-08-08 06:11:04,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1200 transitions. [2018-08-08 06:11:04,921 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1200 transitions. Word has length 171 [2018-08-08 06:11:04,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-08-08 06:11:04,922 INFO L480 AbstractCegarLoop]: Abstraction has 988 states and 1200 transitions. [2018-08-08 06:11:04,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-08-08 06:11:04,922 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1200 transitions. [2018-08-08 06:11:04,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-08-08 06:11:04,929 INFO L368 BasicCegarLoop]: Found error trace [2018-08-08 06:11:04,930 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-08-08 06:11:04,930 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-08-08 06:11:04,930 INFO L82 PathProgramCache]: Analyzing trace with hash -2130079736, now seen corresponding path program 1 times [2018-08-08 06:11:04,930 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-08-08 06:11:04,931 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 257 with the following transitions: [2018-08-08 06:11:04,931 INFO L202 CegarAbsIntRunner]: [0], [7], [15], [23], [31], [39], [47], [55], [63], [71], [79], [87], [95], [103], [111], [119], [127], [135], [143], [151], [159], [167], [175], [183], [191], [199], [207], [215], [223], [231], [239], [247], [255], [263], [271], [279], [287], [295], [303], [311], [319], [327], [335], [343], [351], [359], [367], [375], [379], [381], [384], [392], [400], [408], [416], [424], [432], [440], [448], [456], [464], [472], [480], [488], [493], [497], [501], [505], [509], [513], [517], [521], [525], [529], [533], [537], [541], [545], [549], [552], [553], [557], [561], [565], [569], [573], [577], [581], [585], [589], [593], [597], [601], [605], [609], [613], [617], [621], [625], [629], [633], [637], [641], [645], [649], [653], [656], [946], [947], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-08-08 06:11:04,936 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-08-08 06:11:04,937 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-08-08 06:11:20,800 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-08-08 06:11:20,800 INFO L272 AbstractInterpreter]: Visited 120 different actions 353 times. Merged at 7 different actions 17 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-08-08 06:11:20,807 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-08-08 06:11:20,846 WARN L205 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-08-08 06:11:20,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.08 06:11:20 BoogieIcfgContainer [2018-08-08 06:11:20,847 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-08-08 06:11:20,848 INFO L168 Benchmark]: Toolchain (without parser) took 100634.47 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 4.0 GB in the end (delta: -2.5 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-08-08 06:11:20,850 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-08-08 06:11:20,851 INFO L168 Benchmark]: CACSL2BoogieTranslator took 820.99 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-08-08 06:11:20,851 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.59 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-08-08 06:11:20,852 INFO L168 Benchmark]: Boogie Preprocessor took 257.86 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 807.9 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -916.3 MB). Peak memory consumption was 36.2 MB. Max. memory is 7.1 GB. [2018-08-08 06:11:20,853 INFO L168 Benchmark]: RCFGBuilder took 3450.89 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 135.4 MB). Peak memory consumption was 135.4 MB. Max. memory is 7.1 GB. [2018-08-08 06:11:20,854 INFO L168 Benchmark]: TraceAbstraction took 95996.42 ms. Allocated memory was 2.4 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 4.0 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-08-08 06:11:20,859 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 820.99 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 100.59 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 257.86 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 807.9 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -916.3 MB). Peak memory consumption was 36.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3450.89 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 135.4 MB). Peak memory consumption was 135.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 95996.42 ms. Allocated memory was 2.4 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 4.0 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 163]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L7] int inputD = 4; [L8] int inputB = 2; [L9] int inputC = 3; [L10] int inputF = 6; [L11] int inputE = 5; [L12] int inputA = 1; [L15] int a21 = 7; [L16] int a15 = 8; [L17] int a12 = -49; [L18] int a24 = 1; [L877] int output = -1; [L880] COND TRUE 1 [L883] int input; [L884] input = __VERIFIER_nondet_int() [L885] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L888] CALL, EXPR calculate_output(input) [L21] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) [L24] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) [L27] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L30] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) [L33] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L36] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L39] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L42] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) [L45] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) [L48] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) [L51] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L54] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) [L57] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) [L60] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) [L63] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) [L66] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L69] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L72] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L75] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L78] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) [L81] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) [L84] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) [L87] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L90] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L93] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) [L96] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) [L99] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) [L102] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L105] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) [L108] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L111] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L114] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L117] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L120] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L123] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) [L126] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L129] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) [L132] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L135] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) [L138] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L141] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) [L144] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L147] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) [L150] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L153] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) [L156] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) [L159] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L162] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) [L165] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) [L168] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L171] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) [L174] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) [L177] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L180] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L183] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) [L186] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L189] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) [L192] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L195] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L198] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) [L201] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L205] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) [L211] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) [L217] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) [L223] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) [L229] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) [L235] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) [L241] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) [L247] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) [L252] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) [L258] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) [L264] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) [L269] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) [L275] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) [L280] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) [L286] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) [L293] COND TRUE ((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8)) [L295] a15 = 5 [L296] a21 = 6 [L298] RET return -1; [L888] EXPR calculate_output(input) [L888] output = calculate_output(input) [L880] COND TRUE 1 [L883] int input; [L884] input = __VERIFIER_nondet_int() [L885] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L888] CALL, EXPR calculate_output(input) [L21] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) [L24] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) [L27] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L30] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) [L33] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L36] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L39] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L42] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) [L45] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) [L48] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) [L51] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L54] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) [L57] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) [L60] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) [L63] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) [L66] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L69] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L72] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L75] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L78] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) [L81] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) [L84] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) [L87] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L90] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L93] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) [L96] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) [L99] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) [L102] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L105] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) [L108] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L111] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L114] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L117] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L120] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L123] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) [L126] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L129] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) [L132] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L135] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) [L138] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L141] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) [L144] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L147] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) [L150] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L153] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) [L156] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) [L159] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L162] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) [L165] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) [L168] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L171] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) [L174] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) [L177] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L180] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L183] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) [L186] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L189] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) [L192] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L195] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L198] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) [L201] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L205] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) [L211] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) [L217] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) [L223] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) [L229] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) [L235] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) [L241] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) [L247] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) [L252] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) [L258] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) [L264] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) [L269] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) [L275] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) [L280] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) [L286] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) [L293] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) [L299] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) [L305] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) [L311] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) [L317] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) [L323] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) [L329] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) [L335] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) [L341] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) [L347] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) [L353] COND FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) [L359] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && a12 <= -43 )) && (a21==6))) && (input == 3))) [L366] COND FALSE !(((((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 5)) && (a24==1)) && (a15==9))) [L372] COND FALSE !((((((input == 1) && (((a21==7) || (a21==8)) || (a21==9))) && (a15==9)) && a12 <= -43 ) && (a24==1))) [L378] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && ((-43 < a12) && (11 >= a12)) ) && (a21==8))))) [L384] COND FALSE !((((a24==1) && ((a15==9) && ((input == 5) && ((a21==8) || ((a21==6) || (a21==7)))))) && ((11 < a12) && (80 >= a12)) )) [L390] COND FALSE !(((((a15==8) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 5))) && ((-43 < a12) && (11 >= a12)) ) && (a24==1))) [L396] COND FALSE !(((a15==9) && ((((input == 3) && (((a21==6) || (a21==7)) || (a21==8))) && (a24==1)) && ((11 < a12) && (80 >= a12)) ))) [L402] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 3)))) && (a24==1))) [L408] COND FALSE !(((a15==9) && ((a24==1) && ((((a21==9) || (a21==10)) && (input == 5)) && ((-43 < a12) && (11 >= a12)) )))) [L414] COND FALSE !(( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9)))) [L420] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && 80 < a12 ) && (a21==9))))) [L426] COND FALSE !((((a24==1) && (((input == 2) && ((a21==10) || ((a21==8) || (a21==9)))) && a12 <= -43 )) && (a15==8))) [L432] COND FALSE !(((a24==1) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))))) && (a15==9)))) [L438] COND FALSE !((((((input == 6) && ((a21==9) || ((a21==7) || (a21==8)))) && (a24==1)) && (a15==9)) && a12 <= -43 )) [L444] COND FALSE !(((( a12 <= -43 && ((input == 6) && ((a21==10) || ((a21==8) || (a21==9))))) && (a24==1)) && (a15==8))) [L449] COND TRUE (((((a21==7) && (input == 5)) && a12 <= -43 ) && (a24==1)) && (a15==8)) [L451] a21 = 10 [L453] RET return 22; [L888] EXPR calculate_output(input) [L888] output = calculate_output(input) [L880] COND TRUE 1 [L883] int input; [L884] input = __VERIFIER_nondet_int() [L885] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L888] CALL calculate_output(input) [L21] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) [L24] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) [L27] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L30] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) [L33] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L36] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L39] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L42] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) [L45] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) [L48] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) [L51] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L54] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) [L57] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) [L60] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) [L63] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) [L66] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L69] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L72] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L75] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L78] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) [L81] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) [L84] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) [L87] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L90] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L93] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) [L96] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) [L99] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) [L102] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L105] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) [L108] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L111] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L114] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L117] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L120] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L123] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) [L126] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L129] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) [L132] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L135] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) [L138] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L141] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) [L144] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L147] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) [L150] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L153] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) [L156] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) [L159] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L162] COND TRUE ((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7)) [L163] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 255 locations, 1 error locations. UNKNOWN Result, 95.9s OverallTime, 4 OverallIterations, 3 TraceHistogramMax, 32.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 741 SDtfs, 1865 SDslu, 1251 SDs, 0 SdLazy, 7128 SolverSat, 713 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 29.8s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 388 GetRequests, 255 SyntacticMatches, 96 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=988occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 45.7s AbstIntTime, 4 AbstIntIterations, 3 AbstIntStrong, 0.993234006930242 AbsIntWeakeningRatio, 0.1447721179624665 AbsIntAvgWeakeningVarsNumRemoved, 158.96782841823057 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: No data available, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem14_label00_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-08-08_06-11-20-874.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem14_label00_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-08-08_06-11-20-874.csv Received shutdown request...