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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/array-crafted/zero_sum_const1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:51:49,912 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:51:49,915 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:51:49,932 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:51:49,933 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:51:49,935 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:51:49,937 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:51:49,949 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:51:49,951 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:51:49,951 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:51:49,953 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:51:49,955 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:51:49,956 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:51:49,959 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:51:49,962 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:51:49,963 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:51:49,965 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:51:49,966 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:51:49,967 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:51:49,969 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:51:49,970 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:51:49,971 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:51:49,972 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:51:49,972 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:51:49,974 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:51:49,975 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:51:49,975 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:51:49,976 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:51:49,976 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:51:49,977 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:51:49,977 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:51:49,978 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:51:49,979 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:51:49,979 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:51:49,980 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:51:49,980 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:51:49,981 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:51:49,981 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:51:49,982 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:51:49,982 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:51:49,983 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:51:49,984 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-10-14 23:51:49,997 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:51:49,998 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:51:49,999 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:51:49,999 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:51:49,999 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:51:49,999 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:51:50,000 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:51:50,000 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:51:50,000 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:51:50,000 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:51:50,000 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:51:50,001 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:51:50,001 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:51:50,001 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:51:50,001 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:51:50,001 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:51:50,002 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:51:50,002 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:51:50,002 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:51:50,002 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:51:50,002 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:51:50,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:51:50,003 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:51:50,003 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:51:50,003 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:51:50,003 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:51:50,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:51:50,004 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:51:50,004 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-14 23:51:50,276 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:51:50,296 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:51:50,299 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:51:50,301 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:51:50,301 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:51:50,302 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/zero_sum_const1.c [2019-10-14 23:51:50,366 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/969cdcddb/6a7917c8bcaf468c98861eb238f08f13/FLAG0b435b5ab [2019-10-14 23:51:50,803 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:51:50,806 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/zero_sum_const1.c [2019-10-14 23:51:50,812 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/969cdcddb/6a7917c8bcaf468c98861eb238f08f13/FLAG0b435b5ab [2019-10-14 23:51:51,201 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/969cdcddb/6a7917c8bcaf468c98861eb238f08f13 [2019-10-14 23:51:51,211 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:51:51,213 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:51:51,214 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:51:51,214 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:51:51,217 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:51:51,218 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:51:51" (1/1) ... [2019-10-14 23:51:51,221 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b0cb0e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:51, skipping insertion in model container [2019-10-14 23:51:51,221 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:51:51" (1/1) ... [2019-10-14 23:51:51,228 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:51:51,243 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:51:51,399 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:51:51,417 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:51:51,438 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:51:51,452 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:51:51,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:51 WrapperNode [2019-10-14 23:51:51,453 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:51:51,453 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:51:51,453 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:51:51,453 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:51:51,550 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:51" (1/1) ... [2019-10-14 23:51:51,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:51" (1/1) ... [2019-10-14 23:51:51,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:51" (1/1) ... [2019-10-14 23:51:51,558 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:51" (1/1) ... [2019-10-14 23:51:51,565 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:51" (1/1) ... [2019-10-14 23:51:51,571 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:51" (1/1) ... [2019-10-14 23:51:51,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:51" (1/1) ... [2019-10-14 23:51:51,578 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:51:51,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:51:51,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:51:51,581 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:51:51,582 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:51" (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-10-14 23:51:51,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:51:51,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:51:51,639 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-14 23:51:51,640 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:51:51,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:51:51,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 23:51:51,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-14 23:51:51,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-14 23:51:51,641 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-14 23:51:51,641 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:51:51,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-14 23:51:51,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 23:51:51,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 23:51:51,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:51:51,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:51:51,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 23:51:51,918 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:51:51,918 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-14 23:51:51,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:51:51 BoogieIcfgContainer [2019-10-14 23:51:51,919 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:51:51,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:51:51,923 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:51:51,925 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:51:51,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:51:51" (1/3) ... [2019-10-14 23:51:51,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e2e10e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:51:51, skipping insertion in model container [2019-10-14 23:51:51,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:51" (2/3) ... [2019-10-14 23:51:51,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e2e10e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:51:51, skipping insertion in model container [2019-10-14 23:51:51,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:51:51" (3/3) ... [2019-10-14 23:51:51,928 INFO L109 eAbstractionObserver]: Analyzing ICFG zero_sum_const1.c [2019-10-14 23:51:51,936 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:51:51,943 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:51:51,954 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:51:51,975 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:51:51,975 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:51:51,975 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:51:51,976 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:51:51,976 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:51:51,976 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:51:51,976 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:51:51,976 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:51:51,994 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-10-14 23:51:52,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 23:51:52,001 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:51:52,001 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:51:52,004 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:51:52,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:51:52,009 INFO L82 PathProgramCache]: Analyzing trace with hash -39751432, now seen corresponding path program 1 times [2019-10-14 23:51:52,017 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:51:52,017 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467629890] [2019-10-14 23:51:52,018 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:52,018 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:52,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:51:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:52,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:51:52,148 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467629890] [2019-10-14 23:51:52,148 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:51:52,149 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-14 23:51:52,149 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022174034] [2019-10-14 23:51:52,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-14 23:51:52,154 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:51:52,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-14 23:51:52,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-14 23:51:52,172 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2019-10-14 23:51:52,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:51:52,195 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2019-10-14 23:51:52,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-14 23:51:52,196 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-10-14 23:51:52,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:51:52,204 INFO L225 Difference]: With dead ends: 45 [2019-10-14 23:51:52,205 INFO L226 Difference]: Without dead ends: 20 [2019-10-14 23:51:52,208 INFO L600 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-10-14 23:51:52,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-14 23:51:52,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-14 23:51:52,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-14 23:51:52,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-10-14 23:51:52,246 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 16 [2019-10-14 23:51:52,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:51:52,246 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-10-14 23:51:52,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-14 23:51:52,247 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-10-14 23:51:52,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 23:51:52,247 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:51:52,248 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:51:52,248 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:51:52,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:51:52,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1179444838, now seen corresponding path program 1 times [2019-10-14 23:51:52,249 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:51:52,249 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741255473] [2019-10-14 23:51:52,250 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:52,250 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:52,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:51:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:52,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:51:52,420 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741255473] [2019-10-14 23:51:52,420 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:51:52,420 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:51:52,421 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410108925] [2019-10-14 23:51:52,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:51:52,423 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:51:52,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:51:52,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:51:52,424 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 5 states. [2019-10-14 23:51:52,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:51:52,487 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-10-14 23:51:52,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:51:52,488 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-14 23:51:52,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:51:52,489 INFO L225 Difference]: With dead ends: 28 [2019-10-14 23:51:52,490 INFO L226 Difference]: Without dead ends: 23 [2019-10-14 23:51:52,491 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:51:52,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-14 23:51:52,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-14 23:51:52,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-14 23:51:52,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-10-14 23:51:52,502 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 16 [2019-10-14 23:51:52,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:51:52,502 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-10-14 23:51:52,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:51:52,503 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-10-14 23:51:52,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-14 23:51:52,505 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:51:52,505 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:51:52,506 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:51:52,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:51:52,508 INFO L82 PathProgramCache]: Analyzing trace with hash 621827044, now seen corresponding path program 1 times [2019-10-14 23:51:52,508 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:51:52,508 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507346782] [2019-10-14 23:51:52,508 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:52,509 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:52,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:51:52,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:52,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:51:52,592 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507346782] [2019-10-14 23:51:52,592 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:51:52,592 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:51:52,592 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36748458] [2019-10-14 23:51:52,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:51:52,593 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:51:52,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:51:52,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:51:52,594 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 3 states. [2019-10-14 23:51:52,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:51:52,632 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2019-10-14 23:51:52,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:51:52,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-14 23:51:52,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:51:52,634 INFO L225 Difference]: With dead ends: 39 [2019-10-14 23:51:52,634 INFO L226 Difference]: Without dead ends: 25 [2019-10-14 23:51:52,635 INFO L600 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-10-14 23:51:52,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-14 23:51:52,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-10-14 23:51:52,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-14 23:51:52,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-10-14 23:51:52,644 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 18 [2019-10-14 23:51:52,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:51:52,644 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-10-14 23:51:52,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:51:52,644 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2019-10-14 23:51:52,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 23:51:52,646 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:51:52,646 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:51:52,646 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:51:52,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:51:52,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1263872610, now seen corresponding path program 1 times [2019-10-14 23:51:52,647 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:51:52,648 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280703195] [2019-10-14 23:51:52,648 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:52,648 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:52,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:51:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:52,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 23:51:52,741 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280703195] [2019-10-14 23:51:52,741 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:51:52,741 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:51:52,742 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856705646] [2019-10-14 23:51:52,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:51:52,743 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:51:52,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:51:52,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:51:52,743 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 4 states. [2019-10-14 23:51:52,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:51:52,794 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2019-10-14 23:51:52,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:51:52,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-10-14 23:51:52,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:51:52,795 INFO L225 Difference]: With dead ends: 35 [2019-10-14 23:51:52,796 INFO L226 Difference]: Without dead ends: 26 [2019-10-14 23:51:52,796 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:51:52,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-14 23:51:52,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2019-10-14 23:51:52,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-14 23:51:52,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-10-14 23:51:52,802 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 20 [2019-10-14 23:51:52,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:51:52,802 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-10-14 23:51:52,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:51:52,803 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-10-14 23:51:52,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 23:51:52,804 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:51:52,804 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:51:52,804 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:51:52,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:51:52,804 INFO L82 PathProgramCache]: Analyzing trace with hash 245922080, now seen corresponding path program 1 times [2019-10-14 23:51:52,805 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:51:52,805 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429945359] [2019-10-14 23:51:52,805 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:52,805 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:52,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:51:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:52,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 23:51:52,868 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429945359] [2019-10-14 23:51:52,868 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224834584] [2019-10-14 23:51:52,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:51:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:52,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 23:51:52,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:51:52,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 23:51:52,998 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-14 23:51:53,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 23:51:53,043 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1996751468] [2019-10-14 23:51:53,050 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 23 [2019-10-14 23:51:53,104 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-14 23:51:53,105 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-14 23:51:53,226 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-14 23:51:53,229 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 24 root evaluator evaluations with a maximum evaluation depth of 3. Performed 24 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 28 variables. [2019-10-14 23:51:53,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:51:53,233 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-14 23:51:53,290 INFO L227 lantSequenceWeakener]: Weakened 5 states. On average, predicates are now at 77.5% of their original sizes. [2019-10-14 23:51:53,290 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-14 23:51:53,297 INFO L553 sIntCurrentIteration]: We unified 21 AI predicates to 21 [2019-10-14 23:51:53,298 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-14 23:51:53,298 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-14 23:51:53,299 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4, 4] total 9 [2019-10-14 23:51:53,299 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397809529] [2019-10-14 23:51:53,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:51:53,300 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-14 23:51:53,300 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-14 23:51:53,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:51:53,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:51:53,301 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 4 states. [2019-10-14 23:51:53,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:51:53,305 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2019-10-14 23:51:53,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:51:53,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-10-14 23:51:53,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:51:53,305 INFO L225 Difference]: With dead ends: 23 [2019-10-14 23:51:53,306 INFO L226 Difference]: Without dead ends: 0 [2019-10-14 23:51:53,306 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:51:53,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-14 23:51:53,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-14 23:51:53,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-14 23:51:53,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-14 23:51:53,307 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-10-14 23:51:53,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:51:53,307 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-14 23:51:53,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:51:53,308 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-14 23:51:53,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-14 23:51:53,512 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:51:53,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-14 23:51:53,609 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:51:53,610 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:51:53,610 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:51:53,610 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:51:53,610 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= 0 (+ ~SIZE~0 2147483648)) (<= ~SIZE~0 2147483647) (= ~MAX~0 100000)) [2019-10-14 23:51:53,610 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:51:53,610 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:51:53,611 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 11 37) no Hoare annotation was computed. [2019-10-14 23:51:53,611 INFO L443 ceAbstractionStarter]: For program point L25-2(lines 25 28) no Hoare annotation was computed. [2019-10-14 23:51:53,611 INFO L439 ceAbstractionStarter]: At program point L25-3(lines 25 28) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648)))) [2019-10-14 23:51:53,611 INFO L443 ceAbstractionStarter]: For program point L25-4(lines 25 28) no Hoare annotation was computed. [2019-10-14 23:51:53,611 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 11 37) no Hoare annotation was computed. [2019-10-14 23:51:53,611 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 11 37) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648))) (and (<= 0 (+ ~SIZE~0 2147483648)) (<= ~SIZE~0 2147483647))) [2019-10-14 23:51:53,612 INFO L443 ceAbstractionStarter]: For program point L30-2(lines 30 33) no Hoare annotation was computed. [2019-10-14 23:51:53,612 INFO L439 ceAbstractionStarter]: At program point L30-3(lines 30 33) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648)))) [2019-10-14 23:51:53,612 INFO L439 ceAbstractionStarter]: At program point L30-4(lines 30 33) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (= main_~sum~0 0) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648)))) [2019-10-14 23:51:53,612 INFO L443 ceAbstractionStarter]: For program point L20-2(lines 20 23) no Hoare annotation was computed. [2019-10-14 23:51:53,612 INFO L439 ceAbstractionStarter]: At program point L20-3(lines 20 23) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648)))) [2019-10-14 23:51:53,613 INFO L443 ceAbstractionStarter]: For program point L20-4(lines 20 23) no Hoare annotation was computed. [2019-10-14 23:51:53,613 INFO L443 ceAbstractionStarter]: For program point L14(lines 14 35) no Hoare annotation was computed. [2019-10-14 23:51:53,613 INFO L443 ceAbstractionStarter]: For program point L14-1(lines 14 35) no Hoare annotation was computed. [2019-10-14 23:51:53,613 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2019-10-14 23:51:53,613 INFO L443 ceAbstractionStarter]: For program point L3-3(line 3) no Hoare annotation was computed. [2019-10-14 23:51:53,613 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 3) the Hoare annotation is: true [2019-10-14 23:51:53,614 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 3) no Hoare annotation was computed. [2019-10-14 23:51:53,614 INFO L443 ceAbstractionStarter]: For program point L3(line 3) no Hoare annotation was computed. [2019-10-14 23:51:53,614 INFO L443 ceAbstractionStarter]: For program point L3-1(line 3) no Hoare annotation was computed. [2019-10-14 23:51:53,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:51:53 BoogieIcfgContainer [2019-10-14 23:51:53,631 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-14 23:51:53,636 INFO L168 Benchmark]: Toolchain (without parser) took 2419.81 ms. Allocated memory was 145.2 MB in the beginning and 235.9 MB in the end (delta: 90.7 MB). Free memory was 103.0 MB in the beginning and 184.5 MB in the end (delta: -81.5 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2019-10-14 23:51:53,637 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 145.2 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-14 23:51:53,638 INFO L168 Benchmark]: CACSL2BoogieTranslator took 239.25 ms. Allocated memory is still 145.2 MB. Free memory was 102.6 MB in the beginning and 92.7 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-10-14 23:51:53,639 INFO L168 Benchmark]: Boogie Preprocessor took 124.91 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 92.7 MB in the beginning and 180.4 MB in the end (delta: -87.7 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2019-10-14 23:51:53,640 INFO L168 Benchmark]: RCFGBuilder took 341.04 ms. Allocated memory is still 202.9 MB. Free memory was 180.4 MB in the beginning and 165.0 MB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. [2019-10-14 23:51:53,641 INFO L168 Benchmark]: TraceAbstraction took 1708.28 ms. Allocated memory was 202.9 MB in the beginning and 235.9 MB in the end (delta: 33.0 MB). Free memory was 165.0 MB in the beginning and 184.5 MB in the end (delta: -19.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2019-10-14 23:51:53,645 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.21 ms. Allocated memory is still 145.2 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 239.25 ms. Allocated memory is still 145.2 MB. Free memory was 102.6 MB in the beginning and 92.7 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 124.91 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 92.7 MB in the beginning and 180.4 MB in the end (delta: -87.7 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 341.04 ms. Allocated memory is still 202.9 MB. Free memory was 180.4 MB in the beginning and 165.0 MB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1708.28 ms. Allocated memory was 202.9 MB in the beginning and 235.9 MB in the end (delta: 33.0 MB). Free memory was 165.0 MB in the beginning and 184.5 MB in the end (delta: -19.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: 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: 30]: Loop Invariant Derived loop invariant: (!(\old(SIZE) <= 2147483647) || !(100000 == MAX)) || !(0 <= \old(SIZE) + 2147483648) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: (!(\old(SIZE) <= 2147483647) || !(100000 == MAX)) || !(0 <= \old(SIZE) + 2147483648) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (!(\old(SIZE) <= 2147483647) || !(100000 == MAX)) || !(0 <= \old(SIZE) + 2147483648) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. Result: SAFE, OverallTime: 1.6s, OverallIterations: 5, TraceHistogramMax: 1, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 88 SDtfs, 25 SDslu, 66 SDs, 0 SdLazy, 50 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 13 PreInvPairs, 14 NumberOfFragments, 102 HoareAnnotationTreeSize, 13 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 3 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 114 NumberOfCodeBlocks, 114 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 4027 SizeOfPredicates, 3 NumberOfNonLiveVariables, 95 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 9/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: TIME[ms]: 183, ITERATIONS: 1, WAS_STRONG: 1, WEAKENING_RATIO: 0.9583333333333334, AVG_VARS_REMOVED_DURING_WEAKENING: 0.9523809523809523, AVG_WEAKENED_CONJUNCTS: 1.0476190476190477, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...