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/Problem11_label50_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-15 11:39:36,145 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-15 11:39:36,148 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-15 11:39:36,161 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-15 11:39:36,161 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-15 11:39:36,162 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-15 11:39:36,164 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-15 11:39:36,165 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-15 11:39:36,167 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-15 11:39:36,168 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-15 11:39:36,169 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-15 11:39:36,169 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-15 11:39:36,170 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-15 11:39:36,171 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-15 11:39:36,173 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-15 11:39:36,173 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-15 11:39:36,174 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-15 11:39:36,176 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-15 11:39:36,178 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-15 11:39:36,180 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-15 11:39:36,181 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-15 11:39:36,182 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-15 11:39:36,184 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-15 11:39:36,185 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-15 11:39:36,185 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-15 11:39:36,186 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-15 11:39:36,187 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-15 11:39:36,188 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-15 11:39:36,189 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-15 11:39:36,190 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-15 11:39:36,190 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-15 11:39:36,191 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-15 11:39:36,191 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-15 11:39:36,191 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-15 11:39:36,192 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-15 11:39:36,193 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-15 11:39:36,194 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-09-15 11:39:36,210 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-15 11:39:36,210 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-15 11:39:36,211 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-15 11:39:36,211 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-15 11:39:36,211 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-15 11:39:36,212 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-15 11:39:36,212 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-15 11:39:36,212 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-15 11:39:36,212 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-15 11:39:36,212 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-15 11:39:36,213 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-15 11:39:36,213 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-15 11:39:36,213 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-15 11:39:36,214 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-15 11:39:36,214 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-15 11:39:36,214 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-15 11:39:36,214 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-15 11:39:36,214 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-15 11:39:36,215 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-15 11:39:36,215 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-15 11:39:36,215 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-15 11:39:36,215 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-15 11:39:36,215 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-15 11:39:36,216 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-15 11:39:36,216 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-15 11:39:36,216 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-15 11:39:36,216 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-15 11:39:36,216 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-15 11:39:36,217 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-15 11:39:36,217 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-15 11:39:36,217 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-15 11:39:36,217 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-15 11:39:36,218 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-15 11:39:36,265 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-15 11:39:36,284 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-15 11:39:36,290 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-15 11:39:36,292 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-15 11:39:36,292 INFO L276 PluginConnector]: CDTParser initialized [2018-09-15 11:39:36,293 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label50_true-unreach-call.c [2018-09-15 11:39:36,690 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27ecbef46/4536ff148e334be4b7cefd29be9f3228/FLAG88335f695 [2018-09-15 11:39:37,008 INFO L277 CDTParser]: Found 1 translation units. [2018-09-15 11:39:37,009 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label50_true-unreach-call.c [2018-09-15 11:39:37,027 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27ecbef46/4536ff148e334be4b7cefd29be9f3228/FLAG88335f695 [2018-09-15 11:39:37,043 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27ecbef46/4536ff148e334be4b7cefd29be9f3228 [2018-09-15 11:39:37,055 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-15 11:39:37,058 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-15 11:39:37,059 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-15 11:39:37,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-15 11:39:37,067 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-15 11:39:37,068 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 11:39:37" (1/1) ... [2018-09-15 11:39:37,072 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20672f96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:39:37, skipping insertion in model container [2018-09-15 11:39:37,072 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 11:39:37" (1/1) ... [2018-09-15 11:39:37,084 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-15 11:39:37,809 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 11:39:37,827 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-15 11:39:38,016 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 11:39:38,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:39:38 WrapperNode [2018-09-15 11:39:38,108 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-15 11:39:38,110 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-15 11:39:38,110 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-15 11:39:38,110 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-15 11:39:38,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:39:38" (1/1) ... [2018-09-15 11:39:38,174 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:39:38" (1/1) ... [2018-09-15 11:39:38,298 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-15 11:39:38,298 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-15 11:39:38,298 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-15 11:39:38,299 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-15 11:39:38,572 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:39:38" (1/1) ... [2018-09-15 11:39:38,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:39:38" (1/1) ... [2018-09-15 11:39:38,585 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:39:38" (1/1) ... [2018-09-15 11:39:38,586 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:39:38" (1/1) ... [2018-09-15 11:39:38,642 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:39:38" (1/1) ... [2018-09-15 11:39:38,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:39:38" (1/1) ... [2018-09-15 11:39:38,680 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:39:38" (1/1) ... [2018-09-15 11:39:38,699 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-15 11:39:38,699 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-15 11:39:38,699 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-15 11:39:38,700 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-15 11:39:38,701 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:39:38" (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 11:39:38,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-15 11:39:38,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-15 11:39:38,774 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-15 11:39:38,775 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-15 11:39:38,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-15 11:39:38,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-15 11:39:38,775 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-15 11:39:38,776 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-15 11:39:42,903 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-15 11:39:42,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 11:39:42 BoogieIcfgContainer [2018-09-15 11:39:42,904 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-15 11:39:42,906 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-15 11:39:42,906 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-15 11:39:42,909 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-15 11:39:42,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 11:39:37" (1/3) ... [2018-09-15 11:39:42,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a3bf68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 11:39:42, skipping insertion in model container [2018-09-15 11:39:42,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:39:38" (2/3) ... [2018-09-15 11:39:42,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a3bf68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 11:39:42, skipping insertion in model container [2018-09-15 11:39:42,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 11:39:42" (3/3) ... [2018-09-15 11:39:42,913 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label50_true-unreach-call.c [2018-09-15 11:39:42,923 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-15 11:39:42,935 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-15 11:39:42,997 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-15 11:39:42,998 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-15 11:39:42,998 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-15 11:39:42,998 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-15 11:39:42,998 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-15 11:39:42,998 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-15 11:39:42,999 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-15 11:39:42,999 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-15 11:39:42,999 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-15 11:39:43,026 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states. [2018-09-15 11:39:43,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-15 11:39:43,035 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:39:43,037 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] [2018-09-15 11:39:43,038 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:39:43,043 INFO L82 PathProgramCache]: Analyzing trace with hash -2098834559, now seen corresponding path program 1 times [2018-09-15 11:39:43,046 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:39:43,047 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-09-15 11:39:43,049 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], [245], [247], [1088], [1092], [1098], [1102], [1109], [1110], [1111], [1113] [2018-09-15 11:39:43,115 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:39:43,116 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:39:45,380 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 11:39:45,382 INFO L272 AbstractInterpreter]: Visited 42 different actions 42 times. Never merged. Never widened. Never found a fixpoint. Largest state had 27 variables. [2018-09-15 11:39:45,430 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 11:39:46,192 INFO L232 lantSequenceWeakener]: Weakened 41 states. On average, predicates are now at 75.12% of their original sizes. [2018-09-15 11:39:46,192 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 11:39:46,503 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 11:39:46,505 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 11:39:46,505 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-15 11:39:46,505 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 11:39:46,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-15 11:39:46,518 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-15 11:39:46,518 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-15 11:39:46,521 INFO L87 Difference]: Start difference. First operand 293 states. Second operand 6 states. [2018-09-15 11:39:53,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 11:39:53,216 INFO L93 Difference]: Finished difference Result 776 states and 1363 transitions. [2018-09-15 11:39:53,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-15 11:39:53,218 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-09-15 11:39:53,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 11:39:53,236 INFO L225 Difference]: With dead ends: 776 [2018-09-15 11:39:53,237 INFO L226 Difference]: Without dead ends: 481 [2018-09-15 11:39:53,248 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 42 GetRequests, 38 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 11:39:53,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2018-09-15 11:39:53,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 479. [2018-09-15 11:39:53,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-09-15 11:39:53,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 682 transitions. [2018-09-15 11:39:53,333 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 682 transitions. Word has length 43 [2018-09-15 11:39:53,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 11:39:53,334 INFO L480 AbstractCegarLoop]: Abstraction has 479 states and 682 transitions. [2018-09-15 11:39:53,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-15 11:39:53,334 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 682 transitions. [2018-09-15 11:39:53,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-15 11:39:53,342 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:39:53,344 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:39:53,345 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:39:53,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1888142471, now seen corresponding path program 1 times [2018-09-15 11:39:53,345 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:39:53,346 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 161 with the following transitions: [2018-09-15 11:39:53,347 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], [245], [247], [250], [258], [266], [274], [282], [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], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-09-15 11:39:53,357 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:39:53,358 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:40:00,213 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 11:41:02,017 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 11:41:02,018 INFO L272 AbstractInterpreter]: Visited 124 different actions 359 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-09-15 11:41:02,056 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 11:41:18,941 INFO L232 lantSequenceWeakener]: Weakened 158 states. On average, predicates are now at 73.68% of their original sizes. [2018-09-15 11:41:18,942 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 11:41:21,425 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 11:41:21,425 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 11:41:21,426 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-15 11:41:21,426 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 11:41:21,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-15 11:41:21,428 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-15 11:41:21,429 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-15 11:41:21,429 INFO L87 Difference]: Start difference. First operand 479 states and 682 transitions. Second operand 11 states. [2018-09-15 11:41:31,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 11:41:31,765 INFO L93 Difference]: Finished difference Result 957 states and 1541 transitions. [2018-09-15 11:41:31,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-15 11:41:31,767 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 160 [2018-09-15 11:41:31,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 11:41:31,774 INFO L225 Difference]: With dead ends: 957 [2018-09-15 11:41:31,774 INFO L226 Difference]: Without dead ends: 674 [2018-09-15 11:41:31,777 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 167 GetRequests, 119 SyntacticMatches, 31 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-09-15 11:41:31,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2018-09-15 11:41:31,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 670. [2018-09-15 11:41:31,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2018-09-15 11:41:31,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 887 transitions. [2018-09-15 11:41:31,826 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 887 transitions. Word has length 160 [2018-09-15 11:41:31,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 11:41:31,827 INFO L480 AbstractCegarLoop]: Abstraction has 670 states and 887 transitions. [2018-09-15 11:41:31,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-15 11:41:31,827 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 887 transitions. [2018-09-15 11:41:31,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-09-15 11:41:31,831 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:41:31,831 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:41:31,832 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:41:31,832 INFO L82 PathProgramCache]: Analyzing trace with hash -2136481491, now seen corresponding path program 1 times [2018-09-15 11:41:31,832 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:41:31,832 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 171 with the following transitions: [2018-09-15 11:41:31,833 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], [245], [247], [250], [258], [266], [274], [282], [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], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [750], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-09-15 11:41:31,839 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:41:31,839 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:42:07,358 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 11:42:07,359 INFO L272 AbstractInterpreter]: Visited 134 different actions 262 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-09-15 11:42:07,373 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 11:42:24,199 INFO L232 lantSequenceWeakener]: Weakened 168 states. On average, predicates are now at 73.64% of their original sizes. [2018-09-15 11:42:24,199 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 11:42:25,927 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 11:42:25,927 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 11:42:25,928 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-15 11:42:25,928 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 11:42:25,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-15 11:42:25,929 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-15 11:42:25,929 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-15 11:42:25,930 INFO L87 Difference]: Start difference. First operand 670 states and 887 transitions. Second operand 11 states. [2018-09-15 11:42:35,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 11:42:35,937 INFO L93 Difference]: Finished difference Result 1149 states and 1747 transitions. [2018-09-15 11:42:35,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-15 11:42:35,940 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 170 [2018-09-15 11:42:35,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 11:42:35,946 INFO L225 Difference]: With dead ends: 1149 [2018-09-15 11:42:35,946 INFO L226 Difference]: Without dead ends: 866 [2018-09-15 11:42:35,947 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 177 GetRequests, 129 SyntacticMatches, 31 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-09-15 11:42:35,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2018-09-15 11:42:35,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 861. [2018-09-15 11:42:35,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2018-09-15 11:42:35,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1092 transitions. [2018-09-15 11:42:35,987 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1092 transitions. Word has length 170 [2018-09-15 11:42:35,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 11:42:35,988 INFO L480 AbstractCegarLoop]: Abstraction has 861 states and 1092 transitions. [2018-09-15 11:42:35,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-15 11:42:35,988 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1092 transitions. [2018-09-15 11:42:35,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-09-15 11:42:35,991 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:42:35,992 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:42:35,992 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:42:35,992 INFO L82 PathProgramCache]: Analyzing trace with hash 2090946981, now seen corresponding path program 1 times [2018-09-15 11:42:35,992 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:42:35,993 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 176 with the following transitions: [2018-09-15 11:42:35,993 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], [245], [247], [250], [258], [266], [274], [282], [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], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [769], [772], [776], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-09-15 11:42:35,999 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:42:35,999 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:43:10,709 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 11:43:10,709 INFO L272 AbstractInterpreter]: Visited 139 different actions 272 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-09-15 11:43:10,713 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 11:43:26,118 INFO L232 lantSequenceWeakener]: Weakened 173 states. On average, predicates are now at 73.69% of their original sizes. [2018-09-15 11:43:26,119 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 11:43:28,341 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 11:43:28,341 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 11:43:28,342 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-15 11:43:28,342 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 11:43:28,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-15 11:43:28,343 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-15 11:43:28,343 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-09-15 11:43:28,344 INFO L87 Difference]: Start difference. First operand 861 states and 1092 transitions. Second operand 13 states. [2018-09-15 11:43:42,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 11:43:42,529 INFO L93 Difference]: Finished difference Result 1540 states and 2338 transitions. [2018-09-15 11:43:42,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-15 11:43:42,531 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 175 [2018-09-15 11:43:42,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 11:43:42,538 INFO L225 Difference]: With dead ends: 1540 [2018-09-15 11:43:42,538 INFO L226 Difference]: Without dead ends: 1257 [2018-09-15 11:43:42,540 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 185 GetRequests, 132 SyntacticMatches, 31 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2018-09-15 11:43:42,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2018-09-15 11:43:42,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1251. [2018-09-15 11:43:42,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1251 states. [2018-09-15 11:43:42,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 1504 transitions. [2018-09-15 11:43:42,596 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 1504 transitions. Word has length 175 [2018-09-15 11:43:42,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 11:43:42,596 INFO L480 AbstractCegarLoop]: Abstraction has 1251 states and 1504 transitions. [2018-09-15 11:43:42,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-15 11:43:42,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 1504 transitions. [2018-09-15 11:43:42,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-09-15 11:43:42,600 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:43:42,600 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:43:42,601 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:43:42,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1667488390, now seen corresponding path program 1 times [2018-09-15 11:43:42,601 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:43:42,601 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 192 with the following transitions: [2018-09-15 11:43:42,602 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], [245], [247], [250], [258], [266], [274], [282], [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], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [777], [781], [785], [789], [793], [797], [808], [812], [816], [820], [824], [828], [832], [843], [847], [851], [862], [866], [869], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-09-15 11:43:42,607 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:43:42,608 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-09-15 11:43:56,256 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-09-15 11:43:56,257 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-09-15 11:43:56,257 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-15 11:43:56,289 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-15 11:43:56,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 11:43:56 BoogieIcfgContainer [2018-09-15 11:43:56,290 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-15 11:43:56,291 INFO L168 Benchmark]: Toolchain (without parser) took 259235.48 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2018-09-15 11:43:56,293 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-09-15 11:43:56,293 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1049.10 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-09-15 11:43:56,294 INFO L168 Benchmark]: Boogie Procedure Inliner took 188.41 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-15 11:43:56,295 INFO L168 Benchmark]: Boogie Preprocessor took 400.60 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 794.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -917.7 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2018-09-15 11:43:56,296 INFO L168 Benchmark]: RCFGBuilder took 4204.90 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 173.6 MB). Peak memory consumption was 173.6 MB. Max. memory is 7.1 GB. [2018-09-15 11:43:56,297 INFO L168 Benchmark]: TraceAbstraction took 253384.50 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.0 GB in the end (delta: -937.1 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2018-09-15 11:43:56,302 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 1049.10 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 188.41 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 400.60 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 794.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -917.7 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4204.90 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 173.6 MB). Peak memory consumption was 173.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 253384.50 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.0 GB in the end (delta: -937.1 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 114]: 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 inputA = 1; [L8] int inputD = 4; [L9] int inputB = 2; [L10] int inputE = 5; [L11] int inputF = 6; [L12] int inputC = 3; [L15] int a29 = 130; [L16] int a4 = 1; [L17] int a23 = 312; [L18] int a8 = 15; [L19] int a25 = 10; [L20] int a3 = 1; [L1031] int output = -1; [L1034] COND TRUE 1 [L1037] int input; [L1038] input = __VERIFIER_nondet_int() [L1039] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1042] CALL, EXPR calculate_output(input) [L23] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L26] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L29] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L32] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L35] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L38] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L41] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L44] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L47] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L50] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L53] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L56] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L59] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L62] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L65] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L68] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L71] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L74] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L77] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L80] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L83] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L86] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L89] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L92] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L95] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L98] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L101] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L104] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L107] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L110] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L113] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L116] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L119] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L122] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L125] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L128] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L131] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L134] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L137] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L140] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L143] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L146] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L149] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L152] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L155] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L158] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L161] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L164] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L167] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L170] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L173] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L176] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L179] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L182] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && 306 < a23 ) && (a8==15))) [L185] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L188] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L191] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L194] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L197] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L200] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L203] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L207] COND FALSE !((( ((140 < a29) && (245 >= a29)) && ((a25==12) && ( a23 <= -43 && ((a8==15) && ((input == 6) && (a3==1)))))) && !(a4==1))) [L214] COND FALSE !((!(a4==1) && (((a3==1) && ((((((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 4)) && a23 <= -43 )) && (a8==15)))) [L221] COND FALSE !(((a25==11) && (!(a4==1) && (((((input == 2) && (a3==1)) && a23 <= -43 ) && (a8==15)) && ((245 < a29) && (277 >= a29)) )))) [L227] COND FALSE !(((( a29 <= 140 && ((a3==1) && (((input == 5) && (a25==13)) && (a4==1)))) && (a8==15)) && 306 < a23 )) [L233] COND FALSE !((((a8==15) && (((((((a4==1) && 277 < a29 ) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 )) && (input == 6))) && (a3==1))) [L240] COND FALSE !(((((input == 4) && (( a23 <= -43 && ((a25==9) && (!(a4==1) && a29 <= 140 ))) || (((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && ((a25==13) && ( 277 < a29 && (a4==1))))))) && (a8==15)) && (a3==1))) [L247] COND FALSE !((((a3==1) && (!(a4==1) && (( a29 <= 140 && ((input == 1) && ((a25==12) || ((a25==10) || (a25==11))))) && ((-43 < a23) && (138 >= a23)) ))) && (a8==15))) [L254] COND FALSE !(((( ((245 < a29) && (277 >= a29)) && (( a23 <= -43 && (!(a4==1) && (input == 1))) && (a25==11))) && (a8==15)) && (a3==1))) [L260] COND FALSE !(((((a4==1) && (((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && (a8==15))) && 306 < a23 ) && (a3==1))) [L265] COND FALSE !((( 277 < a29 && (((a8==15) && ( a23 <= -43 && ((input == 2) && (a3==1)))) && !(a4==1))) && (a25==13))) [L268] COND FALSE !(( a29 <= 140 && ((((a8==15) && ((a3==1) && ((input == 1) && ((a25==12) || (a25==13))))) && !(a4==1)) && a23 <= -43 ))) [L275] COND FALSE !((((a4==1) && ((a8==15) && (((a3==1) && (((a25==9) || (a25==10)) && (input == 5))) && ((140 < a29) && (245 >= a29)) ))) && 306 < a23 )) [L280] COND FALSE !(((a3==1) && (((((input == 5) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9))))) && (a8==15)) && !(a4==1)) && a23 <= -43 ))) [L287] COND FALSE !(((a8==15) && ((((!(a4==1) && (((a25==12) || (a25==13)) && (input == 4))) && a23 <= -43 ) && a29 <= 140 ) && (a3==1)))) [L294] COND FALSE !(((a8==15) && (!(a4==1) && ( a23 <= -43 && ((a3==1) && ( 277 < a29 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 6)))))))) [L299] COND FALSE !(( 306 < a23 && (((a8==15) && ((a3==1) && ((a4==1) && (((a25==11) || (a25==12)) && (input == 6))))) && ((140 < a29) && (245 >= a29)) ))) [L305] COND FALSE !(((((a8==15) && ( a29 <= 140 && ( a23 <= -43 && ((input == 2) && ((a25==10) || (a25==11)))))) && !(a4==1)) && (a3==1))) [L310] COND FALSE !(((a3==1) && ( ((245 < a29) && (277 >= a29)) && (((a4==1) && ((a8==15) && ((((a25==11) || (a25==12)) || (a25==13)) && (input == 5)))) && 306 < a23 )))) [L317] COND FALSE !(((((a8==15) && (((a4==1) && ((input == 2) && ((a25==13) || ((a25==11) || (a25==12))))) && ((245 < a29) && (277 >= a29)) )) && 306 < a23 ) && (a3==1))) [L322] COND FALSE !((( 306 < a23 && ((a8==15) && ((((input == 6) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a4==1))) [L329] COND FALSE !(((((a8==15) && (((((a25==11) || (a25==12)) && (input == 4)) && 306 < a23 ) && (a3==1))) && (a4==1)) && ((140 < a29) && (245 >= a29)) )) [L334] COND FALSE !(( a23 <= -43 && ( ((140 < a29) && (245 >= a29)) && (((a8==15) && (((input == 4) && ((a25==11) || ((a25==9) || (a25==10)))) && !(a4==1))) && (a3==1))))) [L340] COND FALSE !((((((((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ( 277 < a29 && (a25==9))) && (input == 1)) && a23 <= -43 ) && (a8==15)) && !(a4==1)) && (a3==1))) [L346] COND FALSE !((!(a4==1) && ( a29 <= 140 && ((((((a25==12) || (a25==13)) && (input == 2)) && a23 <= -43 ) && (a3==1)) && (a8==15))))) [L353] COND FALSE !(((a8==15) && (( 306 < a23 && ((a3==1) && ((input == 4) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))))) && (a4==1)))) [L358] COND FALSE !(((((input == 3) && (( a23 <= -43 && ((!(a4==1) && a29 <= 140 ) && (a25==9))) || (( 306 < a23 && (( 277 < a29 && (a4==1)) && (a25==12))) || ((((a4==1) && 277 < a29 ) && (a25==13)) && 306 < a23 )))) && (a3==1)) && (a8==15))) [L365] COND FALSE !(( 306 < a23 && ((a4==1) && (((((((a25==11) || (a25==12)) || (a25==13)) && (input == 3)) && (a8==15)) && (a3==1)) && ((245 < a29) && (277 >= a29)) )))) [L370] COND FALSE !(( ((245 < a29) && (277 >= a29)) && (((((!(a4==1) && (input == 6)) && (a3==1)) && (a25==11)) && (a8==15)) && a23 <= -43 ))) [L377] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && (((a8==15) && ((input == 2) && ((( a29 <= 140 && (a25==13)) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ((a25==10) && ((140 < a29) && (245 >= a29)) )))) && (a3==1))) && !(a4==1))) [L384] COND FALSE !(( a29 <= 140 && ((a8==15) && ((((((a25==10) || (a25==11)) && (input == 3)) && a23 <= -43 ) && (a3==1)) && !(a4==1))))) [L391] COND FALSE !((((((a8==15) && (((input == 3) && (((a25==10) || (a25==11)) || (a25==12))) && (a3==1))) && a23 <= -43 ) && !(a4==1)) && 277 < a29 )) [L398] COND FALSE !(((!(a4==1) && ((a25==9) && ((a8==15) && ((a3==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 1)))))) && a29 <= 140 )) [L411] COND FALSE !(((a8==15) && ((( 306 < a23 && (((((a25==11) || (a25==12)) || (a25==13)) && (input == 6)) && ((245 < a29) && (277 >= a29)) )) && (a4==1)) && (a3==1)))) [L417] COND FALSE !((((((!(a4==1) && ((a8==15) && (input == 2))) && (a3==1)) && ((140 < a29) && (245 >= a29)) ) && (a25==12)) && a23 <= -43 )) [L422] COND FALSE !(( a23 <= -43 && (( a29 <= 140 && ((a8==15) && (!(a4==1) && (((a25==12) || (a25==13)) && (input == 3))))) && (a3==1)))) [L429] COND FALSE !(((((((input == 6) && ((((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ( ((140 < a29) && (245 >= a29)) && (a25==10)))) && (a8==15)) && (a3==1)) && !(a4==1)) && ((-43 < a23) && (138 >= a23)) )) [L436] COND FALSE !(((!(a4==1) && (((((a3==1) && (input == 4)) && (a25==11)) && ((245 < a29) && (277 >= a29)) ) && a23 <= -43 )) && (a8==15))) [L443] COND FALSE !(((a3==1) && ( ((140 < a29) && (245 >= a29)) && ( a23 <= -43 && ((a8==15) && (!(a4==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 3)))))))) [L450] COND FALSE !(((((!(a4==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 4)) && 277 < a29 )) && a23 <= -43 ) && (a8==15)) && (a3==1))) [L456] COND FALSE !(( ((140 < a29) && (245 >= a29)) && ((a8==15) && (((a25==12) && (!(a4==1) && ( a23 <= -43 && (input == 4)))) && (a3==1))))) [L463] COND FALSE !(((a3==1) && ((((((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || (((a25==9) && (!(a4==1) && a29 <= 140 )) && a23 <= -43 )) && (input == 2)) && (a8==15)))) [L470] COND FALSE !(((((input == 5) && (((((a25==12) && ((a4==1) && 277 < a29 )) && 306 < a23 ) || ((( 277 < a29 && (a4==1)) && (a25==13)) && 306 < a23 )) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 ))) && (a8==15)) && (a3==1))) [L477] COND FALSE !(((a25==12) && (((a3==1) && ((((input == 1) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) ) && !(a4==1))) && (a8==15)))) [L487] COND FALSE !((((a8==15) && (( ((-43 < a23) && (138 >= a23)) && ((input == 1) && (( ((140 < a29) && (245 >= a29)) && (a25==10)) || (((a25==13) && a29 <= 140 ) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))))) && (a3==1))) && !(a4==1))) [L500] COND FALSE !(((a3==1) && ((a8==15) && (((((( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 3)) && !(a4==1)) && a23 <= -43 )))) [L507] COND FALSE !((( a29 <= 140 && ( ((-43 < a23) && (138 >= a23)) && ((a3==1) && ((a8==15) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 2)))))) && !(a4==1))) [L514] COND FALSE !((((a4==1) && ( 306 < a23 && ((((input == 3) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a8==15))) [L526] COND FALSE !(((a4==1) && ((((a3==1) && ( 306 < a23 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 4)))) && a29 <= 140 ) && (a8==15)))) [L531] COND FALSE !((((( ((-43 < a23) && (138 >= a23)) && ((!(a4==1) && (input == 5)) && (a3==1))) && (a25==9)) && a29 <= 140 ) && (a8==15))) [L537] COND FALSE !(( 306 < a23 && (((a8==15) && ((((input == 1) && ((a25==11) || (a25==12))) && (a4==1)) && (a3==1))) && ((140 < a29) && (245 >= a29)) ))) [L542] COND FALSE !(((((a8==15) && ( a23 <= -43 && (((input == 1) && ((a25==10) || (a25==11))) && a29 <= 140 ))) && !(a4==1)) && (a3==1))) [L549] COND FALSE !(((( a23 <= -43 && (!(a4==1) && ((a3==1) && (((a25==11) || ((a25==9) || (a25==10))) && (input == 5))))) && (a8==15)) && ((140 < a29) && (245 >= a29)) )) [L555] COND FALSE !(((a3==1) && ( ((-43 < a23) && (138 >= a23)) && ((a8==15) && ((((((a25==10) || (a25==11)) || (a25==12)) && (input == 5)) && a29 <= 140 ) && !(a4==1)))))) [L561] COND FALSE !(( 306 < a23 && (((a3==1) && ( 277 < a29 && (((input == 4) && (((a25==9) || (a25==10)) || (a25==11))) && (a8==15)))) && (a4==1)))) [L566] COND FALSE !((!(a4==1) && ( a23 <= -43 && ((a8==15) && (((((a25==12) || ((a25==10) || (a25==11))) && (input == 1)) && (a3==1)) && 277 < a29 ))))) [L572] COND FALSE !(( 277 < a29 && (((a25==13) && ( a23 <= -43 && (!(a4==1) && ((input == 1) && (a3==1))))) && (a8==15)))) [L575] COND FALSE !(((( ((-43 < a23) && (138 >= a23)) && (((a25==9) && ((input == 4) && !(a4==1))) && a29 <= 140 )) && (a3==1)) && (a8==15))) [L581] COND FALSE !(((a8==15) && ((((a3==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 3)) && (a4==1))) && 306 < a23 ) && a29 <= 140 ))) [L586] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && ((a3==1) && (!(a4==1) && ((input == 4) && (((a25==10) && ((140 < a29) && (245 >= a29)) ) || (((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9)))))))) && (a8==15))) [L598] COND FALSE !(((((a8==15) && ((!(a4==1) && (((a25==11) || ((a25==9) || (a25==10))) && (input == 6))) && (a3==1))) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) )) [L603] COND FALSE !(( a29 <= 140 && (((a4==1) && ((a8==15) && (((input == 6) && (((a25==10) || (a25==11)) || (a25==12))) && 306 < a23 ))) && (a3==1)))) [L615] COND FALSE !(((((((a3==1) && ((input == 5) && ((a25==11) || (a25==12)))) && (a4==1)) && 306 < a23 ) && ((140 < a29) && (245 >= a29)) ) && (a8==15))) [L621] COND FALSE !(((((a4==1) && ( 306 < a23 && ((a8==15) && (((a25==11) || (a25==12)) && (input == 2))))) && ((140 < a29) && (245 >= a29)) ) && (a3==1))) [L628] COND FALSE !(((((a8==15) && ( a23 <= -43 && (!(a4==1) && ((a25==11) && (input == 5))))) && (a3==1)) && ((245 < a29) && (277 >= a29)) )) [L635] COND FALSE !((((((((input == 2) && ((a25==9) || (a25==10))) && (a8==15)) && ((140 < a29) && (245 >= a29)) ) && 306 < a23 ) && (a3==1)) && (a4==1))) [L642] COND FALSE !(((a8==15) && (((( 277 < a29 && ((input == 2) && ((a25==11) || ((a25==9) || (a25==10))))) && (a4==1)) && (a3==1)) && 306 < a23 ))) [L647] COND FALSE !(((((( ((-43 < a23) && (138 >= a23)) && ((input == 3) && ((a25==12) || ((a25==10) || (a25==11))))) && !(a4==1)) && (a8==15)) && a29 <= 140 ) && (a3==1))) [L658] COND FALSE !((((!(a4==1) && ((((input == 6) && ((a25==12) || ((a25==10) || (a25==11)))) && (a8==15)) && ((-43 < a23) && (138 >= a23)) )) && (a3==1)) && a29 <= 140 )) [L663] COND FALSE !(((a25==9) && (( a29 <= 140 && ((a3==1) && (!(a4==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 2))))) && (a8==15)))) [L670] COND FALSE !((!(a4==1) && ( a23 <= -43 && (((a8==15) && (((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ( ((245 < a29) && (277 >= a29)) && (a25==13))) || ((a25==9) && 277 < a29 )) && (input == 3))) && (a3==1))))) [L675] COND FALSE !((((!(a4==1) && ((a3==1) && ((input == 5) && ((( ((245 < a29) && (277 >= a29)) && (a25==12)) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ((a25==9) && 277 < a29 ))))) && a23 <= -43 ) && (a8==15))) [L681] COND FALSE !(( a23 <= -43 && (!(a4==1) && ( ((245 < a29) && (277 >= a29)) && ((a8==15) && ((a25==11) && ((a3==1) && (input == 3)))))))) [L688] COND FALSE !(((((a8==15) && ( 306 < a23 && ( ((140 < a29) && (245 >= a29)) && ((input == 1) && ((a25==9) || (a25==10)))))) && (a4==1)) && (a3==1))) [L694] COND FALSE !((!(a4==1) && (((((a3==1) && ((input == 2) && (((a25==9) || (a25==10)) || (a25==11)))) && ((140 < a29) && (245 >= a29)) ) && a23 <= -43 ) && (a8==15)))) [L706] COND FALSE !(((((((( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) ))) && (input == 6)) && (a3==1)) && 306 < a23 ) && (a4==1)) && (a8==15))) [L712] COND FALSE !(( 306 < a23 && ((a8==15) && ( 277 < a29 && ((a4==1) && ((a3==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 5)))))))) [L717] COND FALSE !(((( 277 < a29 && ((a8==15) && (((input == 6) && a23 <= -43 ) && (a25==13)))) && !(a4==1)) && (a3==1))) [L731] COND FALSE !(((a3==1) && (((!(a4==1) && ((( ((140 < a29) && (245 >= a29)) && (a25==10)) || (( a29 <= 140 && (a25==13)) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))) && (input == 3))) && ((-43 < a23) && (138 >= a23)) ) && (a8==15)))) [L738] COND TRUE ((a3==1) && (( 306 < a23 && (((a4==1) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 1))) && a29 <= 140 )) && (a8==15))) [L739] a29 = ((((a29 + 161077) + -91920) % 299861)- -300138) [L740] a25 = 9 [L742] RET return 26; [L1042] EXPR calculate_output(input) [L1042] output = calculate_output(input) [L1034] COND TRUE 1 [L1037] int input; [L1038] input = __VERIFIER_nondet_int() [L1039] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1042] CALL calculate_output(input) [L23] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L26] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L29] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L32] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L35] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L38] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L41] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L44] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L47] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L50] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L53] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L56] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L59] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L62] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L65] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L68] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L71] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L74] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L77] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L80] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L83] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L86] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L89] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L92] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L95] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L98] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L101] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L104] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L107] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L110] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L113] COND TRUE ((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15)) [L114] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 293 locations, 1 error locations. UNKNOWN Result, 253.3s OverallTime, 5 OverallIterations, 2 TraceHistogramMax, 41.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1194 SDtfs, 4399 SDslu, 780 SDs, 0 SdLazy, 6991 SolverSat, 953 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 36.6s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 571 GetRequests, 418 SyntacticMatches, 93 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1251occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 155.0s AbstIntTime, 5 AbstIntIterations, 4 AbstIntStrong, 0.9939817807464867 AbsIntWeakeningRatio, 0.15257352941176472 AbsIntAvgWeakeningVarsNumRemoved, 107.40073529411765 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 17 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/Problem11_label50_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-15_11-43-56-315.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem11_label50_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-15_11-43-56-315.csv Completed graceful shutdown