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_label50.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 07:04:42,144 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 07:04:42,147 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 07:04:42,161 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 07:04:42,161 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 07:04:42,162 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 07:04:42,164 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 07:04:42,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 07:04:42,169 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 07:04:42,170 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 07:04:42,171 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 07:04:42,175 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 07:04:42,176 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 07:04:42,177 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 07:04:42,179 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 07:04:42,181 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 07:04:42,182 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 07:04:42,183 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 07:04:42,186 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 07:04:42,189 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 07:04:42,191 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 07:04:42,195 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 07:04:42,197 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 07:04:42,198 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 07:04:42,202 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 07:04:42,202 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 07:04:42,202 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 07:04:42,204 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 07:04:42,205 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 07:04:42,206 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 07:04:42,206 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 07:04:42,208 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 07:04:42,208 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 07:04:42,209 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 07:04:42,211 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 07:04:42,211 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 07:04:42,212 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 07:04:42,214 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 07:04:42,214 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 07:04:42,215 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 07:04:42,216 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 07:04:42,217 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-09-09 07:04:42,246 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 07:04:42,247 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 07:04:42,248 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 07:04:42,248 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 07:04:42,249 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 07:04:42,249 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 07:04:42,249 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 07:04:42,249 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 07:04:42,250 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 07:04:42,250 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 07:04:42,252 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 07:04:42,252 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 07:04:42,252 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 07:04:42,253 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 07:04:42,253 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 07:04:42,253 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 07:04:42,253 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 07:04:42,254 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 07:04:42,254 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 07:04:42,254 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 07:04:42,254 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 07:04:42,255 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 07:04:42,255 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 07:04:42,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 07:04:42,255 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 07:04:42,256 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 07:04:42,256 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 07:04:42,256 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 07:04:42,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 07:04:42,256 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 07:04:42,305 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 07:04:42,321 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 07:04:42,325 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 07:04:42,327 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 07:04:42,327 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 07:04:42,328 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label50.c [2019-09-09 07:04:42,388 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d01ef81a3/f22cb8141f484b95ae7097fd28d47547/FLAGde9e888c8 [2019-09-09 07:04:42,908 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 07:04:42,909 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label50.c [2019-09-09 07:04:42,922 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d01ef81a3/f22cb8141f484b95ae7097fd28d47547/FLAGde9e888c8 [2019-09-09 07:04:43,217 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d01ef81a3/f22cb8141f484b95ae7097fd28d47547 [2019-09-09 07:04:43,227 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 07:04:43,229 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 07:04:43,230 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 07:04:43,230 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 07:04:43,234 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 07:04:43,235 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 07:04:43" (1/1) ... [2019-09-09 07:04:43,238 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7af1abad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:04:43, skipping insertion in model container [2019-09-09 07:04:43,238 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 07:04:43" (1/1) ... [2019-09-09 07:04:43,246 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 07:04:43,291 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 07:04:43,848 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 07:04:43,857 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 07:04:43,972 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 07:04:43,989 INFO L192 MainTranslator]: Completed translation [2019-09-09 07:04:43,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:04:43 WrapperNode [2019-09-09 07:04:43,990 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 07:04:43,991 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 07:04:43,991 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 07:04:43,991 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 07:04:44,006 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:04:43" (1/1) ... [2019-09-09 07:04:44,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:04:43" (1/1) ... [2019-09-09 07:04:44,025 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:04:43" (1/1) ... [2019-09-09 07:04:44,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:04:43" (1/1) ... [2019-09-09 07:04:44,063 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:04:43" (1/1) ... [2019-09-09 07:04:44,084 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:04:43" (1/1) ... [2019-09-09 07:04:44,096 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:04:43" (1/1) ... [2019-09-09 07:04:44,106 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 07:04:44,111 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 07:04:44,112 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 07:04:44,112 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 07:04:44,113 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:04:43" (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-09-09 07:04:44,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 07:04:44,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 07:04:44,211 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-09 07:04:44,211 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 07:04:44,212 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-09 07:04:44,212 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 07:04:44,212 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 07:04:44,212 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-09 07:04:44,212 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 07:04:44,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 07:04:44,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 07:04:45,703 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 07:04:45,704 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 07:04:45,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 07:04:45 BoogieIcfgContainer [2019-09-09 07:04:45,705 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 07:04:45,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 07:04:45,707 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 07:04:45,710 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 07:04:45,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 07:04:43" (1/3) ... [2019-09-09 07:04:45,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62384b2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 07:04:45, skipping insertion in model container [2019-09-09 07:04:45,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:04:43" (2/3) ... [2019-09-09 07:04:45,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62384b2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 07:04:45, skipping insertion in model container [2019-09-09 07:04:45,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 07:04:45" (3/3) ... [2019-09-09 07:04:45,714 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label50.c [2019-09-09 07:04:45,724 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 07:04:45,736 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 07:04:45,754 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 07:04:45,789 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 07:04:45,791 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 07:04:45,791 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 07:04:45,791 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 07:04:45,792 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 07:04:45,792 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 07:04:45,792 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 07:04:45,792 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 07:04:45,829 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2019-09-09 07:04:45,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-09 07:04:45,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 07:04:45,846 INFO L399 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] [2019-09-09 07:04:45,849 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 07:04:45,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 07:04:45,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1330544841, now seen corresponding path program 1 times [2019-09-09 07:04:45,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 07:04:45,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 07:04:45,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 07:04:45,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 07:04:45,905 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 07:04:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 07:04:46,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 07:04:46,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 07:04:46,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 07:04:46,347 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 07:04:46,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 07:04:46,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 07:04:46,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 07:04:46,374 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 3 states. [2019-09-09 07:04:47,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 07:04:47,288 INFO L93 Difference]: Finished difference Result 388 states and 554 transitions. [2019-09-09 07:04:47,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 07:04:47,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-09-09 07:04:47,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 07:04:47,306 INFO L225 Difference]: With dead ends: 388 [2019-09-09 07:04:47,307 INFO L226 Difference]: Without dead ends: 320 [2019-09-09 07:04:47,309 INFO L628 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-09-09 07:04:47,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-09-09 07:04:47,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-09-09 07:04:47,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-09-09 07:04:47,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 465 transitions. [2019-09-09 07:04:47,380 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 465 transitions. Word has length 87 [2019-09-09 07:04:47,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 07:04:47,381 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 465 transitions. [2019-09-09 07:04:47,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 07:04:47,381 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 465 transitions. [2019-09-09 07:04:47,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-09 07:04:47,387 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 07:04:47,387 INFO L399 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] [2019-09-09 07:04:47,387 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 07:04:47,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 07:04:47,388 INFO L82 PathProgramCache]: Analyzing trace with hash 979586382, now seen corresponding path program 1 times [2019-09-09 07:04:47,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 07:04:47,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 07:04:47,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 07:04:47,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 07:04:47,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 07:04:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 07:04:47,494 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 07:04:47,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 07:04:47,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 07:04:47,495 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 07:04:47,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 07:04:47,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 07:04:47,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 07:04:47,497 INFO L87 Difference]: Start difference. First operand 320 states and 465 transitions. Second operand 3 states. [2019-09-09 07:04:48,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 07:04:48,067 INFO L93 Difference]: Finished difference Result 617 states and 866 transitions. [2019-09-09 07:04:48,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 07:04:48,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-09-09 07:04:48,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 07:04:48,073 INFO L225 Difference]: With dead ends: 617 [2019-09-09 07:04:48,073 INFO L226 Difference]: Without dead ends: 617 [2019-09-09 07:04:48,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 07:04:48,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-09 07:04:48,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 612. [2019-09-09 07:04:48,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-09-09 07:04:48,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 857 transitions. [2019-09-09 07:04:48,119 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 857 transitions. Word has length 95 [2019-09-09 07:04:48,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 07:04:48,119 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 857 transitions. [2019-09-09 07:04:48,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 07:04:48,120 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 857 transitions. [2019-09-09 07:04:48,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-09 07:04:48,134 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 07:04:48,136 INFO L399 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] [2019-09-09 07:04:48,136 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 07:04:48,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 07:04:48,137 INFO L82 PathProgramCache]: Analyzing trace with hash -2117634278, now seen corresponding path program 1 times [2019-09-09 07:04:48,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 07:04:48,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 07:04:48,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 07:04:48,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 07:04:48,140 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 07:04:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 07:04:48,264 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 07:04:48,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 07:04:48,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 07:04:48,265 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 07:04:48,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 07:04:48,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 07:04:48,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 07:04:48,266 INFO L87 Difference]: Start difference. First operand 612 states and 857 transitions. Second operand 6 states. [2019-09-09 07:04:49,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 07:04:49,165 INFO L93 Difference]: Finished difference Result 1228 states and 1701 transitions. [2019-09-09 07:04:49,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-09 07:04:49,166 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-09-09 07:04:49,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 07:04:49,174 INFO L225 Difference]: With dead ends: 1228 [2019-09-09 07:04:49,174 INFO L226 Difference]: Without dead ends: 1228 [2019-09-09 07:04:49,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-09-09 07:04:49,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-09-09 07:04:49,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1212. [2019-09-09 07:04:49,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1212 states. [2019-09-09 07:04:49,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1654 transitions. [2019-09-09 07:04:49,219 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1654 transitions. Word has length 101 [2019-09-09 07:04:49,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 07:04:49,220 INFO L475 AbstractCegarLoop]: Abstraction has 1212 states and 1654 transitions. [2019-09-09 07:04:49,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 07:04:49,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1654 transitions. [2019-09-09 07:04:49,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-09 07:04:49,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 07:04:49,226 INFO L399 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] [2019-09-09 07:04:49,226 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 07:04:49,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 07:04:49,226 INFO L82 PathProgramCache]: Analyzing trace with hash 2096741041, now seen corresponding path program 1 times [2019-09-09 07:04:49,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 07:04:49,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 07:04:49,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 07:04:49,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 07:04:49,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 07:04:49,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 07:04:49,304 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 07:04:49,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 07:04:49,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 07:04:49,305 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 07:04:49,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 07:04:49,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 07:04:49,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-09 07:04:49,306 INFO L87 Difference]: Start difference. First operand 1212 states and 1654 transitions. Second operand 6 states. [2019-09-09 07:04:50,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 07:04:50,249 INFO L93 Difference]: Finished difference Result 1832 states and 2493 transitions. [2019-09-09 07:04:50,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-09 07:04:50,252 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2019-09-09 07:04:50,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 07:04:50,268 INFO L225 Difference]: With dead ends: 1832 [2019-09-09 07:04:50,268 INFO L226 Difference]: Without dead ends: 1832 [2019-09-09 07:04:50,269 INFO L628 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-09-09 07:04:50,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2019-09-09 07:04:50,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1814. [2019-09-09 07:04:50,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1814 states. [2019-09-09 07:04:50,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1814 states to 1814 states and 2426 transitions. [2019-09-09 07:04:50,375 INFO L78 Accepts]: Start accepts. Automaton has 1814 states and 2426 transitions. Word has length 109 [2019-09-09 07:04:50,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 07:04:50,376 INFO L475 AbstractCegarLoop]: Abstraction has 1814 states and 2426 transitions. [2019-09-09 07:04:50,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 07:04:50,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1814 states and 2426 transitions. [2019-09-09 07:04:50,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-09 07:04:50,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 07:04:50,391 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-09 07:04:50,392 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 07:04:50,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 07:04:50,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1866094056, now seen corresponding path program 1 times [2019-09-09 07:04:50,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 07:04:50,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 07:04:50,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 07:04:50,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 07:04:50,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 07:04:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 07:04:50,603 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 29 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-09 07:04:50,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 07:04:50,604 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 07:04:50,605 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 123 with the following transitions: [2019-09-09 07:04:50,608 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [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], [375], [377], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2019-09-09 07:04:50,710 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 07:04:50,710 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 07:15:18,679 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 07:15:18,681 INFO L272 AbstractInterpreter]: Visited 91 different actions 265 times. Merged at 6 different actions 12 times. Never widened. Performed 708 root evaluator evaluations with a maximum evaluation depth of 18. Performed 708 inverse root evaluator evaluations with a maximum inverse evaluation depth of 18. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2019-09-09 07:15:18,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 07:15:18,685 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 07:18:40,472 INFO L227 lantSequenceWeakener]: Weakened 119 states. On average, predicates are now at 80.28% of their original sizes. [2019-09-09 07:18:40,472 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 07:18:40,565 INFO L420 sIntCurrentIteration]: We unified 121 AI predicates to 121 [2019-09-09 07:18:40,565 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 07:18:40,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 07:18:40,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2019-09-09 07:18:40,566 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 07:18:40,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-09 07:18:40,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-09 07:18:40,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-09 07:18:40,567 INFO L87 Difference]: Start difference. First operand 1814 states and 2426 transitions. Second operand 10 states. [2019-09-09 07:18:53,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 07:18:53,288 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:696) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:625) 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-09-09 07:18:53,295 INFO L168 Benchmark]: Toolchain (without parser) took 850065.07 ms. Allocated memory was 134.7 MB in the beginning and 349.7 MB in the end (delta: 215.0 MB). Free memory was 89.2 MB in the beginning and 144.2 MB in the end (delta: -55.0 MB). Peak memory consumption was 160.0 MB. Max. memory is 7.1 GB. [2019-09-09 07:18:53,296 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 134.7 MB. Free memory was 109.2 MB in the beginning and 109.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-09 07:18:53,297 INFO L168 Benchmark]: CACSL2BoogieTranslator took 760.31 ms. Allocated memory was 134.7 MB in the beginning and 201.9 MB in the end (delta: 67.1 MB). Free memory was 89.0 MB in the beginning and 160.5 MB in the end (delta: -71.5 MB). Peak memory consumption was 29.7 MB. Max. memory is 7.1 GB. [2019-09-09 07:18:53,298 INFO L168 Benchmark]: Boogie Preprocessor took 115.09 ms. Allocated memory is still 201.9 MB. Free memory was 160.5 MB in the beginning and 156.1 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 7.1 GB. [2019-09-09 07:18:53,299 INFO L168 Benchmark]: RCFGBuilder took 1594.26 ms. Allocated memory was 201.9 MB in the beginning and 229.6 MB in the end (delta: 27.8 MB). Free memory was 155.5 MB in the beginning and 172.9 MB in the end (delta: -17.5 MB). Peak memory consumption was 80.6 MB. Max. memory is 7.1 GB. [2019-09-09 07:18:53,300 INFO L168 Benchmark]: TraceAbstraction took 847585.78 ms. Allocated memory was 229.6 MB in the beginning and 349.7 MB in the end (delta: 120.1 MB). Free memory was 172.9 MB in the beginning and 144.2 MB in the end (delta: 28.7 MB). Peak memory consumption was 148.8 MB. Max. memory is 7.1 GB. [2019-09-09 07:18:53,304 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 134.7 MB. Free memory was 109.2 MB in the beginning and 109.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 760.31 ms. Allocated memory was 134.7 MB in the beginning and 201.9 MB in the end (delta: 67.1 MB). Free memory was 89.0 MB in the beginning and 160.5 MB in the end (delta: -71.5 MB). Peak memory consumption was 29.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 115.09 ms. Allocated memory is still 201.9 MB. Free memory was 160.5 MB in the beginning and 156.1 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1594.26 ms. Allocated memory was 201.9 MB in the beginning and 229.6 MB in the end (delta: 27.8 MB). Free memory was 155.5 MB in the beginning and 172.9 MB in the end (delta: -17.5 MB). Peak memory consumption was 80.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 847585.78 ms. Allocated memory was 229.6 MB in the beginning and 349.7 MB in the end (delta: 120.1 MB). Free memory was 172.9 MB in the beginning and 144.2 MB in the end (delta: 28.7 MB). Peak memory consumption was 148.8 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...