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/Problem10_label02_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 03:21:20,307 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 03:21:20,311 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 03:21:20,333 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 03:21:20,333 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 03:21:20,335 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 03:21:20,338 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 03:21:20,341 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 03:21:20,343 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 03:21:20,344 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 03:21:20,349 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 03:21:20,349 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 03:21:20,350 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 03:21:20,351 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 03:21:20,356 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 03:21:20,359 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 03:21:20,360 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 03:21:20,361 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 03:21:20,367 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 03:21:20,371 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 03:21:20,372 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 03:21:20,373 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 03:21:20,375 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 03:21:20,377 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 03:21:20,377 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 03:21:20,378 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 03:21:20,379 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 03:21:20,380 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 03:21:20,381 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 03:21:20,382 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 03:21:20,383 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 03:21:20,383 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 03:21:20,385 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 03:21:20,385 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 03:21:20,387 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 03:21:20,387 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 03:21:20,388 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-19 03:21:20,408 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 03:21:20,408 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 03:21:20,409 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 03:21:20,409 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 03:21:20,410 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 03:21:20,410 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 03:21:20,410 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 03:21:20,411 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-19 03:21:20,411 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 03:21:20,411 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 03:21:20,411 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 03:21:20,411 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-19 03:21:20,412 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 03:21:20,412 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 03:21:20,412 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 03:21:20,412 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 03:21:20,413 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 03:21:20,413 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 03:21:20,413 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 03:21:20,413 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 03:21:20,415 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 03:21:20,415 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 03:21:20,415 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 03:21:20,415 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 03:21:20,415 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 03:21:20,416 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 03:21:20,416 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 03:21:20,416 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 03:21:20,416 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 03:21:20,416 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 03:21:20,417 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 03:21:20,417 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 03:21:20,417 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 03:21:20,417 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 03:21:20,480 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 03:21:20,499 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 03:21:20,503 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 03:21:20,505 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 03:21:20,505 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 03:21:20,506 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label02_true-unreach-call.c [2018-09-19 03:21:20,868 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1c2e742a/b61590a695ed485fa9c820558cd13ebc/FLAG3b3be98a3 [2018-09-19 03:21:21,191 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 03:21:21,192 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label02_true-unreach-call.c [2018-09-19 03:21:21,211 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1c2e742a/b61590a695ed485fa9c820558cd13ebc/FLAG3b3be98a3 [2018-09-19 03:21:21,226 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1c2e742a/b61590a695ed485fa9c820558cd13ebc [2018-09-19 03:21:21,238 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 03:21:21,241 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 03:21:21,243 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 03:21:21,243 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 03:21:21,251 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 03:21:21,253 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:21:21" (1/1) ... [2018-09-19 03:21:21,257 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c4408f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:21:21, skipping insertion in model container [2018-09-19 03:21:21,257 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:21:21" (1/1) ... [2018-09-19 03:21:21,270 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 03:21:21,817 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 03:21:21,835 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 03:21:21,982 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 03:21:22,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:21:22 WrapperNode [2018-09-19 03:21:22,047 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 03:21:22,048 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 03:21:22,048 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 03:21:22,048 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 03:21:22,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:21:22" (1/1) ... [2018-09-19 03:21:22,093 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:21:22" (1/1) ... [2018-09-19 03:21:22,181 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 03:21:22,181 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 03:21:22,182 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 03:21:22,182 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 03:21:22,193 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:21:22" (1/1) ... [2018-09-19 03:21:22,193 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:21:22" (1/1) ... [2018-09-19 03:21:22,200 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:21:22" (1/1) ... [2018-09-19 03:21:22,200 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:21:22" (1/1) ... [2018-09-19 03:21:22,402 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:21:22" (1/1) ... [2018-09-19 03:21:22,428 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:21:22" (1/1) ... [2018-09-19 03:21:22,447 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:21:22" (1/1) ... [2018-09-19 03:21:22,466 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 03:21:22,467 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 03:21:22,467 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 03:21:22,467 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 03:21:22,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:21:22" (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-19 03:21:22,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 03:21:22,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 03:21:22,540 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 03:21:22,540 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 03:21:22,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 03:21:22,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 03:21:22,540 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 03:21:22,541 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 03:21:26,050 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 03:21:26,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:21:26 BoogieIcfgContainer [2018-09-19 03:21:26,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 03:21:26,053 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 03:21:26,053 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 03:21:26,057 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 03:21:26,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 03:21:21" (1/3) ... [2018-09-19 03:21:26,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbd3695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:21:26, skipping insertion in model container [2018-09-19 03:21:26,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:21:22" (2/3) ... [2018-09-19 03:21:26,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbd3695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:21:26, skipping insertion in model container [2018-09-19 03:21:26,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:21:26" (3/3) ... [2018-09-19 03:21:26,060 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label02_true-unreach-call.c [2018-09-19 03:21:26,069 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 03:21:26,077 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 03:21:26,130 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 03:21:26,131 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 03:21:26,131 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 03:21:26,132 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 03:21:26,132 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 03:21:26,132 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 03:21:26,132 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 03:21:26,132 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 03:21:26,133 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 03:21:26,160 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-19 03:21:26,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-19 03:21:26,172 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:21:26,173 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 03:21:26,174 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:21:26,180 INFO L82 PathProgramCache]: Analyzing trace with hash 417311892, now seen corresponding path program 1 times [2018-09-19 03:21:26,183 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:21:26,184 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 67 with the following transitions: [2018-09-19 03:21:26,187 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], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-19 03:21:26,271 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:21:26,271 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:21:28,542 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:21:28,543 INFO L272 AbstractInterpreter]: Visited 65 different actions 65 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-19 03:21:28,559 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:21:29,465 INFO L232 lantSequenceWeakener]: Weakened 64 states. On average, predicates are now at 76.05% of their original sizes. [2018-09-19 03:21:29,465 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:21:29,776 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:21:29,779 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:21:29,779 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 03:21:29,779 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:21:29,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 03:21:29,799 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 03:21:29,799 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 03:21:29,802 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 6 states. [2018-09-19 03:21:33,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:21:33,608 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-19 03:21:33,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 03:21:33,611 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-09-19 03:21:33,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:21:33,628 INFO L225 Difference]: With dead ends: 576 [2018-09-19 03:21:33,628 INFO L226 Difference]: Without dead ends: 358 [2018-09-19 03:21:33,635 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 65 GetRequests, 61 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-19 03:21:33,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-19 03:21:33,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-19 03:21:33,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-19 03:21:33,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-19 03:21:33,715 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 66 [2018-09-19 03:21:33,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:21:33,716 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-19 03:21:33,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 03:21:33,716 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-19 03:21:33,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-09-19 03:21:33,724 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:21:33,724 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 03:21:33,724 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:21:33,725 INFO L82 PathProgramCache]: Analyzing trace with hash 696839107, now seen corresponding path program 1 times [2018-09-19 03:21:33,725 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:21:33,725 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 138 with the following transitions: [2018-09-19 03:21:33,726 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], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:21:33,730 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:21:33,731 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:21:35,556 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:21:38,708 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:21:38,709 INFO L272 AbstractInterpreter]: Visited 78 different actions 221 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 03:21:38,722 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:21:39,939 INFO L232 lantSequenceWeakener]: Weakened 135 states. On average, predicates are now at 74.37% of their original sizes. [2018-09-19 03:21:39,939 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:21:40,500 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:21:40,501 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:21:40,501 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 03:21:40,501 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:21:40,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 03:21:40,503 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 03:21:40,503 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 03:21:40,503 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 10 states. [2018-09-19 03:21:47,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:21:47,154 INFO L93 Difference]: Finished difference Result 717 states and 1132 transitions. [2018-09-19 03:21:47,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 03:21:47,156 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 137 [2018-09-19 03:21:47,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:21:47,164 INFO L225 Difference]: With dead ends: 717 [2018-09-19 03:21:47,164 INFO L226 Difference]: Without dead ends: 511 [2018-09-19 03:21:47,169 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 143 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 03:21:47,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-09-19 03:21:47,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 505. [2018-09-19 03:21:47,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-09-19 03:21:47,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 659 transitions. [2018-09-19 03:21:47,210 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 659 transitions. Word has length 137 [2018-09-19 03:21:47,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:21:47,211 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 659 transitions. [2018-09-19 03:21:47,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 03:21:47,211 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 659 transitions. [2018-09-19 03:21:47,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-09-19 03:21:47,215 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:21:47,216 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 03:21:47,216 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:21:47,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1246975752, now seen corresponding path program 1 times [2018-09-19 03:21:47,216 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:21:47,217 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 147 with the following transitions: [2018-09-19 03:21:47,217 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], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:21:47,222 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:21:47,222 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:21:52,484 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:21:55,348 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:21:55,348 INFO L272 AbstractInterpreter]: Visited 87 different actions 248 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 03:21:55,364 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:21:56,500 INFO L232 lantSequenceWeakener]: Weakened 144 states. On average, predicates are now at 74.27% of their original sizes. [2018-09-19 03:21:56,501 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:21:57,261 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:21:57,261 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:21:57,261 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 03:21:57,261 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:21:57,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 03:21:57,262 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 03:21:57,263 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-19 03:21:57,263 INFO L87 Difference]: Start difference. First operand 505 states and 659 transitions. Second operand 13 states. [2018-09-19 03:22:08,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:22:08,344 INFO L93 Difference]: Finished difference Result 1333 states and 2076 transitions. [2018-09-19 03:22:08,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-19 03:22:08,345 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 146 [2018-09-19 03:22:08,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:22:08,353 INFO L225 Difference]: With dead ends: 1333 [2018-09-19 03:22:08,353 INFO L226 Difference]: Without dead ends: 978 [2018-09-19 03:22:08,356 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 160 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2018-09-19 03:22:08,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2018-09-19 03:22:08,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 762. [2018-09-19 03:22:08,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2018-09-19 03:22:08,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 943 transitions. [2018-09-19 03:22:08,408 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 943 transitions. Word has length 146 [2018-09-19 03:22:08,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:22:08,409 INFO L480 AbstractCegarLoop]: Abstraction has 762 states and 943 transitions. [2018-09-19 03:22:08,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 03:22:08,409 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 943 transitions. [2018-09-19 03:22:08,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-09-19 03:22:08,414 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:22:08,414 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 03:22:08,414 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:22:08,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1408154240, now seen corresponding path program 1 times [2018-09-19 03:22:08,415 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:22:08,415 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 183 with the following transitions: [2018-09-19 03:22:08,416 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], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [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], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:22:08,421 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:22:08,421 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:22:11,556 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:22:18,653 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:22:18,653 INFO L272 AbstractInterpreter]: Visited 123 different actions 356 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 03:22:18,660 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:22:19,785 INFO L232 lantSequenceWeakener]: Weakened 180 states. On average, predicates are now at 73.96% of their original sizes. [2018-09-19 03:22:19,786 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:22:20,198 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:22:20,198 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:22:20,199 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-19 03:22:20,199 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:22:20,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 03:22:20,199 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 03:22:20,200 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-09-19 03:22:20,200 INFO L87 Difference]: Start difference. First operand 762 states and 943 transitions. Second operand 12 states. [2018-09-19 03:22:30,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:22:30,787 INFO L93 Difference]: Finished difference Result 1677 states and 2200 transitions. [2018-09-19 03:22:30,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 03:22:30,788 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 182 [2018-09-19 03:22:30,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:22:30,796 INFO L225 Difference]: With dead ends: 1677 [2018-09-19 03:22:30,797 INFO L226 Difference]: Without dead ends: 1067 [2018-09-19 03:22:30,800 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 190 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2018-09-19 03:22:30,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2018-09-19 03:22:30,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1056. [2018-09-19 03:22:30,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1056 states. [2018-09-19 03:22:30,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1277 transitions. [2018-09-19 03:22:30,847 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1277 transitions. Word has length 182 [2018-09-19 03:22:30,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:22:30,848 INFO L480 AbstractCegarLoop]: Abstraction has 1056 states and 1277 transitions. [2018-09-19 03:22:30,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 03:22:30,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1277 transitions. [2018-09-19 03:22:30,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-09-19 03:22:30,854 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:22:30,854 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 03:22:30,854 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:22:30,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1512419139, now seen corresponding path program 1 times [2018-09-19 03:22:30,855 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:22:30,855 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 202 with the following transitions: [2018-09-19 03:22:30,856 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], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [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], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [754], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:22:30,870 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:22:30,871 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:22:42,077 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:22:42,078 INFO L272 AbstractInterpreter]: Visited 142 different actions 413 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 03:22:42,082 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:22:43,677 INFO L232 lantSequenceWeakener]: Weakened 199 states. On average, predicates are now at 73.84% of their original sizes. [2018-09-19 03:22:43,678 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:22:44,376 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:22:44,377 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:22:44,377 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-19 03:22:44,377 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:22:44,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 03:22:44,378 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 03:22:44,378 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-09-19 03:22:44,378 INFO L87 Difference]: Start difference. First operand 1056 states and 1277 transitions. Second operand 12 states. [2018-09-19 03:22:49,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:22:49,128 INFO L93 Difference]: Finished difference Result 2268 states and 2879 transitions. [2018-09-19 03:22:49,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-19 03:22:49,133 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 201 [2018-09-19 03:22:49,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:22:49,140 INFO L225 Difference]: With dead ends: 2268 [2018-09-19 03:22:49,140 INFO L226 Difference]: Without dead ends: 1364 [2018-09-19 03:22:49,144 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 210 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2018-09-19 03:22:49,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2018-09-19 03:22:49,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1352. [2018-09-19 03:22:49,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-09-19 03:22:49,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1605 transitions. [2018-09-19 03:22:49,201 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1605 transitions. Word has length 201 [2018-09-19 03:22:49,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:22:49,201 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 1605 transitions. [2018-09-19 03:22:49,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 03:22:49,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1605 transitions. [2018-09-19 03:22:49,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-09-19 03:22:49,206 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:22:49,206 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-19 03:22:49,206 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:22:49,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1959328001, now seen corresponding path program 1 times [2018-09-19 03:22:49,207 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:22:49,207 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 214 with the following transitions: [2018-09-19 03:22:49,207 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], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [518], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:22:49,211 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:22:49,211 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:22:50,853 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:22:56,300 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:22:56,300 INFO L272 AbstractInterpreter]: Visited 84 different actions 323 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 03:22:56,305 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:22:57,744 INFO L232 lantSequenceWeakener]: Weakened 211 states. On average, predicates are now at 73.82% of their original sizes. [2018-09-19 03:22:57,744 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:22:58,054 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:22:58,055 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:22:58,055 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 03:22:58,055 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:22:58,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 03:22:58,056 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 03:22:58,056 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 03:22:58,057 INFO L87 Difference]: Start difference. First operand 1352 states and 1605 transitions. Second operand 10 states. [2018-09-19 03:23:02,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:23:02,371 INFO L93 Difference]: Finished difference Result 2719 states and 3368 transitions. [2018-09-19 03:23:02,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 03:23:02,372 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 213 [2018-09-19 03:23:02,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:23:02,380 INFO L225 Difference]: With dead ends: 2719 [2018-09-19 03:23:02,380 INFO L226 Difference]: Without dead ends: 1521 [2018-09-19 03:23:02,384 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 220 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 03:23:02,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2018-09-19 03:23:02,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1503. [2018-09-19 03:23:02,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2018-09-19 03:23:02,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1772 transitions. [2018-09-19 03:23:02,447 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1772 transitions. Word has length 213 [2018-09-19 03:23:02,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:23:02,447 INFO L480 AbstractCegarLoop]: Abstraction has 1503 states and 1772 transitions. [2018-09-19 03:23:02,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 03:23:02,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1772 transitions. [2018-09-19 03:23:02,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-09-19 03:23:02,452 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:23:02,453 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 03:23:02,453 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:23:02,453 INFO L82 PathProgramCache]: Analyzing trace with hash 501368352, now seen corresponding path program 1 times [2018-09-19 03:23:02,453 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:23:02,454 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 225 with the following transitions: [2018-09-19 03:23:02,454 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], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:23:02,463 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:23:02,463 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:23:06,014 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:23:10,325 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:23:10,326 INFO L272 AbstractInterpreter]: Visited 88 different actions 341 times. Merged at 7 different actions 22 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 03:23:10,332 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:23:11,591 INFO L232 lantSequenceWeakener]: Weakened 222 states. On average, predicates are now at 73.77% of their original sizes. [2018-09-19 03:23:11,591 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:23:12,047 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:23:12,048 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:23:12,048 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 03:23:12,048 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:23:12,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 03:23:12,049 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 03:23:12,049 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-19 03:23:12,050 INFO L87 Difference]: Start difference. First operand 1503 states and 1772 transitions. Second operand 13 states. [2018-09-19 03:23:19,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:23:19,037 INFO L93 Difference]: Finished difference Result 3686 states and 4637 transitions. [2018-09-19 03:23:19,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 03:23:19,046 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 224 [2018-09-19 03:23:19,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:23:19,059 INFO L225 Difference]: With dead ends: 3686 [2018-09-19 03:23:19,059 INFO L226 Difference]: Without dead ends: 2337 [2018-09-19 03:23:19,065 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 236 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2018-09-19 03:23:19,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2018-09-19 03:23:19,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2189. [2018-09-19 03:23:19,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2189 states. [2018-09-19 03:23:19,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2189 states to 2189 states and 2615 transitions. [2018-09-19 03:23:19,152 INFO L78 Accepts]: Start accepts. Automaton has 2189 states and 2615 transitions. Word has length 224 [2018-09-19 03:23:19,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:23:19,153 INFO L480 AbstractCegarLoop]: Abstraction has 2189 states and 2615 transitions. [2018-09-19 03:23:19,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 03:23:19,153 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 2615 transitions. [2018-09-19 03:23:19,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-09-19 03:23:19,158 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:23:19,159 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 03:23:19,159 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:23:19,159 INFO L82 PathProgramCache]: Analyzing trace with hash -2050132244, now seen corresponding path program 1 times [2018-09-19 03:23:19,159 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:23:19,160 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 235 with the following transitions: [2018-09-19 03:23:19,160 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], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:23:19,164 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:23:19,164 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:23:22,971 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:23:39,177 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:23:39,178 INFO L272 AbstractInterpreter]: Visited 96 different actions 555 times. Merged at 7 different actions 34 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 03:23:39,185 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:23:40,681 INFO L232 lantSequenceWeakener]: Weakened 232 states. On average, predicates are now at 73.72% of their original sizes. [2018-09-19 03:23:40,682 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:23:41,170 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:23:41,171 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:23:41,171 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 03:23:41,171 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:23:41,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 03:23:41,172 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 03:23:41,172 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-19 03:23:41,172 INFO L87 Difference]: Start difference. First operand 2189 states and 2615 transitions. Second operand 13 states. [2018-09-19 03:23:52,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:23:52,495 INFO L93 Difference]: Finished difference Result 5360 states and 6747 transitions. [2018-09-19 03:23:52,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 03:23:52,507 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 234 [2018-09-19 03:23:52,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:23:52,528 INFO L225 Difference]: With dead ends: 5360 [2018-09-19 03:23:52,528 INFO L226 Difference]: Without dead ends: 3325 [2018-09-19 03:23:52,536 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 246 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2018-09-19 03:23:52,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3325 states. [2018-09-19 03:23:52,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3325 to 3019. [2018-09-19 03:23:52,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3019 states. [2018-09-19 03:23:52,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3019 states to 3019 states and 3715 transitions. [2018-09-19 03:23:52,672 INFO L78 Accepts]: Start accepts. Automaton has 3019 states and 3715 transitions. Word has length 234 [2018-09-19 03:23:52,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:23:52,673 INFO L480 AbstractCegarLoop]: Abstraction has 3019 states and 3715 transitions. [2018-09-19 03:23:52,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 03:23:52,673 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 3715 transitions. [2018-09-19 03:23:52,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-09-19 03:23:52,681 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:23:52,681 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-19 03:23:52,681 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:23:52,682 INFO L82 PathProgramCache]: Analyzing trace with hash 151529664, now seen corresponding path program 1 times [2018-09-19 03:23:52,682 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:23:52,682 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 251 with the following transitions: [2018-09-19 03:23:52,683 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], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [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], [659], [663], [666], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:23:52,686 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:23:52,687 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:23:54,411 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:24:05,408 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:24:05,408 INFO L272 AbstractInterpreter]: Visited 121 different actions 471 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 03:24:05,410 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:24:06,700 INFO L232 lantSequenceWeakener]: Weakened 248 states. On average, predicates are now at 73.66% of their original sizes. [2018-09-19 03:24:06,701 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:24:07,289 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:24:07,290 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:24:07,290 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 03:24:07,290 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:24:07,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 03:24:07,291 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 03:24:07,291 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-19 03:24:07,291 INFO L87 Difference]: Start difference. First operand 3019 states and 3715 transitions. Second operand 13 states. [2018-09-19 03:24:20,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:24:20,485 INFO L93 Difference]: Finished difference Result 6300 states and 8063 transitions. [2018-09-19 03:24:20,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 03:24:20,489 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 250 [2018-09-19 03:24:20,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:24:20,503 INFO L225 Difference]: With dead ends: 6300 [2018-09-19 03:24:20,504 INFO L226 Difference]: Without dead ends: 3435 [2018-09-19 03:24:20,511 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 262 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2018-09-19 03:24:20,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3435 states. [2018-09-19 03:24:20,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3435 to 3305. [2018-09-19 03:24:20,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3305 states. [2018-09-19 03:24:20,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3305 states to 3305 states and 4062 transitions. [2018-09-19 03:24:20,625 INFO L78 Accepts]: Start accepts. Automaton has 3305 states and 4062 transitions. Word has length 250 [2018-09-19 03:24:20,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:24:20,627 INFO L480 AbstractCegarLoop]: Abstraction has 3305 states and 4062 transitions. [2018-09-19 03:24:20,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 03:24:20,627 INFO L276 IsEmpty]: Start isEmpty. Operand 3305 states and 4062 transitions. [2018-09-19 03:24:20,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-09-19 03:24:20,637 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:24:20,637 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-19 03:24:20,637 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:24:20,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1058847117, now seen corresponding path program 1 times [2018-09-19 03:24:20,638 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:24:20,638 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 256 with the following transitions: [2018-09-19 03:24:20,638 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], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [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], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:24:20,641 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:24:20,642 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:24:23,616 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:24:36,790 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:24:36,790 INFO L272 AbstractInterpreter]: Visited 124 different actions 603 times. Merged at 7 different actions 27 times. Never widened. Found 5 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 03:24:36,796 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:24:38,338 INFO L232 lantSequenceWeakener]: Weakened 253 states. On average, predicates are now at 73.64% of their original sizes. [2018-09-19 03:24:38,338 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:24:38,712 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:24:38,713 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:24:38,713 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 03:24:38,713 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:24:38,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 03:24:38,714 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 03:24:38,714 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 03:24:38,714 INFO L87 Difference]: Start difference. First operand 3305 states and 4062 transitions. Second operand 10 states. [2018-09-19 03:24:45,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:24:45,875 INFO L93 Difference]: Finished difference Result 6634 states and 8307 transitions. [2018-09-19 03:24:45,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 03:24:45,876 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 255 [2018-09-19 03:24:45,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:24:45,891 INFO L225 Difference]: With dead ends: 6634 [2018-09-19 03:24:45,891 INFO L226 Difference]: Without dead ends: 3483 [2018-09-19 03:24:45,899 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 262 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 03:24:45,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3483 states. [2018-09-19 03:24:46,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3483 to 3457. [2018-09-19 03:24:46,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3457 states. [2018-09-19 03:24:46,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3457 states to 3457 states and 4260 transitions. [2018-09-19 03:24:46,022 INFO L78 Accepts]: Start accepts. Automaton has 3457 states and 4260 transitions. Word has length 255 [2018-09-19 03:24:46,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:24:46,023 INFO L480 AbstractCegarLoop]: Abstraction has 3457 states and 4260 transitions. [2018-09-19 03:24:46,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 03:24:46,023 INFO L276 IsEmpty]: Start isEmpty. Operand 3457 states and 4260 transitions. [2018-09-19 03:24:46,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-09-19 03:24:46,030 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:24:46,031 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 03:24:46,031 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:24:46,031 INFO L82 PathProgramCache]: Analyzing trace with hash -485114912, now seen corresponding path program 1 times [2018-09-19 03:24:46,032 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:24:46,032 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 257 with the following transitions: [2018-09-19 03:24:46,032 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], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [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], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:24:46,035 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:24:46,035 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:24:50,839 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:25:04,278 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:25:04,278 INFO L272 AbstractInterpreter]: Visited 118 different actions 687 times. Merged at 7 different actions 34 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 03:25:04,285 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:25:05,997 INFO L232 lantSequenceWeakener]: Weakened 254 states. On average, predicates are now at 73.64% of their original sizes. [2018-09-19 03:25:05,997 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:25:06,754 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:25:06,754 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:25:06,755 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 03:25:06,755 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:25:06,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 03:25:06,756 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 03:25:06,756 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-19 03:25:06,756 INFO L87 Difference]: Start difference. First operand 3457 states and 4260 transitions. Second operand 13 states. [2018-09-19 03:25:14,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:25:14,073 INFO L93 Difference]: Finished difference Result 8601 states and 11011 transitions. [2018-09-19 03:25:14,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 03:25:14,074 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 256 [2018-09-19 03:25:14,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:25:14,097 INFO L225 Difference]: With dead ends: 8601 [2018-09-19 03:25:14,097 INFO L226 Difference]: Without dead ends: 5298 [2018-09-19 03:25:14,107 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 268 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2018-09-19 03:25:14,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5298 states. [2018-09-19 03:25:14,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5298 to 4845. [2018-09-19 03:25:14,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4845 states. [2018-09-19 03:25:14,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4845 states to 4845 states and 6065 transitions. [2018-09-19 03:25:14,260 INFO L78 Accepts]: Start accepts. Automaton has 4845 states and 6065 transitions. Word has length 256 [2018-09-19 03:25:14,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:25:14,261 INFO L480 AbstractCegarLoop]: Abstraction has 4845 states and 6065 transitions. [2018-09-19 03:25:14,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 03:25:14,261 INFO L276 IsEmpty]: Start isEmpty. Operand 4845 states and 6065 transitions. [2018-09-19 03:25:14,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-09-19 03:25:14,269 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:25:14,269 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 03:25:14,270 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:25:14,270 INFO L82 PathProgramCache]: Analyzing trace with hash 230335824, now seen corresponding path program 1 times [2018-09-19 03:25:14,270 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:25:14,270 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 265 with the following transitions: [2018-09-19 03:25:14,271 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], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [542], [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], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:25:14,274 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:25:14,274 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:25:17,162 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. Received shutdown request... [2018-09-19 03:25:31,180 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-09-19 03:25:31,181 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-09-19 03:25:31,182 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 03:25:31,229 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 03:25:31,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 03:25:31 BoogieIcfgContainer [2018-09-19 03:25:31,230 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 03:25:31,231 INFO L168 Benchmark]: Toolchain (without parser) took 249991.75 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.3 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-19 03:25:31,233 INFO L168 Benchmark]: CDTParser took 0.19 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-19 03:25:31,233 INFO L168 Benchmark]: CACSL2BoogieTranslator took 805.11 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-19 03:25:31,234 INFO L168 Benchmark]: Boogie Procedure Inliner took 132.96 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-19 03:25:31,235 INFO L168 Benchmark]: Boogie Preprocessor took 284.81 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -829.5 MB). Peak memory consumption was 30.1 MB. Max. memory is 7.1 GB. [2018-09-19 03:25:31,235 INFO L168 Benchmark]: RCFGBuilder took 3585.27 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: 107.6 MB). Peak memory consumption was 107.6 MB. Max. memory is 7.1 GB. [2018-09-19 03:25:31,236 INFO L168 Benchmark]: TraceAbstraction took 245177.21 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-09-19 03:25:31,241 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.19 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 805.11 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 132.96 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 284.81 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -829.5 MB). Peak memory consumption was 30.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3585.27 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: 107.6 MB). Peak memory consumption was 107.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 245177.21 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 181]: 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 inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; [L579] int output = -1; [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND TRUE ((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0)) [L426] a1 = ((((a1 / 5) * 5) / 5) + 505228) [L427] a10 = 1 [L429] RET return 25; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND TRUE (((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9)) [L266] a1 = ((((a1 / 5) - -367248) * 1) - 890938) [L267] a10 = 0 [L268] a19 = 10 [L270] RET return 26; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND TRUE (((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)) [L181] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 245.1s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 87.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2167 SDtfs, 11109 SDslu, 3967 SDs, 0 SdLazy, 22654 SolverSat, 2521 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 75.3s Time, PredicateUnifierStatistics: 22 DeclaredPredicates, 2262 GetRequests, 2050 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 887 ImplicationChecksByTransitivity, 9.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4845occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 136.0s AbstIntTime, 12 AbstIntIterations, 11 AbstIntStrong, 0.9946829407995829 AbsIntWeakeningRatio, 0.1161170459823502 AbsIntAvgWeakeningVarsNumRemoved, 894.7533673943335 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 11 MinimizatonAttempts, 1328 StatesRemovedByMinimization, 11 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/Problem10_label02_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_03-25-31-260.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label02_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_03-25-31-260.csv Completed graceful shutdown