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_INTCON-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label01_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 12:37:48,393 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 12:37:48,396 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 12:37:48,413 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 12:37:48,413 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 12:37:48,415 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 12:37:48,416 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 12:37:48,421 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 12:37:48,423 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 12:37:48,425 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 12:37:48,428 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 12:37:48,429 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 12:37:48,430 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 12:37:48,431 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 12:37:48,435 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 12:37:48,436 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 12:37:48,437 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 12:37:48,446 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 12:37:48,451 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 12:37:48,452 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 12:37:48,453 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 12:37:48,455 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 12:37:48,457 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 12:37:48,457 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 12:37:48,458 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 12:37:48,458 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 12:37:48,459 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 12:37:48,460 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 12:37:48,461 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 12:37:48,462 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 12:37:48,462 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 12:37:48,463 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 12:37:48,463 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 12:37:48,463 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 12:37:48,467 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 12:37:48,468 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 12:37:48,469 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf [2018-09-19 12:37:48,489 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 12:37:48,489 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 12:37:48,491 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 12:37:48,491 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 12:37:48,492 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 12:37:48,492 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 12:37:48,492 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 12:37:48,492 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-19 12:37:48,493 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-19 12:37:48,493 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 12:37:48,493 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 12:37:48,493 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 12:37:48,495 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 12:37:48,495 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 12:37:48,495 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 12:37:48,495 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 12:37:48,495 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 12:37:48,496 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 12:37:48,496 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 12:37:48,496 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 12:37:48,498 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 12:37:48,498 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 12:37:48,498 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 12:37:48,499 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 12:37:48,499 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 12:37:48,499 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 12:37:48,499 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 12:37:48,499 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 12:37:48,500 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 12:37:48,500 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 12:37:48,500 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 12:37:48,500 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 12:37:48,500 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 12:37:48,501 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 12:37:48,574 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 12:37:48,593 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 12:37:48,600 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 12:37:48,602 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 12:37:48,603 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 12:37:48,604 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label01_true-unreach-call.c [2018-09-19 12:37:49,009 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/515eab632/08bfb5600add48da8a66df7c0e900526/FLAG1ecf71ee1 [2018-09-19 12:37:49,282 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 12:37:49,282 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label01_true-unreach-call.c [2018-09-19 12:37:49,298 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/515eab632/08bfb5600add48da8a66df7c0e900526/FLAG1ecf71ee1 [2018-09-19 12:37:49,329 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/515eab632/08bfb5600add48da8a66df7c0e900526 [2018-09-19 12:37:49,350 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 12:37:49,354 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 12:37:49,355 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 12:37:49,355 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 12:37:49,363 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 12:37:49,364 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 12:37:49" (1/1) ... [2018-09-19 12:37:49,367 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b58cb10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:37:49, skipping insertion in model container [2018-09-19 12:37:49,368 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 12:37:49" (1/1) ... [2018-09-19 12:37:49,380 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 12:37:49,824 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 12:37:49,843 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 12:37:49,977 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 12:37:50,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:37:50 WrapperNode [2018-09-19 12:37:50,024 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 12:37:50,025 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 12:37:50,026 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 12:37:50,026 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 12:37:50,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:37:50" (1/1) ... [2018-09-19 12:37:50,061 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:37:50" (1/1) ... [2018-09-19 12:37:50,124 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 12:37:50,124 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 12:37:50,125 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 12:37:50,125 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 12:37:50,135 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:37:50" (1/1) ... [2018-09-19 12:37:50,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:37:50" (1/1) ... [2018-09-19 12:37:50,142 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:37:50" (1/1) ... [2018-09-19 12:37:50,142 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:37:50" (1/1) ... [2018-09-19 12:37:50,167 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:37:50" (1/1) ... [2018-09-19 12:37:50,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:37:50" (1/1) ... [2018-09-19 12:37:50,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:37:50" (1/1) ... [2018-09-19 12:37:50,379 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 12:37:50,380 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 12:37:50,380 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 12:37:50,380 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 12:37:50,386 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:37:50" (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 12:37:50,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 12:37:50,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 12:37:50,461 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 12:37:50,461 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 12:37:50,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 12:37:50,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 12:37:50,462 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 12:37:50,462 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 12:37:53,768 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 12:37:53,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 12:37:53 BoogieIcfgContainer [2018-09-19 12:37:53,769 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 12:37:53,770 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 12:37:53,770 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 12:37:53,774 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 12:37:53,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 12:37:49" (1/3) ... [2018-09-19 12:37:53,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5534d2a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 12:37:53, skipping insertion in model container [2018-09-19 12:37:53,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:37:50" (2/3) ... [2018-09-19 12:37:53,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5534d2a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 12:37:53, skipping insertion in model container [2018-09-19 12:37:53,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 12:37:53" (3/3) ... [2018-09-19 12:37:53,781 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label01_true-unreach-call.c [2018-09-19 12:37:53,793 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 12:37:53,807 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 12:37:53,875 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 12:37:53,876 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 12:37:53,876 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 12:37:53,876 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 12:37:53,876 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 12:37:53,876 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 12:37:53,877 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 12:37:53,877 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 12:37:53,877 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 12:37:53,914 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-19 12:37:53,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-19 12:37:53,925 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:37:53,926 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:37:53,928 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:37:53,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1691291748, now seen corresponding path program 1 times [2018-09-19 12:37:53,936 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:37:53,937 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2018-09-19 12:37:53,940 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], [381], [383], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-19 12:37:53,982 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:37:53,982 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:37:54,331 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:37:54,335 INFO L272 AbstractInterpreter]: Visited 59 different actions 59 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-19 12:37:54,383 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:37:54,651 INFO L232 lantSequenceWeakener]: Weakened 57 states. On average, predicates are now at 75.5% of their original sizes. [2018-09-19 12:37:54,651 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:37:54,914 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:37:54,916 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:37:54,917 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 12:37:54,917 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:37:54,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 12:37:54,933 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 12:37:54,934 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 12:37:54,936 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 6 states. [2018-09-19 12:37:56,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:37:56,969 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-19 12:37:56,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 12:37:56,971 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-09-19 12:37:56,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:37:56,997 INFO L225 Difference]: With dead ends: 576 [2018-09-19 12:37:56,998 INFO L226 Difference]: Without dead ends: 358 [2018-09-19 12:37:57,005 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 59 GetRequests, 55 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 12:37:57,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-19 12:37:57,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-19 12:37:57,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-19 12:37:57,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-19 12:37:57,083 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 60 [2018-09-19 12:37:57,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:37:57,084 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-19 12:37:57,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 12:37:57,085 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-19 12:37:57,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-09-19 12:37:57,092 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:37:57,092 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:37:57,093 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:37:57,093 INFO L82 PathProgramCache]: Analyzing trace with hash 703281579, now seen corresponding path program 1 times [2018-09-19 12:37:57,093 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:37:57,094 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 132 with the following transitions: [2018-09-19 12:37:57,094 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], [381], [383], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:37:57,099 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:37:57,100 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:37:57,209 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:37:57,379 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:37:57,380 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 12:37:57,419 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:37:57,735 INFO L232 lantSequenceWeakener]: Weakened 128 states. On average, predicates are now at 74.03% of their original sizes. [2018-09-19 12:37:57,735 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:37:58,224 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:37:58,224 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:37:58,224 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:37:58,224 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:37:58,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:37:58,226 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:37:58,226 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:37:58,227 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 10 states. [2018-09-19 12:38:02,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:38:02,568 INFO L93 Difference]: Finished difference Result 717 states and 1132 transitions. [2018-09-19 12:38:02,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 12:38:02,569 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 131 [2018-09-19 12:38:02,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:38:02,581 INFO L225 Difference]: With dead ends: 717 [2018-09-19 12:38:02,581 INFO L226 Difference]: Without dead ends: 511 [2018-09-19 12:38:02,584 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 137 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:38:02,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-09-19 12:38:02,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 505. [2018-09-19 12:38:02,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-09-19 12:38:02,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 659 transitions. [2018-09-19 12:38:02,625 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 659 transitions. Word has length 131 [2018-09-19 12:38:02,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:38:02,626 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 659 transitions. [2018-09-19 12:38:02,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:38:02,626 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 659 transitions. [2018-09-19 12:38:02,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-19 12:38:02,631 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:38:02,631 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:38:02,631 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:38:02,632 INFO L82 PathProgramCache]: Analyzing trace with hash 999905648, now seen corresponding path program 1 times [2018-09-19 12:38:02,632 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:38:02,632 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 141 with the following transitions: [2018-09-19 12:38:02,633 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], [381], [383], [386], [394], [402], [410], [418], [426], [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 12:38:02,641 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:38:02,641 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:38:02,738 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:38:02,846 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:38:02,847 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 12:38:02,885 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:38:03,093 INFO L232 lantSequenceWeakener]: Weakened 137 states. On average, predicates are now at 73.95% of their original sizes. [2018-09-19 12:38:03,093 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:38:03,382 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:38:03,383 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:38:03,383 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:38:03,383 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:38:03,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:38:03,384 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:38:03,384 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:38:03,384 INFO L87 Difference]: Start difference. First operand 505 states and 659 transitions. Second operand 10 states. [2018-09-19 12:38:07,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:38:07,249 INFO L93 Difference]: Finished difference Result 1149 states and 1716 transitions. [2018-09-19 12:38:07,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:38:07,252 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2018-09-19 12:38:07,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:38:07,264 INFO L225 Difference]: With dead ends: 1149 [2018-09-19 12:38:07,265 INFO L226 Difference]: Without dead ends: 794 [2018-09-19 12:38:07,267 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 147 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:38:07,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-09-19 12:38:07,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 783. [2018-09-19 12:38:07,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2018-09-19 12:38:07,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 991 transitions. [2018-09-19 12:38:07,317 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 991 transitions. Word has length 140 [2018-09-19 12:38:07,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:38:07,317 INFO L480 AbstractCegarLoop]: Abstraction has 783 states and 991 transitions. [2018-09-19 12:38:07,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:38:07,318 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 991 transitions. [2018-09-19 12:38:07,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-09-19 12:38:07,322 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:38:07,323 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:38:07,323 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:38:07,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1433611800, now seen corresponding path program 1 times [2018-09-19 12:38:07,324 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:38:07,324 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 177 with the following transitions: [2018-09-19 12:38:07,325 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], [381], [383], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:38:07,330 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:38:07,330 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:38:07,475 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:38:07,750 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:38:07,751 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 12:38:07,788 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:38:08,156 INFO L232 lantSequenceWeakener]: Weakened 173 states. On average, predicates are now at 73.69% of their original sizes. [2018-09-19 12:38:08,157 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:38:08,612 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:38:08,613 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:38:08,613 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:38:08,613 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:38:08,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:38:08,614 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:38:08,614 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:38:08,615 INFO L87 Difference]: Start difference. First operand 783 states and 991 transitions. Second operand 10 states. [2018-09-19 12:38:11,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:38:11,542 INFO L93 Difference]: Finished difference Result 1723 states and 2312 transitions. [2018-09-19 12:38:11,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 12:38:11,542 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 176 [2018-09-19 12:38:11,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:38:11,549 INFO L225 Difference]: With dead ends: 1723 [2018-09-19 12:38:11,549 INFO L226 Difference]: Without dead ends: 1090 [2018-09-19 12:38:11,552 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 182 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:38:11,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2018-09-19 12:38:11,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1081. [2018-09-19 12:38:11,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1081 states. [2018-09-19 12:38:11,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1341 transitions. [2018-09-19 12:38:11,590 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1341 transitions. Word has length 176 [2018-09-19 12:38:11,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:38:11,590 INFO L480 AbstractCegarLoop]: Abstraction has 1081 states and 1341 transitions. [2018-09-19 12:38:11,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:38:11,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1341 transitions. [2018-09-19 12:38:11,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-09-19 12:38:11,594 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:38:11,595 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:38:11,595 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:38:11,596 INFO L82 PathProgramCache]: Analyzing trace with hash -627860181, now seen corresponding path program 1 times [2018-09-19 12:38:11,596 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:38:11,596 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 196 with the following transitions: [2018-09-19 12:38:11,597 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], [381], [383], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [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 12:38:11,601 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:38:11,601 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:38:11,841 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:38:11,841 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 12:38:11,886 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:38:12,095 INFO L232 lantSequenceWeakener]: Weakened 192 states. On average, predicates are now at 73.6% of their original sizes. [2018-09-19 12:38:12,095 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:38:12,304 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:38:12,304 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:38:12,304 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:38:12,304 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:38:12,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:38:12,305 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:38:12,305 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:38:12,305 INFO L87 Difference]: Start difference. First operand 1081 states and 1341 transitions. Second operand 10 states. [2018-09-19 12:38:15,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:38:15,010 INFO L93 Difference]: Finished difference Result 2464 states and 3181 transitions. [2018-09-19 12:38:15,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 12:38:15,022 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 195 [2018-09-19 12:38:15,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:38:15,031 INFO L225 Difference]: With dead ends: 2464 [2018-09-19 12:38:15,031 INFO L226 Difference]: Without dead ends: 1533 [2018-09-19 12:38:15,035 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 201 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:38:15,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2018-09-19 12:38:15,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1521. [2018-09-19 12:38:15,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1521 states. [2018-09-19 12:38:15,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 1832 transitions. [2018-09-19 12:38:15,084 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 1832 transitions. Word has length 195 [2018-09-19 12:38:15,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:38:15,084 INFO L480 AbstractCegarLoop]: Abstraction has 1521 states and 1832 transitions. [2018-09-19 12:38:15,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:38:15,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1832 transitions. [2018-09-19 12:38:15,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-09-19 12:38:15,088 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:38:15,089 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:38:15,089 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:38:15,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1484130887, now seen corresponding path program 1 times [2018-09-19 12:38:15,090 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:38:15,090 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 208 with the following transitions: [2018-09-19 12:38:15,091 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], [381], [383], [386], [394], [402], [410], [418], [426], [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 12:38:15,101 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:38:15,101 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:38:15,146 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:38:15,260 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:38:15,260 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 12:38:15,274 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:38:15,585 INFO L232 lantSequenceWeakener]: Weakened 204 states. On average, predicates are now at 73.59% of their original sizes. [2018-09-19 12:38:15,586 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:38:15,791 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:38:15,792 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:38:15,792 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:38:15,792 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:38:15,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:38:15,793 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:38:15,793 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:38:15,793 INFO L87 Difference]: Start difference. First operand 1521 states and 1832 transitions. Second operand 10 states. [2018-09-19 12:38:17,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:38:17,618 INFO L93 Difference]: Finished difference Result 3061 states and 3823 transitions. [2018-09-19 12:38:17,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:38:17,624 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 207 [2018-09-19 12:38:17,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:38:17,637 INFO L225 Difference]: With dead ends: 3061 [2018-09-19 12:38:17,638 INFO L226 Difference]: Without dead ends: 1690 [2018-09-19 12:38:17,642 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 214 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:38:17,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2018-09-19 12:38:17,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1672. [2018-09-19 12:38:17,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2018-09-19 12:38:17,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1998 transitions. [2018-09-19 12:38:17,701 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1998 transitions. Word has length 207 [2018-09-19 12:38:17,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:38:17,702 INFO L480 AbstractCegarLoop]: Abstraction has 1672 states and 1998 transitions. [2018-09-19 12:38:17,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:38:17,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1998 transitions. [2018-09-19 12:38:17,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-09-19 12:38:17,706 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:38:17,706 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:38:17,706 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:38:17,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1303190157, now seen corresponding path program 1 times [2018-09-19 12:38:17,707 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:38:17,707 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 214 with the following transitions: [2018-09-19 12:38:17,707 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], [381], [383], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:38:17,712 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:38:17,712 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:38:17,760 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:38:17,864 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:38:17,865 INFO L272 AbstractInterpreter]: Visited 88 different actions 340 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:38:17,892 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:38:18,101 INFO L232 lantSequenceWeakener]: Weakened 210 states. On average, predicates are now at 73.57% of their original sizes. [2018-09-19 12:38:18,102 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:38:18,339 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:38:18,339 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:38:18,339 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:38:18,340 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:38:18,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:38:18,340 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:38:18,340 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:38:18,341 INFO L87 Difference]: Start difference. First operand 1672 states and 1998 transitions. Second operand 10 states. [2018-09-19 12:38:21,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:38:21,910 INFO L93 Difference]: Finished difference Result 3508 states and 4339 transitions. [2018-09-19 12:38:21,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:38:21,917 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 213 [2018-09-19 12:38:21,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:38:21,927 INFO L225 Difference]: With dead ends: 3508 [2018-09-19 12:38:21,927 INFO L226 Difference]: Without dead ends: 1986 [2018-09-19 12:38:21,931 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 220 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:38:21,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1986 states. [2018-09-19 12:38:21,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1986 to 1956. [2018-09-19 12:38:21,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1956 states. [2018-09-19 12:38:21,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1956 states and 2368 transitions. [2018-09-19 12:38:21,989 INFO L78 Accepts]: Start accepts. Automaton has 1956 states and 2368 transitions. Word has length 213 [2018-09-19 12:38:21,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:38:21,989 INFO L480 AbstractCegarLoop]: Abstraction has 1956 states and 2368 transitions. [2018-09-19 12:38:21,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:38:21,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1956 states and 2368 transitions. [2018-09-19 12:38:21,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-09-19 12:38:21,995 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:38:21,995 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:38:21,995 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:38:21,996 INFO L82 PathProgramCache]: Analyzing trace with hash 2027668200, now seen corresponding path program 1 times [2018-09-19 12:38:21,996 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:38:21,996 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 219 with the following transitions: [2018-09-19 12:38:21,996 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], [381], [383], [386], [394], [402], [410], [418], [426], [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 12:38:21,999 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:38:21,999 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:38:22,049 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:38:22,260 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:38:22,260 INFO L272 AbstractInterpreter]: Visited 88 different actions 340 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:38:22,299 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:38:22,521 INFO L232 lantSequenceWeakener]: Weakened 215 states. On average, predicates are now at 73.55% of their original sizes. [2018-09-19 12:38:22,522 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:38:22,698 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:38:22,698 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:38:22,699 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:38:22,699 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:38:22,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:38:22,699 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:38:22,700 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:38:22,700 INFO L87 Difference]: Start difference. First operand 1956 states and 2368 transitions. Second operand 10 states. [2018-09-19 12:38:26,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:38:26,177 INFO L93 Difference]: Finished difference Result 4370 states and 5531 transitions. [2018-09-19 12:38:26,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:38:26,185 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 218 [2018-09-19 12:38:26,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:38:26,198 INFO L225 Difference]: With dead ends: 4370 [2018-09-19 12:38:26,199 INFO L226 Difference]: Without dead ends: 2564 [2018-09-19 12:38:26,204 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 225 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:38:26,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2018-09-19 12:38:26,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 2527. [2018-09-19 12:38:26,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2527 states. [2018-09-19 12:38:26,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2527 states to 2527 states and 3089 transitions. [2018-09-19 12:38:26,277 INFO L78 Accepts]: Start accepts. Automaton has 2527 states and 3089 transitions. Word has length 218 [2018-09-19 12:38:26,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:38:26,279 INFO L480 AbstractCegarLoop]: Abstraction has 2527 states and 3089 transitions. [2018-09-19 12:38:26,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:38:26,280 INFO L276 IsEmpty]: Start isEmpty. Operand 2527 states and 3089 transitions. [2018-09-19 12:38:26,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-09-19 12:38:26,285 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:38:26,286 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:38:26,286 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:38:26,286 INFO L82 PathProgramCache]: Analyzing trace with hash 13937568, now seen corresponding path program 1 times [2018-09-19 12:38:26,287 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:38:26,287 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 223 with the following transitions: [2018-09-19 12:38:26,287 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], [381], [383], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [542], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:38:26,289 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:38:26,289 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:38:26,337 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:38:26,511 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:38:26,512 INFO L272 AbstractInterpreter]: Visited 90 different actions 434 times. Merged at 7 different actions 28 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:38:26,553 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:38:26,786 INFO L232 lantSequenceWeakener]: Weakened 219 states. On average, predicates are now at 73.53% of their original sizes. [2018-09-19 12:38:26,787 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:38:27,074 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:38:27,075 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:38:27,075 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:38:27,075 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:38:27,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:38:27,076 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:38:27,076 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:38:27,077 INFO L87 Difference]: Start difference. First operand 2527 states and 3089 transitions. Second operand 10 states. [2018-09-19 12:38:29,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:38:29,618 INFO L93 Difference]: Finished difference Result 5813 states and 7415 transitions. [2018-09-19 12:38:29,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:38:29,619 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 222 [2018-09-19 12:38:29,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:38:29,634 INFO L225 Difference]: With dead ends: 5813 [2018-09-19 12:38:29,634 INFO L226 Difference]: Without dead ends: 3436 [2018-09-19 12:38:29,640 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 229 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:38:29,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3436 states. [2018-09-19 12:38:29,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3436 to 3377. [2018-09-19 12:38:29,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3377 states. [2018-09-19 12:38:29,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3377 states to 3377 states and 4175 transitions. [2018-09-19 12:38:29,715 INFO L78 Accepts]: Start accepts. Automaton has 3377 states and 4175 transitions. Word has length 222 [2018-09-19 12:38:29,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:38:29,717 INFO L480 AbstractCegarLoop]: Abstraction has 3377 states and 4175 transitions. [2018-09-19 12:38:29,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:38:29,717 INFO L276 IsEmpty]: Start isEmpty. Operand 3377 states and 4175 transitions. [2018-09-19 12:38:29,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-09-19 12:38:29,725 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:38:29,726 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:38:29,726 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:38:29,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1948028084, now seen corresponding path program 1 times [2018-09-19 12:38:29,726 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:38:29,727 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 229 with the following transitions: [2018-09-19 12:38:29,727 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], [381], [383], [386], [394], [402], [410], [418], [426], [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 12:38:29,729 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:38:29,730 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:38:29,776 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:38:35,079 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:38:35,080 INFO L272 AbstractInterpreter]: Visited 96 different actions 464 times. Merged at 7 different actions 28 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:38:35,086 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:38:36,518 INFO L232 lantSequenceWeakener]: Weakened 225 states. On average, predicates are now at 73.51% of their original sizes. [2018-09-19 12:38:36,519 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:38:36,614 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:38:36,615 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:38:36,615 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:38:36,615 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:38:36,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:38:36,616 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:38:36,616 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:38:36,616 INFO L87 Difference]: Start difference. First operand 3377 states and 4175 transitions. Second operand 10 states. [2018-09-19 12:38:39,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:38:39,393 INFO L93 Difference]: Finished difference Result 8372 states and 10738 transitions. [2018-09-19 12:38:39,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:38:39,400 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 228 [2018-09-19 12:38:39,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:38:39,420 INFO L225 Difference]: With dead ends: 8372 [2018-09-19 12:38:39,420 INFO L226 Difference]: Without dead ends: 5145 [2018-09-19 12:38:39,430 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 235 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:38:39,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5145 states. [2018-09-19 12:38:39,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5145 to 5045. [2018-09-19 12:38:39,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5045 states. [2018-09-19 12:38:39,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5045 states to 5045 states and 6270 transitions. [2018-09-19 12:38:39,555 INFO L78 Accepts]: Start accepts. Automaton has 5045 states and 6270 transitions. Word has length 228 [2018-09-19 12:38:39,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:38:39,555 INFO L480 AbstractCegarLoop]: Abstraction has 5045 states and 6270 transitions. [2018-09-19 12:38:39,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:38:39,556 INFO L276 IsEmpty]: Start isEmpty. Operand 5045 states and 6270 transitions. [2018-09-19 12:38:39,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-09-19 12:38:39,563 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:38:39,564 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:38:39,564 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:38:39,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1456014569, now seen corresponding path program 1 times [2018-09-19 12:38:39,564 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:38:39,565 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 244 with the following transitions: [2018-09-19 12:38:39,565 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], [381], [383], [386], [394], [402], [410], [418], [426], [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], [626], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:38:39,567 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:38:39,567 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:38:39,614 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:38:39,877 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:38:39,877 INFO L272 AbstractInterpreter]: Visited 111 different actions 539 times. Merged at 7 different actions 28 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:38:39,912 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:38:40,155 INFO L232 lantSequenceWeakener]: Weakened 240 states. On average, predicates are now at 73.46% of their original sizes. [2018-09-19 12:38:40,155 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:38:40,265 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:38:40,265 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:38:40,265 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:38:40,265 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:38:40,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:38:40,266 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:38:40,266 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:38:40,266 INFO L87 Difference]: Start difference. First operand 5045 states and 6270 transitions. Second operand 10 states. [2018-09-19 12:38:43,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:38:43,631 INFO L93 Difference]: Finished difference Result 10399 states and 13068 transitions. [2018-09-19 12:38:43,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:38:43,631 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 243 [2018-09-19 12:38:43,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:38:43,652 INFO L225 Difference]: With dead ends: 10399 [2018-09-19 12:38:43,652 INFO L226 Difference]: Without dead ends: 5504 [2018-09-19 12:38:43,663 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 250 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:38:43,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5504 states. [2018-09-19 12:38:43,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5504 to 5429. [2018-09-19 12:38:43,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5429 states. [2018-09-19 12:38:43,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5429 states to 5429 states and 6773 transitions. [2018-09-19 12:38:43,774 INFO L78 Accepts]: Start accepts. Automaton has 5429 states and 6773 transitions. Word has length 243 [2018-09-19 12:38:43,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:38:43,775 INFO L480 AbstractCegarLoop]: Abstraction has 5429 states and 6773 transitions. [2018-09-19 12:38:43,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:38:43,775 INFO L276 IsEmpty]: Start isEmpty. Operand 5429 states and 6773 transitions. [2018-09-19 12:38:43,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-09-19 12:38:43,783 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:38:43,784 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:38:43,784 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:38:43,784 INFO L82 PathProgramCache]: Analyzing trace with hash -696568837, now seen corresponding path program 1 times [2018-09-19 12:38:43,785 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:38:43,785 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 250 with the following transitions: [2018-09-19 12:38:43,785 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], [381], [383], [386], [394], [402], [410], [418], [426], [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 12:38:43,788 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:38:43,788 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:38:43,861 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:38:44,061 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:38:44,061 INFO L272 AbstractInterpreter]: Visited 124 different actions 483 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 12:38:44,100 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:38:44,319 INFO L232 lantSequenceWeakener]: Weakened 246 states. On average, predicates are now at 73.44% of their original sizes. [2018-09-19 12:38:44,320 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:38:44,409 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:38:44,409 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:38:44,409 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:38:44,409 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:38:44,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:38:44,410 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:38:44,410 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:38:44,410 INFO L87 Difference]: Start difference. First operand 5429 states and 6773 transitions. Second operand 10 states. [2018-09-19 12:38:47,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:38:47,600 INFO L93 Difference]: Finished difference Result 11196 states and 14212 transitions. [2018-09-19 12:38:47,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:38:47,607 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 249 [2018-09-19 12:38:47,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:38:47,629 INFO L225 Difference]: With dead ends: 11196 [2018-09-19 12:38:47,630 INFO L226 Difference]: Without dead ends: 5917 [2018-09-19 12:38:47,642 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 256 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:38:47,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5917 states. [2018-09-19 12:38:47,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5917 to 5887. [2018-09-19 12:38:47,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5887 states. [2018-09-19 12:38:47,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5887 states to 5887 states and 7406 transitions. [2018-09-19 12:38:47,756 INFO L78 Accepts]: Start accepts. Automaton has 5887 states and 7406 transitions. Word has length 249 [2018-09-19 12:38:47,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:38:47,757 INFO L480 AbstractCegarLoop]: Abstraction has 5887 states and 7406 transitions. [2018-09-19 12:38:47,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:38:47,757 INFO L276 IsEmpty]: Start isEmpty. Operand 5887 states and 7406 transitions. [2018-09-19 12:38:47,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-09-19 12:38:47,766 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:38:47,767 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:38:47,767 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:38:47,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1114142552, now seen corresponding path program 1 times [2018-09-19 12:38:47,768 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:38:47,768 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 251 with the following transitions: [2018-09-19 12:38:47,768 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], [381], [383], [386], [394], [402], [410], [418], [426], [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 12:38:47,772 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:38:47,772 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:38:47,816 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:38:48,099 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:38:48,099 INFO L272 AbstractInterpreter]: Visited 118 different actions 574 times. Merged at 7 different actions 28 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:38:48,136 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:38:48,395 INFO L232 lantSequenceWeakener]: Weakened 247 states. On average, predicates are now at 73.44% of their original sizes. [2018-09-19 12:38:48,395 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:38:48,564 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:38:48,564 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:38:48,565 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:38:48,565 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:38:48,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:38:48,565 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:38:48,566 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:38:48,566 INFO L87 Difference]: Start difference. First operand 5887 states and 7406 transitions. Second operand 10 states. [2018-09-19 12:38:51,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:38:51,399 INFO L93 Difference]: Finished difference Result 13421 states and 17237 transitions. [2018-09-19 12:38:51,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:38:51,400 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 250 [2018-09-19 12:38:51,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:38:51,422 INFO L225 Difference]: With dead ends: 13421 [2018-09-19 12:38:51,422 INFO L226 Difference]: Without dead ends: 7684 [2018-09-19 12:38:51,437 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 257 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:38:51,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7684 states. [2018-09-19 12:38:51,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7684 to 7560. [2018-09-19 12:38:51,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7560 states. [2018-09-19 12:38:51,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7560 states to 7560 states and 9639 transitions. [2018-09-19 12:38:51,580 INFO L78 Accepts]: Start accepts. Automaton has 7560 states and 9639 transitions. Word has length 250 [2018-09-19 12:38:51,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:38:51,581 INFO L480 AbstractCegarLoop]: Abstraction has 7560 states and 9639 transitions. [2018-09-19 12:38:51,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:38:51,581 INFO L276 IsEmpty]: Start isEmpty. Operand 7560 states and 9639 transitions. [2018-09-19 12:38:51,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-09-19 12:38:51,596 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:38:51,597 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:38:51,597 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:38:51,597 INFO L82 PathProgramCache]: Analyzing trace with hash -355774872, now seen corresponding path program 1 times [2018-09-19 12:38:51,597 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:38:51,598 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 283 with the following transitions: [2018-09-19 12:38:51,598 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], [381], [383], [386], [394], [402], [410], [418], [426], [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], [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], [755], [759], [763], [767], [771], [775], [779], [782], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:38:51,601 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:38:51,602 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:38:51,645 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:38:51,939 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:38:51,940 INFO L272 AbstractInterpreter]: Visited 150 different actions 587 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 12:38:51,977 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:38:52,271 INFO L232 lantSequenceWeakener]: Weakened 279 states. On average, predicates are now at 73.36% of their original sizes. [2018-09-19 12:38:52,272 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:38:52,410 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:38:52,411 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:38:52,411 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:38:52,411 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:38:52,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:38:52,412 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:38:52,412 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:38:52,412 INFO L87 Difference]: Start difference. First operand 7560 states and 9639 transitions. Second operand 10 states. [2018-09-19 12:38:56,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:38:56,008 INFO L93 Difference]: Finished difference Result 16780 states and 21621 transitions. [2018-09-19 12:38:56,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:38:56,014 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 282 [2018-09-19 12:38:56,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:38:56,034 INFO L225 Difference]: With dead ends: 16780 [2018-09-19 12:38:56,034 INFO L226 Difference]: Without dead ends: 9370 [2018-09-19 12:38:56,049 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 289 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:38:56,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9370 states. [2018-09-19 12:38:56,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9370 to 9238. [2018-09-19 12:38:56,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9238 states. [2018-09-19 12:38:56,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9238 states to 9238 states and 11908 transitions. [2018-09-19 12:38:56,221 INFO L78 Accepts]: Start accepts. Automaton has 9238 states and 11908 transitions. Word has length 282 [2018-09-19 12:38:56,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:38:56,222 INFO L480 AbstractCegarLoop]: Abstraction has 9238 states and 11908 transitions. [2018-09-19 12:38:56,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:38:56,222 INFO L276 IsEmpty]: Start isEmpty. Operand 9238 states and 11908 transitions. [2018-09-19 12:38:56,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-09-19 12:38:56,238 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:38:56,239 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:38:56,239 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:38:56,239 INFO L82 PathProgramCache]: Analyzing trace with hash 175334139, now seen corresponding path program 1 times [2018-09-19 12:38:56,240 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:38:56,240 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 292 with the following transitions: [2018-09-19 12:38:56,240 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], [381], [383], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [526], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:38:56,242 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:38:56,242 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:38:56,284 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:38:56,454 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:38:56,454 INFO L272 AbstractInterpreter]: Visited 89 different actions 438 times. Merged at 8 different actions 37 times. Never widened. Found 9 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:38:56,483 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:38:56,751 INFO L232 lantSequenceWeakener]: Weakened 288 states. On average, predicates are now at 73.37% of their original sizes. [2018-09-19 12:38:56,751 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:38:57,285 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:38:57,286 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:38:57,286 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:38:57,286 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:38:57,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:38:57,287 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:38:57,287 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:38:57,287 INFO L87 Difference]: Start difference. First operand 9238 states and 11908 transitions. Second operand 10 states. [2018-09-19 12:39:00,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:00,583 INFO L93 Difference]: Finished difference Result 20530 states and 26690 transitions. [2018-09-19 12:39:00,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:39:00,592 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 291 [2018-09-19 12:39:00,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:00,625 INFO L225 Difference]: With dead ends: 20530 [2018-09-19 12:39:00,625 INFO L226 Difference]: Without dead ends: 11442 [2018-09-19 12:39:00,644 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 298 GetRequests, 282 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 12:39:00,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11442 states. [2018-09-19 12:39:00,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11442 to 11268. [2018-09-19 12:39:00,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11268 states. [2018-09-19 12:39:00,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11268 states to 11268 states and 14578 transitions. [2018-09-19 12:39:00,844 INFO L78 Accepts]: Start accepts. Automaton has 11268 states and 14578 transitions. Word has length 291 [2018-09-19 12:39:00,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:00,845 INFO L480 AbstractCegarLoop]: Abstraction has 11268 states and 14578 transitions. [2018-09-19 12:39:00,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:00,845 INFO L276 IsEmpty]: Start isEmpty. Operand 11268 states and 14578 transitions. [2018-09-19 12:39:00,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-09-19 12:39:00,866 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:00,867 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:39:00,867 INFO L423 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:00,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1714707307, now seen corresponding path program 1 times [2018-09-19 12:39:00,868 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:00,868 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 300 with the following transitions: [2018-09-19 12:39:00,868 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], [381], [383], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [534], [535], [538], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:00,870 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:00,870 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:00,914 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:39:01,108 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:01,109 INFO L272 AbstractInterpreter]: Visited 90 different actions 440 times. Merged at 8 different actions 34 times. Never widened. Found 8 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:39:01,148 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:01,426 INFO L232 lantSequenceWeakener]: Weakened 296 states. On average, predicates are now at 73.35% of their original sizes. [2018-09-19 12:39:01,426 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:02,059 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:02,059 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:02,059 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:02,059 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:02,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:02,060 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:02,060 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:02,061 INFO L87 Difference]: Start difference. First operand 11268 states and 14578 transitions. Second operand 10 states. [2018-09-19 12:39:05,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:05,359 INFO L93 Difference]: Finished difference Result 24169 states and 31450 transitions. [2018-09-19 12:39:05,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 12:39:05,361 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 299 [2018-09-19 12:39:05,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:05,387 INFO L225 Difference]: With dead ends: 24169 [2018-09-19 12:39:05,387 INFO L226 Difference]: Without dead ends: 13051 [2018-09-19 12:39:05,401 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 306 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:39:05,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13051 states. [2018-09-19 12:39:05,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13051 to 12904. [2018-09-19 12:39:05,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12904 states. [2018-09-19 12:39:05,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12904 states to 12904 states and 16702 transitions. [2018-09-19 12:39:05,585 INFO L78 Accepts]: Start accepts. Automaton has 12904 states and 16702 transitions. Word has length 299 [2018-09-19 12:39:05,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:05,586 INFO L480 AbstractCegarLoop]: Abstraction has 12904 states and 16702 transitions. [2018-09-19 12:39:05,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:05,586 INFO L276 IsEmpty]: Start isEmpty. Operand 12904 states and 16702 transitions. [2018-09-19 12:39:05,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-09-19 12:39:05,608 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:05,608 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:39:05,608 INFO L423 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:05,609 INFO L82 PathProgramCache]: Analyzing trace with hash 2094218927, now seen corresponding path program 1 times [2018-09-19 12:39:05,609 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:05,609 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 302 with the following transitions: [2018-09-19 12:39:05,609 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], [381], [383], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [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 12:39:05,611 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:05,611 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:05,650 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:39:10,706 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:10,706 INFO L272 AbstractInterpreter]: Visited 97 different actions 573 times. Merged at 8 different actions 46 times. Widened at 1 different actions 1 times. Found 11 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:39:10,721 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:12,539 INFO L232 lantSequenceWeakener]: Weakened 298 states. On average, predicates are now at 73.35% of their original sizes. [2018-09-19 12:39:12,540 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:12,669 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:12,669 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:12,670 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:12,670 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:12,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:12,670 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:12,670 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:12,671 INFO L87 Difference]: Start difference. First operand 12904 states and 16702 transitions. Second operand 10 states. [2018-09-19 12:39:18,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:18,596 INFO L93 Difference]: Finished difference Result 27274 states and 35434 transitions. [2018-09-19 12:39:18,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:39:18,597 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 301 [2018-09-19 12:39:18,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:18,630 INFO L225 Difference]: With dead ends: 27274 [2018-09-19 12:39:18,631 INFO L226 Difference]: Without dead ends: 14520 [2018-09-19 12:39:18,649 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 308 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:39:18,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14520 states. [2018-09-19 12:39:18,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14520 to 14234. [2018-09-19 12:39:18,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14234 states. [2018-09-19 12:39:18,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14234 states to 14234 states and 18516 transitions. [2018-09-19 12:39:18,915 INFO L78 Accepts]: Start accepts. Automaton has 14234 states and 18516 transitions. Word has length 301 [2018-09-19 12:39:18,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:18,916 INFO L480 AbstractCegarLoop]: Abstraction has 14234 states and 18516 transitions. [2018-09-19 12:39:18,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:18,916 INFO L276 IsEmpty]: Start isEmpty. Operand 14234 states and 18516 transitions. [2018-09-19 12:39:18,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-09-19 12:39:18,940 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:18,941 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 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 12:39:18,941 INFO L423 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:18,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1777002052, now seen corresponding path program 1 times [2018-09-19 12:39:18,942 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:18,942 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 309 with the following transitions: [2018-09-19 12:39:18,942 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], [381], [383], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:18,944 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:18,945 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:18,985 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:39:19,161 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:19,161 INFO L272 AbstractInterpreter]: Visited 104 different actions 510 times. Merged at 8 different actions 34 times. Never widened. Found 8 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:39:19,173 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:19,445 INFO L232 lantSequenceWeakener]: Weakened 305 states. On average, predicates are now at 73.34% of their original sizes. [2018-09-19 12:39:19,445 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:19,829 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:19,829 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:19,829 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:19,829 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:19,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:19,830 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:19,830 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:19,830 INFO L87 Difference]: Start difference. First operand 14234 states and 18516 transitions. Second operand 10 states. [2018-09-19 12:39:22,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:22,439 INFO L93 Difference]: Finished difference Result 29317 states and 38295 transitions. [2018-09-19 12:39:22,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:39:22,439 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 308 [2018-09-19 12:39:22,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:22,474 INFO L225 Difference]: With dead ends: 29317 [2018-09-19 12:39:22,475 INFO L226 Difference]: Without dead ends: 15233 [2018-09-19 12:39:22,494 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 315 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:39:22,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15233 states. [2018-09-19 12:39:22,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15233 to 15014. [2018-09-19 12:39:22,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15014 states. [2018-09-19 12:39:22,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15014 states to 15014 states and 19527 transitions. [2018-09-19 12:39:22,736 INFO L78 Accepts]: Start accepts. Automaton has 15014 states and 19527 transitions. Word has length 308 [2018-09-19 12:39:22,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:22,736 INFO L480 AbstractCegarLoop]: Abstraction has 15014 states and 19527 transitions. [2018-09-19 12:39:22,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:22,737 INFO L276 IsEmpty]: Start isEmpty. Operand 15014 states and 19527 transitions. [2018-09-19 12:39:22,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-09-19 12:39:22,757 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:22,758 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:39:22,758 INFO L423 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:22,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1867642939, now seen corresponding path program 1 times [2018-09-19 12:39:22,758 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:22,758 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 312 with the following transitions: [2018-09-19 12:39:22,759 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], [381], [383], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [546], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:22,761 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:22,761 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:22,800 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:39:28,011 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:28,011 INFO L272 AbstractInterpreter]: Visited 97 different actions 568 times. Merged at 8 different actions 41 times. Widened at 1 different actions 1 times. Found 9 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:39:28,017 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:29,554 INFO L232 lantSequenceWeakener]: Weakened 308 states. On average, predicates are now at 73.33% of their original sizes. [2018-09-19 12:39:29,554 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:29,675 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:29,675 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:29,675 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:29,675 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:29,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:29,676 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:29,676 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:29,676 INFO L87 Difference]: Start difference. First operand 15014 states and 19527 transitions. Second operand 10 states. [2018-09-19 12:39:33,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:33,337 INFO L93 Difference]: Finished difference Result 31248 states and 40901 transitions. [2018-09-19 12:39:33,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:39:33,338 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 311 [2018-09-19 12:39:33,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:33,374 INFO L225 Difference]: With dead ends: 31248 [2018-09-19 12:39:33,374 INFO L226 Difference]: Without dead ends: 16384 [2018-09-19 12:39:33,394 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 318 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:39:33,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16384 states. [2018-09-19 12:39:33,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16384 to 16100. [2018-09-19 12:39:33,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16100 states. [2018-09-19 12:39:33,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16100 states to 16100 states and 21070 transitions. [2018-09-19 12:39:33,650 INFO L78 Accepts]: Start accepts. Automaton has 16100 states and 21070 transitions. Word has length 311 [2018-09-19 12:39:33,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:33,651 INFO L480 AbstractCegarLoop]: Abstraction has 16100 states and 21070 transitions. [2018-09-19 12:39:33,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:33,651 INFO L276 IsEmpty]: Start isEmpty. Operand 16100 states and 21070 transitions. [2018-09-19 12:39:33,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-09-19 12:39:33,669 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:33,669 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:39:33,670 INFO L423 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:33,670 INFO L82 PathProgramCache]: Analyzing trace with hash 368065139, now seen corresponding path program 1 times [2018-09-19 12:39:33,670 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:33,670 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 316 with the following transitions: [2018-09-19 12:39:33,670 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], [381], [383], [386], [394], [402], [410], [418], [426], [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], [562], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:33,672 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:33,673 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:33,711 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:39:39,541 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:39,541 INFO L272 AbstractInterpreter]: Visited 97 different actions 664 times. Merged at 8 different actions 51 times. Widened at 1 different actions 2 times. Found 11 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:39:39,575 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:41,399 INFO L232 lantSequenceWeakener]: Weakened 312 states. On average, predicates are now at 73.32% of their original sizes. [2018-09-19 12:39:41,399 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:41,505 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:41,505 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:41,505 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:41,505 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:41,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:41,506 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:41,506 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:41,506 INFO L87 Difference]: Start difference. First operand 16100 states and 21070 transitions. Second operand 10 states. [2018-09-19 12:39:44,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:44,406 INFO L93 Difference]: Finished difference Result 33283 states and 43657 transitions. [2018-09-19 12:39:44,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:39:44,406 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 315 [2018-09-19 12:39:44,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:44,435 INFO L225 Difference]: With dead ends: 33283 [2018-09-19 12:39:44,436 INFO L226 Difference]: Without dead ends: 17333 [2018-09-19 12:39:44,455 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 322 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:39:44,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17333 states. [2018-09-19 12:39:44,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17333 to 17020. [2018-09-19 12:39:44,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17020 states. [2018-09-19 12:39:44,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17020 states to 17020 states and 22326 transitions. [2018-09-19 12:39:44,693 INFO L78 Accepts]: Start accepts. Automaton has 17020 states and 22326 transitions. Word has length 315 [2018-09-19 12:39:44,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:44,693 INFO L480 AbstractCegarLoop]: Abstraction has 17020 states and 22326 transitions. [2018-09-19 12:39:44,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:44,693 INFO L276 IsEmpty]: Start isEmpty. Operand 17020 states and 22326 transitions. [2018-09-19 12:39:44,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-09-19 12:39:44,704 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:44,704 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:39:44,705 INFO L423 AbstractCegarLoop]: === Iteration 21 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:44,705 INFO L82 PathProgramCache]: Analyzing trace with hash -196668192, now seen corresponding path program 1 times [2018-09-19 12:39:44,705 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:44,705 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 319 with the following transitions: [2018-09-19 12:39:44,706 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], [381], [383], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [782], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:44,708 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:44,708 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:44,774 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:39:44,988 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:44,989 INFO L272 AbstractInterpreter]: Visited 150 different actions 587 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 12:39:44,996 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:45,258 INFO L232 lantSequenceWeakener]: Weakened 315 states. On average, predicates are now at 73.29% of their original sizes. [2018-09-19 12:39:45,258 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:45,346 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:45,347 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:45,347 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:45,347 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:45,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:45,347 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:45,348 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:45,348 INFO L87 Difference]: Start difference. First operand 17020 states and 22326 transitions. Second operand 10 states. [2018-09-19 12:39:51,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:51,108 INFO L93 Difference]: Finished difference Result 35215 states and 46290 transitions. [2018-09-19 12:39:51,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:39:51,108 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 318 [2018-09-19 12:39:51,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:51,137 INFO L225 Difference]: With dead ends: 35215 [2018-09-19 12:39:51,137 INFO L226 Difference]: Without dead ends: 18345 [2018-09-19 12:39:51,153 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 325 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:39:51,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18345 states. [2018-09-19 12:39:51,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18345 to 17954. [2018-09-19 12:39:51,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17954 states. [2018-09-19 12:39:51,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17954 states to 17954 states and 23579 transitions. [2018-09-19 12:39:51,391 INFO L78 Accepts]: Start accepts. Automaton has 17954 states and 23579 transitions. Word has length 318 [2018-09-19 12:39:51,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:51,391 INFO L480 AbstractCegarLoop]: Abstraction has 17954 states and 23579 transitions. [2018-09-19 12:39:51,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:51,391 INFO L276 IsEmpty]: Start isEmpty. Operand 17954 states and 23579 transitions. [2018-09-19 12:39:51,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-09-19 12:39:51,401 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:51,401 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:39:51,401 INFO L423 AbstractCegarLoop]: === Iteration 22 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:51,402 INFO L82 PathProgramCache]: Analyzing trace with hash 76027195, now seen corresponding path program 1 times [2018-09-19 12:39:51,402 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:51,402 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 324 with the following transitions: [2018-09-19 12:39:51,402 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], [381], [383], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [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 12:39:51,404 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:51,404 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:51,438 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:39:51,668 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:51,668 INFO L272 AbstractInterpreter]: Visited 119 different actions 704 times. Merged at 8 different actions 45 times. Widened at 1 different actions 1 times. Found 11 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:39:51,675 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:51,928 INFO L232 lantSequenceWeakener]: Weakened 320 states. On average, predicates are now at 73.31% of their original sizes. [2018-09-19 12:39:51,928 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:52,022 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:52,023 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:52,023 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:52,023 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:52,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:52,024 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:52,024 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:52,024 INFO L87 Difference]: Start difference. First operand 17954 states and 23579 transitions. Second operand 10 states. [2018-09-19 12:39:54,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:54,910 INFO L93 Difference]: Finished difference Result 37767 states and 49724 transitions. [2018-09-19 12:39:54,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:39:54,913 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 323 [2018-09-19 12:39:54,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:54,946 INFO L225 Difference]: With dead ends: 37767 [2018-09-19 12:39:54,947 INFO L226 Difference]: Without dead ends: 19963 [2018-09-19 12:39:54,967 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 330 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:39:54,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19963 states. [2018-09-19 12:39:55,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19963 to 19520. [2018-09-19 12:39:55,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19520 states. [2018-09-19 12:39:55,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19520 states to 19520 states and 25686 transitions. [2018-09-19 12:39:55,196 INFO L78 Accepts]: Start accepts. Automaton has 19520 states and 25686 transitions. Word has length 323 [2018-09-19 12:39:55,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:55,196 INFO L480 AbstractCegarLoop]: Abstraction has 19520 states and 25686 transitions. [2018-09-19 12:39:55,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:55,197 INFO L276 IsEmpty]: Start isEmpty. Operand 19520 states and 25686 transitions. [2018-09-19 12:39:55,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-09-19 12:39:55,209 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:55,209 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:39:55,209 INFO L423 AbstractCegarLoop]: === Iteration 23 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:55,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1586189313, now seen corresponding path program 1 times [2018-09-19 12:39:55,209 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:55,210 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 338 with the following transitions: [2018-09-19 12:39:55,210 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], [381], [383], [386], [394], [402], [410], [418], [426], [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], [562], [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 12:39:55,212 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:55,212 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:55,245 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:39:55,510 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:55,511 INFO L272 AbstractInterpreter]: Visited 119 different actions 819 times. Merged at 8 different actions 52 times. Widened at 1 different actions 2 times. Found 11 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:39:55,519 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:55,808 INFO L232 lantSequenceWeakener]: Weakened 334 states. On average, predicates are now at 73.28% of their original sizes. [2018-09-19 12:39:55,808 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:55,909 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:55,909 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:55,909 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:55,909 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:55,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:55,910 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:55,910 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:55,910 INFO L87 Difference]: Start difference. First operand 19520 states and 25686 transitions. Second operand 10 states. [2018-09-19 12:39:59,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:59,068 INFO L93 Difference]: Finished difference Result 40792 states and 53797 transitions. [2018-09-19 12:39:59,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:39:59,068 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 337 [2018-09-19 12:39:59,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:59,109 INFO L225 Difference]: With dead ends: 40792 [2018-09-19 12:39:59,110 INFO L226 Difference]: Without dead ends: 21422 [2018-09-19 12:39:59,131 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 344 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:39:59,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21422 states. [2018-09-19 12:39:59,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21422 to 21074. [2018-09-19 12:39:59,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21074 states. [2018-09-19 12:39:59,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21074 states to 21074 states and 27733 transitions. [2018-09-19 12:39:59,659 INFO L78 Accepts]: Start accepts. Automaton has 21074 states and 27733 transitions. Word has length 337 [2018-09-19 12:39:59,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:59,660 INFO L480 AbstractCegarLoop]: Abstraction has 21074 states and 27733 transitions. [2018-09-19 12:39:59,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:59,660 INFO L276 IsEmpty]: Start isEmpty. Operand 21074 states and 27733 transitions. [2018-09-19 12:39:59,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-09-19 12:39:59,680 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:59,680 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:39:59,681 INFO L423 AbstractCegarLoop]: === Iteration 24 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:59,681 INFO L82 PathProgramCache]: Analyzing trace with hash 2057155564, now seen corresponding path program 1 times [2018-09-19 12:39:59,681 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:59,681 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 339 with the following transitions: [2018-09-19 12:39:59,681 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], [381], [383], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [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], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [694], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:59,684 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:59,684 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:59,718 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:39:59,980 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-19 12:39:59,980 INFO L272 AbstractInterpreter]: Visited 130 different actions 636 times. Merged at 8 different actions 34 times. Never widened. Found 8 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:39:59,986 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 12:40:00,037 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 12:40:00,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 12:40:00 BoogieIcfgContainer [2018-09-19 12:40:00,037 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 12:40:00,038 INFO L168 Benchmark]: Toolchain (without parser) took 130687.01 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 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 568.1 MB. Max. memory is 7.1 GB. [2018-09-19 12:40:00,040 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 12:40:00,040 INFO L168 Benchmark]: CACSL2BoogieTranslator took 669.74 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 12:40:00,041 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.83 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 12:40:00,042 INFO L168 Benchmark]: Boogie Preprocessor took 254.77 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 775.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -866.4 MB). Peak memory consumption was 32.8 MB. Max. memory is 7.1 GB. [2018-09-19 12:40:00,043 INFO L168 Benchmark]: RCFGBuilder took 3389.48 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: 109.1 MB). Peak memory consumption was 109.1 MB. Max. memory is 7.1 GB. [2018-09-19 12:40:00,043 INFO L168 Benchmark]: TraceAbstraction took 126267.25 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 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 497.1 MB. Max. memory is 7.1 GB. [2018-09-19 12:40:00,048 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.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 669.74 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 98.83 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 254.77 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 775.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -866.4 MB). Peak memory consumption was 32.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3389.48 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: 109.1 MB). Peak memory consumption was 109.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 126267.25 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 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 497.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 163]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L7] int 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 TRUE (((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0)) [L255] a1 = (((a1 / 5) + 110755) + 220746) [L256] a10 = 1 [L257] a19 = 8 [L259] RET return -1; [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 TRUE (((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0)) [L245] a1 = (((((a1 % 25)- -13) - 42605) / 5) - -8517) [L246] a10 = 3 [L248] 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, 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 FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) [L430] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) [L436] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) [L442] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) [L448] COND TRUE ((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0))) [L449] a1 = ((((((a1 % 25)- -12) - 0) * 5) % 25)- -13) [L450] a10 = 3 [L451] a19 = 6 [L453] RET return -1; [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 TRUE (((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)) [L163] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 126.1s OverallTime, 24 OverallIterations, 4 TraceHistogramMax, 77.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3940 SDtfs, 16771 SDslu, 8411 SDs, 0 SdLazy, 46284 SolverSat, 4750 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 62.6s Time, PredicateUnifierStatistics: 46 DeclaredPredicates, 5767 GetRequests, 5414 SyntacticMatches, 0 SemanticMatches, 353 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21074occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 27.6s AbstIntTime, 24 AbstIntIterations, 23 AbstIntStrong, 0.9968725583277599 AbsIntWeakeningRatio, 0.10904540579191992 AbsIntAvgWeakeningVarsNumRemoved, 21.747586700035754 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 23 MinimizatonAttempts, 3250 StatesRemovedByMinimization, 23 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_label01_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_12-40-00-065.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label01_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_12-40-00-065.csv Received shutdown request...