java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label39.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 17:34:07,863 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 17:34:07,866 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 17:34:07,883 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 17:34:07,884 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 17:34:07,885 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 17:34:07,887 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 17:34:07,900 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 17:34:07,901 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 17:34:07,903 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 17:34:07,906 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 17:34:07,908 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 17:34:07,908 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 17:34:07,910 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 17:34:07,911 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 17:34:07,913 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 17:34:07,914 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 17:34:07,915 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 17:34:07,919 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 17:34:07,921 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 17:34:07,925 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 17:34:07,926 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 17:34:07,927 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 17:34:07,928 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 17:34:07,931 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 17:34:07,931 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 17:34:07,931 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 17:34:07,932 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 17:34:07,933 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 17:34:07,935 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 17:34:07,935 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 17:34:07,936 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 17:34:07,937 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 17:34:07,939 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 17:34:07,941 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 17:34:07,941 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 17:34:07,941 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 17:34:07,942 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 17:34:07,942 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 17:34:07,943 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 17:34:07,945 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 17:34:07,947 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-02 17:34:07,967 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 17:34:07,967 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 17:34:07,968 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-02 17:34:07,968 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-02 17:34:07,969 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-02 17:34:07,969 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-02 17:34:07,969 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-02 17:34:07,969 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-02 17:34:07,970 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-02 17:34:07,970 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-02 17:34:07,970 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 17:34:07,971 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 17:34:07,971 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 17:34:07,971 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 17:34:07,971 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 17:34:07,971 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 17:34:07,972 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 17:34:07,972 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 17:34:07,972 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 17:34:07,972 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 17:34:07,973 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 17:34:07,973 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-02 17:34:07,973 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 17:34:07,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 17:34:07,973 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 17:34:07,974 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 17:34:07,974 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-02 17:34:07,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 17:34:07,974 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 17:34:07,974 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-02 17:34:08,027 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 17:34:08,042 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 17:34:08,048 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 17:34:08,050 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 17:34:08,050 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 17:34:08,051 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label39.c [2019-10-02 17:34:08,117 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1263f614b/5bcc4219f67444df964882a65ea817ce/FLAG9d175bc70 [2019-10-02 17:34:08,695 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 17:34:08,696 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label39.c [2019-10-02 17:34:08,712 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1263f614b/5bcc4219f67444df964882a65ea817ce/FLAG9d175bc70 [2019-10-02 17:34:08,947 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1263f614b/5bcc4219f67444df964882a65ea817ce [2019-10-02 17:34:08,956 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 17:34:08,958 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 17:34:08,959 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 17:34:08,959 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 17:34:08,963 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 17:34:08,964 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 05:34:08" (1/1) ... [2019-10-02 17:34:08,967 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62648d18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:34:08, skipping insertion in model container [2019-10-02 17:34:08,967 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 05:34:08" (1/1) ... [2019-10-02 17:34:08,975 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 17:34:09,033 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 17:34:09,526 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 17:34:09,534 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 17:34:09,646 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 17:34:09,670 INFO L192 MainTranslator]: Completed translation [2019-10-02 17:34:09,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:34:09 WrapperNode [2019-10-02 17:34:09,671 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 17:34:09,672 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 17:34:09,672 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 17:34:09,672 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 17:34:09,684 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:34:09" (1/1) ... [2019-10-02 17:34:09,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:34:09" (1/1) ... [2019-10-02 17:34:09,704 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:34:09" (1/1) ... [2019-10-02 17:34:09,704 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:34:09" (1/1) ... [2019-10-02 17:34:09,749 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:34:09" (1/1) ... [2019-10-02 17:34:09,780 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:34:09" (1/1) ... [2019-10-02 17:34:09,786 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:34:09" (1/1) ... [2019-10-02 17:34:09,796 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 17:34:09,796 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 17:34:09,797 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 17:34:09,797 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 17:34:09,798 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:34:09" (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 [2019-10-02 17:34:09,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 17:34:09,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 17:34:09,863 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 17:34:09,863 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 17:34:09,864 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 17:34:09,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 17:34:09,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 17:34:09,864 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 17:34:09,864 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 17:34:09,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 17:34:09,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 17:34:11,076 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 17:34:11,077 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 17:34:11,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 05:34:11 BoogieIcfgContainer [2019-10-02 17:34:11,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 17:34:11,080 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 17:34:11,080 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 17:34:11,083 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 17:34:11,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 05:34:08" (1/3) ... [2019-10-02 17:34:11,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dce5f0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 05:34:11, skipping insertion in model container [2019-10-02 17:34:11,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:34:09" (2/3) ... [2019-10-02 17:34:11,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dce5f0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 05:34:11, skipping insertion in model container [2019-10-02 17:34:11,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 05:34:11" (3/3) ... [2019-10-02 17:34:11,087 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label39.c [2019-10-02 17:34:11,098 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 17:34:11,106 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 17:34:11,124 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 17:34:11,162 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 17:34:11,163 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-02 17:34:11,163 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 17:34:11,164 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 17:34:11,164 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 17:34:11,164 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 17:34:11,164 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 17:34:11,164 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 17:34:11,193 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2019-10-02 17:34:11,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-02 17:34:11,210 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:34:11,212 INFO L411 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] [2019-10-02 17:34:11,214 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:34:11,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:34:11,219 INFO L82 PathProgramCache]: Analyzing trace with hash 640678305, now seen corresponding path program 1 times [2019-10-02 17:34:11,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:34:11,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:34:11,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:34:11,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:34:11,271 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:34:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:34:11,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:34:11,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:34:11,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 17:34:11,791 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:34:11,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 17:34:11,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 17:34:11,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 17:34:11,816 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 3 states. [2019-10-02 17:34:12,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:34:12,837 INFO L93 Difference]: Finished difference Result 388 states and 554 transitions. [2019-10-02 17:34:12,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 17:34:12,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-10-02 17:34:12,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:34:12,870 INFO L225 Difference]: With dead ends: 388 [2019-10-02 17:34:12,871 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 17:34:12,874 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 17:34:12,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 17:34:12,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 17:34:12,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 17:34:12,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 465 transitions. [2019-10-02 17:34:12,985 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 465 transitions. Word has length 117 [2019-10-02 17:34:12,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:34:12,986 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 465 transitions. [2019-10-02 17:34:12,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 17:34:12,987 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 465 transitions. [2019-10-02 17:34:12,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-02 17:34:12,991 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:34:12,992 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 17:34:12,992 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:34:12,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:34:12,993 INFO L82 PathProgramCache]: Analyzing trace with hash -758657178, now seen corresponding path program 1 times [2019-10-02 17:34:12,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:34:12,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:34:12,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:34:12,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:34:12,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:34:13,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:34:13,335 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:34:13,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:34:13,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 17:34:13,336 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:34:13,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 17:34:13,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 17:34:13,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:34:13,339 INFO L87 Difference]: Start difference. First operand 320 states and 465 transitions. Second operand 5 states. [2019-10-02 17:34:14,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:34:14,023 INFO L93 Difference]: Finished difference Result 407 states and 552 transitions. [2019-10-02 17:34:14,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 17:34:14,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 125 [2019-10-02 17:34:14,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:34:14,032 INFO L225 Difference]: With dead ends: 407 [2019-10-02 17:34:14,032 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 17:34:14,033 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:34:14,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 17:34:14,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 17:34:14,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 17:34:14,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 461 transitions. [2019-10-02 17:34:14,053 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 461 transitions. Word has length 125 [2019-10-02 17:34:14,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:34:14,053 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 461 transitions. [2019-10-02 17:34:14,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 17:34:14,054 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 461 transitions. [2019-10-02 17:34:14,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-02 17:34:14,057 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:34:14,057 INFO L411 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] [2019-10-02 17:34:14,058 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:34:14,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:34:14,058 INFO L82 PathProgramCache]: Analyzing trace with hash 79547442, now seen corresponding path program 1 times [2019-10-02 17:34:14,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:34:14,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:34:14,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:34:14,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:34:14,060 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:34:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:34:14,416 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:34:14,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:34:14,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 17:34:14,417 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:34:14,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 17:34:14,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 17:34:14,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:34:14,418 INFO L87 Difference]: Start difference. First operand 320 states and 461 transitions. Second operand 5 states. [2019-10-02 17:34:15,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:34:15,154 INFO L93 Difference]: Finished difference Result 403 states and 544 transitions. [2019-10-02 17:34:15,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 17:34:15,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 131 [2019-10-02 17:34:15,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:34:15,158 INFO L225 Difference]: With dead ends: 403 [2019-10-02 17:34:15,158 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 17:34:15,159 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:34:15,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 17:34:15,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 17:34:15,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 17:34:15,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 455 transitions. [2019-10-02 17:34:15,172 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 455 transitions. Word has length 131 [2019-10-02 17:34:15,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:34:15,173 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 455 transitions. [2019-10-02 17:34:15,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 17:34:15,173 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 455 transitions. [2019-10-02 17:34:15,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-02 17:34:15,176 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:34:15,176 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 17:34:15,176 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:34:15,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:34:15,177 INFO L82 PathProgramCache]: Analyzing trace with hash 505867657, now seen corresponding path program 1 times [2019-10-02 17:34:15,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:34:15,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:34:15,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:34:15,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:34:15,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:34:15,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:34:15,266 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:34:15,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:34:15,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 17:34:15,267 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:34:15,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 17:34:15,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 17:34:15,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 17:34:15,269 INFO L87 Difference]: Start difference. First operand 320 states and 455 transitions. Second operand 6 states. [2019-10-02 17:34:16,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:34:16,184 INFO L93 Difference]: Finished difference Result 637 states and 893 transitions. [2019-10-02 17:34:16,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 17:34:16,189 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2019-10-02 17:34:16,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:34:16,193 INFO L225 Difference]: With dead ends: 637 [2019-10-02 17:34:16,194 INFO L226 Difference]: Without dead ends: 637 [2019-10-02 17:34:16,194 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 17:34:16,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-02 17:34:16,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 626. [2019-10-02 17:34:16,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 17:34:16,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 870 transitions. [2019-10-02 17:34:16,220 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 870 transitions. Word has length 139 [2019-10-02 17:34:16,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:34:16,220 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 870 transitions. [2019-10-02 17:34:16,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 17:34:16,221 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 870 transitions. [2019-10-02 17:34:16,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-02 17:34:16,224 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:34:16,224 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 17:34:16,224 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:34:16,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:34:16,225 INFO L82 PathProgramCache]: Analyzing trace with hash -571744819, now seen corresponding path program 1 times [2019-10-02 17:34:16,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:34:16,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:34:16,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:34:16,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:34:16,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:34:16,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:34:16,409 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:34:16,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:34:16,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 17:34:16,410 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:34:16,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 17:34:16,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 17:34:16,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:34:16,411 INFO L87 Difference]: Start difference. First operand 626 states and 870 transitions. Second operand 5 states. [2019-10-02 17:34:17,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:34:17,124 INFO L93 Difference]: Finished difference Result 710 states and 956 transitions. [2019-10-02 17:34:17,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 17:34:17,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2019-10-02 17:34:17,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:34:17,129 INFO L225 Difference]: With dead ends: 710 [2019-10-02 17:34:17,129 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 17:34:17,130 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:34:17,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 17:34:17,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 17:34:17,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 17:34:17,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 858 transitions. [2019-10-02 17:34:17,149 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 858 transitions. Word has length 141 [2019-10-02 17:34:17,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:34:17,149 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 858 transitions. [2019-10-02 17:34:17,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 17:34:17,150 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 858 transitions. [2019-10-02 17:34:17,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-02 17:34:17,152 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:34:17,153 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 17:34:17,153 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:34:17,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:34:17,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1019973137, now seen corresponding path program 1 times [2019-10-02 17:34:17,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:34:17,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:34:17,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:34:17,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:34:17,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:34:17,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:34:17,426 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:34:17,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:34:17,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 17:34:17,427 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:34:17,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 17:34:17,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 17:34:17,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:34:17,429 INFO L87 Difference]: Start difference. First operand 626 states and 858 transitions. Second operand 5 states. [2019-10-02 17:34:18,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:34:18,184 INFO L93 Difference]: Finished difference Result 712 states and 946 transitions. [2019-10-02 17:34:18,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 17:34:18,185 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2019-10-02 17:34:18,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:34:18,189 INFO L225 Difference]: With dead ends: 712 [2019-10-02 17:34:18,189 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 17:34:18,189 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:34:18,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 17:34:18,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 17:34:18,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 17:34:18,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 842 transitions. [2019-10-02 17:34:18,209 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 842 transitions. Word has length 143 [2019-10-02 17:34:18,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:34:18,210 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 842 transitions. [2019-10-02 17:34:18,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 17:34:18,210 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 842 transitions. [2019-10-02 17:34:18,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-02 17:34:18,213 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:34:18,214 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 17:34:18,214 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:34:18,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:34:18,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1793380711, now seen corresponding path program 1 times [2019-10-02 17:34:18,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:34:18,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:34:18,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:34:18,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:34:18,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:34:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:34:18,322 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:34:18,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:34:18,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 17:34:18,323 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:34:18,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 17:34:18,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 17:34:18,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 17:34:18,325 INFO L87 Difference]: Start difference. First operand 626 states and 842 transitions. Second operand 6 states. [2019-10-02 17:34:19,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:34:19,124 INFO L93 Difference]: Finished difference Result 1238 states and 1702 transitions. [2019-10-02 17:34:19,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 17:34:19,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 147 [2019-10-02 17:34:19,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:34:19,133 INFO L225 Difference]: With dead ends: 1238 [2019-10-02 17:34:19,133 INFO L226 Difference]: Without dead ends: 1238 [2019-10-02 17:34:19,134 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 17:34:19,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2019-10-02 17:34:19,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1218. [2019-10-02 17:34:19,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-10-02 17:34:19,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1635 transitions. [2019-10-02 17:34:19,173 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1635 transitions. Word has length 147 [2019-10-02 17:34:19,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:34:19,173 INFO L475 AbstractCegarLoop]: Abstraction has 1218 states and 1635 transitions. [2019-10-02 17:34:19,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 17:34:19,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1635 transitions. [2019-10-02 17:34:19,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-02 17:34:19,179 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:34:19,179 INFO L411 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, 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] [2019-10-02 17:34:19,179 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:34:19,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:34:19,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1396546535, now seen corresponding path program 1 times [2019-10-02 17:34:19,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:34:19,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:34:19,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:34:19,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:34:19,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:34:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:34:19,285 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 86 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:34:19,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 17:34:19,285 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 17:34:19,287 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 182 with the following transitions: [2019-10-02 17:34:19,290 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [615], [617], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2019-10-02 17:34:19,394 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 17:34:19,394 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 17:40:37,515 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 17:40:37,518 INFO L272 AbstractInterpreter]: Visited 121 different actions 236 times. Merged at 4 different actions 4 times. Never widened. Performed 496 root evaluator evaluations with a maximum evaluation depth of 18. Performed 496 inverse root evaluator evaluations with a maximum inverse evaluation depth of 18. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2019-10-02 17:40:37,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:40:37,523 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 17:45:51,867 INFO L227 lantSequenceWeakener]: Weakened 178 states. On average, predicates are now at 80.84% of their original sizes. [2019-10-02 17:45:51,867 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 17:45:52,087 INFO L420 sIntCurrentIteration]: We unified 180 AI predicates to 180 [2019-10-02 17:45:52,088 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 17:45:52,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 17:45:52,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [6] total 20 [2019-10-02 17:45:52,089 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:45:52,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 17:45:52,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 17:45:52,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-10-02 17:45:52,091 INFO L87 Difference]: Start difference. First operand 1218 states and 1635 transitions. Second operand 16 states. [2019-10-02 17:46:08,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 17:46:08,707 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: There is no value of variable ~a25~0. at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalState.getValue(NonrelationalState.java:147) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.SingletonVariableExpressionEvaluator.lambda$0(SingletonVariableExpressionEvaluator.java:83) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.util.typeutils.TypeUtils.applyVariableFunctionPerType(TypeUtils.java:114) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.util.typeutils.TypeUtils.applyVariableFunction(TypeUtils.java:103) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.SingletonVariableExpressionEvaluator.evaluate(SingletonVariableExpressionEvaluator.java:89) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.SingletonVariableExpressionEvaluator.evaluate(SingletonVariableExpressionEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:90) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:90) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalEvaluator.evaluate(NonrelationalEvaluator.java:81) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:297) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:156) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:138) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:107) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:422) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:413) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:140) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:353) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:250) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:72) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:708) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:637) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:467) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-02 17:46:08,718 INFO L168 Benchmark]: Toolchain (without parser) took 719759.27 ms. Allocated memory was 140.0 MB in the beginning and 363.9 MB in the end (delta: 223.9 MB). Free memory was 86.0 MB in the beginning and 143.4 MB in the end (delta: -57.4 MB). Peak memory consumption was 166.5 MB. Max. memory is 7.1 GB. [2019-10-02 17:46:08,719 INFO L168 Benchmark]: CDTParser took 1.12 ms. Allocated memory is still 140.0 MB. Free memory is still 105.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-02 17:46:08,720 INFO L168 Benchmark]: CACSL2BoogieTranslator took 712.17 ms. Allocated memory was 140.0 MB in the beginning and 200.8 MB in the end (delta: 60.8 MB). Free memory was 85.6 MB in the beginning and 159.2 MB in the end (delta: -73.6 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. [2019-10-02 17:46:08,721 INFO L168 Benchmark]: Boogie Preprocessor took 124.21 ms. Allocated memory is still 200.8 MB. Free memory was 159.2 MB in the beginning and 154.7 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.6 MB. Max. memory is 7.1 GB. [2019-10-02 17:46:08,722 INFO L168 Benchmark]: RCFGBuilder took 1282.44 ms. Allocated memory was 200.8 MB in the beginning and 226.0 MB in the end (delta: 25.2 MB). Free memory was 154.7 MB in the beginning and 169.1 MB in the end (delta: -14.5 MB). Peak memory consumption was 83.6 MB. Max. memory is 7.1 GB. [2019-10-02 17:46:08,723 INFO L168 Benchmark]: TraceAbstraction took 717635.38 ms. Allocated memory was 226.0 MB in the beginning and 363.9 MB in the end (delta: 137.9 MB). Free memory was 169.1 MB in the beginning and 143.4 MB in the end (delta: 25.7 MB). Peak memory consumption was 163.6 MB. Max. memory is 7.1 GB. [2019-10-02 17:46:08,727 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.12 ms. Allocated memory is still 140.0 MB. Free memory is still 105.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 712.17 ms. Allocated memory was 140.0 MB in the beginning and 200.8 MB in the end (delta: 60.8 MB). Free memory was 85.6 MB in the beginning and 159.2 MB in the end (delta: -73.6 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 124.21 ms. Allocated memory is still 200.8 MB. Free memory was 159.2 MB in the beginning and 154.7 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1282.44 ms. Allocated memory was 200.8 MB in the beginning and 226.0 MB in the end (delta: 25.2 MB). Free memory was 154.7 MB in the beginning and 169.1 MB in the end (delta: -14.5 MB). Peak memory consumption was 83.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 717635.38 ms. Allocated memory was 226.0 MB in the beginning and 363.9 MB in the end (delta: 137.9 MB). Free memory was 169.1 MB in the beginning and 143.4 MB in the end (delta: 25.7 MB). Peak memory consumption was 163.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: There is no value of variable ~a25~0. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: There is no value of variable ~a25~0.: de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalState.getValue(NonrelationalState.java:147) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...