java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 10:36:01,222 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 10:36:01,224 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 10:36:01,242 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 10:36:01,243 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 10:36:01,244 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 10:36:01,245 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 10:36:01,247 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 10:36:01,248 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 10:36:01,249 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 10:36:01,250 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 10:36:01,250 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 10:36:01,251 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 10:36:01,252 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 10:36:01,253 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 10:36:01,254 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 10:36:01,255 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 10:36:01,256 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 10:36:01,258 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 10:36:01,260 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 10:36:01,261 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 10:36:01,262 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 10:36:01,264 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 10:36:01,265 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 10:36:01,265 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 10:36:01,266 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 10:36:01,267 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 10:36:01,267 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 10:36:01,268 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 10:36:01,269 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 10:36:01,270 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 10:36:01,270 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 10:36:01,270 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 10:36:01,271 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 10:36:01,272 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 10:36:01,272 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 10:36:01,273 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 10:36:01,288 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 10:36:01,288 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 10:36:01,289 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 10:36:01,289 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 10:36:01,289 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 10:36:01,289 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 10:36:01,289 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 10:36:01,290 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 10:36:01,290 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 10:36:01,290 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 10:36:01,290 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 10:36:01,290 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 10:36:01,290 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 10:36:01,291 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 10:36:01,291 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 10:36:01,291 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 10:36:01,292 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 10:36:01,292 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 10:36:01,292 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 10:36:01,292 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 10:36:01,292 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 10:36:01,292 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 10:36:01,293 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 10:36:01,293 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 10:36:01,294 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 10:36:01,294 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 10:36:01,294 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:36:01,294 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 10:36:01,294 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 10:36:01,295 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 10:36:01,295 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 10:36:01,295 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 10:36:01,295 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 10:36:01,296 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 10:36:01,296 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 10:36:01,296 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 10:36:01,356 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 10:36:01,368 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 10:36:01,375 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 10:36:01,376 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 10:36:01,377 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 10:36:01,377 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c [2018-11-07 10:36:01,441 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/249ce4744/ecee7c582c58479a90e3fd47b36f10bd/FLAG0175206ce [2018-11-07 10:36:01,882 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 10:36:01,883 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c [2018-11-07 10:36:01,891 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/249ce4744/ecee7c582c58479a90e3fd47b36f10bd/FLAG0175206ce [2018-11-07 10:36:01,907 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/249ce4744/ecee7c582c58479a90e3fd47b36f10bd [2018-11-07 10:36:01,919 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 10:36:01,921 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 10:36:01,922 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 10:36:01,922 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 10:36:01,926 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 10:36:01,927 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:36:01" (1/1) ... [2018-11-07 10:36:01,929 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36bd1723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:01, skipping insertion in model container [2018-11-07 10:36:01,930 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:36:01" (1/1) ... [2018-11-07 10:36:01,940 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 10:36:01,967 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 10:36:02,190 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:36:02,197 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 10:36:02,233 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:36:02,251 INFO L193 MainTranslator]: Completed translation [2018-11-07 10:36:02,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:02 WrapperNode [2018-11-07 10:36:02,252 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 10:36:02,253 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 10:36:02,253 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 10:36:02,253 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 10:36:02,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:02" (1/1) ... [2018-11-07 10:36:02,273 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:02" (1/1) ... [2018-11-07 10:36:02,280 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 10:36:02,281 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 10:36:02,281 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 10:36:02,281 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 10:36:02,292 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:02" (1/1) ... [2018-11-07 10:36:02,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:02" (1/1) ... [2018-11-07 10:36:02,294 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:02" (1/1) ... [2018-11-07 10:36:02,294 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:02" (1/1) ... [2018-11-07 10:36:02,303 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:02" (1/1) ... [2018-11-07 10:36:02,307 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:02" (1/1) ... [2018-11-07 10:36:02,309 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:02" (1/1) ... [2018-11-07 10:36:02,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 10:36:02,312 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 10:36:02,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 10:36:02,312 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 10:36:02,313 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:36:02,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 10:36:02,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 10:36:02,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 10:36:02,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 10:36:02,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 10:36:02,434 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 10:36:02,435 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 10:36:02,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 10:36:02,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-07 10:36:02,990 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 10:36:02,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:36:02 BoogieIcfgContainer [2018-11-07 10:36:02,991 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 10:36:02,992 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 10:36:02,992 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 10:36:02,996 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 10:36:02,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:36:01" (1/3) ... [2018-11-07 10:36:02,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5193a8d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:36:02, skipping insertion in model container [2018-11-07 10:36:02,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:02" (2/3) ... [2018-11-07 10:36:02,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5193a8d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:36:02, skipping insertion in model container [2018-11-07 10:36:02,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:36:02" (3/3) ... [2018-11-07 10:36:02,999 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c [2018-11-07 10:36:03,008 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 10:36:03,015 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-11-07 10:36:03,029 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-11-07 10:36:03,065 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 10:36:03,065 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 10:36:03,065 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 10:36:03,065 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 10:36:03,065 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 10:36:03,065 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 10:36:03,066 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 10:36:03,066 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 10:36:03,086 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2018-11-07 10:36:03,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-07 10:36:03,093 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:03,094 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:36:03,096 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:03,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:03,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1928124594, now seen corresponding path program 1 times [2018-11-07 10:36:03,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:03,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:03,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:03,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:03,151 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:03,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:36:03,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:36:03,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 10:36:03,317 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:36:03,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 10:36:03,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 10:36:03,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-07 10:36:03,337 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 4 states. [2018-11-07 10:36:03,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:03,614 INFO L93 Difference]: Finished difference Result 108 states and 132 transitions. [2018-11-07 10:36:03,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:36:03,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-07 10:36:03,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:03,627 INFO L225 Difference]: With dead ends: 108 [2018-11-07 10:36:03,627 INFO L226 Difference]: Without dead ends: 70 [2018-11-07 10:36:03,631 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:36:03,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-07 10:36:03,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 48. [2018-11-07 10:36:03,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-07 10:36:03,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-11-07 10:36:03,686 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 15 [2018-11-07 10:36:03,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:03,687 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-11-07 10:36:03,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 10:36:03,687 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-07 10:36:03,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-07 10:36:03,688 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:03,688 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:36:03,690 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:03,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:03,691 INFO L82 PathProgramCache]: Analyzing trace with hash 2007100535, now seen corresponding path program 1 times [2018-11-07 10:36:03,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:03,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:03,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:03,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:03,694 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:03,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:03,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:36:03,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:36:03,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 10:36:03,814 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:36:03,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 10:36:03,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 10:36:03,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:36:03,816 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 3 states. [2018-11-07 10:36:03,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:03,964 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2018-11-07 10:36:03,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 10:36:03,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-07 10:36:03,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:03,966 INFO L225 Difference]: With dead ends: 84 [2018-11-07 10:36:03,966 INFO L226 Difference]: Without dead ends: 58 [2018-11-07 10:36:03,967 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:36:03,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-07 10:36:03,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 48. [2018-11-07 10:36:03,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-07 10:36:03,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-11-07 10:36:03,975 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 15 [2018-11-07 10:36:03,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:03,975 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-11-07 10:36:03,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 10:36:03,976 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-11-07 10:36:03,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-07 10:36:03,976 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:03,977 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:36:03,977 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:03,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:03,977 INFO L82 PathProgramCache]: Analyzing trace with hash -285230905, now seen corresponding path program 1 times [2018-11-07 10:36:03,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:03,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:03,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:03,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:03,979 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:04,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:36:04,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:36:04,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 10:36:04,023 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:36:04,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 10:36:04,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 10:36:04,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:36:04,024 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 3 states. [2018-11-07 10:36:04,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:04,275 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2018-11-07 10:36:04,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 10:36:04,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-07 10:36:04,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:04,277 INFO L225 Difference]: With dead ends: 78 [2018-11-07 10:36:04,277 INFO L226 Difference]: Without dead ends: 52 [2018-11-07 10:36:04,277 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:36:04,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-07 10:36:04,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2018-11-07 10:36:04,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-07 10:36:04,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-07 10:36:04,286 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 16 [2018-11-07 10:36:04,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:04,286 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-07 10:36:04,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 10:36:04,286 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-07 10:36:04,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 10:36:04,287 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:04,287 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:36:04,288 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:04,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:04,288 INFO L82 PathProgramCache]: Analyzing trace with hash -356408398, now seen corresponding path program 1 times [2018-11-07 10:36:04,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:04,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:04,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:04,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:04,290 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:04,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:04,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:36:04,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:36:04,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 10:36:04,373 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:36:04,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 10:36:04,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 10:36:04,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:36:04,374 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 3 states. [2018-11-07 10:36:04,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:04,386 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2018-11-07 10:36:04,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 10:36:04,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-07 10:36:04,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:04,388 INFO L225 Difference]: With dead ends: 55 [2018-11-07 10:36:04,388 INFO L226 Difference]: Without dead ends: 39 [2018-11-07 10:36:04,390 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:36:04,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-07 10:36:04,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2018-11-07 10:36:04,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-07 10:36:04,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-11-07 10:36:04,395 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 17 [2018-11-07 10:36:04,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:04,395 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-11-07 10:36:04,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 10:36:04,395 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-07 10:36:04,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-07 10:36:04,396 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:04,396 INFO L375 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] [2018-11-07 10:36:04,397 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:04,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:04,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1832093736, now seen corresponding path program 1 times [2018-11-07 10:36:04,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:04,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:04,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:04,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:04,398 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:04,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:04,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:36:04,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:36:04,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 10:36:04,524 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:36:04,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 10:36:04,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 10:36:04,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:36:04,525 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 6 states. [2018-11-07 10:36:04,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:04,790 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2018-11-07 10:36:04,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 10:36:04,795 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-07 10:36:04,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:04,796 INFO L225 Difference]: With dead ends: 72 [2018-11-07 10:36:04,797 INFO L226 Difference]: Without dead ends: 70 [2018-11-07 10:36:04,797 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-07 10:36:04,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-07 10:36:04,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 37. [2018-11-07 10:36:04,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-07 10:36:04,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-11-07 10:36:04,805 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 24 [2018-11-07 10:36:04,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:04,805 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-11-07 10:36:04,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 10:36:04,806 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-07 10:36:04,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-07 10:36:04,807 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:04,807 INFO L375 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] [2018-11-07 10:36:04,807 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:04,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:04,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1814129763, now seen corresponding path program 1 times [2018-11-07 10:36:04,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:04,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:04,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:04,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:04,809 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:04,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:05,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:36:05,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:36:05,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 10:36:05,053 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:36:05,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 10:36:05,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 10:36:05,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:36:05,055 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 6 states. [2018-11-07 10:36:05,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:05,682 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2018-11-07 10:36:05,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 10:36:05,683 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-07 10:36:05,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:05,686 INFO L225 Difference]: With dead ends: 112 [2018-11-07 10:36:05,687 INFO L226 Difference]: Without dead ends: 89 [2018-11-07 10:36:05,687 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-11-07 10:36:05,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-07 10:36:05,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 43. [2018-11-07 10:36:05,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-07 10:36:05,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-07 10:36:05,698 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 24 [2018-11-07 10:36:05,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:05,698 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-07 10:36:05,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 10:36:05,699 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-07 10:36:05,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-07 10:36:05,699 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:05,700 INFO L375 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] [2018-11-07 10:36:05,700 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:05,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:05,700 INFO L82 PathProgramCache]: Analyzing trace with hash -948894085, now seen corresponding path program 1 times [2018-11-07 10:36:05,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:05,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:05,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:05,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:05,702 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:05,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:05,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:36:05,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:36:05,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 10:36:05,855 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:36:05,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:36:05,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:36:05,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:36:05,857 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2018-11-07 10:36:06,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:06,020 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2018-11-07 10:36:06,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 10:36:06,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-07 10:36:06,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:06,022 INFO L225 Difference]: With dead ends: 82 [2018-11-07 10:36:06,022 INFO L226 Difference]: Without dead ends: 59 [2018-11-07 10:36:06,023 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:36:06,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-07 10:36:06,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 43. [2018-11-07 10:36:06,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-07 10:36:06,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-11-07 10:36:06,032 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 25 [2018-11-07 10:36:06,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:06,032 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-11-07 10:36:06,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:36:06,032 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-11-07 10:36:06,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-07 10:36:06,033 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:06,033 INFO L375 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] [2018-11-07 10:36:06,034 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:06,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:06,034 INFO L82 PathProgramCache]: Analyzing trace with hash -263889672, now seen corresponding path program 1 times [2018-11-07 10:36:06,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:06,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:06,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:06,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:06,036 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:06,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:06,534 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 11 [2018-11-07 10:36:06,912 WARN L179 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2018-11-07 10:36:21,923 WARN L179 SmtUtils]: Spent 7.07 s on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2018-11-07 10:36:22,136 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 38 [2018-11-07 10:36:22,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:36:22,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:36:22,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-11-07 10:36:22,320 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:36:22,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 10:36:22,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 10:36:22,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=172, Unknown=3, NotChecked=0, Total=240 [2018-11-07 10:36:22,322 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 16 states. [2018-11-07 10:36:25,392 WARN L179 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 75 DAG size of output: 50 [2018-11-07 10:36:28,858 WARN L179 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2018-11-07 10:36:35,906 WARN L179 SmtUtils]: Spent 6.47 s on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2018-11-07 10:36:42,321 WARN L179 SmtUtils]: Spent 6.29 s on a formula simplification that was a NOOP. DAG size: 78 [2018-11-07 10:36:48,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:48,918 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2018-11-07 10:36:48,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 10:36:48,919 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2018-11-07 10:36:48,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:48,920 INFO L225 Difference]: With dead ends: 72 [2018-11-07 10:36:48,920 INFO L226 Difference]: Without dead ends: 70 [2018-11-07 10:36:48,922 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 33.2s TimeCoverageRelationStatistics Valid=147, Invalid=450, Unknown=3, NotChecked=0, Total=600 [2018-11-07 10:36:48,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-07 10:36:48,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 49. [2018-11-07 10:36:48,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-07 10:36:48,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-11-07 10:36:48,931 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 26 [2018-11-07 10:36:48,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:48,932 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-11-07 10:36:48,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 10:36:48,932 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-11-07 10:36:48,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-07 10:36:48,933 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:48,933 INFO L375 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] [2018-11-07 10:36:48,934 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:48,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:48,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1465291236, now seen corresponding path program 1 times [2018-11-07 10:36:48,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:48,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:48,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:48,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:48,936 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:49,281 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 11 [2018-11-07 10:36:53,653 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:36:53,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:53,653 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:36:53,654 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-11-07 10:36:53,656 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [9], [12], [15], [18], [21], [23], [31], [33], [34], [35], [38], [65], [68], [72], [73], [74], [75], [78], [79], [83], [85], [135], [136], [137] [2018-11-07 10:36:53,687 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:36:53,688 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:36:53,891 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:36:53,892 INFO L272 AbstractInterpreter]: Visited 28 different actions 28 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 36 variables. [2018-11-07 10:36:53,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:53,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:36:53,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:53,937 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:36:53,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:53,955 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:36:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:54,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:36:54,415 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:36:54,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:36:54,546 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:36:54,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:36:54,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2018-11-07 10:36:54,575 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:36:54,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 10:36:54,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 10:36:54,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=74, Unknown=2, NotChecked=0, Total=110 [2018-11-07 10:36:54,577 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 9 states. [2018-11-07 10:36:59,428 WARN L179 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 47 DAG size of output: 32 [2018-11-07 10:37:01,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:01,539 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-11-07 10:37:01,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 10:37:01,539 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-11-07 10:37:01,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:01,540 INFO L225 Difference]: With dead ends: 68 [2018-11-07 10:37:01,540 INFO L226 Difference]: Without dead ends: 37 [2018-11-07 10:37:01,541 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=45, Invalid=85, Unknown=2, NotChecked=0, Total=132 [2018-11-07 10:37:01,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-07 10:37:01,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-07 10:37:01,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-07 10:37:01,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-11-07 10:37:01,556 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 32 [2018-11-07 10:37:01,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:01,556 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-11-07 10:37:01,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 10:37:01,557 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-07 10:37:01,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-07 10:37:01,560 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:01,560 INFO L375 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] [2018-11-07 10:37:01,560 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:01,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:01,561 INFO L82 PathProgramCache]: Analyzing trace with hash 823139948, now seen corresponding path program 1 times [2018-11-07 10:37:01,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:01,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:01,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:01,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:01,563 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:01,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:01,992 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2018-11-07 10:37:12,281 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2018-11-07 10:37:16,684 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 36 [2018-11-07 10:37:19,007 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:19,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:19,008 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:19,008 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-11-07 10:37:19,009 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [9], [12], [15], [18], [21], [23], [31], [33], [34], [35], [38], [41], [44], [47], [49], [57], [65], [68], [72], [73], [74], [75], [78], [79], [135], [136], [137] [2018-11-07 10:37:19,011 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:37:19,011 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:37:19,082 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:37:19,083 INFO L272 AbstractInterpreter]: Visited 31 different actions 35 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 37 variables. [2018-11-07 10:37:19,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:19,106 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:37:19,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:19,106 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:37:19,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:19,116 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:37:19,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:19,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:50,779 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-07 10:37:58,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2018-11-07 10:37:58,247 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:37:58,251 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:37:58,264 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:37:58,283 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:37:58,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 64 [2018-11-07 10:37:58,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:37:58,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:37:58,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:37:58,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:86, output treesize:7 [2018-11-07 10:37:58,641 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:58,641 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:38:18,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 78 [2018-11-07 10:38:18,334 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:38:18,350 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:38:18,364 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:38:18,373 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:38:18,386 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:38:18,403 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:38:18,414 INFO L303 Elim1Store]: Index analysis took 112 ms [2018-11-07 10:38:18,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 132 [2018-11-07 10:38:18,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-07 10:38:18,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:38:18,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:38:18,522 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:101, output treesize:29 [2018-11-07 10:38:26,152 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:38:26,171 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 10:38:26,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16, 11] imperfect sequences [18] total 36 [2018-11-07 10:38:26,172 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:38:26,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 10:38:26,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 10:38:26,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1041, Unknown=25, NotChecked=0, Total=1260 [2018-11-07 10:38:26,174 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 16 states. [2018-11-07 10:38:47,354 WARN L179 SmtUtils]: Spent 10.67 s on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2018-11-07 10:39:27,969 WARN L179 SmtUtils]: Spent 13.59 s on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2018-11-07 10:39:54,596 WARN L179 SmtUtils]: Spent 10.43 s on a formula simplification that was a NOOP. DAG size: 53 [2018-11-07 10:39:59,166 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (+ c_main_~main__index1~0 4294967295) 4294967296)) (.cse1 (mod (+ c_main_~main__index2~0 1) 4294967296))) (and (= |c_main_~#main__array~0.offset| 0) (< (mod c_main_~main__index2~0 4294967296) (mod c_main_~main__index1~0 4294967296)) (= c_main_~__VERIFIER_assert__cond~2 1) (let ((.cse0 (select |c_#memory_int| |c_main_~#main__array~0.base|))) (= (mod (select .cse0 (+ |c_main_~#main__array~0.offset| (* 4 .cse1))) 4294967296) (mod (select .cse0 (+ (* 4 .cse2) |c_main_~#main__array~0.offset|)) 4294967296))) (< .cse2 .cse1) (<= c_main_~main__index1~0 (+ (* 4294967296 (div (+ c_main_~main__index1~0 (- 2)) 4294967296)) 100001)) (< .cse1 100000))) is different from false [2018-11-07 10:40:08,545 WARN L179 SmtUtils]: Spent 2.59 s on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2018-11-07 10:40:23,116 WARN L179 SmtUtils]: Spent 9.55 s on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2018-11-07 10:40:25,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:25,123 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-11-07 10:40:25,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 10:40:25,170 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 35 [2018-11-07 10:40:25,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:25,171 INFO L225 Difference]: With dead ends: 44 [2018-11-07 10:40:25,171 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 10:40:25,172 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 48 SyntacticMatches, 8 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 196.2s TimeCoverageRelationStatistics Valid=309, Invalid=1457, Unknown=44, NotChecked=82, Total=1892 [2018-11-07 10:40:25,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 10:40:25,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 10:40:25,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 10:40:25,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 10:40:25,174 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2018-11-07 10:40:25,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:25,174 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 10:40:25,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 10:40:25,174 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 10:40:25,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 10:40:25,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. Received shutdown request... [2018-11-07 10:40:49,209 WARN L187 SmtUtils]: Removed 3 from assertion stack [2018-11-07 10:40:49,209 INFO L256 ToolchainWalker]: Toolchain cancelled while executing plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction. Reason: Timeout or Toolchain cancelled by user [2018-11-07 10:40:49,211 INFO L168 Benchmark]: Toolchain (without parser) took 287290.92 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 864.6 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -720.2 MB). Peak memory consumption was 144.3 MB. Max. memory is 7.1 GB. [2018-11-07 10:40:49,212 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:40:49,213 INFO L168 Benchmark]: CACSL2BoogieTranslator took 330.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 10:40:49,214 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:40:49,214 INFO L168 Benchmark]: Boogie Preprocessor took 30.57 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:40:49,214 INFO L168 Benchmark]: RCFGBuilder took 679.55 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -768.9 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. [2018-11-07 10:40:49,215 INFO L168 Benchmark]: TraceAbstraction took 286217.68 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 127.9 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 38.1 MB). Peak memory consumption was 166.0 MB. Max. memory is 7.1 GB. [2018-11-07 10:40:49,220 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 330.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 28.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.57 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 679.55 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -768.9 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 286217.68 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 127.9 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 38.1 MB). Peak memory consumption was 166.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 162]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 104]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 37]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Toolchain cancelled while SimplifyDDAWithTimeout was simplifying term of DAG size 98. RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown