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_CON-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label05_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-11 17:56:13,352 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-11 17:56:13,355 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-11 17:56:13,371 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-11 17:56:13,371 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-11 17:56:13,372 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-11 17:56:13,373 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-11 17:56:13,375 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-11 17:56:13,377 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-11 17:56:13,378 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-11 17:56:13,379 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-11 17:56:13,379 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-11 17:56:13,380 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-11 17:56:13,381 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-11 17:56:13,382 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-11 17:56:13,383 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-11 17:56:13,384 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-11 17:56:13,385 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-11 17:56:13,387 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-11 17:56:13,389 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-11 17:56:13,390 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-11 17:56:13,391 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-11 17:56:13,394 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-11 17:56:13,394 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-11 17:56:13,394 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-11 17:56:13,395 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-11 17:56:13,396 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-11 17:56:13,397 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-11 17:56:13,398 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-11 17:56:13,399 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-11 17:56:13,399 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-11 17:56:13,400 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-11 17:56:13,400 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-11 17:56:13,400 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-11 17:56:13,401 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-11 17:56:13,402 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-11 17:56:13,402 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf [2018-09-11 17:56:13,418 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-11 17:56:13,418 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-11 17:56:13,419 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-11 17:56:13,419 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-11 17:56:13,419 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-11 17:56:13,420 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-11 17:56:13,420 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-11 17:56:13,420 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-11 17:56:13,420 INFO L133 SettingsManager]: * Abstract domain=CongruenceDomain [2018-09-11 17:56:13,420 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-11 17:56:13,420 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-11 17:56:13,421 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-11 17:56:13,421 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-11 17:56:13,422 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-11 17:56:13,422 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-11 17:56:13,422 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-11 17:56:13,422 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-11 17:56:13,422 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-11 17:56:13,422 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-11 17:56:13,423 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-11 17:56:13,423 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-11 17:56:13,423 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-11 17:56:13,423 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-11 17:56:13,423 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-11 17:56:13,424 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-11 17:56:13,424 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-11 17:56:13,424 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-11 17:56:13,424 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-11 17:56:13,424 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-11 17:56:13,425 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-11 17:56:13,425 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-11 17:56:13,425 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-11 17:56:13,425 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-11 17:56:13,425 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-11 17:56:13,469 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-11 17:56:13,482 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-11 17:56:13,486 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-11 17:56:13,488 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-11 17:56:13,488 INFO L276 PluginConnector]: CDTParser initialized [2018-09-11 17:56:13,489 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label05_true-unreach-call_false-termination.c [2018-09-11 17:56:13,848 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd6491f37/238c4b9bb9854211accbdbc2dccee1f6/FLAGad6b712bd [2018-09-11 17:56:14,112 INFO L276 CDTParser]: Found 1 translation units. [2018-09-11 17:56:14,113 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label05_true-unreach-call_false-termination.c [2018-09-11 17:56:14,131 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd6491f37/238c4b9bb9854211accbdbc2dccee1f6/FLAGad6b712bd [2018-09-11 17:56:14,154 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd6491f37/238c4b9bb9854211accbdbc2dccee1f6 [2018-09-11 17:56:14,164 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-11 17:56:14,167 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-11 17:56:14,168 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-11 17:56:14,169 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-11 17:56:14,175 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-11 17:56:14,176 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 05:56:14" (1/1) ... [2018-09-11 17:56:14,179 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13e4f929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 05:56:14, skipping insertion in model container [2018-09-11 17:56:14,180 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 05:56:14" (1/1) ... [2018-09-11 17:56:14,417 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-11 17:56:14,737 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-11 17:56:14,769 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-11 17:56:14,937 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-11 17:56:14,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 05:56:14 WrapperNode [2018-09-11 17:56:14,985 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-11 17:56:14,986 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-11 17:56:14,986 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-11 17:56:14,987 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-11 17:56:14,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 05:56:14" (1/1) ... [2018-09-11 17:56:15,030 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 05:56:14" (1/1) ... [2018-09-11 17:56:15,104 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-11 17:56:15,104 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-11 17:56:15,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-11 17:56:15,104 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-11 17:56:15,231 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 05:56:14" (1/1) ... [2018-09-11 17:56:15,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 05:56:14" (1/1) ... [2018-09-11 17:56:15,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 05:56:14" (1/1) ... [2018-09-11 17:56:15,246 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 05:56:14" (1/1) ... [2018-09-11 17:56:15,280 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 05:56:14" (1/1) ... [2018-09-11 17:56:15,294 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 05:56:14" (1/1) ... [2018-09-11 17:56:15,300 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 05:56:14" (1/1) ... [2018-09-11 17:56:15,309 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-11 17:56:15,310 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-11 17:56:15,310 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-11 17:56:15,310 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-11 17:56:15,311 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 05:56:14" (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-11 17:56:15,391 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output [2018-09-11 17:56:15,391 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output [2018-09-11 17:56:15,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-11 17:56:15,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-11 17:56:15,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-11 17:56:15,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-11 17:56:15,393 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-11 17:56:15,393 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-11 17:56:18,976 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-11 17:56:18,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 05:56:18 BoogieIcfgContainer [2018-09-11 17:56:18,977 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-11 17:56:18,978 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-11 17:56:18,978 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-11 17:56:18,982 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-11 17:56:18,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 05:56:14" (1/3) ... [2018-09-11 17:56:18,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5563c576 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 05:56:18, skipping insertion in model container [2018-09-11 17:56:18,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 05:56:14" (2/3) ... [2018-09-11 17:56:18,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5563c576 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 05:56:18, skipping insertion in model container [2018-09-11 17:56:18,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 05:56:18" (3/3) ... [2018-09-11 17:56:18,986 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label05_true-unreach-call_false-termination.c [2018-09-11 17:56:18,998 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-11 17:56:19,008 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-11 17:56:19,067 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-11 17:56:19,068 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-11 17:56:19,068 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-11 17:56:19,068 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-11 17:56:19,068 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-11 17:56:19,069 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-11 17:56:19,069 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-11 17:56:19,069 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-11 17:56:19,069 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-11 17:56:19,111 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-09-11 17:56:19,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-09-11 17:56:19,134 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 17:56:19,138 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 17:56:19,140 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-11 17:56:19,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1794698859, now seen corresponding path program 1 times [2018-09-11 17:56:19,151 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 17:56:19,152 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 134 with the following transitions: [2018-09-11 17:56:19,156 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [20], [24], [28], [32], [36], [40], [51], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [169], [173], [177], [181], [185], [189], [193], [197], [208], [212], [216], [220], [231], [235], [239], [243], [247], [251], [255], [266], [270], [281], [285], [296], [307], [311], [315], [319], [323], [327], [331], [342], [346], [350], [354], [358], [362], [366], [370], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [689], [697], [705], [713], [721], [729], [733], [735], [862], [863], [867], [871], [877], [881], [888], [889], [890], [892] [2018-09-11 17:56:19,200 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 17:56:19,200 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 17:56:19,491 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 17:56:19,494 INFO L272 AbstractInterpreter]: Visited 132 different actions 132 times. Never merged. Never widened. Never found a fixpoint. Largest state had 37 variables. [2018-09-11 17:56:19,555 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 17:56:19,820 INFO L232 lantSequenceWeakener]: Weakened 130 states. On average, predicates are now at 81.24% of their original sizes. [2018-09-11 17:56:19,820 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 17:56:20,085 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 17:56:20,090 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 17:56:20,090 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-11 17:56:20,091 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 17:56:20,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-11 17:56:20,107 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-11 17:56:20,108 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-11 17:56:20,111 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 6 states. [2018-09-11 17:56:23,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 17:56:23,343 INFO L93 Difference]: Finished difference Result 622 states and 1061 transitions. [2018-09-11 17:56:23,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-11 17:56:23,345 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2018-09-11 17:56:23,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 17:56:23,364 INFO L225 Difference]: With dead ends: 622 [2018-09-11 17:56:23,364 INFO L226 Difference]: Without dead ends: 383 [2018-09-11 17:56:23,371 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 133 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-11 17:56:23,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-09-11 17:56:23,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 380. [2018-09-11 17:56:23,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-09-11 17:56:23,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 531 transitions. [2018-09-11 17:56:23,453 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 531 transitions. Word has length 133 [2018-09-11 17:56:23,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 17:56:23,456 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 531 transitions. [2018-09-11 17:56:23,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-11 17:56:23,457 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 531 transitions. [2018-09-11 17:56:23,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-09-11 17:56:23,467 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 17:56:23,471 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-11 17:56:23,472 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-11 17:56:23,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1376446252, now seen corresponding path program 1 times [2018-09-11 17:56:23,472 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 17:56:23,473 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 144 with the following transitions: [2018-09-11 17:56:23,473 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [8], [12], [16], [20], [24], [28], [32], [36], [40], [51], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [169], [173], [177], [181], [185], [189], [193], [197], [208], [212], [216], [220], [231], [235], [239], [243], [247], [251], [255], [266], [270], [281], [285], [296], [307], [311], [315], [319], [323], [327], [331], [342], [346], [350], [354], [358], [362], [366], [370], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [689], [697], [705], [713], [721], [729], [733], [735], [861], [862], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-11 17:56:23,486 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 17:56:23,486 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 17:56:23,595 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 17:56:23,595 INFO L272 AbstractInterpreter]: Visited 136 different actions 266 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-09-11 17:56:23,625 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 17:56:23,852 INFO L232 lantSequenceWeakener]: Weakened 140 states. On average, predicates are now at 81.26% of their original sizes. [2018-09-11 17:56:23,852 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 17:56:24,147 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 17:56:24,148 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 17:56:24,148 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-11 17:56:24,148 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 17:56:24,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-11 17:56:24,150 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-11 17:56:24,150 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-11 17:56:24,151 INFO L87 Difference]: Start difference. First operand 380 states and 531 transitions. Second operand 9 states. [2018-09-11 17:56:28,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 17:56:28,611 INFO L93 Difference]: Finished difference Result 905 states and 1347 transitions. [2018-09-11 17:56:28,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-11 17:56:28,614 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 143 [2018-09-11 17:56:28,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 17:56:28,622 INFO L225 Difference]: With dead ends: 905 [2018-09-11 17:56:28,623 INFO L226 Difference]: Without dead ends: 531 [2018-09-11 17:56:28,628 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 149 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-11 17:56:28,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-09-11 17:56:28,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 527. [2018-09-11 17:56:28,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-09-11 17:56:28,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 690 transitions. [2018-09-11 17:56:28,673 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 690 transitions. Word has length 143 [2018-09-11 17:56:28,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 17:56:28,673 INFO L480 AbstractCegarLoop]: Abstraction has 527 states and 690 transitions. [2018-09-11 17:56:28,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-11 17:56:28,674 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 690 transitions. [2018-09-11 17:56:28,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-09-11 17:56:28,677 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 17:56:28,678 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-11 17:56:28,678 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-11 17:56:28,678 INFO L82 PathProgramCache]: Analyzing trace with hash -134709924, now seen corresponding path program 1 times [2018-09-11 17:56:28,678 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 17:56:28,679 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 148 with the following transitions: [2018-09-11 17:56:28,679 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [20], [23], [24], [28], [32], [36], [40], [51], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [169], [173], [177], [181], [185], [189], [193], [197], [208], [212], [216], [220], [231], [235], [239], [243], [247], [251], [255], [266], [270], [281], [285], [296], [307], [311], [315], [319], [323], [327], [331], [342], [346], [350], [354], [358], [362], [366], [370], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [689], [697], [705], [713], [721], [729], [733], [735], [861], [862], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-11 17:56:28,683 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 17:56:28,683 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 17:56:28,795 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 17:56:28,795 INFO L272 AbstractInterpreter]: Visited 136 different actions 266 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-09-11 17:56:28,833 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 17:56:29,050 INFO L232 lantSequenceWeakener]: Weakened 144 states. On average, predicates are now at 81.24% of their original sizes. [2018-09-11 17:56:29,050 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 17:56:29,688 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 17:56:29,688 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 17:56:29,688 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-11 17:56:29,689 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 17:56:29,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-11 17:56:29,693 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-11 17:56:29,693 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-11 17:56:29,694 INFO L87 Difference]: Start difference. First operand 527 states and 690 transitions. Second operand 9 states. [2018-09-11 17:56:32,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 17:56:32,829 INFO L93 Difference]: Finished difference Result 1199 states and 1665 transitions. [2018-09-11 17:56:32,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-11 17:56:32,832 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 147 [2018-09-11 17:56:32,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 17:56:32,837 INFO L225 Difference]: With dead ends: 1199 [2018-09-11 17:56:32,838 INFO L226 Difference]: Without dead ends: 678 [2018-09-11 17:56:32,840 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 153 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-11 17:56:32,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2018-09-11 17:56:32,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 674. [2018-09-11 17:56:32,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2018-09-11 17:56:32,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 849 transitions. [2018-09-11 17:56:32,872 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 849 transitions. Word has length 147 [2018-09-11 17:56:32,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 17:56:32,873 INFO L480 AbstractCegarLoop]: Abstraction has 674 states and 849 transitions. [2018-09-11 17:56:32,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-11 17:56:32,873 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 849 transitions. [2018-09-11 17:56:32,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-09-11 17:56:32,877 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 17:56:32,877 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 17:56:32,878 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-11 17:56:32,878 INFO L82 PathProgramCache]: Analyzing trace with hash -179475877, now seen corresponding path program 1 times [2018-09-11 17:56:32,878 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 17:56:32,879 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 158 with the following transitions: [2018-09-11 17:56:32,879 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [8], [12], [16], [20], [23], [24], [28], [32], [36], [40], [51], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [169], [173], [177], [181], [185], [189], [193], [197], [208], [212], [216], [220], [231], [235], [239], [243], [247], [251], [255], [266], [270], [281], [285], [296], [307], [311], [315], [319], [323], [327], [331], [342], [346], [350], [354], [358], [362], [366], [370], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [689], [697], [705], [713], [721], [729], [733], [735], [861], [862], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-11 17:56:32,883 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 17:56:32,883 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 17:56:33,065 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 17:56:33,066 INFO L272 AbstractInterpreter]: Visited 137 different actions 538 times. Merged at 7 different actions 23 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 38 variables. [2018-09-11 17:56:33,103 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 17:56:33,259 INFO L232 lantSequenceWeakener]: Weakened 154 states. On average, predicates are now at 82.86% of their original sizes. [2018-09-11 17:56:33,260 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 17:56:33,642 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 17:56:33,642 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 17:56:33,642 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-11 17:56:33,643 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 17:56:33,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-11 17:56:33,644 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-11 17:56:33,644 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-11 17:56:33,644 INFO L87 Difference]: Start difference. First operand 674 states and 849 transitions. Second operand 9 states. [2018-09-11 17:56:37,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 17:56:37,102 INFO L93 Difference]: Finished difference Result 1505 states and 1999 transitions. [2018-09-11 17:56:37,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-11 17:56:37,106 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 157 [2018-09-11 17:56:37,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 17:56:37,112 INFO L225 Difference]: With dead ends: 1505 [2018-09-11 17:56:37,112 INFO L226 Difference]: Without dead ends: 837 [2018-09-11 17:56:37,114 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 163 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-11 17:56:37,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2018-09-11 17:56:37,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 828. [2018-09-11 17:56:37,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2018-09-11 17:56:37,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1043 transitions. [2018-09-11 17:56:37,140 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1043 transitions. Word has length 157 [2018-09-11 17:56:37,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 17:56:37,141 INFO L480 AbstractCegarLoop]: Abstraction has 828 states and 1043 transitions. [2018-09-11 17:56:37,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-11 17:56:37,141 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1043 transitions. [2018-09-11 17:56:37,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-09-11 17:56:37,144 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 17:56:37,145 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-11 17:56:37,145 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-11 17:56:37,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1818949796, now seen corresponding path program 1 times [2018-09-11 17:56:37,146 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 17:56:37,146 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 167 with the following transitions: [2018-09-11 17:56:37,146 INFO L202 CegarAbsIntRunner]: [0], [3], [4], [7], [8], [12], [16], [20], [23], [24], [28], [32], [36], [40], [51], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [169], [173], [177], [181], [185], [189], [193], [197], [208], [212], [216], [220], [231], [235], [239], [243], [247], [251], [255], [266], [270], [281], [285], [296], [307], [311], [315], [319], [323], [327], [331], [342], [346], [350], [354], [358], [362], [366], [370], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [689], [697], [705], [713], [721], [729], [733], [735], [861], [862], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-11 17:56:37,149 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 17:56:37,149 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 17:56:37,345 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 17:56:37,346 INFO L272 AbstractInterpreter]: Visited 138 different actions 817 times. Merged at 8 different actions 44 times. Widened at 1 different actions 1 times. Found 11 fixpoints after 1 different actions. Largest state had 38 variables. [2018-09-11 17:56:37,376 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 17:56:37,501 INFO L232 lantSequenceWeakener]: Weakened 163 states. On average, predicates are now at 85.1% of their original sizes. [2018-09-11 17:56:37,502 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 17:56:37,630 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 17:56:37,631 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 17:56:37,631 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-11 17:56:37,631 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 17:56:37,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-11 17:56:37,632 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-11 17:56:37,632 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-11 17:56:37,633 INFO L87 Difference]: Start difference. First operand 828 states and 1043 transitions. Second operand 9 states. [2018-09-11 17:56:39,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 17:56:39,811 INFO L93 Difference]: Finished difference Result 1885 states and 2519 transitions. [2018-09-11 17:56:39,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-11 17:56:39,812 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 166 [2018-09-11 17:56:39,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 17:56:39,818 INFO L225 Difference]: With dead ends: 1885 [2018-09-11 17:56:39,819 INFO L226 Difference]: Without dead ends: 1063 [2018-09-11 17:56:39,822 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 176 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2018-09-11 17:56:39,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2018-09-11 17:56:39,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 1052. [2018-09-11 17:56:39,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2018-09-11 17:56:39,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1328 transitions. [2018-09-11 17:56:39,855 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1328 transitions. Word has length 166 [2018-09-11 17:56:39,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 17:56:39,856 INFO L480 AbstractCegarLoop]: Abstraction has 1052 states and 1328 transitions. [2018-09-11 17:56:39,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-11 17:56:39,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1328 transitions. [2018-09-11 17:56:39,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-09-11 17:56:39,861 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 17:56:39,861 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 17:56:39,861 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-11 17:56:39,862 INFO L82 PathProgramCache]: Analyzing trace with hash -356006106, now seen corresponding path program 1 times [2018-09-11 17:56:39,862 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 17:56:39,862 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 171 with the following transitions: [2018-09-11 17:56:39,863 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [20], [23], [24], [28], [32], [36], [40], [51], [62], [66], [70], [73], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [169], [173], [177], [181], [185], [189], [193], [197], [208], [212], [216], [220], [231], [235], [239], [243], [247], [251], [255], [266], [270], [281], [285], [296], [307], [311], [315], [319], [323], [327], [331], [342], [346], [350], [354], [358], [362], [366], [370], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [689], [697], [705], [713], [721], [729], [733], [735], [861], [862], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-11 17:56:39,865 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 17:56:39,865 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 17:56:39,975 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 17:56:39,975 INFO L272 AbstractInterpreter]: Visited 137 different actions 403 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-09-11 17:56:40,002 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 17:56:40,221 INFO L232 lantSequenceWeakener]: Weakened 167 states. On average, predicates are now at 81.64% of their original sizes. [2018-09-11 17:56:40,221 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 17:56:40,451 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 17:56:40,451 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 17:56:40,452 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-11 17:56:40,452 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 17:56:40,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-11 17:56:40,453 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-11 17:56:40,453 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-11 17:56:40,454 INFO L87 Difference]: Start difference. First operand 1052 states and 1328 transitions. Second operand 10 states. [2018-09-11 17:56:44,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 17:56:44,260 INFO L93 Difference]: Finished difference Result 2628 states and 3535 transitions. [2018-09-11 17:56:44,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-11 17:56:44,262 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 170 [2018-09-11 17:56:44,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 17:56:44,270 INFO L225 Difference]: With dead ends: 2628 [2018-09-11 17:56:44,270 INFO L226 Difference]: Without dead ends: 1582 [2018-09-11 17:56:44,274 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 183 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2018-09-11 17:56:44,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2018-09-11 17:56:44,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1565. [2018-09-11 17:56:44,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2018-09-11 17:56:44,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 1963 transitions. [2018-09-11 17:56:44,319 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 1963 transitions. Word has length 170 [2018-09-11 17:56:44,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 17:56:44,320 INFO L480 AbstractCegarLoop]: Abstraction has 1565 states and 1963 transitions. [2018-09-11 17:56:44,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-11 17:56:44,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 1963 transitions. [2018-09-11 17:56:44,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-09-11 17:56:44,325 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 17:56:44,326 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-11 17:56:44,326 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-11 17:56:44,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1944385683, now seen corresponding path program 1 times [2018-09-11 17:56:44,327 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 17:56:44,327 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 187 with the following transitions: [2018-09-11 17:56:44,327 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [8], [12], [16], [20], [23], [24], [28], [32], [36], [40], [51], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [169], [173], [177], [181], [185], [189], [193], [197], [208], [212], [216], [220], [231], [235], [239], [243], [247], [251], [255], [266], [270], [281], [285], [296], [307], [311], [315], [319], [323], [327], [331], [342], [346], [350], [354], [358], [362], [366], [370], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [689], [697], [705], [713], [721], [729], [733], [735], [861], [862], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-11 17:56:44,329 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 17:56:44,329 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 17:56:44,477 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 17:56:44,477 INFO L272 AbstractInterpreter]: Visited 138 different actions 682 times. Merged at 8 different actions 36 times. Never widened. Found 9 fixpoints after 2 different actions. Largest state had 38 variables. [2018-09-11 17:56:44,515 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 17:56:44,649 INFO L232 lantSequenceWeakener]: Weakened 183 states. On average, predicates are now at 86.94% of their original sizes. [2018-09-11 17:56:44,649 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 17:56:44,754 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 17:56:44,754 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 17:56:44,754 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-11 17:56:44,754 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 17:56:44,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-11 17:56:44,755 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-11 17:56:44,755 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-11 17:56:44,755 INFO L87 Difference]: Start difference. First operand 1565 states and 1963 transitions. Second operand 9 states. [2018-09-11 17:56:47,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 17:56:47,399 INFO L93 Difference]: Finished difference Result 3474 states and 4505 transitions. [2018-09-11 17:56:47,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-11 17:56:47,400 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 186 [2018-09-11 17:56:47,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 17:56:47,411 INFO L225 Difference]: With dead ends: 3474 [2018-09-11 17:56:47,411 INFO L226 Difference]: Without dead ends: 1915 [2018-09-11 17:56:47,415 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 195 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2018-09-11 17:56:47,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1915 states. [2018-09-11 17:56:47,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1915 to 1874. [2018-09-11 17:56:47,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1874 states. [2018-09-11 17:56:47,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2394 transitions. [2018-09-11 17:56:47,477 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2394 transitions. Word has length 186 [2018-09-11 17:56:47,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 17:56:47,478 INFO L480 AbstractCegarLoop]: Abstraction has 1874 states and 2394 transitions. [2018-09-11 17:56:47,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-11 17:56:47,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2394 transitions. [2018-09-11 17:56:47,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-09-11 17:56:47,485 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 17:56:47,485 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 17:56:47,485 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-11 17:56:47,485 INFO L82 PathProgramCache]: Analyzing trace with hash 362415925, now seen corresponding path program 1 times [2018-09-11 17:56:47,486 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 17:56:47,486 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 194 with the following transitions: [2018-09-11 17:56:47,486 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [8], [12], [16], [20], [23], [24], [28], [32], [36], [40], [51], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [125], [126], [130], [134], [138], [142], [146], [150], [154], [158], [169], [173], [177], [181], [185], [189], [193], [197], [208], [212], [216], [220], [231], [235], [239], [243], [247], [251], [255], [266], [270], [281], [285], [296], [307], [311], [315], [319], [323], [327], [331], [342], [346], [350], [354], [358], [362], [366], [370], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [689], [697], [705], [713], [721], [729], [733], [735], [861], [862], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-09-11 17:56:47,488 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 17:56:47,488 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 17:56:47,647 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-11 17:56:47,647 INFO L272 AbstractInterpreter]: Visited 139 different actions 683 times. Merged at 8 different actions 36 times. Never widened. Found 9 fixpoints after 2 different actions. Largest state had 38 variables. [2018-09-11 17:56:47,686 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-11 17:56:47,738 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-11 17:56:47,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 05:56:47 BoogieIcfgContainer [2018-09-11 17:56:47,738 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-11 17:56:47,739 INFO L168 Benchmark]: Toolchain (without parser) took 33575.26 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -920.0 MB). Peak memory consumption was 274.4 MB. Max. memory is 7.1 GB. [2018-09-11 17:56:47,742 INFO L168 Benchmark]: CDTParser took 0.20 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-11 17:56:47,743 INFO L168 Benchmark]: CACSL2BoogieTranslator took 817.23 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-11 17:56:47,744 INFO L168 Benchmark]: Boogie Procedure Inliner took 117.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-11 17:56:47,745 INFO L168 Benchmark]: Boogie Preprocessor took 205.05 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -834.1 MB). Peak memory consumption was 34.9 MB. Max. memory is 7.1 GB. [2018-09-11 17:56:47,746 INFO L168 Benchmark]: RCFGBuilder took 3667.51 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: 119.5 MB). Peak memory consumption was 119.5 MB. Max. memory is 7.1 GB. [2018-09-11 17:56:47,748 INFO L168 Benchmark]: TraceAbstraction took 28760.51 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 446.2 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -247.7 MB). Peak memory consumption was 198.5 MB. Max. memory is 7.1 GB. [2018-09-11 17:56:47,758 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.20 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 817.23 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 117.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 205.05 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -834.1 MB). Peak memory consumption was 34.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3667.51 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: 119.5 MB). Peak memory consumption was 119.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28760.51 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 446.2 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -247.7 MB). Peak memory consumption was 198.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 550]: 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 a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND TRUE ((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1))) [L36] a28 = 10 [L37] RET return 22; [L614] EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) [L50] COND TRUE ((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7))))) [L51] a28 = 11 [L52] a25 = 1 [L53] RET return 26; [L614] EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) [L169] COND TRUE ((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1))) [L170] a17 = 7 [L171] a11 = 1 [L172] a28 = 7 [L173] a25 = 1 [L174] RET return -1; [L614] EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) [L394] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) [L398] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) [L402] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) [L404] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) [L407] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) [L409] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) [L414] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) [L417] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) [L420] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) [L423] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) [L426] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8))) [L429] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7))) [L432] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==7))) [L435] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8))) [L438] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) [L441] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==8))&&(a19==1))&&(a21==1))&&(a17==8))) [L444] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==11))&&!(a19==1))&&(a21==1))&&(a17==8))) [L447] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) [L450] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==8))&&(a19==1))&&(a21==1))&&(a17==7))) [L453] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==7))) [L456] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==11))&&(a19==1))&&(a21==1))&&(a17==7))) [L459] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==8))&&(a19==1))&&(a21==1))&&(a17==7))) [L462] COND FALSE !((((((!(a25==1)&&!(a11==1))&&(a28==8))&&(a19==1))&&(a21==1))&&(a17==7))) [L465] COND FALSE !((((((!(a25==1)&&!(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7))) [L468] COND FALSE !((((((!(a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) [L471] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==8))&&(a19==1))&&(a21==1))&&(a17==8))) [L474] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==8))) [L477] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==7))) [L480] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==11))&&!(a19==1))&&(a21==1))&&(a17==8))) [L483] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==8))&&!(a19==1))&&(a21==1))&&(a17==8))) [L486] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==8))) [L489] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==7))) [L492] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==11))&&(a19==1))&&(a21==1))&&(a17==8))) [L495] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==8))&&!(a19==1))&&(a21==1))&&(a17==7))) [L498] COND FALSE !((((((!(a25==1)&&!(a11==1))&&(a28==8))&&!(a19==1))&&(a21==1))&&(a17==7))) [L501] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==8))&&!(a19==1))&&(a21==1))&&(a17==8))) [L504] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) [L507] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) [L510] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==8))&&(a19==1))&&(a21==1))&&(a17==7))) [L513] COND FALSE !((((((!(a25==1)&&!(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==7))) [L516] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) [L519] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==8))&&!(a19==1))&&(a21==1))&&(a17==7))) [L522] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7))) [L525] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==8))&&!(a19==1))&&(a21==1))&&(a17==7))) [L528] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==11))&&!(a19==1))&&(a21==1))&&(a17==7))) [L531] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==11))&&!(a19==1))&&(a21==1))&&(a17==7))) [L534] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==7))) [L537] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==11))&&(a19==1))&&(a21==1))&&(a17==7))) [L540] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==8))) [L543] COND FALSE !((((((!(a25==1)&&!(a11==1))&&(a28==11))&&(a19==1))&&(a21==1))&&(a17==7))) [L546] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) [L549] COND TRUE ((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==7)) [L550] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. UNKNOWN Result, 28.6s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 23.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1518 SDtfs, 5050 SDslu, 2745 SDs, 0 SdLazy, 12733 SolverSat, 1744 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.8s Time, PredicateUnifierStatistics: 14 DeclaredPredicates, 1152 GetRequests, 1048 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1874occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.6s AbstIntTime, 8 AbstIntIterations, 7 AbstIntStrong, 0.9973324011201432 AbsIntWeakeningRatio, 0.2 AbsIntAvgWeakeningVarsNumRemoved, 16.206392694063926 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 89 StatesRemovedByMinimization, 7 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/Problem02_label05_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-11_17-56-47-786.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem02_label05_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-11_17-56-47-786.csv Received shutdown request...