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/ldv-regression/test22-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 01:35:03,902 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 01:35:03,904 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 01:35:03,919 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 01:35:03,920 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 01:35:03,921 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 01:35:03,922 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 01:35:03,924 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 01:35:03,928 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 01:35:03,929 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 01:35:03,933 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 01:35:03,934 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 01:35:03,935 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 01:35:03,936 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 01:35:03,937 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 01:35:03,939 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 01:35:03,939 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 01:35:03,940 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 01:35:03,946 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 01:35:03,950 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 01:35:03,953 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 01:35:03,955 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 01:35:03,956 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 01:35:03,957 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 01:35:03,959 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 01:35:03,959 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 01:35:03,959 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 01:35:03,963 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 01:35:03,964 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 01:35:03,964 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 01:35:03,965 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 01:35:03,968 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 01:35:03,969 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 01:35:03,970 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 01:35:03,974 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 01:35:03,974 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 01:35:03,975 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 01:35:03,975 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 01:35:03,976 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 01:35:03,977 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 01:35:03,978 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 01:35:03,979 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-08 01:35:04,006 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 01:35:04,006 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 01:35:04,008 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 01:35:04,008 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 01:35:04,008 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 01:35:04,008 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 01:35:04,008 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 01:35:04,009 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 01:35:04,009 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 01:35:04,009 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 01:35:04,009 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 01:35:04,009 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 01:35:04,010 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 01:35:04,010 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 01:35:04,010 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 01:35:04,010 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 01:35:04,010 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 01:35:04,011 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 01:35:04,011 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 01:35:04,011 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 01:35:04,011 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 01:35:04,011 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 01:35:04,012 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 01:35:04,012 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 01:35:04,012 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 01:35:04,012 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 01:35:04,012 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 01:35:04,013 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 01:35:04,013 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 01:35:04,054 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 01:35:04,068 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 01:35:04,073 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 01:35:04,074 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 01:35:04,075 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 01:35:04,075 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test22-1.c [2019-09-08 01:35:04,148 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/580d647f8/e1fb0b0b7f754343a93373210b4d5ab1/FLAG483637424 [2019-09-08 01:35:04,546 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 01:35:04,547 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test22-1.c [2019-09-08 01:35:04,554 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/580d647f8/e1fb0b0b7f754343a93373210b4d5ab1/FLAG483637424 [2019-09-08 01:35:04,967 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/580d647f8/e1fb0b0b7f754343a93373210b4d5ab1 [2019-09-08 01:35:04,975 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 01:35:04,977 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 01:35:04,978 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 01:35:04,978 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 01:35:04,981 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 01:35:04,982 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:35:04" (1/1) ... [2019-09-08 01:35:04,985 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57ccb992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:04, skipping insertion in model container [2019-09-08 01:35:04,985 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:35:04" (1/1) ... [2019-09-08 01:35:04,993 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 01:35:05,010 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 01:35:05,168 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 01:35:05,180 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 01:35:05,201 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 01:35:05,222 INFO L192 MainTranslator]: Completed translation [2019-09-08 01:35:05,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:05 WrapperNode [2019-09-08 01:35:05,223 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 01:35:05,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 01:35:05,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 01:35:05,224 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 01:35:05,323 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:05" (1/1) ... [2019-09-08 01:35:05,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:05" (1/1) ... [2019-09-08 01:35:05,334 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:05" (1/1) ... [2019-09-08 01:35:05,337 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:05" (1/1) ... [2019-09-08 01:35:05,363 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:05" (1/1) ... [2019-09-08 01:35:05,375 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:05" (1/1) ... [2019-09-08 01:35:05,377 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:05" (1/1) ... [2019-09-08 01:35:05,385 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 01:35:05,385 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 01:35:05,385 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 01:35:05,385 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 01:35:05,386 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:05" (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-08 01:35:05,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 01:35:05,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 01:35:05,452 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-08 01:35:05,453 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2019-09-08 01:35:05,453 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-08 01:35:05,453 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 01:35:05,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 01:35:05,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 01:35:05,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 01:35:05,454 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 01:35:05,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 01:35:05,454 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2019-09-08 01:35:05,454 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 01:35:05,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 01:35:05,454 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 01:35:05,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 01:35:05,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 01:35:05,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 01:35:05,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 01:35:05,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 01:35:05,828 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 01:35:05,829 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 01:35:05,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:35:05 BoogieIcfgContainer [2019-09-08 01:35:05,830 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 01:35:05,831 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 01:35:05,831 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 01:35:05,835 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 01:35:05,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:35:04" (1/3) ... [2019-09-08 01:35:05,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b6cf5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:35:05, skipping insertion in model container [2019-09-08 01:35:05,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:05" (2/3) ... [2019-09-08 01:35:05,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b6cf5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:35:05, skipping insertion in model container [2019-09-08 01:35:05,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:35:05" (3/3) ... [2019-09-08 01:35:05,842 INFO L109 eAbstractionObserver]: Analyzing ICFG test22-1.c [2019-09-08 01:35:05,852 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 01:35:05,861 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 01:35:05,879 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 01:35:05,922 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 01:35:05,923 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 01:35:05,923 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 01:35:05,923 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 01:35:05,923 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 01:35:05,923 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 01:35:05,924 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 01:35:05,924 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 01:35:05,924 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 01:35:05,953 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-09-08 01:35:05,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-08 01:35:05,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:05,964 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:35:05,970 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:05,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:05,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1345538594, now seen corresponding path program 1 times [2019-09-08 01:35:05,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:05,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:06,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:06,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:35:06,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:06,291 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 01:35:06,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:35:06,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 01:35:06,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 01:35:06,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 01:35:06,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 01:35:06,315 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2019-09-08 01:35:06,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:35:06,340 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2019-09-08 01:35:06,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 01:35:06,341 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2019-09-08 01:35:06,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:35:06,351 INFO L225 Difference]: With dead ends: 49 [2019-09-08 01:35:06,351 INFO L226 Difference]: Without dead ends: 31 [2019-09-08 01:35:06,355 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-08 01:35:06,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-08 01:35:06,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-09-08 01:35:06,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-08 01:35:06,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-09-08 01:35:06,399 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 37 [2019-09-08 01:35:06,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:35:06,401 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-09-08 01:35:06,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 01:35:06,401 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-09-08 01:35:06,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-08 01:35:06,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:06,404 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:35:06,405 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:06,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:06,405 INFO L82 PathProgramCache]: Analyzing trace with hash -213153012, now seen corresponding path program 1 times [2019-09-08 01:35:06,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:06,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:06,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:06,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:35:06,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:06,744 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 01:35:06,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:35:06,745 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) [2019-09-08 01:35:06,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:35:06,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:06,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 01:35:06,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:35:07,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:35:07,072 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 21 treesize of output 13 [2019-09-08 01:35:07,081 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:35:07,095 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 21 treesize of output 13 [2019-09-08 01:35:07,096 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:35:07,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:35:07,116 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-08 01:35:07,116 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:5 [2019-09-08 01:35:07,122 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 01:35:07,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 01:35:07,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 13 [2019-09-08 01:35:07,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 01:35:07,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 01:35:07,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-09-08 01:35:07,143 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 13 states. [2019-09-08 01:35:07,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:35:07,846 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2019-09-08 01:35:07,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 01:35:07,847 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2019-09-08 01:35:07,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:35:07,851 INFO L225 Difference]: With dead ends: 67 [2019-09-08 01:35:07,851 INFO L226 Difference]: Without dead ends: 59 [2019-09-08 01:35:07,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2019-09-08 01:35:07,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-08 01:35:07,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 33. [2019-09-08 01:35:07,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-08 01:35:07,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-09-08 01:35:07,880 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 38 [2019-09-08 01:35:07,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:35:07,880 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-09-08 01:35:07,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 01:35:07,881 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-09-08 01:35:07,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-08 01:35:07,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:07,885 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-09-08 01:35:07,885 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:07,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:07,888 INFO L82 PathProgramCache]: Analyzing trace with hash -655504409, now seen corresponding path program 1 times [2019-09-08 01:35:07,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:07,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:07,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:07,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:35:07,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:07,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:08,127 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 01:35:08,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:35:08,128 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-08 01:35:08,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:35:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:08,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 01:35:08,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:35:08,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:35:08,389 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 21 treesize of output 13 [2019-09-08 01:35:08,390 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:35:08,395 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 21 treesize of output 13 [2019-09-08 01:35:08,395 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:35:08,406 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:35:08,407 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-08 01:35:08,407 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:5 [2019-09-08 01:35:08,413 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 01:35:08,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:35:08,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2019-09-08 01:35:08,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 01:35:08,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 01:35:08,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-08 01:35:08,418 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 16 states. [2019-09-08 01:35:09,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:35:09,175 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2019-09-08 01:35:09,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 01:35:09,175 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2019-09-08 01:35:09,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:35:09,177 INFO L225 Difference]: With dead ends: 71 [2019-09-08 01:35:09,177 INFO L226 Difference]: Without dead ends: 63 [2019-09-08 01:35:09,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=154, Invalid=658, Unknown=0, NotChecked=0, Total=812 [2019-09-08 01:35:09,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-08 01:35:09,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 35. [2019-09-08 01:35:09,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-08 01:35:09,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-09-08 01:35:09,187 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 40 [2019-09-08 01:35:09,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:35:09,188 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-09-08 01:35:09,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 01:35:09,188 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-09-08 01:35:09,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-08 01:35:09,189 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:09,189 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-09-08 01:35:09,190 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:09,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:09,190 INFO L82 PathProgramCache]: Analyzing trace with hash -553434622, now seen corresponding path program 2 times [2019-09-08 01:35:09,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:09,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:09,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:09,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:35:09,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:09,427 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 01:35:09,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:35:09,428 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-08 01:35:09,447 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:35:09,495 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:35:09,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:35:09,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-08 01:35:09,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:35:09,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:35:09,720 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 21 treesize of output 13 [2019-09-08 01:35:09,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:35:09,730 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 21 treesize of output 13 [2019-09-08 01:35:09,731 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:35:09,742 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:35:09,742 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-08 01:35:09,743 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:5 [2019-09-08 01:35:09,747 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 01:35:09,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:35:09,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2019-09-08 01:35:09,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 01:35:09,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 01:35:09,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-09-08 01:35:09,753 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 22 states. [2019-09-08 01:35:10,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:35:10,713 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2019-09-08 01:35:10,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 01:35:10,714 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2019-09-08 01:35:10,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:35:10,715 INFO L225 Difference]: With dead ends: 75 [2019-09-08 01:35:10,715 INFO L226 Difference]: Without dead ends: 67 [2019-09-08 01:35:10,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=260, Invalid=1222, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 01:35:10,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-08 01:35:10,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 37. [2019-09-08 01:35:10,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-08 01:35:10,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-09-08 01:35:10,726 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 42 [2019-09-08 01:35:10,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:35:10,727 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-09-08 01:35:10,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 01:35:10,729 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-09-08 01:35:10,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-08 01:35:10,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:10,733 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:35:10,733 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:10,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:10,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1248617123, now seen corresponding path program 3 times [2019-09-08 01:35:10,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:10,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:10,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:10,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:35:10,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:11,031 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 01:35:11,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:35:11,031 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-08 01:35:11,050 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:35:11,088 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-08 01:35:11,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:35:11,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-08 01:35:11,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:35:11,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:35:11,525 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 01:35:11,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:35:11,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2019-09-08 01:35:11,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 01:35:11,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 01:35:11,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2019-09-08 01:35:11,532 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 28 states. [2019-09-08 01:35:12,315 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-09-08 01:35:12,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:35:12,955 INFO L93 Difference]: Finished difference Result 86 states and 103 transitions. [2019-09-08 01:35:12,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 01:35:12,956 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 44 [2019-09-08 01:35:12,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:35:12,958 INFO L225 Difference]: With dead ends: 86 [2019-09-08 01:35:12,958 INFO L226 Difference]: Without dead ends: 60 [2019-09-08 01:35:12,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=289, Invalid=1517, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 01:35:12,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-08 01:35:12,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-09-08 01:35:12,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-08 01:35:12,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2019-09-08 01:35:12,970 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 44 [2019-09-08 01:35:12,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:35:12,970 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2019-09-08 01:35:12,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 01:35:12,970 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2019-09-08 01:35:12,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-08 01:35:12,971 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:12,971 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 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] [2019-09-08 01:35:12,972 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:12,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:12,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1758090213, now seen corresponding path program 1 times [2019-09-08 01:35:12,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:12,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:12,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:12,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:35:12,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:13,072 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 01:35:13,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:35:13,073 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-08 01:35:13,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:35:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:13,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-08 01:35:13,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:35:13,146 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 23 treesize of output 21 [2019-09-08 01:35:13,147 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-08 01:35:13,156 INFO L567 ElimStorePlain]: treesize reduction 14, result has 22.2 percent of original size [2019-09-08 01:35:13,157 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:35:13,157 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2019-09-08 01:35:13,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:35:13,212 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-08 01:35:13,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:35:13,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 16 [2019-09-08 01:35:13,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 01:35:13,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 01:35:13,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-09-08 01:35:13,220 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 16 states. [2019-09-08 01:35:13,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:35:13,515 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2019-09-08 01:35:13,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 01:35:13,516 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2019-09-08 01:35:13,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:35:13,517 INFO L225 Difference]: With dead ends: 65 [2019-09-08 01:35:13,517 INFO L226 Difference]: Without dead ends: 40 [2019-09-08 01:35:13,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-09-08 01:35:13,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-08 01:35:13,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-09-08 01:35:13,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-08 01:35:13,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-09-08 01:35:13,526 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 44 [2019-09-08 01:35:13,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:35:13,526 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-09-08 01:35:13,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 01:35:13,527 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-09-08 01:35:13,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-08 01:35:13,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:13,528 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 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] [2019-09-08 01:35:13,528 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:13,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:13,528 INFO L82 PathProgramCache]: Analyzing trace with hash 802366875, now seen corresponding path program 2 times [2019-09-08 01:35:13,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:13,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:13,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:13,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:35:13,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:13,616 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 01:35:13,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:35:13,616 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-08 01:35:13,651 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:35:13,694 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:35:13,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:35:13,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-08 01:35:13,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:35:14,172 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-09-08 01:35:14,173 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:35:14,179 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:35:14,179 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:35:14,179 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:13 [2019-09-08 01:35:14,216 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:14,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:35:14,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 29 [2019-09-08 01:35:14,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 01:35:14,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 01:35:14,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2019-09-08 01:35:14,222 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 29 states. [2019-09-08 01:35:15,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:35:15,565 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2019-09-08 01:35:15,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 01:35:15,565 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 44 [2019-09-08 01:35:15,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:35:15,567 INFO L225 Difference]: With dead ends: 63 [2019-09-08 01:35:15,567 INFO L226 Difference]: Without dead ends: 42 [2019-09-08 01:35:15,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=365, Invalid=2185, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 01:35:15,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-08 01:35:15,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-09-08 01:35:15,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-08 01:35:15,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-09-08 01:35:15,577 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 44 [2019-09-08 01:35:15,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:35:15,578 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-09-08 01:35:15,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 01:35:15,578 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-09-08 01:35:15,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-08 01:35:15,579 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:15,579 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 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] [2019-09-08 01:35:15,580 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:15,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:15,580 INFO L82 PathProgramCache]: Analyzing trace with hash 324163060, now seen corresponding path program 3 times [2019-09-08 01:35:15,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:15,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:15,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:15,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:35:15,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:15,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:15,827 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 01:35:15,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:35:15,828 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-08 01:35:15,853 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:35:15,892 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-08 01:35:15,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:35:15,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-08 01:35:15,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:35:16,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:35:16,209 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-08 01:35:16,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:35:16,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2019-09-08 01:35:16,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 01:35:16,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 01:35:16,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=730, Unknown=0, NotChecked=0, Total=812 [2019-09-08 01:35:16,215 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 29 states. [2019-09-08 01:35:17,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:35:17,602 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-09-08 01:35:17,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 01:35:17,603 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 46 [2019-09-08 01:35:17,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:35:17,604 INFO L225 Difference]: With dead ends: 50 [2019-09-08 01:35:17,604 INFO L226 Difference]: Without dead ends: 0 [2019-09-08 01:35:17,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=345, Invalid=1725, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 01:35:17,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-08 01:35:17,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-08 01:35:17,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-08 01:35:17,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-08 01:35:17,607 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2019-09-08 01:35:17,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:35:17,607 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-08 01:35:17,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 01:35:17,607 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-08 01:35:17,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-08 01:35:17,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-08 01:35:18,063 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 37 [2019-09-08 01:35:18,205 INFO L443 ceAbstractionStarter]: For program point initEXIT(lines 11 18) no Hoare annotation was computed. [2019-09-08 01:35:18,206 INFO L446 ceAbstractionStarter]: At program point initENTRY(lines 11 18) the Hoare annotation is: true [2019-09-08 01:35:18,206 INFO L443 ceAbstractionStarter]: For program point initFINAL(lines 11 18) no Hoare annotation was computed. [2019-09-08 01:35:18,206 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-08 01:35:18,208 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-09-08 01:35:18,208 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-08 01:35:18,208 INFO L443 ceAbstractionStarter]: For program point get_dummyFINAL(lines 20 23) no Hoare annotation was computed. [2019-09-08 01:35:18,208 INFO L446 ceAbstractionStarter]: At program point get_dummyENTRY(lines 20 23) the Hoare annotation is: true [2019-09-08 01:35:18,208 INFO L443 ceAbstractionStarter]: For program point L22-1(line 22) no Hoare annotation was computed. [2019-09-08 01:35:18,208 INFO L443 ceAbstractionStarter]: For program point get_dummyEXIT(lines 20 23) no Hoare annotation was computed. [2019-09-08 01:35:18,208 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-08 01:35:18,209 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 |~#d2~0.offset|) (not (= |~#d1~0.base| |~#d2~0.base|)) (= 0 |~#d1~0.offset|)) [2019-09-08 01:35:18,209 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-08 01:35:18,209 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-08 01:35:18,209 INFO L443 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-09-08 01:35:18,209 INFO L443 ceAbstractionStarter]: For program point L35-2(lines 35 44) no Hoare annotation was computed. [2019-09-08 01:35:18,209 INFO L439 ceAbstractionStarter]: At program point L33-1(line 33) the Hoare annotation is: (or (= |~#d1~0.base| |~#d2~0.base|) (not (= |~#d2~0.offset| 0)) (not (= 0 |~#d1~0.offset|)) (and (= |~#d2~0.base| main_~pd1~0.base) (= main_~pd1~0.offset 0)) (and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))) [2019-09-08 01:35:18,209 INFO L443 ceAbstractionStarter]: For program point L33-2(line 33) no Hoare annotation was computed. [2019-09-08 01:35:18,210 INFO L443 ceAbstractionStarter]: For program point L35-4(lines 35 44) no Hoare annotation was computed. [2019-09-08 01:35:18,210 INFO L439 ceAbstractionStarter]: At program point L33-3(line 33) the Hoare annotation is: (let ((.cse1 (= |~#d1~0.base| main_~pd1~0.base)) (.cse3 (not (= main_~pd2~0.base main_~pd1~0.base))) (.cse0 (= main_~pd2~0.offset 0)) (.cse2 (= main_~pd1~0.offset 0))) (or (and .cse0 .cse1 (= main_~pd1~0.offset |~#d1~0.offset|)) (= |~#d1~0.base| |~#d2~0.base|) (not (= |~#d2~0.offset| 0)) (and (= |~#d2~0.base| main_~pd1~0.base) .cse0 .cse2) (not (= 0 |~#d1~0.offset|)) (and .cse3 .cse1) (and .cse3 .cse0 .cse2))) [2019-09-08 01:35:18,210 INFO L443 ceAbstractionStarter]: For program point L33-4(line 33) no Hoare annotation was computed. [2019-09-08 01:35:18,210 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 30 50) no Hoare annotation was computed. [2019-09-08 01:35:18,210 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 30 50) no Hoare annotation was computed. [2019-09-08 01:35:18,210 INFO L439 ceAbstractionStarter]: At program point L42(lines 31 50) the Hoare annotation is: (or (= |~#d1~0.base| |~#d2~0.base|) (not (= |~#d2~0.offset| 0)) (not (= 0 |~#d1~0.offset|))) [2019-09-08 01:35:18,210 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2019-09-08 01:35:18,211 INFO L443 ceAbstractionStarter]: For program point L38-1(lines 38 40) no Hoare annotation was computed. [2019-09-08 01:35:18,211 INFO L439 ceAbstractionStarter]: At program point L38-3(lines 38 40) the Hoare annotation is: (let ((.cse5 (= main_~pd1~0.offset 0))) (let ((.cse1 (= main_~pd2~0.base main_~pa~0.base)) (.cse2 (= main_~pd2~0.offset 0)) (.cse0 (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (.cse3 (or (not (= 0 main_~pd1~0.base)) (not .cse5))) (.cse4 (= main_~pd2~0.base main_~pd1~0.base))) (or (not (= |~#d2~0.offset| 0)) (= |~#d1~0.base| |~#d2~0.base|) (and .cse0 (= 0 main_~pa~0.offset) .cse1 .cse2 .cse3 .cse4 (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|)) (not (= 0 |~#d1~0.offset|)) (and (= main_~pd2~0.offset main_~pa~0.offset) .cse1 .cse2 .cse5 (= |~#d2~0.base| main_~pd1~0.base) .cse0 .cse3 .cse4)))) [2019-09-08 01:35:18,211 INFO L439 ceAbstractionStarter]: At program point L38-4(lines 38 40) the Hoare annotation is: (let ((.cse3 (not (= 0 main_~pd1~0.base))) (.cse1 (= main_~pd2~0.base main_~pa~0.base)) (.cse2 (= main_~pd2~0.offset 0)) (.cse4 (= main_~pd2~0.base main_~pd1~0.base)) (.cse5 (select |#memory_int| main_~pd2~0.base))) (or (= |~#d1~0.base| |~#d2~0.base|) (not (= |~#d2~0.offset| 0)) (not (= 0 |~#d1~0.offset|)) (let ((.cse0 (select .cse5 main_~pd2~0.offset))) (and (= main_~pd2~0.offset main_~pa~0.offset) (<= main_~i~0 .cse0) (<= .cse0 main_~i~0) .cse1 .cse2 (= main_~pd1~0.offset 0) (= |~#d2~0.base| main_~pd1~0.base) .cse3 .cse4)) (let ((.cse6 (select .cse5 0))) (and .cse3 (<= .cse6 main_~i~0) (<= main_~i~0 .cse6) (= 0 main_~pa~0.offset) .cse1 .cse2 .cse4 (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))))) [2019-09-08 01:35:18,211 INFO L446 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: true [2019-09-08 01:35:18,211 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 30 50) the Hoare annotation is: true [2019-09-08 01:35:18,212 INFO L443 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2019-09-08 01:35:18,212 INFO L443 ceAbstractionStarter]: For program point L41-1(lines 41 43) no Hoare annotation was computed. [2019-09-08 01:35:18,212 INFO L443 ceAbstractionStarter]: For program point L35(line 35) no Hoare annotation was computed. [2019-09-08 01:35:18,212 INFO L446 ceAbstractionStarter]: At program point checkENTRY(lines 25 28) the Hoare annotation is: true [2019-09-08 01:35:18,213 INFO L443 ceAbstractionStarter]: For program point checkFINAL(lines 25 28) no Hoare annotation was computed. [2019-09-08 01:35:18,213 INFO L443 ceAbstractionStarter]: For program point checkEXIT(lines 25 28) no Hoare annotation was computed. [2019-09-08 01:35:18,227 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 01:35:18,228 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 01:35:18,237 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 01:35:18,238 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 01:35:18,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 01:35:18 BoogieIcfgContainer [2019-09-08 01:35:18,242 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-08 01:35:18,245 INFO L168 Benchmark]: Toolchain (without parser) took 13267.69 ms. Allocated memory was 131.6 MB in the beginning and 412.6 MB in the end (delta: 281.0 MB). Free memory was 87.8 MB in the beginning and 269.1 MB in the end (delta: -181.3 MB). Peak memory consumption was 99.8 MB. Max. memory is 7.1 GB. [2019-09-08 01:35:18,251 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 131.6 MB. Free memory was 106.1 MB in the beginning and 105.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-08 01:35:18,252 INFO L168 Benchmark]: CACSL2BoogieTranslator took 245.48 ms. Allocated memory is still 131.6 MB. Free memory was 87.4 MB in the beginning and 77.2 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2019-09-08 01:35:18,253 INFO L168 Benchmark]: Boogie Preprocessor took 161.26 ms. Allocated memory was 131.6 MB in the beginning and 197.1 MB in the end (delta: 65.5 MB). Free memory was 77.2 MB in the beginning and 172.7 MB in the end (delta: -95.6 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. [2019-09-08 01:35:18,254 INFO L168 Benchmark]: RCFGBuilder took 445.08 ms. Allocated memory is still 197.1 MB. Free memory was 172.7 MB in the beginning and 154.7 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 7.1 GB. [2019-09-08 01:35:18,255 INFO L168 Benchmark]: TraceAbstraction took 12411.51 ms. Allocated memory was 197.1 MB in the beginning and 412.6 MB in the end (delta: 215.5 MB). Free memory was 154.0 MB in the beginning and 269.1 MB in the end (delta: -115.0 MB). Peak memory consumption was 100.4 MB. Max. memory is 7.1 GB. [2019-09-08 01:35:18,268 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.48 ms. Allocated memory is still 131.6 MB. Free memory was 106.1 MB in the beginning and 105.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 245.48 ms. Allocated memory is still 131.6 MB. Free memory was 87.4 MB in the beginning and 77.2 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 161.26 ms. Allocated memory was 131.6 MB in the beginning and 197.1 MB in the end (delta: 65.5 MB). Free memory was 77.2 MB in the beginning and 172.7 MB in the end (delta: -95.6 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 445.08 ms. Allocated memory is still 197.1 MB. Free memory was 172.7 MB in the beginning and 154.7 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12411.51 ms. Allocated memory was 197.1 MB in the beginning and 412.6 MB in the end (delta: 215.5 MB). Free memory was 154.0 MB in the beginning and 269.1 MB in the end (delta: -115.0 MB). Peak memory consumption was 100.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 38]: Loop Invariant [2019-09-08 01:35:18,283 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 01:35:18,283 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 01:35:18,284 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 01:35:18,287 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((!(d2 == 0) || d1 == d2) || (((((((i <= unknown-#memory_int-unknown[pa][pa] && 0 == pa) && pd2 == pa) && pd2 == 0) && (!(0 == pd1) || !(pd1 == 0))) && pd2 == pd1) && d1 == pd1) && pd1 == d1)) || !(0 == d1)) || (((((((pd2 == pa && pd2 == pa) && pd2 == 0) && pd1 == 0) && d2 == pd1) && i <= unknown-#memory_int-unknown[pa][pa]) && (!(0 == pd1) || !(pd1 == 0))) && pd2 == pd1) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (d1 == d2 || !(d2 == 0)) || !(0 == d1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 36 locations, 1 error locations. SAFE Result, 12.3s OverallTime, 8 OverallIterations, 5 TraceHistogramMax, 6.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 232 SDtfs, 358 SDslu, 2187 SDs, 0 SdLazy, 2534 SolverSat, 240 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 496 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1334 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 102 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 28 PreInvPairs, 45 NumberOfFragments, 275 HoareAnnotationTreeSize, 28 FomulaSimplifications, 5990 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 13 FomulaSimplificationsInter, 1148 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 633 NumberOfCodeBlocks, 627 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 618 ConstructedInterpolants, 0 QuantifiedInterpolants, 115290 SizeOfPredicates, 67 NumberOfNonLiveVariables, 1343 ConjunctsInSsa, 234 ConjunctsInUnsatCore, 15 InterpolantComputations, 2 PerfectInterpolantSequences, 148/308 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...