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_INT-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label24_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-15 14:54:36,077 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-15 14:54:36,080 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-15 14:54:36,092 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-15 14:54:36,092 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-15 14:54:36,093 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-15 14:54:36,094 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-15 14:54:36,096 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-15 14:54:36,099 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-15 14:54:36,100 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-15 14:54:36,101 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-15 14:54:36,101 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-15 14:54:36,102 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-15 14:54:36,103 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-15 14:54:36,104 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-15 14:54:36,105 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-15 14:54:36,105 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-15 14:54:36,107 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-15 14:54:36,109 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-15 14:54:36,111 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-15 14:54:36,112 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-15 14:54:36,114 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-15 14:54:36,116 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-15 14:54:36,116 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-15 14:54:36,117 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-15 14:54:36,118 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-15 14:54:36,119 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-15 14:54:36,120 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-15 14:54:36,121 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-15 14:54:36,122 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-15 14:54:36,122 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-15 14:54:36,125 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-15 14:54:36,125 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-15 14:54:36,125 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-15 14:54:36,126 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-15 14:54:36,127 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-15 14:54:36,129 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_INT-OldIcfg.epf [2018-09-15 14:54:36,158 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-15 14:54:36,159 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-15 14:54:36,160 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-15 14:54:36,160 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-15 14:54:36,160 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-15 14:54:36,160 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-15 14:54:36,161 INFO L133 SettingsManager]: * Congruence Domain=false [2018-09-15 14:54:36,161 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-15 14:54:36,161 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-15 14:54:36,161 INFO L133 SettingsManager]: * Abstract domain=IntervalDomain [2018-09-15 14:54:36,164 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-15 14:54:36,164 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-15 14:54:36,165 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-15 14:54:36,166 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-15 14:54:36,167 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-15 14:54:36,167 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-15 14:54:36,167 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-15 14:54:36,167 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-15 14:54:36,167 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-15 14:54:36,168 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-15 14:54:36,168 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-15 14:54:36,168 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-15 14:54:36,168 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-15 14:54:36,170 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-15 14:54:36,170 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-15 14:54:36,170 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-15 14:54:36,170 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-15 14:54:36,170 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-15 14:54:36,171 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-15 14:54:36,171 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-15 14:54:36,171 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-15 14:54:36,171 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-15 14:54:36,172 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-15 14:54:36,172 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-15 14:54:36,226 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-15 14:54:36,244 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-15 14:54:36,247 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-15 14:54:36,249 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-15 14:54:36,249 INFO L276 PluginConnector]: CDTParser initialized [2018-09-15 14:54:36,250 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label24_true-unreach-call_false-termination.c [2018-09-15 14:54:36,598 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4490b2178/c33819c6e6b14e6e977ea529fa8d251c/FLAG4e5f7d0ec [2018-09-15 14:54:36,925 INFO L277 CDTParser]: Found 1 translation units. [2018-09-15 14:54:36,926 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label24_true-unreach-call_false-termination.c [2018-09-15 14:54:36,955 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4490b2178/c33819c6e6b14e6e977ea529fa8d251c/FLAG4e5f7d0ec [2018-09-15 14:54:36,984 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4490b2178/c33819c6e6b14e6e977ea529fa8d251c [2018-09-15 14:54:37,000 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-15 14:54:37,006 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-15 14:54:37,007 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-15 14:54:37,008 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-15 14:54:37,018 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-15 14:54:37,020 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 02:54:36" (1/1) ... [2018-09-15 14:54:37,025 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23cf82e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 02:54:37, skipping insertion in model container [2018-09-15 14:54:37,025 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 02:54:36" (1/1) ... [2018-09-15 14:54:37,040 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-15 14:54:37,684 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 14:54:37,704 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-15 14:54:37,844 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 14:54:37,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 02:54:37 WrapperNode [2018-09-15 14:54:37,899 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-15 14:54:37,900 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-15 14:54:37,900 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-15 14:54:37,900 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-15 14:54:37,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 02:54:37" (1/1) ... [2018-09-15 14:54:37,945 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 02:54:37" (1/1) ... [2018-09-15 14:54:38,010 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-15 14:54:38,011 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-15 14:54:38,011 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-15 14:54:38,011 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-15 14:54:38,188 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 02:54:37" (1/1) ... [2018-09-15 14:54:38,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 02:54:37" (1/1) ... [2018-09-15 14:54:38,197 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 02:54:37" (1/1) ... [2018-09-15 14:54:38,198 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 02:54:37" (1/1) ... [2018-09-15 14:54:38,249 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 02:54:37" (1/1) ... [2018-09-15 14:54:38,274 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 02:54:37" (1/1) ... [2018-09-15 14:54:38,293 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 02:54:37" (1/1) ... [2018-09-15 14:54:38,310 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-15 14:54:38,311 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-15 14:54:38,311 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-15 14:54:38,311 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-15 14:54:38,312 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 02:54:37" (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-09-15 14:54:38,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-15 14:54:38,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-15 14:54:38,393 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-15 14:54:38,393 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-15 14:54:38,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-15 14:54:38,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-15 14:54:38,394 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-15 14:54:38,394 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-15 14:54:42,105 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-15 14:54:42,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 02:54:42 BoogieIcfgContainer [2018-09-15 14:54:42,106 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-15 14:54:42,107 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-15 14:54:42,112 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-15 14:54:42,116 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-15 14:54:42,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 02:54:36" (1/3) ... [2018-09-15 14:54:42,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1558fb54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 02:54:42, skipping insertion in model container [2018-09-15 14:54:42,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 02:54:37" (2/3) ... [2018-09-15 14:54:42,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1558fb54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 02:54:42, skipping insertion in model container [2018-09-15 14:54:42,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 02:54:42" (3/3) ... [2018-09-15 14:54:42,120 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label24_true-unreach-call_false-termination.c [2018-09-15 14:54:42,128 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-15 14:54:42,137 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-15 14:54:42,193 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-15 14:54:42,194 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-15 14:54:42,195 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-15 14:54:42,195 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-15 14:54:42,195 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-15 14:54:42,195 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-15 14:54:42,196 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-15 14:54:42,196 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-15 14:54:42,196 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-15 14:54:42,229 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-09-15 14:54:42,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-15 14:54:42,239 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 14:54:42,240 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] [2018-09-15 14:54:42,241 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 14:54:42,247 INFO L82 PathProgramCache]: Analyzing trace with hash -364363092, now seen corresponding path program 1 times [2018-09-15 14:54:42,250 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 14:54:42,251 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-09-15 14:54:42,254 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [285], [287], [952], [956], [962], [966], [973], [974], [975], [977] [2018-09-15 14:54:42,295 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-15 14:54:42,296 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 14:54:43,560 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 14:54:43,563 INFO L272 AbstractInterpreter]: Visited 47 different actions 47 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-15 14:54:43,611 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 14:54:44,453 INFO L232 lantSequenceWeakener]: Weakened 45 states. On average, predicates are now at 79.96% of their original sizes. [2018-09-15 14:54:44,453 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 14:54:44,684 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 14:54:44,686 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 14:54:44,686 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-15 14:54:44,686 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 14:54:44,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-15 14:54:44,701 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-15 14:54:44,702 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-15 14:54:44,705 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 6 states. [2018-09-15 14:54:46,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 14:54:46,989 INFO L93 Difference]: Finished difference Result 693 states and 1229 transitions. [2018-09-15 14:54:46,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-15 14:54:46,995 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-09-15 14:54:46,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 14:54:47,016 INFO L225 Difference]: With dead ends: 693 [2018-09-15 14:54:47,017 INFO L226 Difference]: Without dead ends: 436 [2018-09-15 14:54:47,025 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 47 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-15 14:54:47,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-09-15 14:54:47,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434. [2018-09-15 14:54:47,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-09-15 14:54:47,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 615 transitions. [2018-09-15 14:54:47,111 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 615 transitions. Word has length 48 [2018-09-15 14:54:47,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 14:54:47,112 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 615 transitions. [2018-09-15 14:54:47,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-15 14:54:47,112 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 615 transitions. [2018-09-15 14:54:47,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-09-15 14:54:47,119 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 14:54:47,120 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-15 14:54:47,120 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 14:54:47,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1824784731, now seen corresponding path program 1 times [2018-09-15 14:54:47,121 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 14:54:47,121 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 134 with the following transitions: [2018-09-15 14:54:47,122 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [285], [287], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-15 14:54:47,128 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-15 14:54:47,128 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 14:54:54,328 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 14:54:54,329 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-09-15 14:54:54,338 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 14:54:58,301 INFO L232 lantSequenceWeakener]: Weakened 130 states. On average, predicates are now at 78.3% of their original sizes. [2018-09-15 14:54:58,302 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 14:54:58,406 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 14:54:58,407 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 14:54:58,407 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-15 14:54:58,407 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 14:54:58,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-15 14:54:58,410 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-15 14:54:58,410 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-09-15 14:54:58,411 INFO L87 Difference]: Start difference. First operand 434 states and 615 transitions. Second operand 11 states. [2018-09-15 14:55:02,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 14:55:02,677 INFO L93 Difference]: Finished difference Result 1051 states and 1763 transitions. [2018-09-15 14:55:02,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-15 14:55:02,678 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 133 [2018-09-15 14:55:02,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 14:55:02,685 INFO L225 Difference]: With dead ends: 1051 [2018-09-15 14:55:02,685 INFO L226 Difference]: Without dead ends: 806 [2018-09-15 14:55:02,688 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 139 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-15 14:55:02,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2018-09-15 14:55:02,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 803. [2018-09-15 14:55:02,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2018-09-15 14:55:02,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1002 transitions. [2018-09-15 14:55:02,746 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1002 transitions. Word has length 133 [2018-09-15 14:55:02,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 14:55:02,747 INFO L480 AbstractCegarLoop]: Abstraction has 803 states and 1002 transitions. [2018-09-15 14:55:02,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-15 14:55:02,747 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1002 transitions. [2018-09-15 14:55:02,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-09-15 14:55:02,752 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 14:55:02,752 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-15 14:55:02,753 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 14:55:02,753 INFO L82 PathProgramCache]: Analyzing trace with hash 2118678471, now seen corresponding path program 1 times [2018-09-15 14:55:02,753 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 14:55:02,754 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 160 with the following transitions: [2018-09-15 14:55:02,754 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [285], [287], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-15 14:55:02,760 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-15 14:55:02,761 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 14:55:29,067 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 14:55:29,068 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-09-15 14:55:29,111 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 14:55:48,471 INFO L232 lantSequenceWeakener]: Weakened 156 states. On average, predicates are now at 78.13% of their original sizes. [2018-09-15 14:55:48,471 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 14:55:48,628 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 14:55:48,629 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 14:55:48,629 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-15 14:55:48,629 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 14:55:48,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-15 14:55:48,630 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-15 14:55:48,630 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-15 14:55:48,631 INFO L87 Difference]: Start difference. First operand 803 states and 1002 transitions. Second operand 11 states. [2018-09-15 14:55:52,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 14:55:52,275 INFO L93 Difference]: Finished difference Result 1236 states and 1786 transitions. [2018-09-15 14:55:52,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-15 14:55:52,279 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 159 [2018-09-15 14:55:52,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 14:55:52,286 INFO L225 Difference]: With dead ends: 1236 [2018-09-15 14:55:52,286 INFO L226 Difference]: Without dead ends: 991 [2018-09-15 14:55:52,288 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 166 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-09-15 14:55:52,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2018-09-15 14:55:52,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 988. [2018-09-15 14:55:52,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2018-09-15 14:55:52,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1200 transitions. [2018-09-15 14:55:52,321 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1200 transitions. Word has length 159 [2018-09-15 14:55:52,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 14:55:52,322 INFO L480 AbstractCegarLoop]: Abstraction has 988 states and 1200 transitions. [2018-09-15 14:55:52,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-15 14:55:52,322 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1200 transitions. [2018-09-15 14:55:52,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-09-15 14:55:52,329 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 14:55:52,330 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, 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] [2018-09-15 14:55:52,330 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 14:55:52,330 INFO L82 PathProgramCache]: Analyzing trace with hash 2077333816, now seen corresponding path program 1 times [2018-09-15 14:55:52,331 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 14:55:52,331 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 245 with the following transitions: [2018-09-15 14:55:52,331 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [285], [287], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-15 14:55:52,336 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-15 14:55:52,336 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 14:57:07,557 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 14:57:07,557 INFO L272 AbstractInterpreter]: Visited 119 different actions 466 times. Merged at 7 different actions 23 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-15 14:57:07,563 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 14:58:06,180 INFO L232 lantSequenceWeakener]: Weakened 241 states. On average, predicates are now at 77.87% of their original sizes. [2018-09-15 14:58:06,180 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 14:58:06,300 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 14:58:06,300 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 14:58:06,300 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-15 14:58:06,300 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 14:58:06,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-15 14:58:06,301 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-15 14:58:06,302 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-15 14:58:06,302 INFO L87 Difference]: Start difference. First operand 988 states and 1200 transitions. Second operand 10 states. [2018-09-15 14:58:10,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 14:58:10,409 INFO L93 Difference]: Finished difference Result 1439 states and 2003 transitions. [2018-09-15 14:58:10,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-15 14:58:10,417 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 244 [2018-09-15 14:58:10,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 14:58:10,425 INFO L225 Difference]: With dead ends: 1439 [2018-09-15 14:58:10,425 INFO L226 Difference]: Without dead ends: 1194 [2018-09-15 14:58:10,427 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 250 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-15 14:58:10,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2018-09-15 14:58:10,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1189. [2018-09-15 14:58:10,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1189 states. [2018-09-15 14:58:10,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1189 states to 1189 states and 1431 transitions. [2018-09-15 14:58:10,464 INFO L78 Accepts]: Start accepts. Automaton has 1189 states and 1431 transitions. Word has length 244 [2018-09-15 14:58:10,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 14:58:10,465 INFO L480 AbstractCegarLoop]: Abstraction has 1189 states and 1431 transitions. [2018-09-15 14:58:10,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-15 14:58:10,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 1431 transitions. [2018-09-15 14:58:10,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-09-15 14:58:10,472 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 14:58:10,472 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, 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, 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] [2018-09-15 14:58:10,473 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 14:58:10,473 INFO L82 PathProgramCache]: Analyzing trace with hash 648874139, now seen corresponding path program 1 times [2018-09-15 14:58:10,473 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 14:58:10,473 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 270 with the following transitions: [2018-09-15 14:58:10,474 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [285], [287], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-15 14:58:10,482 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-15 14:58:10,482 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-09-15 14:58:30,771 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-09-15 14:58:30,772 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-09-15 14:58:30,773 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-15 14:58:30,815 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-15 14:58:30,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 02:58:30 BoogieIcfgContainer [2018-09-15 14:58:30,816 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-15 14:58:30,817 INFO L168 Benchmark]: Toolchain (without parser) took 233816.51 ms. Allocated memory was 1.5 GB in the beginning and 5.4 GB in the end (delta: 3.9 GB). Free memory was 1.4 GB in the beginning and 3.0 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-09-15 14:58:30,819 INFO L168 Benchmark]: CDTParser took 0.17 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-09-15 14:58:30,820 INFO L168 Benchmark]: CACSL2BoogieTranslator took 892.31 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: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 7.1 GB. [2018-09-15 14:58:30,821 INFO L168 Benchmark]: Boogie Procedure Inliner took 110.24 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-09-15 14:58:30,822 INFO L168 Benchmark]: Boogie Preprocessor took 299.46 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 781.7 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -883.9 MB). Peak memory consumption was 33.0 MB. Max. memory is 7.1 GB. [2018-09-15 14:58:30,823 INFO L168 Benchmark]: RCFGBuilder took 3795.88 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 121.0 MB). Peak memory consumption was 121.0 MB. Max. memory is 7.1 GB. [2018-09-15 14:58:30,824 INFO L168 Benchmark]: TraceAbstraction took 228708.75 ms. Allocated memory was 2.3 GB in the beginning and 5.4 GB in the end (delta: 3.1 GB). Free memory was 2.1 GB in the beginning and 3.0 GB in the end (delta: -831.0 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-09-15 14:58:30,830 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.17 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 892.31 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: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 110.24 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 299.46 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 781.7 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -883.9 MB). Peak memory consumption was 33.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3795.88 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 121.0 MB). Peak memory consumption was 121.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 228708.75 ms. Allocated memory was 2.3 GB in the beginning and 5.4 GB in the end (delta: 3.1 GB). Free memory was 2.1 GB in the beginning and 3.0 GB in the end (delta: -831.0 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 127]: 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 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, 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 TRUE ((( a12 <= -43 && ((input == 6) && ((a21==10) || ((a21==8) || (a21==9))))) && (a24==1)) && (a15==8)) [L445] a12 = ((((a12 % 26)+ -1) / 5) / 5) [L446] a21 = 7 [L448] RET return 25; [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 TRUE ((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6)) [L127] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 255 locations, 1 error locations. UNKNOWN Result, 228.6s OverallTime, 5 OverallIterations, 3 TraceHistogramMax, 14.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 966 SDtfs, 3268 SDslu, 906 SDs, 0 SdLazy, 6593 SolverSat, 958 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.6s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 602 GetRequests, 550 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1189occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 130.4s AbstIntTime, 5 AbstIntIterations, 4 AbstIntStrong, 0.9968275277945446 AbsIntWeakeningRatio, 0.13793103448275862 AbsIntAvgWeakeningVarsNumRemoved, 11.625862068965517 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 13 StatesRemovedByMinimization, 4 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_label24_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_INT-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-15_14-58-30-847.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem14_label24_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_INT-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-15_14-58-30-847.csv Completed graceful shutdown