java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-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/eca-rers2012/Problem15_label25_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 05:35:29,805 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 05:35:29,807 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 05:35:29,825 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 05:35:29,825 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 05:35:29,826 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 05:35:29,828 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 05:35:29,831 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 05:35:29,833 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 05:35:29,841 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 05:35:29,845 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 05:35:29,845 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 05:35:29,846 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 05:35:29,848 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 05:35:29,851 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 05:35:29,852 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 05:35:29,854 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 05:35:29,859 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 05:35:29,865 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 05:35:29,870 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 05:35:29,871 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 05:35:29,872 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 05:35:29,875 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 05:35:29,878 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 05:35:29,878 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 05:35:29,879 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 05:35:29,882 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 05:35:29,882 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 05:35:29,885 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 05:35:29,888 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 05:35:29,888 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 05:35:29,890 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 05:35:29,890 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 05:35:29,890 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 05:35:29,891 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 05:35:29,893 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 05:35:29,894 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-27 05:35:29,920 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 05:35:29,920 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 05:35:29,921 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 05:35:29,921 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 05:35:29,922 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 05:35:29,923 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 05:35:29,923 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-27 05:35:29,923 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 05:35:29,923 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-27 05:35:29,924 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 05:35:29,924 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 05:35:29,924 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 05:35:29,924 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 05:35:29,925 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 05:35:29,926 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 05:35:29,926 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 05:35:29,927 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 05:35:29,929 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 05:35:29,929 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 05:35:29,929 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 05:35:29,929 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 05:35:29,930 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 05:35:29,930 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 05:35:29,930 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 05:35:29,930 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 05:35:29,930 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 05:35:29,931 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 05:35:29,931 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 05:35:29,931 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 05:35:29,931 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 05:35:29,931 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 05:35:29,932 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 05:35:29,932 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 05:35:29,932 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 05:35:29,933 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 05:35:29,933 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 05:35:30,002 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 05:35:30,019 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 05:35:30,022 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 05:35:30,024 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 05:35:30,028 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 05:35:30,029 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label25_false-unreach-call.c [2018-10-27 05:35:30,095 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/a0e9cbb4a/3a9a90ae0c754ddba99ced5ed8b956a7/FLAGe5da3632f [2018-10-27 05:35:30,789 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 05:35:30,791 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label25_false-unreach-call.c [2018-10-27 05:35:30,812 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/a0e9cbb4a/3a9a90ae0c754ddba99ced5ed8b956a7/FLAGe5da3632f [2018-10-27 05:35:30,833 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/a0e9cbb4a/3a9a90ae0c754ddba99ced5ed8b956a7 [2018-10-27 05:35:30,846 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 05:35:30,848 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 05:35:30,849 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 05:35:30,850 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 05:35:30,855 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 05:35:30,856 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 05:35:30" (1/1) ... [2018-10-27 05:35:30,860 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2993a444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:35:30, skipping insertion in model container [2018-10-27 05:35:30,861 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 05:35:30" (1/1) ... [2018-10-27 05:35:30,871 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 05:35:30,963 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 05:35:31,766 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 05:35:31,771 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 05:35:32,082 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 05:35:32,103 INFO L193 MainTranslator]: Completed translation [2018-10-27 05:35:32,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:35:32 WrapperNode [2018-10-27 05:35:32,104 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 05:35:32,105 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 05:35:32,105 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 05:35:32,105 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 05:35:32,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:35:32" (1/1) ... [2018-10-27 05:35:32,162 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:35:32" (1/1) ... [2018-10-27 05:35:32,515 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 05:35:32,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 05:35:32,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 05:35:32,516 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 05:35:32,531 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:35:32" (1/1) ... [2018-10-27 05:35:32,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:35:32" (1/1) ... [2018-10-27 05:35:32,549 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:35:32" (1/1) ... [2018-10-27 05:35:32,550 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:35:32" (1/1) ... [2018-10-27 05:35:32,661 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:35:32" (1/1) ... [2018-10-27 05:35:32,688 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:35:32" (1/1) ... [2018-10-27 05:35:32,730 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:35:32" (1/1) ... [2018-10-27 05:35:32,763 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 05:35:32,764 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 05:35:32,764 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 05:35:32,764 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 05:35:32,765 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:35:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 05:35:32,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 05:35:32,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 05:35:32,833 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-27 05:35:32,833 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-27 05:35:32,833 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-27 05:35:32,833 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-27 05:35:32,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 05:35:32,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 05:35:32,834 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 05:35:32,834 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 05:35:39,311 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 05:35:39,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:35:39 BoogieIcfgContainer [2018-10-27 05:35:39,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 05:35:39,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 05:35:39,314 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 05:35:39,321 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 05:35:39,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 05:35:30" (1/3) ... [2018-10-27 05:35:39,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c9d6d94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 05:35:39, skipping insertion in model container [2018-10-27 05:35:39,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:35:32" (2/3) ... [2018-10-27 05:35:39,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c9d6d94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 05:35:39, skipping insertion in model container [2018-10-27 05:35:39,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:35:39" (3/3) ... [2018-10-27 05:35:39,325 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label25_false-unreach-call.c [2018-10-27 05:35:39,336 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 05:35:39,348 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 05:35:39,370 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 05:35:39,418 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 05:35:39,418 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 05:35:39,418 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 05:35:39,419 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 05:35:39,419 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 05:35:39,419 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 05:35:39,419 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 05:35:39,419 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 05:35:39,461 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states. [2018-10-27 05:35:39,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-27 05:35:39,469 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:35:39,470 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, 1, 1, 1, 1, 1] [2018-10-27 05:35:39,473 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 05:35:39,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:35:39,479 INFO L82 PathProgramCache]: Analyzing trace with hash 480203289, now seen corresponding path program 1 times [2018-10-27 05:35:39,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:35:39,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:35:39,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:35:39,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:35:39,531 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:35:39,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:35:39,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:35:39,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:35:39,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 05:35:39,959 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:35:39,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 05:35:39,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 05:35:39,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 05:35:39,986 INFO L87 Difference]: Start difference. First operand 438 states. Second operand 4 states. [2018-10-27 05:35:49,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:35:49,941 INFO L93 Difference]: Finished difference Result 1550 states and 2835 transitions. [2018-10-27 05:35:49,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 05:35:49,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-10-27 05:35:49,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:35:49,990 INFO L225 Difference]: With dead ends: 1550 [2018-10-27 05:35:49,990 INFO L226 Difference]: Without dead ends: 1106 [2018-10-27 05:35:50,004 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 05:35:50,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2018-10-27 05:35:50,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 762. [2018-10-27 05:35:50,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2018-10-27 05:35:50,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1263 transitions. [2018-10-27 05:35:50,152 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1263 transitions. Word has length 31 [2018-10-27 05:35:50,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:35:50,153 INFO L481 AbstractCegarLoop]: Abstraction has 762 states and 1263 transitions. [2018-10-27 05:35:50,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 05:35:50,154 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1263 transitions. [2018-10-27 05:35:50,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-27 05:35:50,162 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:35:50,164 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 05:35:50,165 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 05:35:50,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:35:50,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1889968228, now seen corresponding path program 1 times [2018-10-27 05:35:50,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:35:50,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:35:50,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:35:50,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:35:50,168 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:35:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:35:50,506 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:35:50,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:35:50,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 05:35:50,507 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:35:50,509 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 05:35:50,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 05:35:50,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 05:35:50,510 INFO L87 Difference]: Start difference. First operand 762 states and 1263 transitions. Second operand 5 states. [2018-10-27 05:36:00,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:36:00,061 INFO L93 Difference]: Finished difference Result 2245 states and 3758 transitions. [2018-10-27 05:36:00,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 05:36:00,071 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2018-10-27 05:36:00,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:36:00,084 INFO L225 Difference]: With dead ends: 2245 [2018-10-27 05:36:00,084 INFO L226 Difference]: Without dead ends: 1489 [2018-10-27 05:36:00,088 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-27 05:36:00,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2018-10-27 05:36:00,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 1457. [2018-10-27 05:36:00,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1457 states. [2018-10-27 05:36:00,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 2152 transitions. [2018-10-27 05:36:00,161 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 2152 transitions. Word has length 104 [2018-10-27 05:36:00,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:36:00,162 INFO L481 AbstractCegarLoop]: Abstraction has 1457 states and 2152 transitions. [2018-10-27 05:36:00,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 05:36:00,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 2152 transitions. [2018-10-27 05:36:00,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-27 05:36:00,168 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:36:00,169 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 05:36:00,169 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 05:36:00,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:36:00,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1891777420, now seen corresponding path program 1 times [2018-10-27 05:36:00,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:36:00,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:36:00,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:36:00,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:36:00,171 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:36:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:36:00,418 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:36:00,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:36:00,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 05:36:00,419 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:36:00,419 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 05:36:00,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 05:36:00,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 05:36:00,420 INFO L87 Difference]: Start difference. First operand 1457 states and 2152 transitions. Second operand 4 states. [2018-10-27 05:36:06,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:36:06,793 INFO L93 Difference]: Finished difference Result 5409 states and 8320 transitions. [2018-10-27 05:36:06,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 05:36:06,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2018-10-27 05:36:06,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:36:06,827 INFO L225 Difference]: With dead ends: 5409 [2018-10-27 05:36:06,827 INFO L226 Difference]: Without dead ends: 3958 [2018-10-27 05:36:06,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 05:36:06,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3958 states. [2018-10-27 05:36:06,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3958 to 3953. [2018-10-27 05:36:06,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3953 states. [2018-10-27 05:36:06,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3953 states to 3953 states and 5489 transitions. [2018-10-27 05:36:06,981 INFO L78 Accepts]: Start accepts. Automaton has 3953 states and 5489 transitions. Word has length 112 [2018-10-27 05:36:06,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:36:06,985 INFO L481 AbstractCegarLoop]: Abstraction has 3953 states and 5489 transitions. [2018-10-27 05:36:06,985 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 05:36:06,985 INFO L276 IsEmpty]: Start isEmpty. Operand 3953 states and 5489 transitions. [2018-10-27 05:36:06,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-27 05:36:06,989 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:36:06,990 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 05:36:06,990 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 05:36:06,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:36:06,991 INFO L82 PathProgramCache]: Analyzing trace with hash -105933602, now seen corresponding path program 1 times [2018-10-27 05:36:06,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:36:06,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:36:06,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:36:06,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:36:06,992 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:36:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:36:07,211 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:36:07,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:36:07,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 05:36:07,212 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:36:07,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 05:36:07,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 05:36:07,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 05:36:07,214 INFO L87 Difference]: Start difference. First operand 3953 states and 5489 transitions. Second operand 6 states. [2018-10-27 05:36:13,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:36:13,933 INFO L93 Difference]: Finished difference Result 9154 states and 12480 transitions. [2018-10-27 05:36:13,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 05:36:13,943 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2018-10-27 05:36:13,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:36:13,971 INFO L225 Difference]: With dead ends: 9154 [2018-10-27 05:36:13,971 INFO L226 Difference]: Without dead ends: 5207 [2018-10-27 05:36:13,994 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 05:36:13,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5207 states. [2018-10-27 05:36:14,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5207 to 5153. [2018-10-27 05:36:14,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5153 states. [2018-10-27 05:36:14,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5153 states to 5153 states and 6640 transitions. [2018-10-27 05:36:14,142 INFO L78 Accepts]: Start accepts. Automaton has 5153 states and 6640 transitions. Word has length 131 [2018-10-27 05:36:14,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:36:14,143 INFO L481 AbstractCegarLoop]: Abstraction has 5153 states and 6640 transitions. [2018-10-27 05:36:14,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 05:36:14,143 INFO L276 IsEmpty]: Start isEmpty. Operand 5153 states and 6640 transitions. [2018-10-27 05:36:14,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-27 05:36:14,147 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:36:14,147 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-27 05:36:14,147 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 05:36:14,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:36:14,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1626579703, now seen corresponding path program 1 times [2018-10-27 05:36:14,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:36:14,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:36:14,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:36:14,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:36:14,149 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:36:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:36:14,453 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-27 05:36:14,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:36:14,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 05:36:14,454 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:36:14,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 05:36:14,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 05:36:14,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 05:36:14,456 INFO L87 Difference]: Start difference. First operand 5153 states and 6640 transitions. Second operand 4 states. [2018-10-27 05:36:19,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:36:19,765 INFO L93 Difference]: Finished difference Result 16904 states and 22307 transitions. [2018-10-27 05:36:19,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 05:36:19,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2018-10-27 05:36:19,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:36:19,818 INFO L225 Difference]: With dead ends: 16904 [2018-10-27 05:36:19,818 INFO L226 Difference]: Without dead ends: 11757 [2018-10-27 05:36:19,856 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 05:36:19,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11757 states. [2018-10-27 05:36:20,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11757 to 11397. [2018-10-27 05:36:20,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11397 states. [2018-10-27 05:36:20,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11397 states to 11397 states and 14032 transitions. [2018-10-27 05:36:20,119 INFO L78 Accepts]: Start accepts. Automaton has 11397 states and 14032 transitions. Word has length 186 [2018-10-27 05:36:20,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:36:20,120 INFO L481 AbstractCegarLoop]: Abstraction has 11397 states and 14032 transitions. [2018-10-27 05:36:20,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 05:36:20,120 INFO L276 IsEmpty]: Start isEmpty. Operand 11397 states and 14032 transitions. [2018-10-27 05:36:20,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-27 05:36:20,125 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:36:20,126 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-27 05:36:20,126 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 05:36:20,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:36:20,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1918161605, now seen corresponding path program 1 times [2018-10-27 05:36:20,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:36:20,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:36:20,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:36:20,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:36:20,128 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:36:20,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:36:20,392 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 3 [2018-10-27 05:36:20,414 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-10-27 05:36:20,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:36:20,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 05:36:20,415 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:36:20,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 05:36:20,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 05:36:20,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:36:20,416 INFO L87 Difference]: Start difference. First operand 11397 states and 14032 transitions. Second operand 3 states. [2018-10-27 05:36:25,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:36:25,062 INFO L93 Difference]: Finished difference Result 27800 states and 35316 transitions. [2018-10-27 05:36:25,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 05:36:25,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2018-10-27 05:36:25,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:36:25,156 INFO L225 Difference]: With dead ends: 27800 [2018-10-27 05:36:25,157 INFO L226 Difference]: Without dead ends: 16409 [2018-10-27 05:36:25,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:36:25,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16409 states. [2018-10-27 05:36:25,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16409 to 16395. [2018-10-27 05:36:25,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16395 states. [2018-10-27 05:36:25,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16395 states to 16395 states and 20523 transitions. [2018-10-27 05:36:25,735 INFO L78 Accepts]: Start accepts. Automaton has 16395 states and 20523 transitions. Word has length 199 [2018-10-27 05:36:25,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:36:25,735 INFO L481 AbstractCegarLoop]: Abstraction has 16395 states and 20523 transitions. [2018-10-27 05:36:25,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 05:36:25,735 INFO L276 IsEmpty]: Start isEmpty. Operand 16395 states and 20523 transitions. [2018-10-27 05:36:25,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-27 05:36:25,744 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:36:25,744 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-27 05:36:25,745 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 05:36:25,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:36:25,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1276060231, now seen corresponding path program 1 times [2018-10-27 05:36:25,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:36:25,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:36:25,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:36:25,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:36:25,746 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:36:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:36:26,406 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 53 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-10-27 05:36:26,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:36:26,407 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:36:26,408 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 213 with the following transitions: [2018-10-27 05:36:26,410 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [221], [223], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [498], [506], [514], [522], [530], [538], [546], [554], [562], [567], [571], [582], [586], [590], [594], [598], [602], [606], [610], [614], [617], [618], [622], [626], [630], [641], [645], [649], [653], [657], [668], [672], [676], [680], [684], [688], [692], [696], [707], [711], [714], [1635], [1639], [1643], [1649], [1653], [1655], [1662], [1663], [1664], [1666], [1667] [2018-10-27 05:36:26,460 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 05:36:26,460 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:36:27,096 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 05:36:27,098 INFO L272 AbstractInterpreter]: Visited 105 different actions 105 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-10-27 05:36:27,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:36:27,140 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 05:36:27,678 INFO L227 lantSequenceWeakener]: Weakened 203 states. On average, predicates are now at 77.6% of their original sizes. [2018-10-27 05:36:27,678 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 05:36:27,917 INFO L415 sIntCurrentIteration]: We unified 211 AI predicates to 211 [2018-10-27 05:36:27,917 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 05:36:27,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:36:27,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2018-10-27 05:36:27,918 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:36:27,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 05:36:27,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 05:36:27,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 05:36:27,920 INFO L87 Difference]: Start difference. First operand 16395 states and 20523 transitions. Second operand 6 states. [2018-10-27 05:37:10,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:37:10,628 INFO L93 Difference]: Finished difference Result 33094 states and 41402 transitions. [2018-10-27 05:37:10,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 05:37:10,629 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 212 [2018-10-27 05:37:10,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:37:10,711 INFO L225 Difference]: With dead ends: 33094 [2018-10-27 05:37:10,712 INFO L226 Difference]: Without dead ends: 16705 [2018-10-27 05:37:10,762 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 212 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-27 05:37:10,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16705 states. [2018-10-27 05:37:11,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16705 to 16703. [2018-10-27 05:37:11,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16703 states. [2018-10-27 05:37:11,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16703 states to 16703 states and 20840 transitions. [2018-10-27 05:37:11,131 INFO L78 Accepts]: Start accepts. Automaton has 16703 states and 20840 transitions. Word has length 212 [2018-10-27 05:37:11,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:37:11,132 INFO L481 AbstractCegarLoop]: Abstraction has 16703 states and 20840 transitions. [2018-10-27 05:37:11,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 05:37:11,132 INFO L276 IsEmpty]: Start isEmpty. Operand 16703 states and 20840 transitions. [2018-10-27 05:37:11,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-10-27 05:37:11,151 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:37:11,151 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:37:11,152 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 05:37:11,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:37:11,152 INFO L82 PathProgramCache]: Analyzing trace with hash 725845603, now seen corresponding path program 1 times [2018-10-27 05:37:11,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:37:11,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:37:11,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:37:11,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:37:11,153 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:37:11,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:37:12,254 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-27 05:37:12,518 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-10-27 05:37:12,693 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 156 proven. 169 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 05:37:12,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:37:12,693 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:37:12,694 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 309 with the following transitions: [2018-10-27 05:37:12,694 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [221], [223], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [498], [506], [514], [522], [530], [538], [546], [554], [562], [567], [571], [582], [586], [590], [594], [598], [602], [606], [610], [614], [617], [618], [622], [626], [630], [641], [645], [649], [653], [657], [668], [672], [676], [680], [684], [688], [691], [692], [696], [707], [711], [714], [1635], [1639], [1643], [1649], [1653], [1655], [1662], [1663], [1664], [1666], [1667] [2018-10-27 05:37:12,700 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 05:37:12,700 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:37:13,011 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 05:37:13,012 INFO L272 AbstractInterpreter]: Visited 109 different actions 314 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-10-27 05:37:13,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:37:13,051 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 05:37:13,386 INFO L227 lantSequenceWeakener]: Weakened 305 states. On average, predicates are now at 83.53% of their original sizes. [2018-10-27 05:37:13,387 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 05:37:13,565 INFO L415 sIntCurrentIteration]: We unified 307 AI predicates to 307 [2018-10-27 05:37:13,565 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 05:37:13,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:37:13,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2018-10-27 05:37:13,566 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:37:13,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 05:37:13,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 05:37:13,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-27 05:37:13,567 INFO L87 Difference]: Start difference. First operand 16703 states and 20840 transitions. Second operand 9 states. [2018-10-27 05:37:37,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:37:37,046 INFO L93 Difference]: Finished difference Result 33722 states and 42108 transitions. [2018-10-27 05:37:37,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 05:37:37,046 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 308 [2018-10-27 05:37:37,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:37:37,104 INFO L225 Difference]: With dead ends: 33722 [2018-10-27 05:37:37,104 INFO L226 Difference]: Without dead ends: 17333 [2018-10-27 05:37:37,143 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 313 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-10-27 05:37:37,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17333 states. [2018-10-27 05:37:37,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17333 to 17330. [2018-10-27 05:37:37,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17330 states. [2018-10-27 05:37:37,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17330 states to 17330 states and 21512 transitions. [2018-10-27 05:37:37,478 INFO L78 Accepts]: Start accepts. Automaton has 17330 states and 21512 transitions. Word has length 308 [2018-10-27 05:37:37,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:37:37,478 INFO L481 AbstractCegarLoop]: Abstraction has 17330 states and 21512 transitions. [2018-10-27 05:37:37,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 05:37:37,479 INFO L276 IsEmpty]: Start isEmpty. Operand 17330 states and 21512 transitions. [2018-10-27 05:37:37,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-10-27 05:37:37,491 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:37:37,491 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 05:37:37,492 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 05:37:37,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:37:37,492 INFO L82 PathProgramCache]: Analyzing trace with hash -454445057, now seen corresponding path program 1 times [2018-10-27 05:37:37,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:37:37,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:37:37,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:37:37,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:37:37,494 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:37:37,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:37:38,184 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 132 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:37:38,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:37:38,184 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:37:38,184 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 405 with the following transitions: [2018-10-27 05:37:38,185 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [221], [223], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [498], [506], [514], [522], [530], [538], [546], [554], [562], [567], [571], [582], [586], [590], [594], [598], [602], [606], [610], [614], [618], [622], [626], [630], [641], [644], [645], [649], [653], [657], [668], [672], [676], [680], [684], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [798], [809], [813], [824], [835], [839], [850], [854], [865], [869], [873], [877], [881], [885], [896], [900], [904], [908], [912], [916], [920], [924], [935], [939], [943], [947], [951], [955], [959], [963], [967], [971], [975], [979], [983], [987], [991], [1002], [1006], [1010], [1014], [1018], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1072], [1076], [1080], [1084], [1088], [1092], [1096], [1100], [1104], [1108], [1112], [1116], [1120], [1124], [1128], [1132], [1136], [1140], [1144], [1148], [1152], [1156], [1160], [1164], [1168], [1172], [1176], [1180], [1191], [1202], [1206], [1210], [1214], [1218], [1229], [1233], [1237], [1241], [1245], [1256], [1260], [1264], [1268], [1272], [1276], [1280], [1284], [1288], [1292], [1296], [1300], [1304], [1308], [1312], [1316], [1320], [1324], [1328], [1332], [1336], [1340], [1344], [1348], [1352], [1356], [1367], [1371], [1375], [1379], [1383], [1394], [1398], [1402], [1406], [1417], [1421], [1425], [1429], [1433], [1437], [1441], [1452], [1456], [1460], [1471], [1475], [1486], [1490], [1494], [1498], [1502], [1506], [1510], [1514], [1518], [1522], [1526], [1530], [1534], [1538], [1542], [1546], [1550], [1554], [1558], [1562], [1566], [1570], [1581], [1585], [1589], [1593], [1597], [1601], [1612], [1616], [1620], [1623], [1635], [1639], [1643], [1649], [1653], [1655], [1662], [1663], [1664], [1666], [1667] [2018-10-27 05:37:38,194 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 05:37:38,195 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:37:39,378 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 05:37:39,378 INFO L272 AbstractInterpreter]: Visited 296 different actions 1169 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-10-27 05:37:39,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:37:39,413 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 05:37:39,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:37:39,413 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 05:37:39,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:37:39,422 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 05:37:39,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:37:39,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:37:40,014 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 132 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:37:40,014 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:37:40,183 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-27 05:37:40,285 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-27 05:37:41,001 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 132 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:37:41,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:37:41,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-10-27 05:37:41,023 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:37:41,025 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 05:37:41,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 05:37:41,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-10-27 05:37:41,025 INFO L87 Difference]: Start difference. First operand 17330 states and 21512 transitions. Second operand 9 states. [2018-10-27 05:37:50,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:37:50,765 INFO L93 Difference]: Finished difference Result 42756 states and 60389 transitions. [2018-10-27 05:37:50,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-27 05:37:50,766 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 404 [2018-10-27 05:37:50,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:37:50,983 INFO L225 Difference]: With dead ends: 42756 [2018-10-27 05:37:50,984 INFO L226 Difference]: Without dead ends: 26367 [2018-10-27 05:37:51,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 829 GetRequests, 810 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=128, Invalid=252, Unknown=0, NotChecked=0, Total=380 [2018-10-27 05:37:51,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26367 states. [2018-10-27 05:37:52,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26367 to 26229. [2018-10-27 05:37:52,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26229 states. [2018-10-27 05:37:52,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26229 states to 26229 states and 33318 transitions. [2018-10-27 05:37:52,271 INFO L78 Accepts]: Start accepts. Automaton has 26229 states and 33318 transitions. Word has length 404 [2018-10-27 05:37:52,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:37:52,273 INFO L481 AbstractCegarLoop]: Abstraction has 26229 states and 33318 transitions. [2018-10-27 05:37:52,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 05:37:52,273 INFO L276 IsEmpty]: Start isEmpty. Operand 26229 states and 33318 transitions. [2018-10-27 05:37:52,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-10-27 05:37:52,285 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:37:52,286 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 05:37:52,286 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 05:37:52,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:37:52,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1671723896, now seen corresponding path program 1 times [2018-10-27 05:37:52,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:37:52,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:37:52,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:37:52,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:37:52,288 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:37:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:37:53,219 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 245 proven. 2 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-10-27 05:37:53,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:37:53,220 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:37:53,220 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 415 with the following transitions: [2018-10-27 05:37:53,220 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [221], [223], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [498], [506], [514], [522], [530], [538], [546], [554], [562], [567], [571], [582], [586], [590], [594], [598], [602], [606], [610], [614], [618], [622], [626], [630], [641], [644], [645], [649], [653], [657], [668], [672], [676], [680], [684], [688], [691], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [798], [809], [813], [824], [835], [839], [850], [854], [865], [869], [873], [877], [881], [885], [896], [900], [904], [908], [912], [916], [920], [924], [935], [939], [943], [947], [951], [955], [959], [963], [967], [971], [975], [979], [983], [987], [991], [1002], [1006], [1010], [1014], [1018], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1072], [1076], [1080], [1084], [1088], [1092], [1096], [1100], [1104], [1108], [1112], [1116], [1120], [1124], [1128], [1132], [1136], [1140], [1144], [1148], [1152], [1156], [1160], [1164], [1168], [1172], [1176], [1180], [1191], [1202], [1206], [1209], [1635], [1639], [1643], [1649], [1653], [1655], [1662], [1663], [1664], [1666], [1667] [2018-10-27 05:37:53,227 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 05:37:53,228 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:37:54,736 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 05:37:54,736 INFO L272 AbstractInterpreter]: Visited 211 different actions 1040 times. Merged at 8 different actions 32 times. Never widened. Found 7 fixpoints after 2 different actions. Largest state had 24 variables. [2018-10-27 05:37:54,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:37:54,745 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 05:37:54,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:37:54,745 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 05:37:54,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:37:54,754 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 05:37:54,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:37:54,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:37:55,058 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 245 proven. 2 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-10-27 05:37:55,059 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:37:55,513 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 245 proven. 2 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-10-27 05:37:55,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:37:55,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-10-27 05:37:55,535 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:37:55,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 05:37:55,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 05:37:55,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-10-27 05:37:55,536 INFO L87 Difference]: Start difference. First operand 26229 states and 33318 transitions. Second operand 9 states. [2018-10-27 05:38:03,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:38:03,631 INFO L93 Difference]: Finished difference Result 54696 states and 69981 transitions. [2018-10-27 05:38:03,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-27 05:38:03,631 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 414 [2018-10-27 05:38:03,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:38:03,742 INFO L225 Difference]: With dead ends: 54696 [2018-10-27 05:38:03,742 INFO L226 Difference]: Without dead ends: 29408 [2018-10-27 05:38:03,878 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 851 GetRequests, 832 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=252, Unknown=0, NotChecked=0, Total=380 [2018-10-27 05:38:03,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29408 states. [2018-10-27 05:38:04,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29408 to 29186. [2018-10-27 05:38:04,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29186 states. [2018-10-27 05:38:04,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29186 states to 29186 states and 34262 transitions. [2018-10-27 05:38:04,385 INFO L78 Accepts]: Start accepts. Automaton has 29186 states and 34262 transitions. Word has length 414 [2018-10-27 05:38:04,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:38:04,386 INFO L481 AbstractCegarLoop]: Abstraction has 29186 states and 34262 transitions. [2018-10-27 05:38:04,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 05:38:04,386 INFO L276 IsEmpty]: Start isEmpty. Operand 29186 states and 34262 transitions. [2018-10-27 05:38:04,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2018-10-27 05:38:04,408 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:38:04,409 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 05:38:04,409 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 05:38:04,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:38:04,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1572610096, now seen corresponding path program 1 times [2018-10-27 05:38:04,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:38:04,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:38:04,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:38:04,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:38:04,411 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:38:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:38:04,916 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2018-10-27 05:38:04,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:38:04,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 05:38:04,917 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:38:04,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 05:38:04,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 05:38:04,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:38:04,919 INFO L87 Difference]: Start difference. First operand 29186 states and 34262 transitions. Second operand 3 states. [2018-10-27 05:38:09,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:38:09,001 INFO L93 Difference]: Finished difference Result 62725 states and 75431 transitions. [2018-10-27 05:38:09,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 05:38:09,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 510 [2018-10-27 05:38:09,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:38:09,124 INFO L225 Difference]: With dead ends: 62725 [2018-10-27 05:38:09,124 INFO L226 Difference]: Without dead ends: 34480 [2018-10-27 05:38:09,212 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:38:09,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34480 states. [2018-10-27 05:38:09,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34480 to 34474. [2018-10-27 05:38:09,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34474 states. [2018-10-27 05:38:09,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34474 states to 34474 states and 40527 transitions. [2018-10-27 05:38:09,844 INFO L78 Accepts]: Start accepts. Automaton has 34474 states and 40527 transitions. Word has length 510 [2018-10-27 05:38:09,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:38:09,846 INFO L481 AbstractCegarLoop]: Abstraction has 34474 states and 40527 transitions. [2018-10-27 05:38:09,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 05:38:09,846 INFO L276 IsEmpty]: Start isEmpty. Operand 34474 states and 40527 transitions. [2018-10-27 05:38:09,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 658 [2018-10-27 05:38:09,902 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:38:09,904 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 05:38:09,904 INFO L424 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 05:38:09,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:38:09,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1977945066, now seen corresponding path program 1 times [2018-10-27 05:38:09,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:38:09,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:38:09,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:38:09,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:38:09,906 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:38:10,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:38:12,257 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 200 proven. 450 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-10-27 05:38:12,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:38:12,257 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:38:12,258 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 658 with the following transitions: [2018-10-27 05:38:12,258 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [221], [223], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [498], [506], [514], [522], [530], [538], [546], [554], [562], [567], [571], [582], [586], [590], [594], [598], [602], [606], [610], [614], [618], [622], [626], [630], [641], [645], [649], [653], [657], [668], [672], [676], [680], [684], [688], [691], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [798], [809], [813], [824], [835], [839], [842], [847], [849], [850], [854], [865], [869], [873], [877], [881], [885], [896], [900], [904], [908], [912], [916], [920], [924], [935], [939], [943], [947], [951], [955], [959], [963], [967], [971], [974], [975], [979], [983], [987], [991], [1002], [1006], [1010], [1014], [1018], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1072], [1076], [1080], [1084], [1088], [1092], [1096], [1100], [1104], [1108], [1112], [1116], [1120], [1124], [1128], [1132], [1136], [1140], [1144], [1148], [1152], [1156], [1160], [1164], [1168], [1172], [1176], [1180], [1191], [1202], [1206], [1210], [1214], [1218], [1229], [1233], [1237], [1241], [1245], [1256], [1260], [1264], [1268], [1272], [1276], [1280], [1284], [1288], [1292], [1296], [1300], [1304], [1308], [1312], [1316], [1320], [1324], [1328], [1332], [1336], [1340], [1344], [1348], [1352], [1356], [1367], [1371], [1375], [1379], [1383], [1394], [1398], [1402], [1406], [1417], [1421], [1425], [1429], [1433], [1437], [1441], [1452], [1455], [1635], [1639], [1643], [1649], [1653], [1655], [1662], [1663], [1664], [1666], [1667] [2018-10-27 05:38:12,263 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 05:38:12,264 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:38:13,115 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 05:38:13,116 INFO L272 AbstractInterpreter]: Visited 265 different actions 1574 times. Merged at 9 different actions 48 times. Widened at 1 different actions 2 times. Found 11 fixpoints after 2 different actions. Largest state had 24 variables. [2018-10-27 05:38:13,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:38:13,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 05:38:13,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:38:13,122 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 05:38:13,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:38:13,133 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 05:38:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:38:13,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:38:14,206 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 569 proven. 41 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2018-10-27 05:38:14,206 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:38:15,661 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 111 proven. 539 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-10-27 05:38:15,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:38:15,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2018-10-27 05:38:15,682 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:38:15,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-27 05:38:15,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-27 05:38:15,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2018-10-27 05:38:15,684 INFO L87 Difference]: Start difference. First operand 34474 states and 40527 transitions. Second operand 13 states. [2018-10-27 05:38:46,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:38:46,592 INFO L93 Difference]: Finished difference Result 96205 states and 113102 transitions. [2018-10-27 05:38:46,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-27 05:38:46,592 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 657 [2018-10-27 05:38:46,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:38:46,788 INFO L225 Difference]: With dead ends: 96205 [2018-10-27 05:38:46,788 INFO L226 Difference]: Without dead ends: 60142 [2018-10-27 05:38:46,875 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1372 GetRequests, 1331 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=428, Invalid=1294, Unknown=0, NotChecked=0, Total=1722 [2018-10-27 05:38:46,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60142 states. [2018-10-27 05:38:47,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60142 to 56593. [2018-10-27 05:38:47,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56593 states. [2018-10-27 05:38:47,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56593 states to 56593 states and 65922 transitions. [2018-10-27 05:38:47,725 INFO L78 Accepts]: Start accepts. Automaton has 56593 states and 65922 transitions. Word has length 657 [2018-10-27 05:38:47,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:38:47,725 INFO L481 AbstractCegarLoop]: Abstraction has 56593 states and 65922 transitions. [2018-10-27 05:38:47,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-27 05:38:47,725 INFO L276 IsEmpty]: Start isEmpty. Operand 56593 states and 65922 transitions. [2018-10-27 05:38:47,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2018-10-27 05:38:47,780 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:38:47,781 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:38:47,781 INFO L424 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 05:38:47,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:38:47,781 INFO L82 PathProgramCache]: Analyzing trace with hash 87242541, now seen corresponding path program 1 times [2018-10-27 05:38:47,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:38:47,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:38:47,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:38:47,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:38:47,783 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:38:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:38:48,601 INFO L134 CoverageAnalysis]: Checked inductivity of 763 backedges. 475 proven. 2 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2018-10-27 05:38:48,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:38:48,602 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:38:48,602 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 684 with the following transitions: [2018-10-27 05:38:48,602 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [221], [223], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [498], [506], [514], [522], [530], [538], [546], [554], [562], [567], [571], [582], [586], [590], [594], [598], [602], [606], [610], [614], [618], [622], [626], [630], [641], [645], [649], [653], [657], [660], [663], [667], [668], [672], [676], [680], [684], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [762], [763], [767], [771], [775], [779], [783], [787], [798], [809], [813], [824], [835], [839], [850], [854], [865], [869], [873], [877], [881], [885], [896], [900], [904], [908], [912], [916], [920], [924], [935], [939], [943], [947], [951], [955], [959], [963], [967], [971], [975], [979], [983], [987], [991], [1002], [1006], [1010], [1014], [1018], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1072], [1076], [1080], [1083], [1084], [1088], [1092], [1096], [1100], [1104], [1108], [1112], [1116], [1120], [1124], [1128], [1132], [1136], [1140], [1144], [1148], [1152], [1156], [1160], [1164], [1168], [1172], [1176], [1180], [1191], [1202], [1206], [1210], [1214], [1218], [1229], [1233], [1237], [1241], [1245], [1256], [1260], [1264], [1268], [1272], [1276], [1280], [1284], [1288], [1292], [1296], [1300], [1304], [1308], [1312], [1316], [1320], [1324], [1328], [1332], [1336], [1340], [1344], [1348], [1352], [1356], [1367], [1371], [1375], [1379], [1383], [1394], [1398], [1402], [1406], [1417], [1421], [1425], [1429], [1433], [1437], [1441], [1452], [1456], [1460], [1471], [1475], [1486], [1490], [1494], [1498], [1502], [1506], [1510], [1514], [1518], [1522], [1526], [1530], [1534], [1538], [1542], [1546], [1550], [1554], [1558], [1561], [1635], [1639], [1643], [1649], [1653], [1655], [1662], [1663], [1664], [1666], [1667] [2018-10-27 05:38:48,608 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 05:38:48,608 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:38:52,811 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 05:38:52,811 INFO L272 AbstractInterpreter]: Visited 288 different actions 859 times. Merged at 9 different actions 23 times. Never widened. Found 5 fixpoints after 3 different actions. Largest state had 24 variables. [2018-10-27 05:38:52,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:38:52,817 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 05:38:52,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:38:52,817 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 05:38:52,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:38:52,827 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 05:38:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:38:53,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:38:53,872 INFO L134 CoverageAnalysis]: Checked inductivity of 763 backedges. 455 proven. 22 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2018-10-27 05:38:53,872 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:38:54,532 INFO L134 CoverageAnalysis]: Checked inductivity of 763 backedges. 475 proven. 2 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2018-10-27 05:38:54,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:38:54,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2018-10-27 05:38:54,554 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:38:54,555 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 05:38:54,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 05:38:54,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-10-27 05:38:54,556 INFO L87 Difference]: Start difference. First operand 56593 states and 65922 transitions. Second operand 10 states. [2018-10-27 05:39:18,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:39:18,369 INFO L93 Difference]: Finished difference Result 157943 states and 197726 transitions. [2018-10-27 05:39:18,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-27 05:39:18,370 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 683 [2018-10-27 05:39:18,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. Received shutdown request... [2018-10-27 05:39:19,024 INFO L225 Difference]: With dead ends: 157943 [2018-10-27 05:39:19,024 INFO L226 Difference]: Without dead ends: 96730 [2018-10-27 05:39:19,460 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1390 GetRequests, 1368 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=151, Invalid=401, Unknown=0, NotChecked=0, Total=552 [2018-10-27 05:39:19,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96730 states. [2018-10-27 05:39:19,526 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-27 05:39:19,530 WARN L205 ceAbstractionStarter]: Timeout [2018-10-27 05:39:19,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 05:39:19 BoogieIcfgContainer [2018-10-27 05:39:19,531 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 05:39:19,532 INFO L168 Benchmark]: Toolchain (without parser) took 228684.86 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -881.2 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-10-27 05:39:19,533 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 05:39:19,533 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1254.77 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. [2018-10-27 05:39:19,534 INFO L168 Benchmark]: Boogie Procedure Inliner took 410.56 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 758.6 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -872.7 MB). Peak memory consumption was 33.4 MB. Max. memory is 7.1 GB. [2018-10-27 05:39:19,535 INFO L168 Benchmark]: Boogie Preprocessor took 248.41 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 7.1 GB. [2018-10-27 05:39:19,536 INFO L168 Benchmark]: RCFGBuilder took 6548.46 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 317.1 MB). Peak memory consumption was 317.1 MB. Max. memory is 7.1 GB. [2018-10-27 05:39:19,537 INFO L168 Benchmark]: TraceAbstraction took 220217.43 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.8 GB). Free memory was 1.8 GB in the beginning and 2.3 GB in the end (delta: -459.2 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-10-27 05:39:19,541 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1254.77 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 410.56 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 758.6 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -872.7 MB). Peak memory consumption was 33.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 248.41 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 6548.46 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 317.1 MB). Peak memory consumption was 317.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 220217.43 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.8 GB). Free memory was 1.8 GB in the beginning and 2.3 GB in the end (delta: -459.2 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 79]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 79). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 438 locations, 1 error locations. TIMEOUT Result, 220.1s OverallTime, 13 OverallIterations, 5 TraceHistogramMax, 188.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3914 SDtfs, 22519 SDslu, 3791 SDs, 0 SdLazy, 36499 SolverSat, 7067 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 146.0s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 5010 GetRequests, 4868 SyntacticMatches, 5 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56593occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 8.9s AbstIntTime, 6 AbstIntIterations, 2 AbstIntStrong, 0.99672293849649 AbsIntWeakeningRatio, 0.11196911196911197 AbsIntAvgWeakeningVarsNumRemoved, 15.266409266409266 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 5.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 4729 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 11.9s InterpolantComputationTime, 6109 NumberOfCodeBlocks, 6109 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 8246 ConstructedInterpolants, 33 QuantifiedInterpolants, 19928640 SizeOfPredicates, 11 NumberOfNonLiveVariables, 3080 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 21 InterpolantComputations, 7 PerfectInterpolantSequences, 5973/7212 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown