java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/invert_string-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:19:47,893 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:19:47,895 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:19:47,908 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:19:47,908 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:19:47,909 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:19:47,910 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:19:47,912 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:19:47,914 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:19:47,915 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:19:47,916 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:19:47,917 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:19:47,917 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:19:47,918 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:19:47,919 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:19:47,921 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:19:47,921 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:19:47,923 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:19:47,924 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:19:47,926 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:19:47,928 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:19:47,929 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:19:47,930 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:19:47,931 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:19:47,933 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:19:47,933 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:19:47,933 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:19:47,934 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:19:47,935 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:19:47,936 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:19:47,936 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:19:47,937 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:19:47,937 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:19:47,938 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:19:47,939 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:19:47,940 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:19:47,940 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:19:47,940 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:19:47,941 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:19:47,942 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:19:47,942 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:19:47,943 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-03 19:19:47,957 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:19:47,958 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:19:47,959 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:19:47,959 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:19:47,959 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:19:47,960 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:19:47,960 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:19:47,960 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:19:47,960 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:19:47,960 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:19:47,961 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:19:47,961 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:19:47,961 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:19:47,961 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:19:47,961 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:19:47,962 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:19:47,962 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:19:47,962 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:19:47,962 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:19:47,962 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:19:47,963 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:19:47,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:19:47,963 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:19:47,963 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:19:47,963 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:19:47,964 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:19:47,964 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:19:47,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:19:47,964 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:19:47,993 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:19:48,004 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:19:48,008 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:19:48,010 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:19:48,010 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:19:48,011 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/invert_string-1.c [2019-09-03 19:19:48,078 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cc330cd4/9da842d244824a86b4f88e3f26e2b33b/FLAG6c41ce1b6 [2019-09-03 19:19:48,579 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:19:48,581 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-1.c [2019-09-03 19:19:48,587 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cc330cd4/9da842d244824a86b4f88e3f26e2b33b/FLAG6c41ce1b6 [2019-09-03 19:19:48,963 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cc330cd4/9da842d244824a86b4f88e3f26e2b33b [2019-09-03 19:19:48,976 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:19:48,978 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:19:48,979 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:19:48,979 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:19:48,982 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:19:48,983 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:19:48" (1/1) ... [2019-09-03 19:19:48,986 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d38196f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:48, skipping insertion in model container [2019-09-03 19:19:48,987 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:19:48" (1/1) ... [2019-09-03 19:19:48,995 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:19:49,012 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:19:49,291 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:19:49,299 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:19:49,345 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:19:49,372 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:19:49,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:49 WrapperNode [2019-09-03 19:19:49,372 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:19:49,373 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:19:49,373 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:19:49,374 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:19:49,536 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:49" (1/1) ... [2019-09-03 19:19:49,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:49" (1/1) ... [2019-09-03 19:19:49,549 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:49" (1/1) ... [2019-09-03 19:19:49,550 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:49" (1/1) ... [2019-09-03 19:19:49,571 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:49" (1/1) ... [2019-09-03 19:19:49,579 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:49" (1/1) ... [2019-09-03 19:19:49,587 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:49" (1/1) ... [2019-09-03 19:19:49,589 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:19:49,589 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:19:49,590 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:19:49,590 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:19:49,591 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:19:49,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:19:49,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:19:49,652 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 19:19:49,652 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:19:49,653 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:19:49,653 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 19:19:49,653 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:19:49,653 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-03 19:19:49,653 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-03 19:19:49,653 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:19:49,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-03 19:19:49,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-03 19:19:49,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-03 19:19:49,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-03 19:19:49,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:19:49,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:19:49,944 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:19:49,945 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-03 19:19:49,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:19:49 BoogieIcfgContainer [2019-09-03 19:19:49,947 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:19:49,948 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:19:49,948 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:19:49,952 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:19:49,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:19:48" (1/3) ... [2019-09-03 19:19:49,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c423b9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:19:49, skipping insertion in model container [2019-09-03 19:19:49,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:49" (2/3) ... [2019-09-03 19:19:49,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c423b9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:19:49, skipping insertion in model container [2019-09-03 19:19:49,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:19:49" (3/3) ... [2019-09-03 19:19:49,955 INFO L109 eAbstractionObserver]: Analyzing ICFG invert_string-1.c [2019-09-03 19:19:49,966 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:19:49,974 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 19:19:49,991 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 19:19:50,030 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:19:50,031 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:19:50,031 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:19:50,032 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:19:50,032 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:19:50,032 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:19:50,032 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:19:50,033 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:19:50,033 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:19:50,052 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-09-03 19:19:50,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-03 19:19:50,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:50,059 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:50,060 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:50,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:50,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1778002988, now seen corresponding path program 1 times [2019-09-03 19:19:50,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:50,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:50,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:50,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:50,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:50,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:19:50,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:19:50,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 19:19:50,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 19:19:50,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 19:19:50,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 19:19:50,248 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2019-09-03 19:19:50,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:50,268 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2019-09-03 19:19:50,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 19:19:50,269 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-09-03 19:19:50,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:50,277 INFO L225 Difference]: With dead ends: 46 [2019-09-03 19:19:50,277 INFO L226 Difference]: Without dead ends: 22 [2019-09-03 19:19:50,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 19:19:50,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-03 19:19:50,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-03 19:19:50,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-03 19:19:50,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-09-03 19:19:50,318 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2019-09-03 19:19:50,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:50,318 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-09-03 19:19:50,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 19:19:50,318 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-09-03 19:19:50,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-03 19:19:50,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:50,319 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:50,320 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:50,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:50,320 INFO L82 PathProgramCache]: Analyzing trace with hash -262172122, now seen corresponding path program 1 times [2019-09-03 19:19:50,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:50,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:50,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:50,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:50,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:50,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:19:50,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:19:50,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 19:19:50,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 19:19:50,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 19:19:50,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:19:50,417 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 4 states. [2019-09-03 19:19:50,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:50,483 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-09-03 19:19:50,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:19:50,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-09-03 19:19:50,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:50,485 INFO L225 Difference]: With dead ends: 34 [2019-09-03 19:19:50,485 INFO L226 Difference]: Without dead ends: 23 [2019-09-03 19:19:50,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:19:50,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-03 19:19:50,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-03 19:19:50,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-03 19:19:50,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-09-03 19:19:50,493 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2019-09-03 19:19:50,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:50,494 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-09-03 19:19:50,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 19:19:50,494 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-09-03 19:19:50,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 19:19:50,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:50,495 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:50,495 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:50,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:50,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1485613060, now seen corresponding path program 1 times [2019-09-03 19:19:50,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:50,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:50,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:50,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:50,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:50,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 19:19:50,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:19:50,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 19:19:50,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 19:19:50,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 19:19:50,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:19:50,576 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 3 states. [2019-09-03 19:19:50,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:50,621 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-09-03 19:19:50,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 19:19:50,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-03 19:19:50,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:50,623 INFO L225 Difference]: With dead ends: 40 [2019-09-03 19:19:50,623 INFO L226 Difference]: Without dead ends: 25 [2019-09-03 19:19:50,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:19:50,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-03 19:19:50,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-09-03 19:19:50,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-03 19:19:50,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-09-03 19:19:50,630 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2019-09-03 19:19:50,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:50,631 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-09-03 19:19:50,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 19:19:50,631 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-09-03 19:19:50,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-03 19:19:50,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:50,632 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:50,633 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:50,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:50,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1323409058, now seen corresponding path program 1 times [2019-09-03 19:19:50,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:50,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:50,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:50,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:50,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:51,251 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 24 [2019-09-03 19:19:51,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:19:51,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:51,296 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:51,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:51,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 19:19:51,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:51,434 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-03 19:19:51,435 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:51,453 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:51,454 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:19:51,454 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-09-03 19:19:51,543 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2019-09-03 19:19:51,544 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:51,556 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:51,557 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:19:51,557 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-09-03 19:19:51,636 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-09-03 19:19:51,637 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:51,642 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:51,643 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:19:51,643 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-09-03 19:19:51,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:19:51,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:51,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2019-09-03 19:19:51,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 19:19:51,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 19:19:51,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:19:51,683 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 17 states. [2019-09-03 19:19:52,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:52,206 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2019-09-03 19:19:52,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 19:19:52,207 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 19 [2019-09-03 19:19:52,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:52,210 INFO L225 Difference]: With dead ends: 45 [2019-09-03 19:19:52,210 INFO L226 Difference]: Without dead ends: 43 [2019-09-03 19:19:52,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:19:52,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-03 19:19:52,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2019-09-03 19:19:52,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-03 19:19:52,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-09-03 19:19:52,247 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 19 [2019-09-03 19:19:52,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:52,248 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-09-03 19:19:52,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 19:19:52,248 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-09-03 19:19:52,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-03 19:19:52,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:52,252 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:52,253 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:52,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:52,254 INFO L82 PathProgramCache]: Analyzing trace with hash 64185792, now seen corresponding path program 2 times [2019-09-03 19:19:52,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:52,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:52,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:52,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:52,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:52,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:52,365 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:19:52,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:52,365 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:19:52,405 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:52,456 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:19:52,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:19:52,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-03 19:19:52,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:52,464 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:19:52,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:52,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-09-03 19:19:52,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 19:19:52,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 19:19:52,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:19:52,476 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 6 states. [2019-09-03 19:19:52,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:52,639 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2019-09-03 19:19:52,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 19:19:52,640 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-09-03 19:19:52,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:52,641 INFO L225 Difference]: With dead ends: 57 [2019-09-03 19:19:52,641 INFO L226 Difference]: Without dead ends: 46 [2019-09-03 19:19:52,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:19:52,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-03 19:19:52,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2019-09-03 19:19:52,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-03 19:19:52,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-09-03 19:19:52,651 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 21 [2019-09-03 19:19:52,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:52,651 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-09-03 19:19:52,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 19:19:52,651 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-09-03 19:19:52,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-03 19:19:52,652 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:52,652 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:52,653 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:52,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:52,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1582955806, now seen corresponding path program 3 times [2019-09-03 19:19:52,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:52,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:52,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:52,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:19:52,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:52,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:53,030 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2019-09-03 19:19:53,351 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 28 [2019-09-03 19:19:53,492 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 28 [2019-09-03 19:19:53,701 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:19:53,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:53,701 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-03 19:19:53,717 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:19:53,741 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 19:19:53,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:19:53,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 19:19:53,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:53,754 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-03 19:19:53,755 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:53,780 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:53,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:19:53,781 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-09-03 19:19:53,950 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2019-09-03 19:19:53,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:53,960 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:53,961 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:19:53,961 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2019-09-03 19:19:54,039 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:19:54,041 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-09-03 19:19:54,041 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:54,050 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:54,051 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:19:54,051 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:3 [2019-09-03 19:19:54,091 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:19:54,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:54,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2019-09-03 19:19:54,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 19:19:54,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 19:19:54,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2019-09-03 19:19:54,097 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 24 states. [2019-09-03 19:19:55,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:55,830 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2019-09-03 19:19:55,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-03 19:19:55,830 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2019-09-03 19:19:55,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:55,833 INFO L225 Difference]: With dead ends: 82 [2019-09-03 19:19:55,833 INFO L226 Difference]: Without dead ends: 80 [2019-09-03 19:19:55,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=402, Invalid=1668, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 19:19:55,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-03 19:19:55,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 44. [2019-09-03 19:19:55,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-03 19:19:55,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2019-09-03 19:19:55,844 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 23 [2019-09-03 19:19:55,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:55,845 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2019-09-03 19:19:55,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 19:19:55,845 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2019-09-03 19:19:55,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-03 19:19:55,846 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:55,846 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:55,846 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:55,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:55,847 INFO L82 PathProgramCache]: Analyzing trace with hash 683083068, now seen corresponding path program 4 times [2019-09-03 19:19:55,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:55,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:55,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:55,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:19:55,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:55,906 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:19:55,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:55,907 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-03 19:19:55,925 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:19:55,948 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:19:55,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:19:55,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 19:19:55,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:55,988 INFO L341 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2019-09-03 19:19:55,989 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2019-09-03 19:19:55,990 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:55,996 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:55,996 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:19:55,997 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-09-03 19:19:56,064 INFO L341 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2019-09-03 19:19:56,064 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 27 [2019-09-03 19:19:56,065 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:56,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:56,073 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:19:56,074 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2019-09-03 19:19:56,249 INFO L341 Elim1Store]: treesize reduction 10, result has 86.3 percent of original size [2019-09-03 19:19:56,249 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 75 [2019-09-03 19:19:56,251 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:56,265 INFO L567 ElimStorePlain]: treesize reduction 33, result has 23.3 percent of original size [2019-09-03 19:19:56,266 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:19:56,266 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:47, output treesize:3 [2019-09-03 19:19:56,313 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-03 19:19:56,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:56,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12] total 17 [2019-09-03 19:19:56,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 19:19:56,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 19:19:56,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:19:56,317 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 17 states. [2019-09-03 19:19:57,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:57,397 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2019-09-03 19:19:57,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-03 19:19:57,398 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2019-09-03 19:19:57,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:57,400 INFO L225 Difference]: With dead ends: 94 [2019-09-03 19:19:57,400 INFO L226 Difference]: Without dead ends: 80 [2019-09-03 19:19:57,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=180, Invalid=1010, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 19:19:57,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-03 19:19:57,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 62. [2019-09-03 19:19:57,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-03 19:19:57,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2019-09-03 19:19:57,417 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 25 [2019-09-03 19:19:57,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:57,417 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2019-09-03 19:19:57,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 19:19:57,418 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2019-09-03 19:19:57,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-03 19:19:57,419 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:57,419 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:57,419 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:57,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:57,419 INFO L82 PathProgramCache]: Analyzing trace with hash -96694823, now seen corresponding path program 1 times [2019-09-03 19:19:57,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:57,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:57,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:57,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:19:57,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:57,494 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 19:19:57,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:57,495 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:57,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:57,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:57,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-03 19:19:57,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:57,576 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 19:19:57,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:57,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-09-03 19:19:57,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 19:19:57,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 19:19:57,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:19:57,583 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand 10 states. [2019-09-03 19:19:57,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:57,720 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2019-09-03 19:19:57,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 19:19:57,721 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-09-03 19:19:57,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:57,722 INFO L225 Difference]: With dead ends: 97 [2019-09-03 19:19:57,722 INFO L226 Difference]: Without dead ends: 66 [2019-09-03 19:19:57,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:19:57,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-03 19:19:57,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2019-09-03 19:19:57,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-03 19:19:57,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2019-09-03 19:19:57,734 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 27 [2019-09-03 19:19:57,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:57,734 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2019-09-03 19:19:57,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 19:19:57,734 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2019-09-03 19:19:57,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-03 19:19:57,735 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:57,736 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:57,736 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:57,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:57,736 INFO L82 PathProgramCache]: Analyzing trace with hash -657216102, now seen corresponding path program 5 times [2019-09-03 19:19:57,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:57,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:57,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:57,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:57,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:58,046 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 24 [2019-09-03 19:19:58,772 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:19:58,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:58,773 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:58,795 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:19:58,825 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-03 19:19:58,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:19:58,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-03 19:19:58,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:58,834 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-03 19:19:58,835 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:58,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:58,842 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:19:58,842 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-09-03 19:19:59,107 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2019-09-03 19:19:59,108 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:59,116 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:59,117 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:19:59,117 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-09-03 19:19:59,197 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:59,197 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 22 [2019-09-03 19:19:59,198 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-03 19:19:59,212 INFO L567 ElimStorePlain]: treesize reduction 9, result has 60.9 percent of original size [2019-09-03 19:19:59,212 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:19:59,213 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:40, output treesize:3 [2019-09-03 19:19:59,251 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:19:59,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:59,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 32 [2019-09-03 19:19:59,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 19:19:59,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 19:19:59,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=842, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:19:59,257 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 32 states. [2019-09-03 19:20:02,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:20:02,225 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2019-09-03 19:20:02,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-03 19:20:02,226 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 27 [2019-09-03 19:20:02,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:20:02,228 INFO L225 Difference]: With dead ends: 101 [2019-09-03 19:20:02,228 INFO L226 Difference]: Without dead ends: 99 [2019-09-03 19:20:02,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1256 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=819, Invalid=3873, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 19:20:02,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-03 19:20:02,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 66. [2019-09-03 19:20:02,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-03 19:20:02,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2019-09-03 19:20:02,243 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 27 [2019-09-03 19:20:02,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:20:02,243 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2019-09-03 19:20:02,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 19:20:02,243 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2019-09-03 19:20:02,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-03 19:20:02,244 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:20:02,245 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:20:02,245 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:20:02,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:20:02,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1626114376, now seen corresponding path program 6 times [2019-09-03 19:20:02,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:20:02,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:20:02,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:02,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:20:02,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:02,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:02,310 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:20:02,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:20:02,311 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:20:02,327 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:20:02,368 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-03 19:20:02,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:20:02,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 19:20:02,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:20:02,386 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:20:02,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:20:02,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2019-09-03 19:20:02,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 19:20:02,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 19:20:02,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:20:02,407 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 8 states. [2019-09-03 19:20:02,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:20:02,633 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2019-09-03 19:20:02,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 19:20:02,634 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-09-03 19:20:02,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:20:02,635 INFO L225 Difference]: With dead ends: 102 [2019-09-03 19:20:02,635 INFO L226 Difference]: Without dead ends: 91 [2019-09-03 19:20:02,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:20:02,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-03 19:20:02,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 68. [2019-09-03 19:20:02,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-03 19:20:02,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2019-09-03 19:20:02,664 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 29 [2019-09-03 19:20:02,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:20:02,664 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2019-09-03 19:20:02,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 19:20:02,665 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2019-09-03 19:20:02,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-03 19:20:02,666 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:20:02,672 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:20:02,673 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:20:02,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:20:02,673 INFO L82 PathProgramCache]: Analyzing trace with hash 60600405, now seen corresponding path program 2 times [2019-09-03 19:20:02,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:20:02,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:20:02,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:02,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:20:02,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:02,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-03 19:20:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-03 19:20:02,777 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-03 19:20:02,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 07:20:02 BoogieIcfgContainer [2019-09-03 19:20:02,845 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 19:20:02,847 INFO L168 Benchmark]: Toolchain (without parser) took 13868.81 ms. Allocated memory was 131.6 MB in the beginning and 363.9 MB in the end (delta: 232.3 MB). Free memory was 86.9 MB in the beginning and 79.2 MB in the end (delta: 7.8 MB). Peak memory consumption was 240.1 MB. Max. memory is 7.1 GB. [2019-09-03 19:20:02,848 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 131.6 MB. Free memory was 105.7 MB in the beginning and 105.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-09-03 19:20:02,852 INFO L168 Benchmark]: CACSL2BoogieTranslator took 394.36 ms. Allocated memory is still 131.6 MB. Free memory was 86.7 MB in the beginning and 76.6 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2019-09-03 19:20:02,853 INFO L168 Benchmark]: Boogie Preprocessor took 215.87 ms. Allocated memory was 131.6 MB in the beginning and 200.8 MB in the end (delta: 69.2 MB). Free memory was 76.6 MB in the beginning and 176.1 MB in the end (delta: -99.5 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. [2019-09-03 19:20:02,856 INFO L168 Benchmark]: RCFGBuilder took 357.45 ms. Allocated memory is still 200.8 MB. Free memory was 176.1 MB in the beginning and 161.0 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. [2019-09-03 19:20:02,863 INFO L168 Benchmark]: TraceAbstraction took 12896.85 ms. Allocated memory was 200.8 MB in the beginning and 363.9 MB in the end (delta: 163.1 MB). Free memory was 160.4 MB in the beginning and 79.2 MB in the end (delta: 81.2 MB). Peak memory consumption was 244.3 MB. Max. memory is 7.1 GB. [2019-09-03 19:20:02,866 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 131.6 MB. Free memory was 105.7 MB in the beginning and 105.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 394.36 ms. Allocated memory is still 131.6 MB. Free memory was 86.7 MB in the beginning and 76.6 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 215.87 ms. Allocated memory was 131.6 MB in the beginning and 200.8 MB in the end (delta: 69.2 MB). Free memory was 76.6 MB in the beginning and 176.1 MB in the end (delta: -99.5 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 357.45 ms. Allocated memory is still 200.8 MB. Free memory was 176.1 MB in the beginning and 161.0 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12896.85 ms. Allocated memory was 200.8 MB in the beginning and 363.9 MB in the end (delta: 163.1 MB). Free memory was 160.4 MB in the beginning and 79.2 MB in the end (delta: 81.2 MB). Peak memory consumption was 244.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 6]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int MAX = __VERIFIER_nondet_uint(); [L16] char str1[MAX], str2[MAX]; [L17] int cont, i, j; [L18] cont = 0 [L20] i=0 VAL [cont=0, i=0, MAX=2, str1={-1:0}, str2={1:0}] [L20] COND TRUE i= 0 [L28] EXPR str1[0] [L28] str2[j] = str1[0] [L29] j++ VAL [cont=0, i=1, j=1, MAX=2, str1={-1:0}, str2={1:0}] [L27] i-- VAL [cont=0, i=0, j=1, MAX=2, str1={-1:0}, str2={1:0}] [L27] COND TRUE i >= 0 [L28] EXPR str1[0] [L28] str2[j] = str1[0] [L29] j++ VAL [cont=0, i=0, j=2, MAX=2, str1={-1:0}, str2={1:0}] [L27] i-- VAL [cont=0, i=-1, j=2, MAX=2, str1={-1:0}, str2={1:0}] [L27] COND FALSE !(i >= 0) VAL [cont=0, i=-1, j=2, MAX=2, str1={-1:0}, str2={1:0}] [L32] j = MAX-1 [L33] i=0 VAL [cont=0, i=0, j=1, MAX=2, str1={-1:0}, str2={1:0}] [L33] COND TRUE i