java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label30_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 12:41:35,789 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 12:41:35,791 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 12:41:35,807 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 12:41:35,807 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 12:41:35,809 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 12:41:35,812 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 12:41:35,814 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 12:41:35,823 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 12:41:35,824 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 12:41:35,828 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 12:41:35,828 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 12:41:35,829 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 12:41:35,832 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 12:41:35,833 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 12:41:35,836 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 12:41:35,837 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 12:41:35,838 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 12:41:35,843 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 12:41:35,846 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 12:41:35,849 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 12:41:35,850 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 12:41:35,855 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 12:41:35,856 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 12:41:35,856 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 12:41:35,857 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 12:41:35,859 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 12:41:35,860 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 12:41:35,861 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 12:41:35,862 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 12:41:35,862 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 12:41:35,864 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 12:41:35,864 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 12:41:35,865 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 12:41:35,867 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 12:41:35,868 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 12:41:35,868 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf [2018-09-19 12:41:35,898 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 12:41:35,898 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 12:41:35,899 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 12:41:35,899 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 12:41:35,899 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 12:41:35,900 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 12:41:35,900 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 12:41:35,901 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-19 12:41:35,901 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-19 12:41:35,901 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 12:41:35,901 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 12:41:35,901 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 12:41:35,902 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 12:41:35,903 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 12:41:35,904 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 12:41:35,904 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 12:41:35,904 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 12:41:35,904 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 12:41:35,905 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 12:41:35,905 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 12:41:35,905 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 12:41:35,905 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 12:41:35,905 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 12:41:35,906 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 12:41:35,906 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 12:41:35,906 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 12:41:35,906 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 12:41:35,906 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 12:41:35,907 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 12:41:35,907 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 12:41:35,907 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 12:41:35,907 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 12:41:35,908 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 12:41:35,908 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 12:41:35,972 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 12:41:35,989 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 12:41:35,995 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 12:41:35,996 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 12:41:35,997 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 12:41:35,998 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label30_true-unreach-call.c [2018-09-19 12:41:36,352 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42b5c12e6/40791256955849ff9aca16404ca8fd21/FLAGa1c31f6cd [2018-09-19 12:41:36,596 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 12:41:36,597 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label30_true-unreach-call.c [2018-09-19 12:41:36,612 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42b5c12e6/40791256955849ff9aca16404ca8fd21/FLAGa1c31f6cd [2018-09-19 12:41:36,638 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42b5c12e6/40791256955849ff9aca16404ca8fd21 [2018-09-19 12:41:36,654 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 12:41:36,657 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 12:41:36,658 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 12:41:36,658 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 12:41:36,668 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 12:41:36,669 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 12:41:36" (1/1) ... [2018-09-19 12:41:36,672 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18b5fc10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:41:36, skipping insertion in model container [2018-09-19 12:41:36,673 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 12:41:36" (1/1) ... [2018-09-19 12:41:36,686 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 12:41:37,176 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 12:41:37,195 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 12:41:37,321 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 12:41:37,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:41:37 WrapperNode [2018-09-19 12:41:37,371 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 12:41:37,372 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 12:41:37,372 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 12:41:37,373 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 12:41:37,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:41:37" (1/1) ... [2018-09-19 12:41:37,415 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:41:37" (1/1) ... [2018-09-19 12:41:37,496 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 12:41:37,496 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 12:41:37,496 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 12:41:37,496 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 12:41:37,508 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:41:37" (1/1) ... [2018-09-19 12:41:37,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:41:37" (1/1) ... [2018-09-19 12:41:37,515 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:41:37" (1/1) ... [2018-09-19 12:41:37,519 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:41:37" (1/1) ... [2018-09-19 12:41:37,690 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:41:37" (1/1) ... [2018-09-19 12:41:37,704 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:41:37" (1/1) ... [2018-09-19 12:41:37,715 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:41:37" (1/1) ... [2018-09-19 12:41:37,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 12:41:37,725 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 12:41:37,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 12:41:37,725 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 12:41:37,726 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:41:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 12:41:37,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 12:41:37,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 12:41:37,786 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 12:41:37,786 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 12:41:37,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 12:41:37,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 12:41:37,787 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 12:41:37,787 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 12:41:41,256 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 12:41:41,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 12:41:41 BoogieIcfgContainer [2018-09-19 12:41:41,257 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 12:41:41,258 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 12:41:41,258 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 12:41:41,262 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 12:41:41,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 12:41:36" (1/3) ... [2018-09-19 12:41:41,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4002bf5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 12:41:41, skipping insertion in model container [2018-09-19 12:41:41,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:41:37" (2/3) ... [2018-09-19 12:41:41,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4002bf5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 12:41:41, skipping insertion in model container [2018-09-19 12:41:41,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 12:41:41" (3/3) ... [2018-09-19 12:41:41,266 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label30_true-unreach-call.c [2018-09-19 12:41:41,276 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 12:41:41,285 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 12:41:41,340 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 12:41:41,341 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 12:41:41,341 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 12:41:41,341 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 12:41:41,341 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 12:41:41,342 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 12:41:41,342 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 12:41:41,342 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 12:41:41,342 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 12:41:41,369 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-19 12:41:41,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-19 12:41:41,378 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:41:41,379 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] [2018-09-19 12:41:41,380 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:41:41,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1431628569, now seen corresponding path program 1 times [2018-09-19 12:41:41,389 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:41:41,390 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-09-19 12:41:41,392 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], [229], [231], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-19 12:41:41,431 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:41:41,432 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:41:41,738 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:41:41,740 INFO L272 AbstractInterpreter]: Visited 40 different actions 40 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-19 12:41:41,786 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:41:41,935 INFO L232 lantSequenceWeakener]: Weakened 38 states. On average, predicates are now at 74.61% of their original sizes. [2018-09-19 12:41:41,936 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:41:42,196 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:41:42,197 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:41:42,198 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 12:41:42,198 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:41:42,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 12:41:42,212 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 12:41:42,213 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 12:41:42,216 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 6 states. [2018-09-19 12:41:44,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:41:44,813 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-19 12:41:44,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 12:41:44,816 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-09-19 12:41:44,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:41:44,836 INFO L225 Difference]: With dead ends: 576 [2018-09-19 12:41:44,836 INFO L226 Difference]: Without dead ends: 358 [2018-09-19 12:41:44,843 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 12:41:44,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-19 12:41:44,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-19 12:41:44,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-19 12:41:44,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-19 12:41:44,916 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 41 [2018-09-19 12:41:44,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:41:44,917 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-19 12:41:44,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 12:41:44,917 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-19 12:41:44,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-19 12:41:44,923 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:41:44,923 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:41:44,924 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:41:44,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1295784565, now seen corresponding path program 1 times [2018-09-19 12:41:44,924 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:41:44,925 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 113 with the following transitions: [2018-09-19 12:41:44,925 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], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:41:44,931 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:41:44,931 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:41:45,048 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:41:45,205 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:41:45,205 INFO L272 AbstractInterpreter]: Visited 78 different actions 221 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:41:45,247 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:41:45,508 INFO L232 lantSequenceWeakener]: Weakened 109 states. On average, predicates are now at 73.47% of their original sizes. [2018-09-19 12:41:45,508 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:41:45,852 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:41:45,852 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:41:45,853 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:41:45,853 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:41:45,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:41:45,854 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:41:45,855 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:41:45,855 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 10 states. [2018-09-19 12:41:50,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:41:50,293 INFO L93 Difference]: Finished difference Result 717 states and 1132 transitions. [2018-09-19 12:41:50,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 12:41:50,298 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 112 [2018-09-19 12:41:50,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:41:50,304 INFO L225 Difference]: With dead ends: 717 [2018-09-19 12:41:50,304 INFO L226 Difference]: Without dead ends: 511 [2018-09-19 12:41:50,307 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 118 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:41:50,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-09-19 12:41:50,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 505. [2018-09-19 12:41:50,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-09-19 12:41:50,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 659 transitions. [2018-09-19 12:41:50,341 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 659 transitions. Word has length 112 [2018-09-19 12:41:50,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:41:50,342 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 659 transitions. [2018-09-19 12:41:50,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:41:50,342 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 659 transitions. [2018-09-19 12:41:50,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-09-19 12:41:50,347 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:41:50,347 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:41:50,348 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:41:50,348 INFO L82 PathProgramCache]: Analyzing trace with hash 181448388, now seen corresponding path program 1 times [2018-09-19 12:41:50,348 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:41:50,348 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 122 with the following transitions: [2018-09-19 12:41:50,349 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], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:41:50,353 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:41:50,353 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:41:50,430 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:41:50,541 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:41:50,541 INFO L272 AbstractInterpreter]: Visited 87 different actions 248 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:41:50,575 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:41:50,731 INFO L232 lantSequenceWeakener]: Weakened 118 states. On average, predicates are now at 73.41% of their original sizes. [2018-09-19 12:41:50,732 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:41:51,214 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:41:51,215 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:41:51,215 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:41:51,215 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:41:51,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:41:51,216 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:41:51,216 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:41:51,217 INFO L87 Difference]: Start difference. First operand 505 states and 659 transitions. Second operand 10 states. [2018-09-19 12:41:53,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:41:53,821 INFO L93 Difference]: Finished difference Result 1149 states and 1716 transitions. [2018-09-19 12:41:53,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:41:53,824 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 121 [2018-09-19 12:41:53,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:41:53,830 INFO L225 Difference]: With dead ends: 1149 [2018-09-19 12:41:53,830 INFO L226 Difference]: Without dead ends: 794 [2018-09-19 12:41:53,832 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 128 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:41:53,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-09-19 12:41:53,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 783. [2018-09-19 12:41:53,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2018-09-19 12:41:53,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 991 transitions. [2018-09-19 12:41:53,871 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 991 transitions. Word has length 121 [2018-09-19 12:41:53,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:41:53,872 INFO L480 AbstractCegarLoop]: Abstraction has 783 states and 991 transitions. [2018-09-19 12:41:53,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:41:53,872 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 991 transitions. [2018-09-19 12:41:53,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-09-19 12:41:53,879 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:41:53,880 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:41:53,880 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:41:53,880 INFO L82 PathProgramCache]: Analyzing trace with hash -364083764, now seen corresponding path program 1 times [2018-09-19 12:41:53,881 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:41:53,881 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 158 with the following transitions: [2018-09-19 12:41:53,881 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], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:41:53,886 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:41:53,887 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:41:54,028 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:41:54,287 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:41:54,287 INFO L272 AbstractInterpreter]: Visited 123 different actions 356 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:41:54,326 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:41:54,645 INFO L232 lantSequenceWeakener]: Weakened 154 states. On average, predicates are now at 73.25% of their original sizes. [2018-09-19 12:41:54,645 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:41:55,222 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:41:55,224 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:41:55,224 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:41:55,224 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:41:55,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:41:55,225 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:41:55,226 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:41:55,226 INFO L87 Difference]: Start difference. First operand 783 states and 991 transitions. Second operand 10 states. [2018-09-19 12:41:58,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:41:58,239 INFO L93 Difference]: Finished difference Result 1723 states and 2312 transitions. [2018-09-19 12:41:58,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 12:41:58,239 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 157 [2018-09-19 12:41:58,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:41:58,247 INFO L225 Difference]: With dead ends: 1723 [2018-09-19 12:41:58,248 INFO L226 Difference]: Without dead ends: 1090 [2018-09-19 12:41:58,250 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 163 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:41:58,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2018-09-19 12:41:58,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1081. [2018-09-19 12:41:58,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1081 states. [2018-09-19 12:41:58,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1341 transitions. [2018-09-19 12:41:58,296 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1341 transitions. Word has length 157 [2018-09-19 12:41:58,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:41:58,296 INFO L480 AbstractCegarLoop]: Abstraction has 1081 states and 1341 transitions. [2018-09-19 12:41:58,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:41:58,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1341 transitions. [2018-09-19 12:41:58,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-09-19 12:41:58,305 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:41:58,305 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:41:58,306 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:41:58,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1283872245, now seen corresponding path program 1 times [2018-09-19 12:41:58,306 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:41:58,306 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 177 with the following transitions: [2018-09-19 12:41:58,307 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], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [754], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:41:58,316 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:41:58,316 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:41:58,567 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:41:58,568 INFO L272 AbstractInterpreter]: Visited 142 different actions 413 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:41:58,607 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:41:58,805 INFO L232 lantSequenceWeakener]: Weakened 173 states. On average, predicates are now at 73.19% of their original sizes. [2018-09-19 12:41:58,805 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:41:58,972 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:41:58,973 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:41:58,973 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:41:58,973 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:41:58,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:41:58,974 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:41:58,974 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:41:58,974 INFO L87 Difference]: Start difference. First operand 1081 states and 1341 transitions. Second operand 10 states. [2018-09-19 12:42:01,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:42:01,709 INFO L93 Difference]: Finished difference Result 2464 states and 3181 transitions. [2018-09-19 12:42:01,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 12:42:01,721 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 176 [2018-09-19 12:42:01,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:42:01,729 INFO L225 Difference]: With dead ends: 2464 [2018-09-19 12:42:01,729 INFO L226 Difference]: Without dead ends: 1533 [2018-09-19 12:42:01,732 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 182 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:42:01,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2018-09-19 12:42:01,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1521. [2018-09-19 12:42:01,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1521 states. [2018-09-19 12:42:01,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 1832 transitions. [2018-09-19 12:42:01,781 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 1832 transitions. Word has length 176 [2018-09-19 12:42:01,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:42:01,782 INFO L480 AbstractCegarLoop]: Abstraction has 1521 states and 1832 transitions. [2018-09-19 12:42:01,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:42:01,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1832 transitions. [2018-09-19 12:42:01,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-09-19 12:42:01,786 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:42:01,786 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 12:42:01,788 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:42:01,788 INFO L82 PathProgramCache]: Analyzing trace with hash -673837714, now seen corresponding path program 1 times [2018-09-19 12:42:01,788 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:42:01,788 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 189 with the following transitions: [2018-09-19 12:42:01,789 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], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [518], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:42:01,796 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:42:01,796 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:42:01,838 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:42:01,950 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:42:01,951 INFO L272 AbstractInterpreter]: Visited 84 different actions 323 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:42:01,965 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:42:02,192 INFO L232 lantSequenceWeakener]: Weakened 185 states. On average, predicates are now at 73.21% of their original sizes. [2018-09-19 12:42:02,192 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:42:02,396 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:42:02,396 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:42:02,396 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:42:02,396 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:42:02,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:42:02,397 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:42:02,397 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:42:02,398 INFO L87 Difference]: Start difference. First operand 1521 states and 1832 transitions. Second operand 10 states. [2018-09-19 12:42:04,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:42:04,991 INFO L93 Difference]: Finished difference Result 3061 states and 3823 transitions. [2018-09-19 12:42:04,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:42:04,993 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 188 [2018-09-19 12:42:04,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:42:05,005 INFO L225 Difference]: With dead ends: 3061 [2018-09-19 12:42:05,006 INFO L226 Difference]: Without dead ends: 1690 [2018-09-19 12:42:05,012 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 195 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:42:05,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2018-09-19 12:42:05,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1672. [2018-09-19 12:42:05,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2018-09-19 12:42:05,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1998 transitions. [2018-09-19 12:42:05,064 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1998 transitions. Word has length 188 [2018-09-19 12:42:05,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:42:05,065 INFO L480 AbstractCegarLoop]: Abstraction has 1672 states and 1998 transitions. [2018-09-19 12:42:05,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:42:05,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1998 transitions. [2018-09-19 12:42:05,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-09-19 12:42:05,068 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:42:05,068 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 12:42:05,069 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:42:05,069 INFO L82 PathProgramCache]: Analyzing trace with hash -895566748, now seen corresponding path program 1 times [2018-09-19 12:42:05,069 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:42:05,070 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 195 with the following transitions: [2018-09-19 12:42:05,070 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], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:42:05,078 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:42:05,079 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:42:05,126 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:42:05,229 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:42:05,231 INFO L272 AbstractInterpreter]: Visited 88 different actions 340 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:42:05,267 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:42:05,459 INFO L232 lantSequenceWeakener]: Weakened 191 states. On average, predicates are now at 73.2% of their original sizes. [2018-09-19 12:42:05,459 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:42:05,614 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:42:05,614 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:42:05,614 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:42:05,614 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:42:05,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:42:05,615 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:42:05,615 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:42:05,615 INFO L87 Difference]: Start difference. First operand 1672 states and 1998 transitions. Second operand 10 states. [2018-09-19 12:42:08,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:42:08,793 INFO L93 Difference]: Finished difference Result 3508 states and 4339 transitions. [2018-09-19 12:42:08,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:42:08,795 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 194 [2018-09-19 12:42:08,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:42:08,804 INFO L225 Difference]: With dead ends: 3508 [2018-09-19 12:42:08,804 INFO L226 Difference]: Without dead ends: 1986 [2018-09-19 12:42:08,809 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 201 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:42:08,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1986 states. [2018-09-19 12:42:08,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1986 to 1956. [2018-09-19 12:42:08,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1956 states. [2018-09-19 12:42:08,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1956 states and 2368 transitions. [2018-09-19 12:42:08,856 INFO L78 Accepts]: Start accepts. Automaton has 1956 states and 2368 transitions. Word has length 194 [2018-09-19 12:42:08,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:42:08,856 INFO L480 AbstractCegarLoop]: Abstraction has 1956 states and 2368 transitions. [2018-09-19 12:42:08,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:42:08,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1956 states and 2368 transitions. [2018-09-19 12:42:08,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-09-19 12:42:08,860 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:42:08,861 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:42:08,861 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:42:08,861 INFO L82 PathProgramCache]: Analyzing trace with hash -958529845, now seen corresponding path program 1 times [2018-09-19 12:42:08,861 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:42:08,862 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 200 with the following transitions: [2018-09-19 12:42:08,862 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], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:42:08,864 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:42:08,864 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:42:08,973 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:42:09,099 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:42:09,099 INFO L272 AbstractInterpreter]: Visited 88 different actions 340 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:42:09,124 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:42:09,330 INFO L232 lantSequenceWeakener]: Weakened 196 states. On average, predicates are now at 73.19% of their original sizes. [2018-09-19 12:42:09,331 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:42:09,534 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:42:09,534 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:42:09,535 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:42:09,535 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:42:09,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:42:09,535 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:42:09,535 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:42:09,536 INFO L87 Difference]: Start difference. First operand 1956 states and 2368 transitions. Second operand 10 states. [2018-09-19 12:42:12,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:42:12,502 INFO L93 Difference]: Finished difference Result 4370 states and 5531 transitions. [2018-09-19 12:42:12,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:42:12,512 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 199 [2018-09-19 12:42:12,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:42:12,521 INFO L225 Difference]: With dead ends: 4370 [2018-09-19 12:42:12,522 INFO L226 Difference]: Without dead ends: 2564 [2018-09-19 12:42:12,527 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 206 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:42:12,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2018-09-19 12:42:12,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 2527. [2018-09-19 12:42:12,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2527 states. [2018-09-19 12:42:12,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2527 states to 2527 states and 3089 transitions. [2018-09-19 12:42:12,594 INFO L78 Accepts]: Start accepts. Automaton has 2527 states and 3089 transitions. Word has length 199 [2018-09-19 12:42:12,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:42:12,594 INFO L480 AbstractCegarLoop]: Abstraction has 2527 states and 3089 transitions. [2018-09-19 12:42:12,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:42:12,595 INFO L276 IsEmpty]: Start isEmpty. Operand 2527 states and 3089 transitions. [2018-09-19 12:42:12,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-09-19 12:42:12,598 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:42:12,599 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:42:12,599 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:42:12,599 INFO L82 PathProgramCache]: Analyzing trace with hash -835964397, now seen corresponding path program 1 times [2018-09-19 12:42:12,600 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:42:12,600 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 204 with the following transitions: [2018-09-19 12:42:12,600 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], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [542], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:42:12,602 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:42:12,603 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:42:12,646 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:42:12,808 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:42:12,808 INFO L272 AbstractInterpreter]: Visited 90 different actions 434 times. Merged at 7 different actions 28 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:42:12,845 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:42:13,040 INFO L232 lantSequenceWeakener]: Weakened 200 states. On average, predicates are now at 73.18% of their original sizes. [2018-09-19 12:42:13,041 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:42:13,199 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:42:13,200 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:42:13,200 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:42:13,200 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:42:13,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:42:13,200 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:42:13,200 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:42:13,201 INFO L87 Difference]: Start difference. First operand 2527 states and 3089 transitions. Second operand 10 states. [2018-09-19 12:42:15,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:42:15,924 INFO L93 Difference]: Finished difference Result 5813 states and 7415 transitions. [2018-09-19 12:42:15,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:42:15,925 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 203 [2018-09-19 12:42:15,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:42:15,933 INFO L225 Difference]: With dead ends: 5813 [2018-09-19 12:42:15,934 INFO L226 Difference]: Without dead ends: 3436 [2018-09-19 12:42:15,940 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 210 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:42:15,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3436 states. [2018-09-19 12:42:16,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3436 to 3377. [2018-09-19 12:42:16,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3377 states. [2018-09-19 12:42:16,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3377 states to 3377 states and 4175 transitions. [2018-09-19 12:42:16,026 INFO L78 Accepts]: Start accepts. Automaton has 3377 states and 4175 transitions. Word has length 203 [2018-09-19 12:42:16,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:42:16,027 INFO L480 AbstractCegarLoop]: Abstraction has 3377 states and 4175 transitions. [2018-09-19 12:42:16,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:42:16,028 INFO L276 IsEmpty]: Start isEmpty. Operand 3377 states and 4175 transitions. [2018-09-19 12:42:16,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-09-19 12:42:16,034 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:42:16,035 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:42:16,035 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:42:16,035 INFO L82 PathProgramCache]: Analyzing trace with hash 920029951, now seen corresponding path program 1 times [2018-09-19 12:42:16,036 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:42:16,036 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 210 with the following transitions: [2018-09-19 12:42:16,036 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], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:42:16,039 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:42:16,039 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:42:16,085 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:42:21,075 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:42:21,075 INFO L272 AbstractInterpreter]: Visited 96 different actions 464 times. Merged at 7 different actions 28 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:42:21,084 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:42:22,380 INFO L232 lantSequenceWeakener]: Weakened 206 states. On average, predicates are now at 73.16% of their original sizes. [2018-09-19 12:42:22,380 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:42:22,479 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:42:22,479 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:42:22,479 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:42:22,479 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:42:22,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:42:22,480 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:42:22,480 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:42:22,480 INFO L87 Difference]: Start difference. First operand 3377 states and 4175 transitions. Second operand 10 states. [2018-09-19 12:42:25,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:42:25,846 INFO L93 Difference]: Finished difference Result 8372 states and 10738 transitions. [2018-09-19 12:42:25,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:42:25,847 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 209 [2018-09-19 12:42:25,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:42:25,865 INFO L225 Difference]: With dead ends: 8372 [2018-09-19 12:42:25,866 INFO L226 Difference]: Without dead ends: 5145 [2018-09-19 12:42:25,873 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 216 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:42:25,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5145 states. [2018-09-19 12:42:25,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5145 to 5045. [2018-09-19 12:42:25,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5045 states. [2018-09-19 12:42:25,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5045 states to 5045 states and 6270 transitions. [2018-09-19 12:42:25,984 INFO L78 Accepts]: Start accepts. Automaton has 5045 states and 6270 transitions. Word has length 209 [2018-09-19 12:42:25,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:42:25,985 INFO L480 AbstractCegarLoop]: Abstraction has 5045 states and 6270 transitions. [2018-09-19 12:42:25,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:42:25,985 INFO L276 IsEmpty]: Start isEmpty. Operand 5045 states and 6270 transitions. [2018-09-19 12:42:25,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-09-19 12:42:25,990 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:42:25,991 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:42:25,991 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:42:25,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1949343296, now seen corresponding path program 1 times [2018-09-19 12:42:25,991 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:42:25,992 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 225 with the following transitions: [2018-09-19 12:42:25,992 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], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [626], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:42:25,994 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:42:25,994 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:42:26,038 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:42:26,267 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:42:26,267 INFO L272 AbstractInterpreter]: Visited 111 different actions 539 times. Merged at 7 different actions 28 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:42:26,293 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:42:26,470 INFO L232 lantSequenceWeakener]: Weakened 221 states. On average, predicates are now at 73.13% of their original sizes. [2018-09-19 12:42:26,470 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:42:26,559 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:42:26,559 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:42:26,559 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:42:26,559 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:42:26,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:42:26,560 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:42:26,560 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:42:26,560 INFO L87 Difference]: Start difference. First operand 5045 states and 6270 transitions. Second operand 10 states. [2018-09-19 12:42:29,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:42:29,805 INFO L93 Difference]: Finished difference Result 10399 states and 13068 transitions. [2018-09-19 12:42:29,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:42:29,811 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 224 [2018-09-19 12:42:29,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:42:29,830 INFO L225 Difference]: With dead ends: 10399 [2018-09-19 12:42:29,830 INFO L226 Difference]: Without dead ends: 5504 [2018-09-19 12:42:29,839 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 231 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:42:29,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5504 states. [2018-09-19 12:42:29,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5504 to 5429. [2018-09-19 12:42:29,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5429 states. [2018-09-19 12:42:29,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5429 states to 5429 states and 6773 transitions. [2018-09-19 12:42:29,943 INFO L78 Accepts]: Start accepts. Automaton has 5429 states and 6773 transitions. Word has length 224 [2018-09-19 12:42:29,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:42:29,944 INFO L480 AbstractCegarLoop]: Abstraction has 5429 states and 6773 transitions. [2018-09-19 12:42:29,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:42:29,944 INFO L276 IsEmpty]: Start isEmpty. Operand 5429 states and 6773 transitions. [2018-09-19 12:42:29,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-09-19 12:42:29,950 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:42:29,950 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 12:42:29,951 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:42:29,951 INFO L82 PathProgramCache]: Analyzing trace with hash 843353692, now seen corresponding path program 1 times [2018-09-19 12:42:29,951 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:42:29,951 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 231 with the following transitions: [2018-09-19 12:42:29,952 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], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:42:29,954 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:42:29,954 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:42:30,029 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:42:30,236 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:42:30,236 INFO L272 AbstractInterpreter]: Visited 124 different actions 483 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:42:30,274 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:42:30,517 INFO L232 lantSequenceWeakener]: Weakened 227 states. On average, predicates are now at 73.12% of their original sizes. [2018-09-19 12:42:30,517 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:42:30,608 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:42:30,608 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:42:30,609 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:42:30,609 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:42:30,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:42:30,609 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:42:30,609 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:42:30,610 INFO L87 Difference]: Start difference. First operand 5429 states and 6773 transitions. Second operand 10 states. [2018-09-19 12:42:32,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:42:32,659 INFO L93 Difference]: Finished difference Result 11196 states and 14212 transitions. [2018-09-19 12:42:32,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:42:32,661 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 230 [2018-09-19 12:42:32,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:42:32,680 INFO L225 Difference]: With dead ends: 11196 [2018-09-19 12:42:32,680 INFO L226 Difference]: Without dead ends: 5917 [2018-09-19 12:42:32,690 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 237 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:42:32,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5917 states. [2018-09-19 12:42:32,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5917 to 5887. [2018-09-19 12:42:32,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5887 states. [2018-09-19 12:42:32,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5887 states to 5887 states and 7406 transitions. [2018-09-19 12:42:32,786 INFO L78 Accepts]: Start accepts. Automaton has 5887 states and 7406 transitions. Word has length 230 [2018-09-19 12:42:32,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:42:32,787 INFO L480 AbstractCegarLoop]: Abstraction has 5887 states and 7406 transitions. [2018-09-19 12:42:32,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:42:32,787 INFO L276 IsEmpty]: Start isEmpty. Operand 5887 states and 7406 transitions. [2018-09-19 12:42:32,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-09-19 12:42:32,794 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:42:32,794 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:42:32,794 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:42:32,794 INFO L82 PathProgramCache]: Analyzing trace with hash 828184843, now seen corresponding path program 1 times [2018-09-19 12:42:32,795 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:42:32,795 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 232 with the following transitions: [2018-09-19 12:42:32,795 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], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:42:32,797 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:42:32,798 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:42:32,839 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:42:33,111 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:42:33,111 INFO L272 AbstractInterpreter]: Visited 118 different actions 574 times. Merged at 7 different actions 28 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:42:33,147 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:42:33,364 INFO L232 lantSequenceWeakener]: Weakened 228 states. On average, predicates are now at 73.12% of their original sizes. [2018-09-19 12:42:33,364 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:42:33,461 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:42:33,461 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:42:33,461 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:42:33,461 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:42:33,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:42:33,462 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:42:33,462 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:42:33,462 INFO L87 Difference]: Start difference. First operand 5887 states and 7406 transitions. Second operand 10 states. [2018-09-19 12:42:36,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:42:36,019 INFO L93 Difference]: Finished difference Result 13421 states and 17237 transitions. [2018-09-19 12:42:36,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:42:36,019 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 231 [2018-09-19 12:42:36,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:42:36,044 INFO L225 Difference]: With dead ends: 13421 [2018-09-19 12:42:36,045 INFO L226 Difference]: Without dead ends: 7684 [2018-09-19 12:42:36,058 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 238 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:42:36,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7684 states. [2018-09-19 12:42:36,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7684 to 7560. [2018-09-19 12:42:36,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7560 states. [2018-09-19 12:42:36,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7560 states to 7560 states and 9639 transitions. [2018-09-19 12:42:36,193 INFO L78 Accepts]: Start accepts. Automaton has 7560 states and 9639 transitions. Word has length 231 [2018-09-19 12:42:36,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:42:36,194 INFO L480 AbstractCegarLoop]: Abstraction has 7560 states and 9639 transitions. [2018-09-19 12:42:36,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:42:36,194 INFO L276 IsEmpty]: Start isEmpty. Operand 7560 states and 9639 transitions. [2018-09-19 12:42:36,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-09-19 12:42:36,206 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:42:36,206 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:42:36,206 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:42:36,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1782854475, now seen corresponding path program 1 times [2018-09-19 12:42:36,207 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:42:36,207 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 264 with the following transitions: [2018-09-19 12:42:36,207 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [782], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:42:36,210 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:42:36,211 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:42:36,253 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:42:36,514 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:42:36,514 INFO L272 AbstractInterpreter]: Visited 150 different actions 587 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:42:36,520 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:42:36,758 INFO L232 lantSequenceWeakener]: Weakened 260 states. On average, predicates are now at 73.07% of their original sizes. [2018-09-19 12:42:36,758 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:42:36,850 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:42:36,850 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:42:36,851 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:42:36,851 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:42:36,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:42:36,851 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:42:36,852 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:42:36,852 INFO L87 Difference]: Start difference. First operand 7560 states and 9639 transitions. Second operand 10 states. [2018-09-19 12:42:40,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:42:40,116 INFO L93 Difference]: Finished difference Result 16780 states and 21621 transitions. [2018-09-19 12:42:40,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:42:40,120 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 263 [2018-09-19 12:42:40,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:42:40,143 INFO L225 Difference]: With dead ends: 16780 [2018-09-19 12:42:40,143 INFO L226 Difference]: Without dead ends: 9370 [2018-09-19 12:42:40,155 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 270 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:42:40,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9370 states. [2018-09-19 12:42:40,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9370 to 9238. [2018-09-19 12:42:40,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9238 states. [2018-09-19 12:42:40,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9238 states to 9238 states and 11908 transitions. [2018-09-19 12:42:40,487 INFO L78 Accepts]: Start accepts. Automaton has 9238 states and 11908 transitions. Word has length 263 [2018-09-19 12:42:40,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:42:40,487 INFO L480 AbstractCegarLoop]: Abstraction has 9238 states and 11908 transitions. [2018-09-19 12:42:40,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:42:40,488 INFO L276 IsEmpty]: Start isEmpty. Operand 9238 states and 11908 transitions. [2018-09-19 12:42:40,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-09-19 12:42:40,502 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:42:40,502 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:42:40,503 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:42:40,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1008876605, now seen corresponding path program 1 times [2018-09-19 12:42:40,503 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:42:40,503 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 273 with the following transitions: [2018-09-19 12:42:40,503 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], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [526], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:42:40,505 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:42:40,505 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:42:40,553 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:42:40,747 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:42:40,747 INFO L272 AbstractInterpreter]: Visited 89 different actions 438 times. Merged at 8 different actions 37 times. Never widened. Found 9 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:42:40,793 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:42:41,053 INFO L232 lantSequenceWeakener]: Weakened 269 states. On average, predicates are now at 73.1% of their original sizes. [2018-09-19 12:42:41,053 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:42:41,330 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:42:41,330 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:42:41,330 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:42:41,330 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:42:41,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:42:41,331 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:42:41,331 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:42:41,331 INFO L87 Difference]: Start difference. First operand 9238 states and 11908 transitions. Second operand 10 states. [2018-09-19 12:42:44,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:42:44,030 INFO L93 Difference]: Finished difference Result 20530 states and 26690 transitions. [2018-09-19 12:42:44,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:42:44,034 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 272 [2018-09-19 12:42:44,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:42:44,076 INFO L225 Difference]: With dead ends: 20530 [2018-09-19 12:42:44,076 INFO L226 Difference]: Without dead ends: 11442 [2018-09-19 12:42:44,094 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 279 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:42:44,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11442 states. [2018-09-19 12:42:44,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11442 to 11268. [2018-09-19 12:42:44,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11268 states. [2018-09-19 12:42:44,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11268 states to 11268 states and 14578 transitions. [2018-09-19 12:42:44,293 INFO L78 Accepts]: Start accepts. Automaton has 11268 states and 14578 transitions. Word has length 272 [2018-09-19 12:42:44,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:42:44,294 INFO L480 AbstractCegarLoop]: Abstraction has 11268 states and 14578 transitions. [2018-09-19 12:42:44,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:42:44,294 INFO L276 IsEmpty]: Start isEmpty. Operand 11268 states and 14578 transitions. [2018-09-19 12:42:44,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-09-19 12:42:44,310 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:42:44,311 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:42:44,311 INFO L423 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:42:44,311 INFO L82 PathProgramCache]: Analyzing trace with hash 289662669, now seen corresponding path program 1 times [2018-09-19 12:42:44,312 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:42:44,312 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 281 with the following transitions: [2018-09-19 12:42:44,312 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], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [534], [535], [538], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:42:44,314 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:42:44,314 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:42:44,370 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:42:44,544 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:42:44,544 INFO L272 AbstractInterpreter]: Visited 90 different actions 440 times. Merged at 8 different actions 34 times. Never widened. Found 8 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:42:44,581 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:42:44,829 INFO L232 lantSequenceWeakener]: Weakened 277 states. On average, predicates are now at 73.09% of their original sizes. [2018-09-19 12:42:44,829 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:42:44,921 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:42:44,922 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:42:44,922 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:42:44,922 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:42:44,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:42:44,923 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:42:44,923 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:42:44,923 INFO L87 Difference]: Start difference. First operand 11268 states and 14578 transitions. Second operand 10 states. [2018-09-19 12:42:48,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:42:48,364 INFO L93 Difference]: Finished difference Result 24169 states and 31450 transitions. [2018-09-19 12:42:48,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 12:42:48,374 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 280 [2018-09-19 12:42:48,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:42:48,409 INFO L225 Difference]: With dead ends: 24169 [2018-09-19 12:42:48,409 INFO L226 Difference]: Without dead ends: 13051 [2018-09-19 12:42:48,426 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 287 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:42:48,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13051 states. [2018-09-19 12:42:48,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13051 to 12904. [2018-09-19 12:42:48,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12904 states. [2018-09-19 12:42:48,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12904 states to 12904 states and 16702 transitions. [2018-09-19 12:42:48,633 INFO L78 Accepts]: Start accepts. Automaton has 12904 states and 16702 transitions. Word has length 280 [2018-09-19 12:42:48,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:42:48,633 INFO L480 AbstractCegarLoop]: Abstraction has 12904 states and 16702 transitions. [2018-09-19 12:42:48,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:42:48,634 INFO L276 IsEmpty]: Start isEmpty. Operand 12904 states and 16702 transitions. [2018-09-19 12:42:48,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-09-19 12:42:48,652 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:42:48,652 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:42:48,652 INFO L423 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:42:48,653 INFO L82 PathProgramCache]: Analyzing trace with hash 710527625, now seen corresponding path program 1 times [2018-09-19 12:42:48,653 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:42:48,653 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 283 with the following transitions: [2018-09-19 12:42:48,653 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], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:42:48,657 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:42:48,657 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:42:48,725 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:42:54,320 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:42:54,320 INFO L272 AbstractInterpreter]: Visited 97 different actions 573 times. Merged at 8 different actions 46 times. Widened at 1 different actions 1 times. Found 11 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:42:54,334 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:42:56,431 INFO L232 lantSequenceWeakener]: Weakened 279 states. On average, predicates are now at 73.08% of their original sizes. [2018-09-19 12:42:56,431 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:42:56,552 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:42:56,552 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:42:56,552 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:42:56,552 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:42:56,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:42:56,553 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:42:56,553 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:42:56,553 INFO L87 Difference]: Start difference. First operand 12904 states and 16702 transitions. Second operand 10 states. [2018-09-19 12:42:59,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:42:59,530 INFO L93 Difference]: Finished difference Result 27274 states and 35434 transitions. [2018-09-19 12:42:59,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:42:59,535 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 282 [2018-09-19 12:42:59,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:42:59,573 INFO L225 Difference]: With dead ends: 27274 [2018-09-19 12:42:59,573 INFO L226 Difference]: Without dead ends: 14520 [2018-09-19 12:42:59,591 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 289 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:42:59,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14520 states. [2018-09-19 12:42:59,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14520 to 14234. [2018-09-19 12:42:59,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14234 states. [2018-09-19 12:42:59,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14234 states to 14234 states and 18516 transitions. [2018-09-19 12:42:59,841 INFO L78 Accepts]: Start accepts. Automaton has 14234 states and 18516 transitions. Word has length 282 [2018-09-19 12:42:59,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:42:59,842 INFO L480 AbstractCegarLoop]: Abstraction has 14234 states and 18516 transitions. [2018-09-19 12:42:59,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:42:59,842 INFO L276 IsEmpty]: Start isEmpty. Operand 14234 states and 18516 transitions. [2018-09-19 12:42:59,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-09-19 12:42:59,858 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:42:59,859 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:42:59,859 INFO L423 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:42:59,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1054338192, now seen corresponding path program 1 times [2018-09-19 12:42:59,859 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:42:59,860 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 290 with the following transitions: [2018-09-19 12:42:59,860 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], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:42:59,862 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:42:59,862 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:42:59,909 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:43:00,102 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:43:00,102 INFO L272 AbstractInterpreter]: Visited 104 different actions 510 times. Merged at 8 different actions 34 times. Never widened. Found 8 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:43:00,127 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:43:00,326 INFO L232 lantSequenceWeakener]: Weakened 286 states. On average, predicates are now at 73.07% of their original sizes. [2018-09-19 12:43:00,326 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:43:00,416 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:43:00,417 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:43:00,417 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:43:00,417 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:43:00,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:43:00,418 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:43:00,418 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:43:00,418 INFO L87 Difference]: Start difference. First operand 14234 states and 18516 transitions. Second operand 10 states. [2018-09-19 12:43:03,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:43:03,168 INFO L93 Difference]: Finished difference Result 29317 states and 38295 transitions. [2018-09-19 12:43:03,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:43:03,169 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 289 [2018-09-19 12:43:03,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:43:03,205 INFO L225 Difference]: With dead ends: 29317 [2018-09-19 12:43:03,206 INFO L226 Difference]: Without dead ends: 15233 [2018-09-19 12:43:03,224 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 296 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:43:03,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15233 states. [2018-09-19 12:43:03,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15233 to 15014. [2018-09-19 12:43:03,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15014 states. [2018-09-19 12:43:03,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15014 states to 15014 states and 19527 transitions. [2018-09-19 12:43:03,457 INFO L78 Accepts]: Start accepts. Automaton has 15014 states and 19527 transitions. Word has length 289 [2018-09-19 12:43:03,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:43:03,458 INFO L480 AbstractCegarLoop]: Abstraction has 15014 states and 19527 transitions. [2018-09-19 12:43:03,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:43:03,458 INFO L276 IsEmpty]: Start isEmpty. Operand 15014 states and 19527 transitions. [2018-09-19 12:43:03,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-09-19 12:43:03,475 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:43:03,475 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:43:03,476 INFO L423 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:43:03,476 INFO L82 PathProgramCache]: Analyzing trace with hash 509400253, now seen corresponding path program 1 times [2018-09-19 12:43:03,476 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:43:03,476 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 293 with the following transitions: [2018-09-19 12:43:03,476 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], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [546], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:43:03,480 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:43:03,480 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:43:03,524 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:43:09,074 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-19 12:43:09,075 INFO L272 AbstractInterpreter]: Visited 98 different actions 570 times. Merged at 8 different actions 41 times. Widened at 1 different actions 1 times. Found 9 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:43:09,083 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 12:43:09,124 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 12:43:09,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 12:43:09 BoogieIcfgContainer [2018-09-19 12:43:09,125 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 12:43:09,126 INFO L168 Benchmark]: Toolchain (without parser) took 92471.57 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.5 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-19 12:43:09,128 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 12:43:09,128 INFO L168 Benchmark]: CACSL2BoogieTranslator took 713.94 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: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. [2018-09-19 12:43:09,129 INFO L168 Benchmark]: Boogie Procedure Inliner took 123.64 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-19 12:43:09,130 INFO L168 Benchmark]: Boogie Preprocessor took 228.54 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 778.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -858.3 MB). Peak memory consumption was 30.0 MB. Max. memory is 7.1 GB. [2018-09-19 12:43:09,131 INFO L168 Benchmark]: RCFGBuilder took 3532.13 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: 106.0 MB). Peak memory consumption was 106.0 MB. Max. memory is 7.1 GB. [2018-09-19 12:43:09,132 INFO L168 Benchmark]: TraceAbstraction took 87867.17 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-09-19 12:43:09,137 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 713.94 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: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 123.64 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 228.54 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 778.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -858.3 MB). Peak memory consumption was 30.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3532.13 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: 106.0 MB). Peak memory consumption was 106.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 87867.17 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.5 GB in the end (delta: -1.4 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: 106]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; [L579] int output = -1; [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND TRUE (((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0)) [L255] a1 = (((a1 / 5) + 110755) + 220746) [L256] a10 = 1 [L257] a19 = 8 [L259] RET return -1; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND 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 TRUE ((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14)) [L297] a1 = ((((((a1 * 9)/ 10) % 299993)+ -300005) / 5) + -75819) [L298] a10 = 4 [L300] RET return 26; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND TRUE ((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0)) [L272] a1 = (((((a1 % 25)+ -8) * 5) % 25)+ 13) [L273] a10 = 1 [L274] a19 = 7 [L276] RET return -1; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND TRUE (((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7)) [L106] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 87.7s OverallTime, 19 OverallIterations, 4 TraceHistogramMax, 53.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3206 SDtfs, 13038 SDslu, 6049 SDs, 0 SdLazy, 34286 SolverSat, 3435 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 43.3s Time, PredicateUnifierStatistics: 36 DeclaredPredicates, 3786 GetRequests, 3513 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15014occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 21.0s AbstIntTime, 19 AbstIntIterations, 18 AbstIntStrong, 0.9965184797151364 AbsIntWeakeningRatio, 0.12482890774705721 AbsIntAvgWeakeningVarsNumRemoved, 21.40678894059677 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 1471 StatesRemovedByMinimization, 18 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_label30_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_12-43-09-152.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label30_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_12-43-09-152.csv Received shutdown request...