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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_trivial_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-06 23:16:48,525 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-06 23:16:48,528 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-06 23:16:48,544 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-06 23:16:48,545 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-06 23:16:48,547 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-06 23:16:48,548 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-06 23:16:48,557 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-06 23:16:48,562 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-06 23:16:48,565 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-06 23:16:48,566 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-06 23:16:48,567 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-06 23:16:48,567 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-06 23:16:48,569 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-06 23:16:48,571 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-06 23:16:48,572 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-06 23:16:48,573 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-06 23:16:48,575 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-06 23:16:48,576 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-06 23:16:48,580 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-06 23:16:48,584 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-06 23:16:48,586 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-06 23:16:48,589 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-06 23:16:48,590 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-06 23:16:48,593 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-06 23:16:48,593 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-06 23:16:48,593 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-06 23:16:48,595 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-06 23:16:48,596 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-06 23:16:48,597 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-06 23:16:48,597 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-06 23:16:48,599 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-06 23:16:48,599 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-06 23:16:48,600 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-06 23:16:48,601 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-06 23:16:48,601 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-06 23:16:48,602 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-06 23:16:48,602 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-06 23:16:48,602 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-06 23:16:48,603 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-06 23:16:48,604 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-06 23:16:48,605 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-06 23:16:48,631 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-06 23:16:48,631 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-06 23:16:48,632 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-06 23:16:48,634 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-06 23:16:48,635 INFO L138 SettingsManager]: * Use SBE=true [2019-10-06 23:16:48,635 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-06 23:16:48,635 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-06 23:16:48,635 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-06 23:16:48,636 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-06 23:16:48,636 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-06 23:16:48,636 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-06 23:16:48,636 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-06 23:16:48,636 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-06 23:16:48,636 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-06 23:16:48,637 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-06 23:16:48,637 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-06 23:16:48,637 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-06 23:16:48,637 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-06 23:16:48,637 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-06 23:16:48,638 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-06 23:16:48,638 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-06 23:16:48,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:16:48,641 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-06 23:16:48,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-06 23:16:48,642 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-06 23:16:48,642 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-06 23:16:48,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-06 23:16:48,642 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-06 23:16:48,643 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-06 23:16:48,902 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-06 23:16:48,914 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-06 23:16:48,917 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-06 23:16:48,919 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-06 23:16:48,919 INFO L275 PluginConnector]: CDTParser initialized [2019-10-06 23:16:48,920 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_trivial_ground.i [2019-10-06 23:16:48,992 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0da9e6a8/00811c59c49b4160b98ccd44b51b881f/FLAGe80ae32d9 [2019-10-06 23:16:49,451 INFO L306 CDTParser]: Found 1 translation units. [2019-10-06 23:16:49,452 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_trivial_ground.i [2019-10-06 23:16:49,459 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0da9e6a8/00811c59c49b4160b98ccd44b51b881f/FLAGe80ae32d9 [2019-10-06 23:16:49,852 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0da9e6a8/00811c59c49b4160b98ccd44b51b881f [2019-10-06 23:16:49,861 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-06 23:16:49,863 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-06 23:16:49,864 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-06 23:16:49,864 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-06 23:16:49,867 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-06 23:16:49,868 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:16:49" (1/1) ... [2019-10-06 23:16:49,871 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d46bbee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:49, skipping insertion in model container [2019-10-06 23:16:49,871 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:16:49" (1/1) ... [2019-10-06 23:16:49,878 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-06 23:16:49,905 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-06 23:16:50,143 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:16:50,153 INFO L188 MainTranslator]: Completed pre-run [2019-10-06 23:16:50,257 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:16:50,272 INFO L192 MainTranslator]: Completed translation [2019-10-06 23:16:50,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:50 WrapperNode [2019-10-06 23:16:50,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-06 23:16:50,274 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-06 23:16:50,274 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-06 23:16:50,274 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-06 23:16:50,283 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:50" (1/1) ... [2019-10-06 23:16:50,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:50" (1/1) ... [2019-10-06 23:16:50,290 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:50" (1/1) ... [2019-10-06 23:16:50,291 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:50" (1/1) ... [2019-10-06 23:16:50,301 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:50" (1/1) ... [2019-10-06 23:16:50,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:50" (1/1) ... [2019-10-06 23:16:50,314 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:50" (1/1) ... [2019-10-06 23:16:50,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-06 23:16:50,317 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-06 23:16:50,317 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-06 23:16:50,318 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-06 23:16:50,318 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:50" (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-06 23:16:50,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-06 23:16:50,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-06 23:16:50,377 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-06 23:16:50,377 INFO L138 BoogieDeclarations]: Found implementation of procedure insert [2019-10-06 23:16:50,377 INFO L138 BoogieDeclarations]: Found implementation of procedure elem_exists [2019-10-06 23:16:50,378 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-06 23:16:50,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-06 23:16:50,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-06 23:16:50,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-06 23:16:50,379 INFO L130 BoogieDeclarations]: Found specification of procedure insert [2019-10-06 23:16:50,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-06 23:16:50,380 INFO L130 BoogieDeclarations]: Found specification of procedure elem_exists [2019-10-06 23:16:50,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-06 23:16:50,380 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-06 23:16:50,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-06 23:16:50,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-06 23:16:50,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-06 23:16:50,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-06 23:16:50,938 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-06 23:16:50,939 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-06 23:16:50,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:16:50 BoogieIcfgContainer [2019-10-06 23:16:50,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-06 23:16:50,943 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-06 23:16:50,943 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-06 23:16:50,946 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-06 23:16:50,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 11:16:49" (1/3) ... [2019-10-06 23:16:50,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c99eae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:16:50, skipping insertion in model container [2019-10-06 23:16:50,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:16:50" (2/3) ... [2019-10-06 23:16:50,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c99eae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:16:50, skipping insertion in model container [2019-10-06 23:16:50,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:16:50" (3/3) ... [2019-10-06 23:16:50,951 INFO L109 eAbstractionObserver]: Analyzing ICFG data_structures_set_multi_proc_trivial_ground.i [2019-10-06 23:16:50,961 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-06 23:16:50,969 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-06 23:16:50,982 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-06 23:16:51,007 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-06 23:16:51,007 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-06 23:16:51,007 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-06 23:16:51,007 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-06 23:16:51,007 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-06 23:16:51,007 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-06 23:16:51,008 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-06 23:16:51,008 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-06 23:16:51,023 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-10-06 23:16:51,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-06 23:16:51,028 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:16:51,029 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:16:51,031 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:16:51,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:16:51,035 INFO L82 PathProgramCache]: Analyzing trace with hash 652244700, now seen corresponding path program 1 times [2019-10-06 23:16:51,042 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:16:51,042 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:51,042 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:51,043 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:51,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:16:51,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:51,206 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-06 23:16:51,207 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:51,208 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:16:51,208 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:16:51,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:16:51,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:16:51,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:16:51,226 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2019-10-06 23:16:51,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:16:51,336 INFO L93 Difference]: Finished difference Result 100 states and 148 transitions. [2019-10-06 23:16:51,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:16:51,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-06 23:16:51,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:16:51,349 INFO L225 Difference]: With dead ends: 100 [2019-10-06 23:16:51,349 INFO L226 Difference]: Without dead ends: 60 [2019-10-06 23:16:51,353 INFO L606 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-06 23:16:51,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-06 23:16:51,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 40. [2019-10-06 23:16:51,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-06 23:16:51,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2019-10-06 23:16:51,402 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 53 transitions. Word has length 12 [2019-10-06 23:16:51,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:16:51,402 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 53 transitions. [2019-10-06 23:16:51,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:16:51,402 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2019-10-06 23:16:51,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-06 23:16:51,403 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:16:51,403 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:16:51,404 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:16:51,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:16:51,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1778757127, now seen corresponding path program 1 times [2019-10-06 23:16:51,405 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:16:51,405 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:51,405 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:51,405 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:51,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:16:51,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:51,496 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-06 23:16:51,496 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:51,496 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:16:51,496 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-06 23:16:51,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-06 23:16:51,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-06 23:16:51,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-06 23:16:51,499 INFO L87 Difference]: Start difference. First operand 40 states and 53 transitions. Second operand 5 states. [2019-10-06 23:16:51,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:16:51,570 INFO L93 Difference]: Finished difference Result 79 states and 107 transitions. [2019-10-06 23:16:51,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-06 23:16:51,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-10-06 23:16:51,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:16:51,573 INFO L225 Difference]: With dead ends: 79 [2019-10-06 23:16:51,573 INFO L226 Difference]: Without dead ends: 45 [2019-10-06 23:16:51,574 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-06 23:16:51,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-06 23:16:51,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-10-06 23:16:51,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-06 23:16:51,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2019-10-06 23:16:51,584 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 13 [2019-10-06 23:16:51,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:16:51,585 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2019-10-06 23:16:51,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-06 23:16:51,585 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2019-10-06 23:16:51,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-06 23:16:51,587 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:16:51,587 INFO L385 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] [2019-10-06 23:16:51,587 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:16:51,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:16:51,588 INFO L82 PathProgramCache]: Analyzing trace with hash -569386671, now seen corresponding path program 1 times [2019-10-06 23:16:51,588 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:16:51,588 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:51,588 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:51,588 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:51,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:16:51,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:51,659 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-06 23:16:51,659 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:51,660 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:16:51,660 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:16:51,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:16:51,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:16:51,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:16:51,661 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand 3 states. [2019-10-06 23:16:51,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:16:51,689 INFO L93 Difference]: Finished difference Result 91 states and 120 transitions. [2019-10-06 23:16:51,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:16:51,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-06 23:16:51,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:16:51,691 INFO L225 Difference]: With dead ends: 91 [2019-10-06 23:16:51,691 INFO L226 Difference]: Without dead ends: 57 [2019-10-06 23:16:51,692 INFO L606 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-06 23:16:51,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-06 23:16:51,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 44. [2019-10-06 23:16:51,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-06 23:16:51,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2019-10-06 23:16:51,701 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 28 [2019-10-06 23:16:51,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:16:51,702 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2019-10-06 23:16:51,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:16:51,702 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2019-10-06 23:16:51,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-06 23:16:51,703 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:16:51,704 INFO L385 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] [2019-10-06 23:16:51,704 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:16:51,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:16:51,704 INFO L82 PathProgramCache]: Analyzing trace with hash -299816976, now seen corresponding path program 1 times [2019-10-06 23:16:51,705 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:16:51,705 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:51,705 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:51,705 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:51,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:16:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:51,798 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-06 23:16:51,798 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:51,799 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:16:51,799 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-06 23:16:51,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-06 23:16:51,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-06 23:16:51,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-06 23:16:51,800 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand 4 states. [2019-10-06 23:16:51,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:16:51,820 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2019-10-06 23:16:51,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-06 23:16:51,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-10-06 23:16:51,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:16:51,822 INFO L225 Difference]: With dead ends: 78 [2019-10-06 23:16:51,822 INFO L226 Difference]: Without dead ends: 50 [2019-10-06 23:16:51,823 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-06 23:16:51,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-06 23:16:51,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-10-06 23:16:51,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-06 23:16:51,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2019-10-06 23:16:51,831 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 63 transitions. Word has length 29 [2019-10-06 23:16:51,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:16:51,832 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 63 transitions. [2019-10-06 23:16:51,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-06 23:16:51,832 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2019-10-06 23:16:51,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-06 23:16:51,833 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:16:51,833 INFO L385 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-06 23:16:51,834 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:16:51,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:16:51,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1746170530, now seen corresponding path program 1 times [2019-10-06 23:16:51,834 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:16:51,834 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:51,835 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:51,835 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:51,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:16:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:51,955 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-06 23:16:51,955 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:51,956 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:16:51,956 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-06 23:16:51,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-06 23:16:51,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-06 23:16:51,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-06 23:16:51,957 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. Second operand 5 states. [2019-10-06 23:16:52,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:16:52,017 INFO L93 Difference]: Finished difference Result 69 states and 86 transitions. [2019-10-06 23:16:52,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-06 23:16:52,019 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-10-06 23:16:52,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:16:52,020 INFO L225 Difference]: With dead ends: 69 [2019-10-06 23:16:52,020 INFO L226 Difference]: Without dead ends: 0 [2019-10-06 23:16:52,021 INFO L606 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-06 23:16:52,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-06 23:16:52,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-06 23:16:52,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-06 23:16:52,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-06 23:16:52,023 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2019-10-06 23:16:52,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:16:52,023 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-06 23:16:52,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-06 23:16:52,024 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-06 23:16:52,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-06 23:16:52,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-06 23:16:52,156 INFO L446 ceAbstractionStarter]: At program point elem_existsENTRY(lines 9 15) the Hoare annotation is: true [2019-10-06 23:16:52,157 INFO L443 ceAbstractionStarter]: For program point elem_existsEXIT(lines 9 15) no Hoare annotation was computed. [2019-10-06 23:16:52,157 INFO L443 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2019-10-06 23:16:52,157 INFO L443 ceAbstractionStarter]: For program point elem_existsFINAL(lines 9 15) no Hoare annotation was computed. [2019-10-06 23:16:52,157 INFO L439 ceAbstractionStarter]: At program point L11-3(lines 11 13) the Hoare annotation is: (or (and (= elem_exists_~i~0 0) (= elem_exists_~size |elem_exists_#in~size|)) (not (= 0 |elem_exists_#in~size|))) [2019-10-06 23:16:52,157 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-06 23:16:52,158 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-06 23:16:52,158 INFO L446 ceAbstractionStarter]: At program point insertENTRY(lines 5 8) the Hoare annotation is: true [2019-10-06 23:16:52,158 INFO L443 ceAbstractionStarter]: For program point insertEXIT(lines 5 8) no Hoare annotation was computed. [2019-10-06 23:16:52,158 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-06 23:16:52,158 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-06 23:16:52,158 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-06 23:16:52,158 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-06 23:16:52,159 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 16 56) no Hoare annotation was computed. [2019-10-06 23:16:52,159 INFO L439 ceAbstractionStarter]: At program point L52(line 52) the Hoare annotation is: false [2019-10-06 23:16:52,159 INFO L443 ceAbstractionStarter]: For program point L52-1(line 52) no Hoare annotation was computed. [2019-10-06 23:16:52,159 INFO L439 ceAbstractionStarter]: At program point L44-3(lines 44 48) the Hoare annotation is: (and (= main_~n~0 0) (= main_~x~0 0)) [2019-10-06 23:16:52,159 INFO L439 ceAbstractionStarter]: At program point L36-3(lines 36 39) the Hoare annotation is: (and (= main_~n~0 0) (= main_~x~0 0)) [2019-10-06 23:16:52,159 INFO L439 ceAbstractionStarter]: At program point L28-3(lines 28 32) the Hoare annotation is: (and (= main_~n~0 0) (= main_~x~0 0)) [2019-10-06 23:16:52,160 INFO L439 ceAbstractionStarter]: At program point L45-3(lines 45 47) the Hoare annotation is: false [2019-10-06 23:16:52,160 INFO L439 ceAbstractionStarter]: At program point L29-3(lines 29 31) the Hoare annotation is: false [2019-10-06 23:16:52,160 INFO L439 ceAbstractionStarter]: At program point L46(line 46) the Hoare annotation is: false [2019-10-06 23:16:52,160 INFO L443 ceAbstractionStarter]: For program point L46-1(line 46) no Hoare annotation was computed. [2019-10-06 23:16:52,160 INFO L439 ceAbstractionStarter]: At program point L30(line 30) the Hoare annotation is: false [2019-10-06 23:16:52,160 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 16 56) the Hoare annotation is: true [2019-10-06 23:16:52,161 INFO L443 ceAbstractionStarter]: For program point L30-1(line 30) no Hoare annotation was computed. [2019-10-06 23:16:52,161 INFO L439 ceAbstractionStarter]: At program point L22-3(lines 22 25) the Hoare annotation is: (= main_~n~0 0) [2019-10-06 23:16:52,161 INFO L439 ceAbstractionStarter]: At program point L40-3(lines 40 49) the Hoare annotation is: (and (= main_~n~0 0) (= main_~x~0 0)) [2019-10-06 23:16:52,161 INFO L439 ceAbstractionStarter]: At program point L41(line 41) the Hoare annotation is: (and (= main_~n~0 0) (= main_~x~0 0)) [2019-10-06 23:16:52,161 INFO L443 ceAbstractionStarter]: For program point L41-1(line 41) no Hoare annotation was computed. [2019-10-06 23:16:52,161 INFO L443 ceAbstractionStarter]: For program point L41-2(lines 41 43) no Hoare annotation was computed. [2019-10-06 23:16:52,162 INFO L443 ceAbstractionStarter]: For program point L41-4(lines 41 43) no Hoare annotation was computed. [2019-10-06 23:16:52,162 INFO L439 ceAbstractionStarter]: At program point L50-3(lines 50 54) the Hoare annotation is: (and (= main_~n~0 0) (= main_~x~0 0)) [2019-10-06 23:16:52,162 INFO L439 ceAbstractionStarter]: At program point L42(line 42) the Hoare annotation is: false [2019-10-06 23:16:52,162 INFO L443 ceAbstractionStarter]: For program point L42-1(line 42) no Hoare annotation was computed. [2019-10-06 23:16:52,162 INFO L439 ceAbstractionStarter]: At program point L51-3(lines 51 53) the Hoare annotation is: false [2019-10-06 23:16:52,162 INFO L443 ceAbstractionStarter]: For program point L2-1(line 2) no Hoare annotation was computed. [2019-10-06 23:16:52,163 INFO L443 ceAbstractionStarter]: For program point L2-3(line 2) no Hoare annotation was computed. [2019-10-06 23:16:52,163 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 2) the Hoare annotation is: true [2019-10-06 23:16:52,163 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2) no Hoare annotation was computed. [2019-10-06 23:16:52,163 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 2) no Hoare annotation was computed. [2019-10-06 23:16:52,163 INFO L443 ceAbstractionStarter]: For program point L2(line 2) no Hoare annotation was computed. [2019-10-06 23:16:52,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.10 11:16:52 BoogieIcfgContainer [2019-10-06 23:16:52,183 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-06 23:16:52,189 INFO L168 Benchmark]: Toolchain (without parser) took 2324.74 ms. Allocated memory was 138.9 MB in the beginning and 234.9 MB in the end (delta: 95.9 MB). Free memory was 103.8 MB in the beginning and 164.2 MB in the end (delta: -60.4 MB). Peak memory consumption was 35.5 MB. Max. memory is 7.1 GB. [2019-10-06 23:16:52,191 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-10-06 23:16:52,194 INFO L168 Benchmark]: CACSL2BoogieTranslator took 409.56 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 103.6 MB in the beginning and 180.1 MB in the end (delta: -76.5 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. [2019-10-06 23:16:52,195 INFO L168 Benchmark]: Boogie Preprocessor took 43.37 ms. Allocated memory is still 202.4 MB. Free memory was 180.1 MB in the beginning and 178.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-10-06 23:16:52,196 INFO L168 Benchmark]: RCFGBuilder took 623.82 ms. Allocated memory is still 202.4 MB. Free memory was 178.1 MB in the beginning and 144.3 MB in the end (delta: 33.8 MB). Peak memory consumption was 33.8 MB. Max. memory is 7.1 GB. [2019-10-06 23:16:52,198 INFO L168 Benchmark]: TraceAbstraction took 1240.46 ms. Allocated memory was 202.4 MB in the beginning and 234.9 MB in the end (delta: 32.5 MB). Free memory was 144.3 MB in the beginning and 164.2 MB in the end (delta: -19.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. [2019-10-06 23:16:52,207 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.19 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 409.56 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 103.6 MB in the beginning and 180.1 MB in the end (delta: -76.5 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.37 ms. Allocated memory is still 202.4 MB. Free memory was 180.1 MB in the beginning and 178.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 623.82 ms. Allocated memory is still 202.4 MB. Free memory was 178.1 MB in the beginning and 144.3 MB in the end (delta: 33.8 MB). Peak memory consumption was 33.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1240.46 ms. Allocated memory was 202.4 MB in the beginning and 234.9 MB in the end (delta: 32.5 MB). Free memory was 144.3 MB in the beginning and 164.2 MB in the end (delta: -19.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2]: 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: 36]: Loop Invariant Derived loop invariant: n == 0 && x == 0 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: n == 0 - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: n == 0 && x == 0 - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: n == 0 && x == 0 - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: (i == 0 && size == \old(size)) || !(0 == \old(size)) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: n == 0 && x == 0 - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: n == 0 && x == 0 - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 42 locations, 1 error locations. Result: SAFE, OverallTime: 1.1s, OverallIterations: 5, TraceHistogramMax: 1, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 201 SDtfs, 59 SDslu, 240 SDs, 0 SdLazy, 85 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=4, 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, 35 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 51 PreInvPairs, 60 NumberOfFragments, 71 HoareAnnotationTreeSize, 51 FomulaSimplifications, 64 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 22 FomulaSimplificationsInter, 4 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 112 NumberOfCodeBlocks, 112 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 107 ConstructedInterpolants, 0 QuantifiedInterpolants, 4128 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 6/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...