java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label53_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-15 11:26:48,058 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-15 11:26:48,067 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-15 11:26:48,081 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-15 11:26:48,081 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-15 11:26:48,082 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-15 11:26:48,084 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-15 11:26:48,085 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-15 11:26:48,087 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-15 11:26:48,088 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-15 11:26:48,089 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-15 11:26:48,089 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-15 11:26:48,090 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-15 11:26:48,091 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-15 11:26:48,092 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-15 11:26:48,093 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-15 11:26:48,094 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-15 11:26:48,096 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-15 11:26:48,098 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-15 11:26:48,100 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-15 11:26:48,101 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-15 11:26:48,102 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-15 11:26:48,105 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-15 11:26:48,105 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-15 11:26:48,105 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-15 11:26:48,106 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-15 11:26:48,107 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-15 11:26:48,108 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-15 11:26:48,109 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-15 11:26:48,110 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-15 11:26:48,110 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-15 11:26:48,111 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-15 11:26:48,111 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-15 11:26:48,112 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-15 11:26:48,113 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-15 11:26:48,113 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-15 11:26:48,114 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf [2018-09-15 11:26:48,131 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-15 11:26:48,131 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-15 11:26:48,132 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-15 11:26:48,133 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-15 11:26:48,133 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-15 11:26:48,133 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-15 11:26:48,133 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-15 11:26:48,133 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-15 11:26:48,134 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-15 11:26:48,134 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-15 11:26:48,134 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-15 11:26:48,135 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-15 11:26:48,135 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-15 11:26:48,135 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-15 11:26:48,135 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-15 11:26:48,135 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-15 11:26:48,136 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-15 11:26:48,136 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-15 11:26:48,136 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-15 11:26:48,136 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-15 11:26:48,136 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-15 11:26:48,137 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-15 11:26:48,137 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-15 11:26:48,137 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-15 11:26:48,137 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-15 11:26:48,137 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-15 11:26:48,138 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-15 11:26:48,138 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-15 11:26:48,138 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-15 11:26:48,138 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-15 11:26:48,138 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-15 11:26:48,138 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-15 11:26:48,139 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-15 11:26:48,188 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-15 11:26:48,203 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-15 11:26:48,207 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-15 11:26:48,208 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-15 11:26:48,208 INFO L276 PluginConnector]: CDTParser initialized [2018-09-15 11:26:48,209 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label53_true-unreach-call.c [2018-09-15 11:26:48,552 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9305a7536/77596a2cb1b942cfb71b2e71ff723330/FLAGadb68679f [2018-09-15 11:26:48,832 INFO L277 CDTParser]: Found 1 translation units. [2018-09-15 11:26:48,833 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label53_true-unreach-call.c [2018-09-15 11:26:48,852 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9305a7536/77596a2cb1b942cfb71b2e71ff723330/FLAGadb68679f [2018-09-15 11:26:48,875 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9305a7536/77596a2cb1b942cfb71b2e71ff723330 [2018-09-15 11:26:48,888 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-15 11:26:48,891 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-15 11:26:48,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-15 11:26:48,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-15 11:26:48,902 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-15 11:26:48,903 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 11:26:48" (1/1) ... [2018-09-15 11:26:48,907 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6df1523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:26:48, skipping insertion in model container [2018-09-15 11:26:48,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 11:26:48" (1/1) ... [2018-09-15 11:26:48,923 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-15 11:26:49,433 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 11:26:49,452 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-15 11:26:49,598 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 11:26:49,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:26:49 WrapperNode [2018-09-15 11:26:49,658 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-15 11:26:49,659 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-15 11:26:49,659 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-15 11:26:49,659 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-15 11:26:49,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:26:49" (1/1) ... [2018-09-15 11:26:49,701 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:26:49" (1/1) ... [2018-09-15 11:26:49,788 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-15 11:26:49,789 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-15 11:26:49,789 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-15 11:26:49,789 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-15 11:26:49,960 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:26:49" (1/1) ... [2018-09-15 11:26:49,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:26:49" (1/1) ... [2018-09-15 11:26:49,968 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:26:49" (1/1) ... [2018-09-15 11:26:49,969 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:26:49" (1/1) ... [2018-09-15 11:26:49,999 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:26:49" (1/1) ... [2018-09-15 11:26:50,015 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:26:49" (1/1) ... [2018-09-15 11:26:50,025 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:26:49" (1/1) ... [2018-09-15 11:26:50,039 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-15 11:26:50,039 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-15 11:26:50,039 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-15 11:26:50,039 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-15 11:26:50,042 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:26:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-15 11:26:50,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-15 11:26:50,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-15 11:26:50,122 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-15 11:26:50,122 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-15 11:26:50,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-15 11:26:50,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-15 11:26:50,123 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-15 11:26:50,123 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-15 11:26:53,426 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-15 11:26:53,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 11:26:53 BoogieIcfgContainer [2018-09-15 11:26:53,427 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-15 11:26:53,428 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-15 11:26:53,428 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-15 11:26:53,433 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-15 11:26:53,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 11:26:48" (1/3) ... [2018-09-15 11:26:53,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7755af93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 11:26:53, skipping insertion in model container [2018-09-15 11:26:53,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:26:49" (2/3) ... [2018-09-15 11:26:53,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7755af93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 11:26:53, skipping insertion in model container [2018-09-15 11:26:53,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 11:26:53" (3/3) ... [2018-09-15 11:26:53,437 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label53_true-unreach-call.c [2018-09-15 11:26:53,448 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-15 11:26:53,460 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-15 11:26:53,522 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-15 11:26:53,523 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-15 11:26:53,524 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-15 11:26:53,524 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-15 11:26:53,524 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-15 11:26:53,524 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-15 11:26:53,525 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-15 11:26:53,525 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-15 11:26:53,525 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-15 11:26:53,565 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-15 11:26:53,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-15 11:26:53,574 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:26:53,575 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 11:26:53,576 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:26:53,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1566545735, now seen corresponding path program 1 times [2018-09-15 11:26:53,584 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:26:53,585 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 50 with the following transitions: [2018-09-15 11:26:53,587 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [293], [295], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-15 11:26:53,647 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:26:53,648 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:26:55,032 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 11:26:55,034 INFO L272 AbstractInterpreter]: Visited 48 different actions 48 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-15 11:26:55,049 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 11:26:55,679 INFO L232 lantSequenceWeakener]: Weakened 47 states. On average, predicates are now at 75.6% of their original sizes. [2018-09-15 11:26:55,679 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 11:26:55,989 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 11:26:55,990 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 11:26:55,991 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-15 11:26:55,991 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 11:26:55,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-15 11:26:56,004 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-15 11:26:56,005 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-15 11:26:56,007 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 6 states. [2018-09-15 11:27:00,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 11:27:00,678 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-15 11:27:00,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-15 11:27:00,680 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-09-15 11:27:00,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 11:27:00,697 INFO L225 Difference]: With dead ends: 576 [2018-09-15 11:27:00,697 INFO L226 Difference]: Without dead ends: 358 [2018-09-15 11:27:00,704 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-15 11:27:00,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-15 11:27:00,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-15 11:27:00,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-15 11:27:00,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-15 11:27:00,781 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 49 [2018-09-15 11:27:00,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 11:27:00,782 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-15 11:27:00,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-15 11:27:00,782 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-15 11:27:00,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-15 11:27:00,788 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:27:00,789 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 11:27:00,789 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:27:00,790 INFO L82 PathProgramCache]: Analyzing trace with hash 491983275, now seen corresponding path program 1 times [2018-09-15 11:27:00,790 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:27:00,790 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 121 with the following transitions: [2018-09-15 11:27:00,791 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [293], [295], [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-15 11:27:00,796 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:27:00,797 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:27:02,853 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 11:27:08,564 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 11:27:08,564 INFO L272 AbstractInterpreter]: Visited 78 different actions 150 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 11:27:08,607 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 11:27:11,935 INFO L232 lantSequenceWeakener]: Weakened 118 states. On average, predicates are now at 73.99% of their original sizes. [2018-09-15 11:27:11,935 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 11:27:13,735 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 11:27:13,735 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 11:27:13,736 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-15 11:27:13,736 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 11:27:13,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-15 11:27:13,738 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-15 11:27:13,739 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-15 11:27:13,739 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 10 states. [2018-09-15 11:27:19,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 11:27:19,966 INFO L93 Difference]: Finished difference Result 711 states and 1126 transitions. [2018-09-15 11:27:19,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-15 11:27:19,967 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2018-09-15 11:27:19,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 11:27:19,973 INFO L225 Difference]: With dead ends: 711 [2018-09-15 11:27:19,974 INFO L226 Difference]: Without dead ends: 505 [2018-09-15 11:27:19,976 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 126 GetRequests, 74 SyntacticMatches, 37 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-15 11:27:19,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-09-15 11:27:20,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 502. [2018-09-15 11:27:20,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2018-09-15 11:27:20,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 655 transitions. [2018-09-15 11:27:20,020 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 655 transitions. Word has length 120 [2018-09-15 11:27:20,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 11:27:20,022 INFO L480 AbstractCegarLoop]: Abstraction has 502 states and 655 transitions. [2018-09-15 11:27:20,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-15 11:27:20,022 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 655 transitions. [2018-09-15 11:27:20,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-09-15 11:27:20,025 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:27:20,026 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 11:27:20,026 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:27:20,027 INFO L82 PathProgramCache]: Analyzing trace with hash -126115612, now seen corresponding path program 1 times [2018-09-15 11:27:20,027 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:27:20,027 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 130 with the following transitions: [2018-09-15 11:27:20,027 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [293], [295], [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-15 11:27:20,032 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:27:20,032 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:27:26,758 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 11:27:26,759 INFO L272 AbstractInterpreter]: Visited 87 different actions 167 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 11:27:26,795 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 11:27:29,162 INFO L232 lantSequenceWeakener]: Weakened 127 states. On average, predicates are now at 73.9% of their original sizes. [2018-09-15 11:27:29,162 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 11:27:30,673 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 11:27:30,673 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 11:27:30,673 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-15 11:27:30,673 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 11:27:30,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-15 11:27:30,674 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-15 11:27:30,674 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-09-15 11:27:30,675 INFO L87 Difference]: Start difference. First operand 502 states and 655 transitions. Second operand 11 states. [2018-09-15 11:27:42,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 11:27:42,525 INFO L93 Difference]: Finished difference Result 1002 states and 1569 transitions. [2018-09-15 11:27:42,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-15 11:27:42,527 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 129 [2018-09-15 11:27:42,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 11:27:42,534 INFO L225 Difference]: With dead ends: 1002 [2018-09-15 11:27:42,535 INFO L226 Difference]: Without dead ends: 796 [2018-09-15 11:27:42,537 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 135 GetRequests, 82 SyntacticMatches, 37 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-15 11:27:42,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2018-09-15 11:27:42,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 793. [2018-09-15 11:27:42,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2018-09-15 11:27:42,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 962 transitions. [2018-09-15 11:27:42,596 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 962 transitions. Word has length 129 [2018-09-15 11:27:42,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 11:27:42,597 INFO L480 AbstractCegarLoop]: Abstraction has 793 states and 962 transitions. [2018-09-15 11:27:42,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-15 11:27:42,597 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 962 transitions. [2018-09-15 11:27:42,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-09-15 11:27:42,603 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:27:42,603 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 11:27:42,604 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:27:42,604 INFO L82 PathProgramCache]: Analyzing trace with hash -2004733972, now seen corresponding path program 1 times [2018-09-15 11:27:42,604 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:27:42,604 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 166 with the following transitions: [2018-09-15 11:27:42,605 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [293], [295], [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-15 11:27:42,610 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:27:42,610 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:27:45,455 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 11:27:55,879 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 11:27:55,879 INFO L272 AbstractInterpreter]: Visited 123 different actions 240 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 11:27:55,918 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 11:27:59,690 INFO L232 lantSequenceWeakener]: Weakened 163 states. On average, predicates are now at 73.64% of their original sizes. [2018-09-15 11:27:59,690 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 11:28:01,210 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 11:28:01,211 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 11:28:01,211 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-15 11:28:01,211 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 11:28:01,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-15 11:28:01,213 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-15 11:28:01,213 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-09-15 11:28:01,213 INFO L87 Difference]: Start difference. First operand 793 states and 962 transitions. Second operand 12 states. [2018-09-15 11:28:11,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 11:28:11,338 INFO L93 Difference]: Finished difference Result 1150 states and 1593 transitions. [2018-09-15 11:28:11,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-15 11:28:11,339 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 165 [2018-09-15 11:28:11,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 11:28:11,345 INFO L225 Difference]: With dead ends: 1150 [2018-09-15 11:28:11,345 INFO L226 Difference]: Without dead ends: 944 [2018-09-15 11:28:11,347 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 173 GetRequests, 117 SyntacticMatches, 37 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2018-09-15 11:28:11,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2018-09-15 11:28:11,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 939. [2018-09-15 11:28:11,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 939 states. [2018-09-15 11:28:11,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1120 transitions. [2018-09-15 11:28:11,394 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1120 transitions. Word has length 165 [2018-09-15 11:28:11,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 11:28:11,395 INFO L480 AbstractCegarLoop]: Abstraction has 939 states and 1120 transitions. [2018-09-15 11:28:11,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-15 11:28:11,395 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1120 transitions. [2018-09-15 11:28:11,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-09-15 11:28:11,401 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:28:11,401 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 11:28:11,401 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:28:11,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1107798485, now seen corresponding path program 1 times [2018-09-15 11:28:11,402 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:28:11,402 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 185 with the following transitions: [2018-09-15 11:28:11,403 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [293], [295], [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-15 11:28:11,408 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:28:11,408 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:28:35,022 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 11:28:35,023 INFO L272 AbstractInterpreter]: Visited 142 different actions 549 times. Merged at 5 different actions 14 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 11:28:35,031 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 11:28:36,801 INFO L232 lantSequenceWeakener]: Weakened 182 states. On average, predicates are now at 73.54% of their original sizes. [2018-09-15 11:28:36,802 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 11:28:37,655 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 11:28:37,656 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 11:28:37,656 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-09-15 11:28:37,656 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 11:28:37,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-15 11:28:37,657 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-15 11:28:37,657 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-09-15 11:28:37,658 INFO L87 Difference]: Start difference. First operand 939 states and 1120 transitions. Second operand 15 states. [2018-09-15 11:28:44,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 11:28:44,239 INFO L93 Difference]: Finished difference Result 1301 states and 1760 transitions. [2018-09-15 11:28:44,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-15 11:28:44,240 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 184 [2018-09-15 11:28:44,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 11:28:44,250 INFO L225 Difference]: With dead ends: 1301 [2018-09-15 11:28:44,250 INFO L226 Difference]: Without dead ends: 1095 [2018-09-15 11:28:44,252 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 195 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2018-09-15 11:28:44,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2018-09-15 11:28:44,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1089. [2018-09-15 11:28:44,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1089 states. [2018-09-15 11:28:44,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1286 transitions. [2018-09-15 11:28:44,305 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 1286 transitions. Word has length 184 [2018-09-15 11:28:44,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 11:28:44,306 INFO L480 AbstractCegarLoop]: Abstraction has 1089 states and 1286 transitions. [2018-09-15 11:28:44,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-15 11:28:44,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1286 transitions. [2018-09-15 11:28:44,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-09-15 11:28:44,310 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:28:44,310 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 11:28:44,310 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:28:44,311 INFO L82 PathProgramCache]: Analyzing trace with hash -297409480, now seen corresponding path program 1 times [2018-09-15 11:28:44,311 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:28:44,311 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 188 with the following transitions: [2018-09-15 11:28: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], [233], [241], [249], [257], [265], [273], [281], [289], [293], [295], [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], [755], [759], [763], [766], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 11:28:44,327 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:28:44,327 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:29:00,872 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 11:29:00,872 INFO L272 AbstractInterpreter]: Visited 145 different actions 284 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 11:29:00,876 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 11:29:04,424 INFO L232 lantSequenceWeakener]: Weakened 185 states. On average, predicates are now at 73.53% of their original sizes. [2018-09-15 11:29:04,425 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 11:29:06,194 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 11:29:06,195 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 11:29:06,195 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-15 11:29:06,195 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 11:29:06,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-15 11:29:06,196 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-15 11:29:06,196 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-09-15 11:29:06,197 INFO L87 Difference]: Start difference. First operand 1089 states and 1286 transitions. Second operand 14 states. [2018-09-15 11:29:17,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 11:29:17,672 INFO L93 Difference]: Finished difference Result 1594 states and 2078 transitions. [2018-09-15 11:29:17,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-15 11:29:17,674 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 187 [2018-09-15 11:29:17,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 11:29:17,681 INFO L225 Difference]: With dead ends: 1594 [2018-09-15 11:29:17,681 INFO L226 Difference]: Without dead ends: 1238 [2018-09-15 11:29:17,683 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 198 GetRequests, 137 SyntacticMatches, 37 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2018-09-15 11:29:17,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2018-09-15 11:29:17,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1235. [2018-09-15 11:29:17,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1235 states. [2018-09-15 11:29:17,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1444 transitions. [2018-09-15 11:29:17,746 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1444 transitions. Word has length 187 [2018-09-15 11:29:17,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 11:29:17,747 INFO L480 AbstractCegarLoop]: Abstraction has 1235 states and 1444 transitions. [2018-09-15 11:29:17,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-15 11:29:17,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1444 transitions. [2018-09-15 11:29:17,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-09-15 11:29:17,750 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:29:17,751 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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-15 11:29:17,751 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:29:17,751 INFO L82 PathProgramCache]: Analyzing trace with hash -2054425074, now seen corresponding path program 1 times [2018-09-15 11:29:17,751 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:29:17,752 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 197 with the following transitions: [2018-09-15 11:29:17,752 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [293], [295], [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-15 11:29:17,754 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:29:17,755 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:29:19,066 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 11:29:30,095 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 11:29:30,096 INFO L272 AbstractInterpreter]: Visited 84 different actions 244 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-15 11:29:30,103 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 11:29:33,507 INFO L232 lantSequenceWeakener]: Weakened 194 states. On average, predicates are now at 73.55% of their original sizes. [2018-09-15 11:29:33,507 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 11:29:34,815 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 11:29:34,815 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 11:29:34,816 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-15 11:29:34,816 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 11:29:34,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-15 11:29:34,816 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-15 11:29:34,817 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-15 11:29:34,817 INFO L87 Difference]: Start difference. First operand 1235 states and 1444 transitions. Second operand 10 states. [2018-09-15 11:29:43,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 11:29:43,681 INFO L93 Difference]: Finished difference Result 1749 states and 2252 transitions. [2018-09-15 11:29:43,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-15 11:29:43,691 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 196 [2018-09-15 11:29:43,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 11:29:43,698 INFO L225 Difference]: With dead ends: 1749 [2018-09-15 11:29:43,698 INFO L226 Difference]: Without dead ends: 1393 [2018-09-15 11:29:43,700 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 203 GetRequests, 150 SyntacticMatches, 37 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-15 11:29:43,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2018-09-15 11:29:43,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1383. [2018-09-15 11:29:43,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1383 states. [2018-09-15 11:29:43,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 1610 transitions. [2018-09-15 11:29:43,767 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 1610 transitions. Word has length 196 [2018-09-15 11:29:43,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 11:29:43,767 INFO L480 AbstractCegarLoop]: Abstraction has 1383 states and 1610 transitions. [2018-09-15 11:29:43,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-15 11:29:43,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 1610 transitions. [2018-09-15 11:29:43,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-09-15 11:29:43,772 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:29:43,772 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2018-09-15 11:29:43,772 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:29:43,772 INFO L82 PathProgramCache]: Analyzing trace with hash 307336662, now seen corresponding path program 1 times [2018-09-15 11:29:43,773 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:29:43,773 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 201 with the following transitions: [2018-09-15 11:29:43,773 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [293], [295], [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], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 11:29:43,776 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:29:43,776 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:29:45,267 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 11:30:04,311 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 11:30:04,311 INFO L272 AbstractInterpreter]: Visited 88 different actions 510 times. Merged at 7 different actions 37 times. Widened at 1 different actions 1 times. Found 7 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-15 11:30:04,316 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 11:30:05,668 INFO L232 lantSequenceWeakener]: Weakened 198 states. On average, predicates are now at 73.5% of their original sizes. [2018-09-15 11:30:05,668 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 11:30:06,650 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 11:30:06,650 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 11:30:06,650 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-09-15 11:30:06,650 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 11:30:06,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-15 11:30:06,651 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-15 11:30:06,651 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-09-15 11:30:06,651 INFO L87 Difference]: Start difference. First operand 1383 states and 1610 transitions. Second operand 15 states. [2018-09-15 11:30:16,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 11:30:16,708 INFO L93 Difference]: Finished difference Result 2585 states and 3385 transitions. [2018-09-15 11:30:16,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-15 11:30:16,710 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 200 [2018-09-15 11:30:16,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 11:30:16,720 INFO L225 Difference]: With dead ends: 2585 [2018-09-15 11:30:16,721 INFO L226 Difference]: Without dead ends: 2081 [2018-09-15 11:30:16,723 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 211 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=177, Invalid=525, Unknown=0, NotChecked=0, Total=702 [2018-09-15 11:30:16,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2081 states. [2018-09-15 11:30:16,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2081 to 2059. [2018-09-15 11:30:16,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2059 states. [2018-09-15 11:30:16,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2059 states to 2059 states and 2428 transitions. [2018-09-15 11:30:16,811 INFO L78 Accepts]: Start accepts. Automaton has 2059 states and 2428 transitions. Word has length 200 [2018-09-15 11:30:16,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 11:30:16,811 INFO L480 AbstractCegarLoop]: Abstraction has 2059 states and 2428 transitions. [2018-09-15 11:30:16,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-15 11:30:16,811 INFO L276 IsEmpty]: Start isEmpty. Operand 2059 states and 2428 transitions. [2018-09-15 11:30:16,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-09-15 11:30:16,817 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:30:16,817 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 11:30:16,817 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:30:16,818 INFO L82 PathProgramCache]: Analyzing trace with hash -668828691, now seen corresponding path program 1 times [2018-09-15 11:30:16,818 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:30:16,818 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 234 with the following transitions: [2018-09-15 11:30:16,818 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [293], [295], [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], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 11:30:16,821 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:30:16,821 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:30:18,117 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 11:30:41,234 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 11:30:41,234 INFO L272 AbstractInterpreter]: Visited 121 different actions 589 times. Merged at 7 different actions 28 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-15 11:30:41,241 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 11:30:42,626 INFO L232 lantSequenceWeakener]: Weakened 231 states. On average, predicates are now at 73.42% of their original sizes. [2018-09-15 11:30:42,627 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 11:30:43,343 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 11:30:43,343 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 11:30:43,343 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-15 11:30:43,344 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 11:30:43,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-15 11:30:43,344 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-15 11:30:43,344 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-15 11:30:43,345 INFO L87 Difference]: Start difference. First operand 2059 states and 2428 transitions. Second operand 13 states. [2018-09-15 11:30:53,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 11:30:53,945 INFO L93 Difference]: Finished difference Result 3850 states and 4951 transitions. [2018-09-15 11:30:53,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-15 11:30:53,952 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 233 [2018-09-15 11:30:53,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 11:30:53,964 INFO L225 Difference]: With dead ends: 3850 [2018-09-15 11:30:53,964 INFO L226 Difference]: Without dead ends: 2670 [2018-09-15 11:30:53,969 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 245 GetRequests, 209 SyntacticMatches, 12 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2018-09-15 11:30:53,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2670 states. [2018-09-15 11:30:54,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2670 to 2574. [2018-09-15 11:30:54,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2574 states. [2018-09-15 11:30:54,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2574 states to 2574 states and 3052 transitions. [2018-09-15 11:30:54,073 INFO L78 Accepts]: Start accepts. Automaton has 2574 states and 3052 transitions. Word has length 233 [2018-09-15 11:30:54,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 11:30:54,074 INFO L480 AbstractCegarLoop]: Abstraction has 2574 states and 3052 transitions. [2018-09-15 11:30:54,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-15 11:30:54,074 INFO L276 IsEmpty]: Start isEmpty. Operand 2574 states and 3052 transitions. [2018-09-15 11:30:54,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-09-15 11:30:54,080 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:30:54,080 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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-15 11:30:54,080 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:30:54,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1508633634, now seen corresponding path program 1 times [2018-09-15 11:30:54,080 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:30:54,081 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 237 with the following transitions: [2018-09-15 11:30:54,081 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [293], [295], [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], [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-15 11:30:54,084 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:30:54,084 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:30:55,544 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. Received shutdown request... [2018-09-15 11:31:04,013 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-09-15 11:31:04,014 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-09-15 11:31:04,015 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-15 11:31:04,049 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-15 11:31:04,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 11:31:04 BoogieIcfgContainer [2018-09-15 11:31:04,049 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-15 11:31:04,050 INFO L168 Benchmark]: Toolchain (without parser) took 255161.87 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -254.4 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-15 11:31:04,053 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-15 11:31:04,054 INFO L168 Benchmark]: CACSL2BoogieTranslator took 764.34 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-15 11:31:04,055 INFO L168 Benchmark]: Boogie Procedure Inliner took 129.81 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-15 11:31:04,057 INFO L168 Benchmark]: Boogie Preprocessor took 249.88 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -830.1 MB). Peak memory consumption was 28.9 MB. Max. memory is 7.1 GB. [2018-09-15 11:31:04,059 INFO L168 Benchmark]: RCFGBuilder took 3387.76 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: 111.4 MB). Peak memory consumption was 111.4 MB. Max. memory is 7.1 GB. [2018-09-15 11:31:04,059 INFO L168 Benchmark]: TraceAbstraction took 250621.61 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 408.8 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-15 11:31:04,064 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 764.34 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 129.81 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 249.88 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -830.1 MB). Peak memory consumption was 28.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3387.76 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: 111.4 MB). Peak memory consumption was 111.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 250621.61 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 408.8 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 130]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; [L579] int output = -1; [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND TRUE ((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0))) [L211] a1 = (((a1 + -15535) - 211896) / 5) [L212] a10 = 2 [L214] RET return 22; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND TRUE ((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0)) [L426] a1 = ((((a1 / 5) * 5) / 5) + 505228) [L427] a10 = 1 [L429] RET return 25; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL 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 TRUE (((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)) [L130] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 250.5s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 80.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1842 SDtfs, 7726 SDslu, 3386 SDs, 0 SdLazy, 18196 SolverSat, 1768 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 70.7s Time, PredicateUnifierStatistics: 18 DeclaredPredicates, 1534 GetRequests, 1169 SyntacticMatches, 197 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2041 ImplicationChecksByTransitivity, 14.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2574occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 136.8s AbstIntTime, 10 AbstIntIterations, 9 AbstIntStrong, 0.9939246918681458 AbsIntWeakeningRatio, 0.13204951856946354 AbsIntAvgWeakeningVarsNumRemoved, 303.8720770288858 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 150 StatesRemovedByMinimization, 9 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_label53_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-15_11-31-04-077.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label53_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-15_11-31-04-077.csv Completed graceful shutdown