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_OCT-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label31_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 10:01:11,909 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 10:01:11,911 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 10:01:11,925 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 10:01:11,925 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 10:01:11,926 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 10:01:11,928 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 10:01:11,931 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 10:01:11,933 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 10:01:11,933 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 10:01:11,934 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 10:01:11,936 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 10:01:11,937 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 10:01:11,938 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 10:01:11,939 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 10:01:11,940 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 10:01:11,940 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 10:01:11,942 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 10:01:11,945 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 10:01:11,946 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 10:01:11,947 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 10:01:11,949 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 10:01:11,951 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 10:01:11,951 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 10:01:11,952 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 10:01:11,953 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 10:01:11,954 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 10:01:11,954 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 10:01:11,955 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 10:01:11,957 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 10:01:11,957 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 10:01:11,958 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 10:01:11,958 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 10:01:11,958 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 10:01:11,959 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 10:01:11,960 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 10:01:11,961 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf [2018-09-19 10:01:11,978 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 10:01:11,979 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 10:01:11,980 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 10:01:11,980 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 10:01:11,980 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 10:01:11,980 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 10:01:11,980 INFO L133 SettingsManager]: * Congruence Domain=false [2018-09-19 10:01:11,981 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 10:01:11,981 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2018-09-19 10:01:11,981 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 10:01:11,981 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 10:01:11,981 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 10:01:11,982 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-19 10:01:11,982 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 10:01:11,983 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 10:01:11,983 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 10:01:11,983 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 10:01:11,983 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 10:01:11,983 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 10:01:11,984 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 10:01:11,984 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 10:01:11,984 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 10:01:11,984 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 10:01:11,984 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 10:01:11,985 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 10:01:11,985 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 10:01:11,985 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 10:01:11,985 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 10:01:11,985 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 10:01:11,986 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 10:01:11,986 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 10:01:11,986 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 10:01:11,986 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 10:01:11,986 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 10:01:11,987 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 10:01:12,035 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 10:01:12,055 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 10:01:12,061 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 10:01:12,063 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 10:01:12,064 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 10:01:12,064 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label31_true-unreach-call.c [2018-09-19 10:01:12,462 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1b83d32d/ca5a178bb902416897a462b5c4db8fed/FLAGd9f5be761 [2018-09-19 10:01:12,797 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 10:01:12,800 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label31_true-unreach-call.c [2018-09-19 10:01:12,817 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1b83d32d/ca5a178bb902416897a462b5c4db8fed/FLAGd9f5be761 [2018-09-19 10:01:12,841 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1b83d32d/ca5a178bb902416897a462b5c4db8fed [2018-09-19 10:01:12,854 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 10:01:12,858 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 10:01:12,859 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 10:01:12,859 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 10:01:12,870 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 10:01:12,871 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 10:01:12" (1/1) ... [2018-09-19 10:01:12,875 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f414e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:01:12, skipping insertion in model container [2018-09-19 10:01:12,875 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 10:01:12" (1/1) ... [2018-09-19 10:01:12,888 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 10:01:13,399 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 10:01:13,420 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 10:01:13,553 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 10:01:13,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:01:13 WrapperNode [2018-09-19 10:01:13,594 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 10:01:13,595 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 10:01:13,595 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 10:01:13,595 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 10:01:13,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:01:13" (1/1) ... [2018-09-19 10:01:13,630 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:01:13" (1/1) ... [2018-09-19 10:01:13,698 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 10:01:13,699 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 10:01:13,699 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 10:01:13,699 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 10:01:13,860 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:01:13" (1/1) ... [2018-09-19 10:01:13,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:01:13" (1/1) ... [2018-09-19 10:01:13,877 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:01:13" (1/1) ... [2018-09-19 10:01:13,878 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:01:13" (1/1) ... [2018-09-19 10:01:13,921 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:01:13" (1/1) ... [2018-09-19 10:01:13,937 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:01:13" (1/1) ... [2018-09-19 10:01:13,948 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:01:13" (1/1) ... [2018-09-19 10:01:13,960 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 10:01:13,960 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 10:01:13,960 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 10:01:13,961 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 10:01:13,964 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:01:13" (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 10:01:14,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 10:01:14,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 10:01:14,043 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 10:01:14,043 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 10:01:14,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 10:01:14,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 10:01:14,044 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 10:01:14,044 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 10:01:17,280 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 10:01:17,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 10:01:17 BoogieIcfgContainer [2018-09-19 10:01:17,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 10:01:17,282 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 10:01:17,282 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 10:01:17,285 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 10:01:17,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 10:01:12" (1/3) ... [2018-09-19 10:01:17,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f809498 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 10:01:17, skipping insertion in model container [2018-09-19 10:01:17,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:01:13" (2/3) ... [2018-09-19 10:01:17,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f809498 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 10:01:17, skipping insertion in model container [2018-09-19 10:01:17,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 10:01:17" (3/3) ... [2018-09-19 10:01:17,290 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label31_true-unreach-call.c [2018-09-19 10:01:17,299 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 10:01:17,307 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 10:01:17,362 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 10:01:17,363 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 10:01:17,363 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 10:01:17,364 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 10:01:17,364 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 10:01:17,364 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 10:01:17,365 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 10:01:17,365 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 10:01:17,365 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 10:01:17,403 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-19 10:01:17,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-19 10:01:17,412 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:01:17,413 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] [2018-09-19 10:01:17,414 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:01:17,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1318273196, now seen corresponding path program 1 times [2018-09-19 10:01:17,421 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:01:17,421 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-09-19 10:01:17,424 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], [301], [303], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-19 10:01:17,491 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:01:17,491 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:01:18,856 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:01:18,858 INFO L272 AbstractInterpreter]: Visited 49 different actions 49 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-19 10:01:18,882 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:01:19,517 INFO L232 lantSequenceWeakener]: Weakened 48 states. On average, predicates are now at 75.64% of their original sizes. [2018-09-19 10:01:19,518 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:01:19,816 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:01:19,818 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:01:19,818 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 10:01:19,818 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:01:19,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 10:01:19,833 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 10:01:19,834 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 10:01:19,837 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 6 states. [2018-09-19 10:01:23,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:01:23,024 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-19 10:01:23,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 10:01:23,030 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-09-19 10:01:23,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:01:23,049 INFO L225 Difference]: With dead ends: 576 [2018-09-19 10:01:23,049 INFO L226 Difference]: Without dead ends: 358 [2018-09-19 10:01:23,057 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 49 GetRequests, 45 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 10:01:23,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-19 10:01:23,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-19 10:01:23,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-19 10:01:23,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-19 10:01:23,138 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 50 [2018-09-19 10:01:23,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:01:23,138 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-19 10:01:23,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 10:01:23,139 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-19 10:01:23,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-09-19 10:01:23,146 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:01:23,147 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:01:23,148 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:01:23,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1922972547, now seen corresponding path program 1 times [2018-09-19 10:01:23,148 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:01:23,149 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 122 with the following transitions: [2018-09-19 10:01:23,150 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], [301], [303], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:01:23,166 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:01:23,167 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:01:24,770 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:01:27,640 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:01:27,640 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 10:01:27,651 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:01:28,661 INFO L232 lantSequenceWeakener]: Weakened 119 states. On average, predicates are now at 73.98% of their original sizes. [2018-09-19 10:01:28,662 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:01:29,202 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:01:29,202 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:01:29,202 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 10:01:29,202 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:01:29,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 10:01:29,204 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 10:01:29,204 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 10:01:29,204 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 10 states. [2018-09-19 10:01:38,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:01:38,513 INFO L93 Difference]: Finished difference Result 717 states and 1132 transitions. [2018-09-19 10:01:38,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 10:01:38,517 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 121 [2018-09-19 10:01:38,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:01:38,523 INFO L225 Difference]: With dead ends: 717 [2018-09-19 10:01:38,523 INFO L226 Difference]: Without dead ends: 511 [2018-09-19 10:01:38,526 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 127 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 10:01:38,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-09-19 10:01:38,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 505. [2018-09-19 10:01:38,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-09-19 10:01:38,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 669 transitions. [2018-09-19 10:01:38,562 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 669 transitions. Word has length 121 [2018-09-19 10:01:38,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:01:38,564 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 669 transitions. [2018-09-19 10:01:38,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 10:01:38,564 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 669 transitions. [2018-09-19 10:01:38,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-19 10:01:38,567 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:01:38,568 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:01:38,568 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:01:38,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1870443208, now seen corresponding path program 1 times [2018-09-19 10:01:38,569 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:01:38,569 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 131 with the following transitions: [2018-09-19 10:01:38,569 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], [301], [303], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:01:38,574 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:01:38,574 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:01:42,765 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:01:44,534 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:01:44,535 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 10:01:44,536 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:01:45,488 INFO L232 lantSequenceWeakener]: Weakened 128 states. On average, predicates are now at 73.89% of their original sizes. [2018-09-19 10:01:45,489 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:01:46,699 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:01:46,700 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:01:46,700 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 10:01:46,700 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:01:46,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 10:01:46,701 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 10:01:46,702 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-19 10:01:46,702 INFO L87 Difference]: Start difference. First operand 505 states and 669 transitions. Second operand 13 states. [2018-09-19 10:02:00,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:02:00,259 INFO L93 Difference]: Finished difference Result 1333 states and 2096 transitions. [2018-09-19 10:02:00,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-19 10:02:00,264 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 130 [2018-09-19 10:02:00,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:02:00,270 INFO L225 Difference]: With dead ends: 1333 [2018-09-19 10:02:00,270 INFO L226 Difference]: Without dead ends: 978 [2018-09-19 10:02:00,273 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 144 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2018-09-19 10:02:00,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2018-09-19 10:02:00,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 762. [2018-09-19 10:02:00,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2018-09-19 10:02:00,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 953 transitions. [2018-09-19 10:02:00,315 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 953 transitions. Word has length 130 [2018-09-19 10:02:00,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:02:00,316 INFO L480 AbstractCegarLoop]: Abstraction has 762 states and 953 transitions. [2018-09-19 10:02:00,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 10:02:00,316 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 953 transitions. [2018-09-19 10:02:00,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-09-19 10:02:00,321 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:02:00,321 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:00,321 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:02:00,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1376120512, now seen corresponding path program 1 times [2018-09-19 10:02:00,322 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:02:00,322 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 167 with the following transitions: [2018-09-19 10:02:00,323 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], [301], [303], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:02:00,329 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:02:00,329 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:02:02,961 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:02:09,155 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:02:09,156 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 10:02:09,160 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:02:09,992 INFO L232 lantSequenceWeakener]: Weakened 164 states. On average, predicates are now at 73.64% of their original sizes. [2018-09-19 10:02:09,992 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:02:11,276 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:02:11,277 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:02:11,277 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-19 10:02:11,278 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:02:11,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 10:02:11,279 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 10:02:11,279 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-09-19 10:02:11,279 INFO L87 Difference]: Start difference. First operand 762 states and 953 transitions. Second operand 12 states. [2018-09-19 10:02:22,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:02:22,279 INFO L93 Difference]: Finished difference Result 1677 states and 2220 transitions. [2018-09-19 10:02:22,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 10:02:22,280 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 166 [2018-09-19 10:02:22,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:02:22,287 INFO L225 Difference]: With dead ends: 1677 [2018-09-19 10:02:22,287 INFO L226 Difference]: Without dead ends: 1067 [2018-09-19 10:02:22,289 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 174 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2018-09-19 10:02:22,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2018-09-19 10:02:22,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1056. [2018-09-19 10:02:22,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1056 states. [2018-09-19 10:02:22,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1287 transitions. [2018-09-19 10:02:22,333 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1287 transitions. Word has length 166 [2018-09-19 10:02:22,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:02:22,333 INFO L480 AbstractCegarLoop]: Abstraction has 1056 states and 1287 transitions. [2018-09-19 10:02:22,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 10:02:22,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1287 transitions. [2018-09-19 10:02:22,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-09-19 10:02:22,337 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:02:22,337 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:22,338 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:02:22,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1061552381, now seen corresponding path program 1 times [2018-09-19 10:02:22,338 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:02:22,339 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 186 with the following transitions: [2018-09-19 10:02:22,339 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], [301], [303], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [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 10:02:22,346 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:02:22,346 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:02:31,623 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:02:31,623 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 10:02:31,635 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:02:32,430 INFO L232 lantSequenceWeakener]: Weakened 183 states. On average, predicates are now at 73.54% of their original sizes. [2018-09-19 10:02:32,430 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:02:32,828 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:02:32,828 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:02:32,828 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-19 10:02:32,828 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:02:32,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 10:02:32,829 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 10:02:32,829 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-09-19 10:02:32,829 INFO L87 Difference]: Start difference. First operand 1056 states and 1287 transitions. Second operand 12 states. [2018-09-19 10:02:37,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:02:37,820 INFO L93 Difference]: Finished difference Result 2268 states and 2899 transitions. [2018-09-19 10:02:37,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-19 10:02:37,821 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 185 [2018-09-19 10:02:37,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:02:37,828 INFO L225 Difference]: With dead ends: 2268 [2018-09-19 10:02:37,828 INFO L226 Difference]: Without dead ends: 1364 [2018-09-19 10:02:37,831 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 194 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2018-09-19 10:02:37,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2018-09-19 10:02:37,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1352. [2018-09-19 10:02:37,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-09-19 10:02:37,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1615 transitions. [2018-09-19 10:02:37,884 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1615 transitions. Word has length 185 [2018-09-19 10:02:37,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:02:37,885 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 1615 transitions. [2018-09-19 10:02:37,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 10:02:37,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1615 transitions. [2018-09-19 10:02:37,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-09-19 10:02:37,888 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:02:37,888 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, 2, 2, 2, 2, 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] [2018-09-19 10:02:37,889 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:02:37,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1068683329, now seen corresponding path program 1 times [2018-09-19 10:02:37,889 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:02:37,890 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 198 with the following transitions: [2018-09-19 10:02:37,890 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], [301], [303], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [518], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:02:37,893 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:02:37,894 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:02:39,224 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:02:44,143 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:02:44,144 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 10:02:44,150 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:02:45,036 INFO L232 lantSequenceWeakener]: Weakened 195 states. On average, predicates are now at 73.54% of their original sizes. [2018-09-19 10:02:45,036 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:02:45,688 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:02:45,689 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:02:45,689 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 10:02:45,689 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:02:45,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 10:02:45,690 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 10:02:45,690 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 10:02:45,690 INFO L87 Difference]: Start difference. First operand 1352 states and 1615 transitions. Second operand 10 states. [2018-09-19 10:02:50,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:02:50,312 INFO L93 Difference]: Finished difference Result 2719 states and 3388 transitions. [2018-09-19 10:02:50,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 10:02:50,318 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 197 [2018-09-19 10:02:50,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:02:50,331 INFO L225 Difference]: With dead ends: 2719 [2018-09-19 10:02:50,332 INFO L226 Difference]: Without dead ends: 1521 [2018-09-19 10:02:50,337 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 204 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 10:02:50,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2018-09-19 10:02:50,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1503. [2018-09-19 10:02:50,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2018-09-19 10:02:50,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1792 transitions. [2018-09-19 10:02:50,416 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1792 transitions. Word has length 197 [2018-09-19 10:02:50,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:02:50,416 INFO L480 AbstractCegarLoop]: Abstraction has 1503 states and 1792 transitions. [2018-09-19 10:02:50,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 10:02:50,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1792 transitions. [2018-09-19 10:02:50,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-09-19 10:02:50,421 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:02:50,422 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, 2, 2, 2, 2, 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] [2018-09-19 10:02:50,422 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:02:50,422 INFO L82 PathProgramCache]: Analyzing trace with hash 847052891, now seen corresponding path program 1 times [2018-09-19 10:02:50,423 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:02:50,423 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 200 with the following transitions: [2018-09-19 10:02:50,423 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], [301], [303], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [526], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:02:50,428 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:02:50,428 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:02:52,020 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:02:57,788 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:02:57,788 INFO L272 AbstractInterpreter]: Visited 86 different actions 333 times. Merged at 7 different actions 22 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 10:02:57,795 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:02:58,661 INFO L232 lantSequenceWeakener]: Weakened 197 states. On average, predicates are now at 73.53% of their original sizes. [2018-09-19 10:02:58,661 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:02:58,924 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:02:58,925 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:02:58,925 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 10:02:58,925 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:02:58,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 10:02:58,926 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 10:02:58,926 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 10:02:58,926 INFO L87 Difference]: Start difference. First operand 1503 states and 1792 transitions. Second operand 10 states. [2018-09-19 10:03:05,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:03:05,848 INFO L93 Difference]: Finished difference Result 3020 states and 3751 transitions. [2018-09-19 10:03:05,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 10:03:05,848 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 199 [2018-09-19 10:03:05,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:03:05,859 INFO L225 Difference]: With dead ends: 3020 [2018-09-19 10:03:05,860 INFO L226 Difference]: Without dead ends: 1671 [2018-09-19 10:03:05,864 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 206 GetRequests, 190 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 10:03:05,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-09-19 10:03:05,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1654. [2018-09-19 10:03:05,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1654 states. [2018-09-19 10:03:05,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 1988 transitions. [2018-09-19 10:03:05,939 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 1988 transitions. Word has length 199 [2018-09-19 10:03:05,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:03:05,940 INFO L480 AbstractCegarLoop]: Abstraction has 1654 states and 1988 transitions. [2018-09-19 10:03:05,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 10:03:05,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 1988 transitions. [2018-09-19 10:03:05,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-09-19 10:03:05,944 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:03:05,947 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 10:03:05,947 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:03:05,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1430460819, now seen corresponding path program 1 times [2018-09-19 10:03:05,948 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:03:05,948 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 204 with the following transitions: [2018-09-19 10:03:05,948 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], [301], [303], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [542], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:03:05,951 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:03:05,952 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:03:07,400 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:03:13,116 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:03:13,116 INFO L272 AbstractInterpreter]: Visited 90 different actions 349 times. Merged at 7 different actions 22 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 10:03:13,127 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:03:13,907 INFO L232 lantSequenceWeakener]: Weakened 201 states. On average, predicates are now at 73.51% of their original sizes. [2018-09-19 10:03:13,908 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:03:14,188 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:03:14,189 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:03:14,189 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 10:03:14,189 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:03:14,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 10:03:14,190 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 10:03:14,190 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 10:03:14,190 INFO L87 Difference]: Start difference. First operand 1654 states and 1988 transitions. Second operand 10 states. [2018-09-19 10:03:19,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:03:19,119 INFO L93 Difference]: Finished difference Result 3477 states and 4328 transitions. [2018-09-19 10:03:19,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 10:03:19,119 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 203 [2018-09-19 10:03:19,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:03:19,127 INFO L225 Difference]: With dead ends: 3477 [2018-09-19 10:03:19,128 INFO L226 Difference]: Without dead ends: 1977 [2018-09-19 10:03:19,131 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 210 GetRequests, 194 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 10:03:19,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2018-09-19 10:03:19,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1954. [2018-09-19 10:03:19,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1954 states. [2018-09-19 10:03:19,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2362 transitions. [2018-09-19 10:03:19,197 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2362 transitions. Word has length 203 [2018-09-19 10:03:19,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:03:19,198 INFO L480 AbstractCegarLoop]: Abstraction has 1954 states and 2362 transitions. [2018-09-19 10:03:19,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 10:03:19,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2362 transitions. [2018-09-19 10:03:19,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-09-19 10:03:19,202 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:03:19,202 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, 2, 2, 2, 2, 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 10:03:19,203 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:03:19,203 INFO L82 PathProgramCache]: Analyzing trace with hash -541693081, now seen corresponding path program 1 times [2018-09-19 10:03:19,203 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:03:19,203 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 210 with the following transitions: [2018-09-19 10:03:19,204 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], [301], [303], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:03:19,206 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:03:19,206 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:03:20,616 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:03:30,391 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:03:30,392 INFO L272 AbstractInterpreter]: Visited 96 different actions 373 times. Merged at 7 different actions 22 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 10:03:30,400 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:03:31,476 INFO L232 lantSequenceWeakener]: Weakened 207 states. On average, predicates are now at 73.49% of their original sizes. [2018-09-19 10:03:31,476 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:03:31,788 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:03:31,789 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:03:31,789 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 10:03:31,789 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:03:31,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 10:03:31,790 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 10:03:31,790 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 10:03:31,790 INFO L87 Difference]: Start difference. First operand 1954 states and 2362 transitions. Second operand 10 states. [2018-09-19 10:03:39,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:03:39,730 INFO L93 Difference]: Finished difference Result 3932 states and 4909 transitions. [2018-09-19 10:03:39,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 10:03:39,732 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 209 [2018-09-19 10:03:39,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:03:39,741 INFO L225 Difference]: With dead ends: 3932 [2018-09-19 10:03:39,741 INFO L226 Difference]: Without dead ends: 2132 [2018-09-19 10:03:39,746 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 216 GetRequests, 200 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 10:03:39,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2132 states. [2018-09-19 10:03:39,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2132 to 2109. [2018-09-19 10:03:39,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2109 states. [2018-09-19 10:03:39,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2109 states to 2109 states and 2577 transitions. [2018-09-19 10:03:39,819 INFO L78 Accepts]: Start accepts. Automaton has 2109 states and 2577 transitions. Word has length 209 [2018-09-19 10:03:39,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:03:39,819 INFO L480 AbstractCegarLoop]: Abstraction has 2109 states and 2577 transitions. [2018-09-19 10:03:39,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 10:03:39,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 2577 transitions. [2018-09-19 10:03:39,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-09-19 10:03:39,824 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:03:39,824 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, 2, 2, 2, 2, 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 10:03:39,825 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:03:39,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1808235360, now seen corresponding path program 1 times [2018-09-19 10:03:39,825 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:03:39,825 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 219 with the following transitions: [2018-09-19 10:03:39,826 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], [301], [303], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [602], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:03:39,828 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:03:39,828 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:03:41,075 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:03:50,904 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:03:50,905 INFO L272 AbstractInterpreter]: Visited 105 different actions 407 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 10:03:50,909 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:03:51,955 INFO L232 lantSequenceWeakener]: Weakened 216 states. On average, predicates are now at 73.46% of their original sizes. [2018-09-19 10:03:51,955 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:03:52,292 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:03:52,292 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:03:52,292 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 10:03:52,292 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:03:52,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 10:03:52,293 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 10:03:52,293 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-19 10:03:52,294 INFO L87 Difference]: Start difference. First operand 2109 states and 2577 transitions. Second operand 11 states. [2018-09-19 10:04:00,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:04:00,922 INFO L93 Difference]: Finished difference Result 4320 states and 5463 transitions. [2018-09-19 10:04:00,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 10:04:00,923 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 218 [2018-09-19 10:04:00,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:04:00,933 INFO L225 Difference]: With dead ends: 4320 [2018-09-19 10:04:00,934 INFO L226 Difference]: Without dead ends: 2365 [2018-09-19 10:04:00,939 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 226 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-09-19 10:04:00,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2018-09-19 10:04:01,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 2262. [2018-09-19 10:04:01,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2262 states. [2018-09-19 10:04:01,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 2262 states and 2792 transitions. [2018-09-19 10:04:01,023 INFO L78 Accepts]: Start accepts. Automaton has 2262 states and 2792 transitions. Word has length 218 [2018-09-19 10:04:01,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:04:01,024 INFO L480 AbstractCegarLoop]: Abstraction has 2262 states and 2792 transitions. [2018-09-19 10:04:01,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 10:04:01,024 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 2792 transitions. [2018-09-19 10:04:01,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-09-19 10:04:01,029 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:04:01,029 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, 2, 2, 2, 2, 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] [2018-09-19 10:04:01,030 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:04:01,030 INFO L82 PathProgramCache]: Analyzing trace with hash -33402316, now seen corresponding path program 1 times [2018-09-19 10:04:01,030 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:04:01,031 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 225 with the following transitions: [2018-09-19 10:04:01,031 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], [301], [303], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [626], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:04:01,034 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:04:01,034 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:04:02,440 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:04:10,327 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:04:10,328 INFO L272 AbstractInterpreter]: Visited 111 different actions 433 times. Merged at 7 different actions 22 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 10:04:10,334 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:04:11,416 INFO L232 lantSequenceWeakener]: Weakened 222 states. On average, predicates are now at 73.44% of their original sizes. [2018-09-19 10:04:11,416 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:04:11,765 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:04:11,766 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:04:11,766 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 10:04:11,766 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:04:11,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 10:04:11,767 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 10:04:11,767 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-19 10:04:11,767 INFO L87 Difference]: Start difference. First operand 2262 states and 2792 transitions. Second operand 11 states. [2018-09-19 10:04:21,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:04:21,625 INFO L93 Difference]: Finished difference Result 4808 states and 6139 transitions. [2018-09-19 10:04:21,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-19 10:04:21,626 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 224 [2018-09-19 10:04:21,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:04:21,636 INFO L225 Difference]: With dead ends: 4808 [2018-09-19 10:04:21,636 INFO L226 Difference]: Without dead ends: 2700 [2018-09-19 10:04:21,642 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 232 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-09-19 10:04:21,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2700 states. [2018-09-19 10:04:21,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 2670. [2018-09-19 10:04:21,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2670 states. [2018-09-19 10:04:21,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 3328 transitions. [2018-09-19 10:04:21,729 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 3328 transitions. Word has length 224 [2018-09-19 10:04:21,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:04:21,730 INFO L480 AbstractCegarLoop]: Abstraction has 2670 states and 3328 transitions. [2018-09-19 10:04:21,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 10:04:21,730 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 3328 transitions. [2018-09-19 10:04:21,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-09-19 10:04:21,737 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:04:21,737 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, 2, 2, 2, 2, 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] [2018-09-19 10:04:21,737 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:04:21,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1769949723, now seen corresponding path program 1 times [2018-09-19 10:04:21,738 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:04:21,738 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 232 with the following transitions: [2018-09-19 10:04:21,738 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], [301], [303], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:04:21,741 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:04:21,741 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:04:23,115 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:04:32,034 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:04:32,035 INFO L272 AbstractInterpreter]: Visited 118 different actions 459 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 10:04:32,043 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:04:32,990 INFO L232 lantSequenceWeakener]: Weakened 229 states. On average, predicates are now at 73.42% of their original sizes. [2018-09-19 10:04:32,990 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:04:33,355 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:04:33,355 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:04:33,356 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 10:04:33,356 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:04:33,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 10:04:33,356 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 10:04:33,356 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-19 10:04:33,357 INFO L87 Difference]: Start difference. First operand 2670 states and 3328 transitions. Second operand 11 states. [2018-09-19 10:04:41,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:04:41,010 INFO L93 Difference]: Finished difference Result 5752 states and 7377 transitions. [2018-09-19 10:04:41,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 10:04:41,016 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 231 [2018-09-19 10:04:41,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:04:41,027 INFO L225 Difference]: With dead ends: 5752 [2018-09-19 10:04:41,028 INFO L226 Difference]: Without dead ends: 3236 [2018-09-19 10:04:41,033 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 239 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-09-19 10:04:41,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3236 states. [2018-09-19 10:04:41,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3236 to 3129. [2018-09-19 10:04:41,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2018-09-19 10:04:41,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 3930 transitions. [2018-09-19 10:04:41,135 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 3930 transitions. Word has length 231 [2018-09-19 10:04:41,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:04:41,136 INFO L480 AbstractCegarLoop]: Abstraction has 3129 states and 3930 transitions. [2018-09-19 10:04:41,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 10:04:41,136 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 3930 transitions. [2018-09-19 10:04:41,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-09-19 10:04:41,142 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:04:41,142 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, 2, 2, 2, 2, 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] [2018-09-19 10:04:41,143 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:04:41,143 INFO L82 PathProgramCache]: Analyzing trace with hash 456012672, now seen corresponding path program 1 times [2018-09-19 10:04:41,143 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:04:41,143 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 235 with the following transitions: [2018-09-19 10:04:41,144 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], [301], [303], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:04:41,147 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:04:41,147 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:04:42,429 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:04:51,742 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:04:51,742 INFO L272 AbstractInterpreter]: Visited 121 different actions 471 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 10:04:51,752 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:04:52,775 INFO L232 lantSequenceWeakener]: Weakened 232 states. On average, predicates are now at 73.41% of their original sizes. [2018-09-19 10:04:52,775 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:04:53,245 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:04:53,245 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:04:53,246 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 10:04:53,246 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:04:53,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 10:04:53,246 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 10:04:53,247 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-19 10:04:53,247 INFO L87 Difference]: Start difference. First operand 3129 states and 3930 transitions. Second operand 13 states. [2018-09-19 10:05:04,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:05:04,139 INFO L93 Difference]: Finished difference Result 6701 states and 8709 transitions. [2018-09-19 10:05:04,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 10:05:04,143 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 234 [2018-09-19 10:05:04,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:05:04,158 INFO L225 Difference]: With dead ends: 6701 [2018-09-19 10:05:04,159 INFO L226 Difference]: Without dead ends: 3726 [2018-09-19 10:05:04,166 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 246 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2018-09-19 10:05:04,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3726 states. [2018-09-19 10:05:04,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3726 to 3529. [2018-09-19 10:05:04,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3529 states. [2018-09-19 10:05:04,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3529 states to 3529 states and 4443 transitions. [2018-09-19 10:05:04,286 INFO L78 Accepts]: Start accepts. Automaton has 3529 states and 4443 transitions. Word has length 234 [2018-09-19 10:05:04,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:05:04,287 INFO L480 AbstractCegarLoop]: Abstraction has 3529 states and 4443 transitions. [2018-09-19 10:05:04,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 10:05:04,287 INFO L276 IsEmpty]: Start isEmpty. Operand 3529 states and 4443 transitions. [2018-09-19 10:05:04,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-09-19 10:05:04,292 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:05:04,293 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 10:05:04,293 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:05:04,293 INFO L82 PathProgramCache]: Analyzing trace with hash -214895309, now seen corresponding path program 1 times [2018-09-19 10:05:04,294 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:05:04,294 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 240 with the following transitions: [2018-09-19 10:05:04,294 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], [301], [303], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [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 10:05:04,297 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:05:04,298 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:05:06,891 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:05:18,940 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:05:18,941 INFO L272 AbstractInterpreter]: Visited 124 different actions 603 times. Merged at 7 different actions 27 times. Never widened. Found 5 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 10:05:18,950 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:05:20,047 INFO L232 lantSequenceWeakener]: Weakened 237 states. On average, predicates are now at 73.39% of their original sizes. [2018-09-19 10:05:20,047 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:05:20,348 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:05:20,349 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:05:20,349 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 10:05:20,349 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:05:20,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 10:05:20,350 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 10:05:20,350 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 10:05:20,350 INFO L87 Difference]: Start difference. First operand 3529 states and 4443 transitions. Second operand 10 states. [2018-09-19 10:05:28,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:05:28,361 INFO L93 Difference]: Finished difference Result 7079 states and 9092 transitions. [2018-09-19 10:05:28,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 10:05:28,361 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 239 [2018-09-19 10:05:28,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:05:28,382 INFO L225 Difference]: With dead ends: 7079 [2018-09-19 10:05:28,383 INFO L226 Difference]: Without dead ends: 3704 [2018-09-19 10:05:28,396 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 246 GetRequests, 230 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 10:05:28,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3704 states. [2018-09-19 10:05:28,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3704 to 3677. [2018-09-19 10:05:28,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3677 states. [2018-09-19 10:05:28,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3677 states to 3677 states and 4642 transitions. [2018-09-19 10:05:28,528 INFO L78 Accepts]: Start accepts. Automaton has 3677 states and 4642 transitions. Word has length 239 [2018-09-19 10:05:28,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:05:28,529 INFO L480 AbstractCegarLoop]: Abstraction has 3677 states and 4642 transitions. [2018-09-19 10:05:28,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 10:05:28,529 INFO L276 IsEmpty]: Start isEmpty. Operand 3677 states and 4642 transitions. [2018-09-19 10:05:28,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-09-19 10:05:28,535 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:05:28,535 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, 2, 2, 2, 2, 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] [2018-09-19 10:05:28,535 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:05:28,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1675463229, now seen corresponding path program 1 times [2018-09-19 10:05:28,536 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:05:28,536 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 244 with the following transitions: [2018-09-19 10:05:28,536 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], [301], [303], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [702], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:05:28,540 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:05:28,540 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:05:30,428 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. Received shutdown request... [2018-09-19 10:05:30,760 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-09-19 10:05:30,761 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-09-19 10:05:30,762 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 10:05:30,819 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 10:05:30,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 10:05:30 BoogieIcfgContainer [2018-09-19 10:05:30,819 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 10:05:30,820 INFO L168 Benchmark]: Toolchain (without parser) took 257965.25 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 4.1 GB in the end (delta: -2.7 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-19 10:05:30,822 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 10:05:30,823 INFO L168 Benchmark]: CACSL2BoogieTranslator took 735.21 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 10:05:30,823 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.82 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 10:05:30,824 INFO L168 Benchmark]: Boogie Preprocessor took 260.94 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: -871.7 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. [2018-09-19 10:05:30,825 INFO L168 Benchmark]: RCFGBuilder took 3320.60 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 107.0 MB). Peak memory consumption was 107.0 MB. Max. memory is 7.1 GB. [2018-09-19 10:05:30,826 INFO L168 Benchmark]: TraceAbstraction took 253537.48 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 4.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-09-19 10:05:30,831 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 735.21 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 103.82 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 260.94 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: -871.7 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3320.60 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 107.0 MB). Peak memory consumption was 107.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 253537.48 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 4.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 133]: 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 TRUE ((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0))) [L211] a1 = (((a1 + -15535) - 211896) / 5) [L212] a10 = 2 [L214] RET return 22; [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 FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) [L454] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) [L460] COND TRUE ((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0)))) [L461] a1 = (((a1 / 5) + 105416) + 61704) [L462] a10 = 4 [L464] RET return 24; [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 TRUE (((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7)) [L133] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 253.4s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 111.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2712 SDtfs, 10487 SDslu, 5744 SDs, 0 SdLazy, 29489 SolverSat, 2496 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 97.8s Time, PredicateUnifierStatistics: 28 DeclaredPredicates, 2713 GetRequests, 2471 SyntacticMatches, 0 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 812 ImplicationChecksByTransitivity, 11.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3677occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 120.2s AbstIntTime, 15 AbstIntIterations, 14 AbstIntStrong, 0.9942184907651404 AbsIntWeakeningRatio, 0.12654320987654322 AbsIntAvgWeakeningVarsNumRemoved, 877.3819444444445 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 792 StatesRemovedByMinimization, 14 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_label31_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_10-05-30-855.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label31_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_10-05-30-855.csv Completed graceful shutdown