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_const_m2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:51:50,330 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:51:50,332 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:51:50,345 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:51:50,346 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:51:50,347 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:51:50,348 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:51:50,350 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:51:50,351 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:51:50,352 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:51:50,353 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:51:50,354 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:51:50,354 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:51:50,355 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:51:50,356 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:51:50,357 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:51:50,358 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:51:50,359 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:51:50,360 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:51:50,362 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:51:50,364 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:51:50,365 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:51:50,366 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:51:50,366 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:51:50,369 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:51:50,369 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:51:50,369 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:51:50,370 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:51:50,370 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:51:50,371 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:51:50,372 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:51:50,372 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:51:50,373 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:51:50,374 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:51:50,375 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:51:50,375 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:51:50,376 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:51:50,376 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:51:50,376 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:51:50,377 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:51:50,378 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:51:50,378 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:50,392 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:51:50,392 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:51:50,394 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:51:50,394 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:51:50,394 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:51:50,394 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:51:50,394 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:51:50,395 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:51:50,395 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:51:50,395 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:51:50,396 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:51:50,396 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:51:50,396 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:51:50,396 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:51:50,396 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:51:50,397 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:51:50,397 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:51:50,397 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:51:50,397 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:51:50,397 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:51:50,398 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:51:50,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:51:50,398 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:51:50,399 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:51:50,399 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:51:50,399 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:51:50,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:51:50,399 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:51:50,400 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,723 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:51:50,741 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:51:50,745 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:51:50,747 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:51:50,747 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:51:50,748 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/zero_sum_const_m2.c [2019-10-14 23:51:50,815 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e58494b2/258837d4f8e346c4b491997829075c8d/FLAGdd71b53b1 [2019-10-14 23:51:51,241 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:51:51,242 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/zero_sum_const_m2.c [2019-10-14 23:51:51,248 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e58494b2/258837d4f8e346c4b491997829075c8d/FLAGdd71b53b1 [2019-10-14 23:51:51,654 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e58494b2/258837d4f8e346c4b491997829075c8d [2019-10-14 23:51:51,664 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:51:51,666 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:51:51,667 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:51:51,669 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:51:51,672 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:51:51,672 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,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51fe3b84 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,675 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,683 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:51:51,700 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:51:51,892 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:51:51,916 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:51:51,957 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:51:51,975 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:51:51,976 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,976 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:51:51,977 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:51:51,977 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:51:51,977 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:51:52,091 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:52,092 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:52,103 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:52,112 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:52,128 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:52,142 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:52,144 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:52,146 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:51:52,153 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:51:52,153 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:51:52,153 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:51:52,154 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:52,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:51:52,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:51:52,212 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-14 23:51:52,212 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:51:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:51:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 23:51:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-14 23:51:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-14 23:51:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-14 23:51:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:51:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-14 23:51:52,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 23:51:52,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 23:51:52,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:51:52,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:51:52,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 23:51:52,543 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:51:52,543 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-14 23:51:52,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:51:52 BoogieIcfgContainer [2019-10-14 23:51:52,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:51:52,546 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:51:52,546 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:51:52,549 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:51:52,549 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:52,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63ffb9f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:51:52, skipping insertion in model container [2019-10-14 23:51:52,550 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:52,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63ffb9f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:51:52, skipping insertion in model container [2019-10-14 23:51:52,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:51:52" (3/3) ... [2019-10-14 23:51:52,553 INFO L109 eAbstractionObserver]: Analyzing ICFG zero_sum_const_m2.c [2019-10-14 23:51:52,561 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:51:52,567 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:51:52,576 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:51:52,598 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:51:52,598 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:51:52,599 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:51:52,599 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:51:52,599 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:51:52,599 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:51:52,599 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:51:52,600 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:51:52,617 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-10-14 23:51:52,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 23:51:52,624 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:51:52,625 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,627 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:51:52,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:51:52,632 INFO L82 PathProgramCache]: Analyzing trace with hash -720839896, now seen corresponding path program 1 times [2019-10-14 23:51:52,640 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:51:52,640 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574198431] [2019-10-14 23:51:52,640 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:52,641 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:52,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:51:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:52,775 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,775 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574198431] [2019-10-14 23:51:52,776 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:51:52,777 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-14 23:51:52,777 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109084291] [2019-10-14 23:51:52,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-14 23:51:52,783 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:51:52,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-14 23:51:52,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-14 23:51:52,800 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2019-10-14 23:51:52,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:51:52,824 INFO L93 Difference]: Finished difference Result 57 states and 77 transitions. [2019-10-14 23:51:52,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-14 23:51:52,826 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2019-10-14 23:51:52,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:51:52,834 INFO L225 Difference]: With dead ends: 57 [2019-10-14 23:51:52,835 INFO L226 Difference]: Without dead ends: 26 [2019-10-14 23:51:52,838 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,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-14 23:51:52,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-14 23:51:52,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-14 23:51:52,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-10-14 23:51:52,879 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 20 [2019-10-14 23:51:52,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:51:52,879 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-10-14 23:51:52,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-14 23:51:52,879 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-10-14 23:51:52,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 23:51:52,881 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:51:52,881 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,881 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:51:52,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:51:52,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1191176598, now seen corresponding path program 1 times [2019-10-14 23:51:52,882 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:51:52,882 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696753347] [2019-10-14 23:51:52,883 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:52,883 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:52,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:51:52,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:53,028 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:53,029 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696753347] [2019-10-14 23:51:53,029 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:51:53,030 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:51:53,030 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889612693] [2019-10-14 23:51:53,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:51:53,032 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:51:53,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:51:53,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:51:53,033 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 5 states. [2019-10-14 23:51:53,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:51:53,098 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2019-10-14 23:51:53,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:51:53,099 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-10-14 23:51:53,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:51:53,101 INFO L225 Difference]: With dead ends: 38 [2019-10-14 23:51:53,101 INFO L226 Difference]: Without dead ends: 33 [2019-10-14 23:51:53,102 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:51:53,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-14 23:51:53,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-10-14 23:51:53,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-14 23:51:53,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2019-10-14 23:51:53,110 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 20 [2019-10-14 23:51:53,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:51:53,111 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-10-14 23:51:53,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:51:53,111 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2019-10-14 23:51:53,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 23:51:53,112 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:51:53,112 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:53,113 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:51:53,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:51:53,113 INFO L82 PathProgramCache]: Analyzing trace with hash -988852588, now seen corresponding path program 1 times [2019-10-14 23:51:53,114 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:51:53,114 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161474198] [2019-10-14 23:51:53,114 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:53,115 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:53,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:51:53,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:53,201 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:53,202 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161474198] [2019-10-14 23:51:53,203 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:51:53,204 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:51:53,204 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336226445] [2019-10-14 23:51:53,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:51:53,205 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:51:53,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:51:53,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:51:53,206 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 3 states. [2019-10-14 23:51:53,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:51:53,272 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2019-10-14 23:51:53,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:51:53,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-14 23:51:53,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:51:53,275 INFO L225 Difference]: With dead ends: 59 [2019-10-14 23:51:53,276 INFO L226 Difference]: Without dead ends: 35 [2019-10-14 23:51:53,278 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:53,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-14 23:51:53,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-10-14 23:51:53,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-14 23:51:53,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2019-10-14 23:51:53,290 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 22 [2019-10-14 23:51:53,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:51:53,290 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2019-10-14 23:51:53,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:51:53,291 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2019-10-14 23:51:53,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-14 23:51:53,293 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:51:53,293 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, 1, 1] [2019-10-14 23:51:53,294 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:51:53,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:51:53,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1991586542, now seen corresponding path program 1 times [2019-10-14 23:51:53,295 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:51:53,296 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021688518] [2019-10-14 23:51:53,296 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:53,296 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:53,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:51:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:53,388 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:53,388 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021688518] [2019-10-14 23:51:53,388 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:51:53,389 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:51:53,389 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541597575] [2019-10-14 23:51:53,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:51:53,390 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:51:53,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:51:53,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:51:53,390 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 4 states. [2019-10-14 23:51:53,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:51:53,479 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2019-10-14 23:51:53,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:51:53,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-10-14 23:51:53,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:51:53,481 INFO L225 Difference]: With dead ends: 55 [2019-10-14 23:51:53,481 INFO L226 Difference]: Without dead ends: 36 [2019-10-14 23:51:53,482 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:53,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-14 23:51:53,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2019-10-14 23:51:53,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-14 23:51:53,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-10-14 23:51:53,489 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 24 [2019-10-14 23:51:53,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:51:53,490 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-10-14 23:51:53,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:51:53,490 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-10-14 23:51:53,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 23:51:53,491 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:51:53,491 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:51:53,492 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:51:53,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:51:53,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1169709580, now seen corresponding path program 1 times [2019-10-14 23:51:53,492 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:51:53,493 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057682930] [2019-10-14 23:51:53,493 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:53,493 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:53,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:51:53,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:53,602 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 23:51:53,602 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057682930] [2019-10-14 23:51:53,602 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906485625] [2019-10-14 23:51:53,603 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:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:53,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 23:51:53,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:51:53,740 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 23:51:53,741 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-14 23:51:53,794 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 23:51:53,794 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1689882218] [2019-10-14 23:51:53,801 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 31 [2019-10-14 23:51:53,832 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-14 23:51:53,832 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-14 23:51:53,899 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-14 23:51:53,901 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 32 variables. [2019-10-14 23:51:53,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:51:53,905 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-14 23:51:53,952 INFO L227 lantSequenceWeakener]: Weakened 5 states. On average, predicates are now at 77.5% of their original sizes. [2019-10-14 23:51:53,953 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-14 23:51:53,967 INFO L553 sIntCurrentIteration]: We unified 29 AI predicates to 29 [2019-10-14 23:51:53,967 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-14 23:51:53,968 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-14 23:51:53,968 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4, 4] total 9 [2019-10-14 23:51:53,968 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811905022] [2019-10-14 23:51:53,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:51:53,970 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-14 23:51:53,970 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-14 23:51:53,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:51:53,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:51:53,971 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 4 states. [2019-10-14 23:51:53,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:51:53,975 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-10-14 23:51:53,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:51:53,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-10-14 23:51:53,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:51:53,975 INFO L225 Difference]: With dead ends: 31 [2019-10-14 23:51:53,975 INFO L226 Difference]: Without dead ends: 0 [2019-10-14 23:51:53,976 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 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,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-14 23:51:53,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-14 23:51:53,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-14 23:51:53,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-14 23:51:53,977 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2019-10-14 23:51:53,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:51:53,977 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-14 23:51:53,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:51:53,978 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-14 23:51:53,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-14 23:51:54,182 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:51:54,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-14 23:51:54,283 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:51:54,284 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:51:54,284 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:51:54,284 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:51:54,284 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:54,285 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:51:54,285 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:51:54,285 INFO L443 ceAbstractionStarter]: For program point L35-2(lines 35 38) no Hoare annotation was computed. [2019-10-14 23:51:54,285 INFO L439 ceAbstractionStarter]: At program point L35-3(lines 35 38) 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:54,285 INFO L443 ceAbstractionStarter]: For program point L35-4(lines 35 38) no Hoare annotation was computed. [2019-10-14 23:51:54,285 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 11 47) no Hoare annotation was computed. [2019-10-14 23:51:54,286 INFO L443 ceAbstractionStarter]: For program point L40-2(lines 40 43) no Hoare annotation was computed. [2019-10-14 23:51:54,286 INFO L439 ceAbstractionStarter]: At program point L40-3(lines 40 43) 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:54,286 INFO L439 ceAbstractionStarter]: At program point L40-4(lines 40 43) 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:54,286 INFO L443 ceAbstractionStarter]: For program point L20-2(lines 20 23) no Hoare annotation was computed. [2019-10-14 23:51:54,286 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:54,287 INFO L443 ceAbstractionStarter]: For program point L20-4(lines 20 23) no Hoare annotation was computed. [2019-10-14 23:51:54,287 INFO L443 ceAbstractionStarter]: For program point L25-2(lines 25 28) no Hoare annotation was computed. [2019-10-14 23:51:54,287 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:54,287 INFO L443 ceAbstractionStarter]: For program point L25-4(lines 25 28) no Hoare annotation was computed. [2019-10-14 23:51:54,287 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 11 47) no Hoare annotation was computed. [2019-10-14 23:51:54,287 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 11 47) 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:54,288 INFO L443 ceAbstractionStarter]: For program point L30-2(lines 30 33) no Hoare annotation was computed. [2019-10-14 23:51:54,288 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:54,288 INFO L443 ceAbstractionStarter]: For program point L30-4(lines 30 33) no Hoare annotation was computed. [2019-10-14 23:51:54,288 INFO L443 ceAbstractionStarter]: For program point L14(lines 14 45) no Hoare annotation was computed. [2019-10-14 23:51:54,288 INFO L443 ceAbstractionStarter]: For program point L14-1(lines 14 45) no Hoare annotation was computed. [2019-10-14 23:51:54,288 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2019-10-14 23:51:54,289 INFO L443 ceAbstractionStarter]: For program point L3-3(line 3) no Hoare annotation was computed. [2019-10-14 23:51:54,289 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 3) the Hoare annotation is: true [2019-10-14 23:51:54,289 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 3) no Hoare annotation was computed. [2019-10-14 23:51:54,289 INFO L443 ceAbstractionStarter]: For program point L3(line 3) no Hoare annotation was computed. [2019-10-14 23:51:54,289 INFO L443 ceAbstractionStarter]: For program point L3-1(line 3) no Hoare annotation was computed. [2019-10-14 23:51:54,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:51:54 BoogieIcfgContainer [2019-10-14 23:51:54,317 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-14 23:51:54,321 INFO L168 Benchmark]: Toolchain (without parser) took 2652.72 ms. Allocated memory was 135.8 MB in the beginning and 229.1 MB in the end (delta: 93.3 MB). Free memory was 100.0 MB in the beginning and 170.7 MB in the end (delta: -70.8 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. [2019-10-14 23:51:54,322 INFO L168 Benchmark]: CDTParser took 1.04 ms. Allocated memory is still 135.8 MB. Free memory was 119.0 MB in the beginning and 118.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-14 23:51:54,324 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.81 ms. Allocated memory is still 135.8 MB. Free memory was 99.7 MB in the beginning and 89.5 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2019-10-14 23:51:54,325 INFO L168 Benchmark]: Boogie Preprocessor took 175.66 ms. Allocated memory was 135.8 MB in the beginning and 201.3 MB in the end (delta: 65.5 MB). Free memory was 89.5 MB in the beginning and 179.3 MB in the end (delta: -89.9 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2019-10-14 23:51:54,327 INFO L168 Benchmark]: RCFGBuilder took 392.11 ms. Allocated memory is still 201.3 MB. Free memory was 178.6 MB in the beginning and 162.1 MB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 7.1 GB. [2019-10-14 23:51:54,328 INFO L168 Benchmark]: TraceAbstraction took 1770.54 ms. Allocated memory was 201.3 MB in the beginning and 229.1 MB in the end (delta: 27.8 MB). Free memory was 162.1 MB in the beginning and 170.7 MB in the end (delta: -8.6 MB). Peak memory consumption was 19.2 MB. Max. memory is 7.1 GB. [2019-10-14 23:51:54,334 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.04 ms. Allocated memory is still 135.8 MB. Free memory was 119.0 MB in the beginning and 118.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 309.81 ms. Allocated memory is still 135.8 MB. Free memory was 99.7 MB in the beginning and 89.5 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 175.66 ms. Allocated memory was 135.8 MB in the beginning and 201.3 MB in the end (delta: 65.5 MB). Free memory was 89.5 MB in the beginning and 179.3 MB in the end (delta: -89.9 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 392.11 ms. Allocated memory is still 201.3 MB. Free memory was 178.6 MB in the beginning and 162.1 MB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1770.54 ms. Allocated memory was 201.3 MB in the beginning and 229.1 MB in the end (delta: 27.8 MB). Free memory was 162.1 MB in the beginning and 170.7 MB in the end (delta: -8.6 MB). Peak memory consumption was 19.2 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) - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: (!(\old(SIZE) <= 2147483647) || !(100000 == MAX)) || !(0 <= \old(SIZE) + 2147483648) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (!(\old(SIZE) <= 2147483647) || !(100000 == MAX)) || !(0 <= \old(SIZE) + 2147483648) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 33 locations, 1 error locations. Result: SAFE, OverallTime: 1.6s, OverallIterations: 5, TraceHistogramMax: 1, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 112 SDtfs, 30 SDslu, 89 SDs, 0 SdLazy, 80 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=3, 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, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 15 PreInvPairs, 16 NumberOfFragments, 132 HoareAnnotationTreeSize, 15 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 3 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 169 ConstructedInterpolants, 0 QuantifiedInterpolants, 6491 SizeOfPredicates, 3 NumberOfNonLiveVariables, 111 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 15/18 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: TIME[ms]: 104, ITERATIONS: 1, WAS_STRONG: 1, WEAKENING_RATIO: 0.9698275862068966, AVG_VARS_REMOVED_DURING_WEAKENING: 0.896551724137931, AVG_WEAKENED_CONJUNCTS: 0.7586206896551724, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...