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-f4eb214f-m [2019-10-13 21:32:32,839 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:32:32,841 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:32:32,858 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:32:32,859 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:32:32,861 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:32:32,863 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:32:32,872 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:32:32,874 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:32:32,875 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:32:32,877 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:32:32,878 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:32:32,879 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:32:32,881 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:32:32,884 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:32:32,885 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:32:32,887 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:32:32,889 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:32:32,891 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:32:32,896 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:32:32,898 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:32:32,899 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:32:32,900 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:32:32,901 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:32:32,902 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:32:32,903 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:32:32,903 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:32:32,904 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:32:32,904 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:32:32,905 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:32:32,905 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:32:32,906 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:32:32,906 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:32:32,907 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:32:32,908 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:32:32,908 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:32:32,909 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:32:32,909 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:32:32,909 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:32:32,910 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:32:32,911 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:32:32,912 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-13 21:32:32,925 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:32:32,926 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:32:32,927 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:32:32,927 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:32:32,927 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:32:32,927 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:32:32,928 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:32:32,928 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:32:32,928 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:32:32,928 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:32:32,928 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:32:32,929 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:32:32,929 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:32:32,929 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:32:32,929 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:32:32,929 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:32:32,930 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:32:32,930 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:32:32,930 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:32:32,930 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:32:32,930 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:32:32,931 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:32:32,931 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:32:32,931 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:32:32,931 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:32:32,931 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:32:32,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:32:32,932 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:32:32,932 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-13 21:32:33,226 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:32:33,245 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:32:33,250 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:32:33,252 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:32:33,252 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:32:33,253 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-13 21:32:33,339 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58923fe3e/1a66bf3a6d6d4e6a9615450ae07749ee/FLAGd388db858 [2019-10-13 21:32:33,795 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:32:33,796 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_trivial_ground.i [2019-10-13 21:32:33,806 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58923fe3e/1a66bf3a6d6d4e6a9615450ae07749ee/FLAGd388db858 [2019-10-13 21:32:34,154 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58923fe3e/1a66bf3a6d6d4e6a9615450ae07749ee [2019-10-13 21:32:34,165 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:32:34,166 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:32:34,169 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:32:34,169 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:32:34,173 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:32:34,174 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:32:34" (1/1) ... [2019-10-13 21:32:34,176 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20f9cada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:34, skipping insertion in model container [2019-10-13 21:32:34,177 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:32:34" (1/1) ... [2019-10-13 21:32:34,185 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:32:34,205 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:32:34,395 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:32:34,404 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:32:34,428 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:32:34,519 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:32:34,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:34 WrapperNode [2019-10-13 21:32:34,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:32:34,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:32:34,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:32:34,520 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:32:34,531 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:34" (1/1) ... [2019-10-13 21:32:34,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:34" (1/1) ... [2019-10-13 21:32:34,540 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:34" (1/1) ... [2019-10-13 21:32:34,540 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:34" (1/1) ... [2019-10-13 21:32:34,551 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:34" (1/1) ... [2019-10-13 21:32:34,560 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:34" (1/1) ... [2019-10-13 21:32:34,562 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:34" (1/1) ... [2019-10-13 21:32:34,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:32:34,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:32:34,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:32:34,566 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:32:34,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:34" (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-13 21:32:34,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:32:34,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:32:34,621 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:32:34,622 INFO L138 BoogieDeclarations]: Found implementation of procedure insert [2019-10-13 21:32:34,622 INFO L138 BoogieDeclarations]: Found implementation of procedure elem_exists [2019-10-13 21:32:34,622 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:32:34,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:32:34,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:32:34,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:32:34,623 INFO L130 BoogieDeclarations]: Found specification of procedure insert [2019-10-13 21:32:34,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:32:34,623 INFO L130 BoogieDeclarations]: Found specification of procedure elem_exists [2019-10-13 21:32:34,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:32:34,623 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:32:34,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:32:34,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:32:34,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:32:34,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:32:35,188 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:32:35,188 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-13 21:32:35,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:32:35 BoogieIcfgContainer [2019-10-13 21:32:35,191 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:32:35,192 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:32:35,193 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:32:35,196 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:32:35,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:32:34" (1/3) ... [2019-10-13 21:32:35,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d8a4b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:32:35, skipping insertion in model container [2019-10-13 21:32:35,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:34" (2/3) ... [2019-10-13 21:32:35,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d8a4b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:32:35, skipping insertion in model container [2019-10-13 21:32:35,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:32:35" (3/3) ... [2019-10-13 21:32:35,204 INFO L109 eAbstractionObserver]: Analyzing ICFG data_structures_set_multi_proc_trivial_ground.i [2019-10-13 21:32:35,215 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:32:35,223 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:32:35,237 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:32:35,268 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:32:35,269 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:32:35,269 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:32:35,269 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:32:35,269 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:32:35,269 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:32:35,269 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:32:35,270 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:32:35,287 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-10-13 21:32:35,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-13 21:32:35,294 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:35,295 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:35,297 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:35,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:35,303 INFO L82 PathProgramCache]: Analyzing trace with hash 652244700, now seen corresponding path program 1 times [2019-10-13 21:32:35,313 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:35,314 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321654572] [2019-10-13 21:32:35,314 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:35,314 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:35,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:35,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:35,478 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-13 21:32:35,479 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321654572] [2019-10-13 21:32:35,480 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:32:35,482 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:32:35,482 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524064951] [2019-10-13 21:32:35,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:32:35,488 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:35,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:32:35,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:32:35,509 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2019-10-13 21:32:35,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:35,654 INFO L93 Difference]: Finished difference Result 100 states and 148 transitions. [2019-10-13 21:32:35,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:32:35,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-13 21:32:35,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:35,672 INFO L225 Difference]: With dead ends: 100 [2019-10-13 21:32:35,672 INFO L226 Difference]: Without dead ends: 60 [2019-10-13 21:32:35,684 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-13 21:32:35,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-13 21:32:35,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 40. [2019-10-13 21:32:35,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-13 21:32:35,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2019-10-13 21:32:35,752 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 53 transitions. Word has length 12 [2019-10-13 21:32:35,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:35,754 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 53 transitions. [2019-10-13 21:32:35,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:32:35,754 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2019-10-13 21:32:35,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 21:32:35,756 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:35,757 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:35,757 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:35,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:35,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1778757127, now seen corresponding path program 1 times [2019-10-13 21:32:35,759 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:35,759 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401728217] [2019-10-13 21:32:35,759 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:35,760 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:35,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:35,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:35,888 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-13 21:32:35,889 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401728217] [2019-10-13 21:32:35,889 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:32:35,889 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:32:35,890 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424949960] [2019-10-13 21:32:35,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:32:35,892 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:35,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:32:35,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:32:35,893 INFO L87 Difference]: Start difference. First operand 40 states and 53 transitions. Second operand 5 states. [2019-10-13 21:32:35,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:35,963 INFO L93 Difference]: Finished difference Result 79 states and 107 transitions. [2019-10-13 21:32:35,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:32:35,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-10-13 21:32:35,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:35,965 INFO L225 Difference]: With dead ends: 79 [2019-10-13 21:32:35,965 INFO L226 Difference]: Without dead ends: 45 [2019-10-13 21:32:35,967 INFO L600 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-13 21:32:35,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-13 21:32:35,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-10-13 21:32:35,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-13 21:32:35,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2019-10-13 21:32:35,978 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 13 [2019-10-13 21:32:35,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:35,979 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2019-10-13 21:32:35,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:32:35,980 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2019-10-13 21:32:35,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 21:32:35,982 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:35,983 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] [2019-10-13 21:32:35,984 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:35,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:35,984 INFO L82 PathProgramCache]: Analyzing trace with hash -569386671, now seen corresponding path program 1 times [2019-10-13 21:32:35,985 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:35,985 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969674133] [2019-10-13 21:32:35,985 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:35,986 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:35,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:36,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:36,074 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-13 21:32:36,075 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969674133] [2019-10-13 21:32:36,075 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:32:36,075 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:32:36,076 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452417735] [2019-10-13 21:32:36,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:32:36,079 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:36,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:32:36,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:32:36,080 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand 3 states. [2019-10-13 21:32:36,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:36,118 INFO L93 Difference]: Finished difference Result 91 states and 120 transitions. [2019-10-13 21:32:36,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:32:36,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-13 21:32:36,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:36,123 INFO L225 Difference]: With dead ends: 91 [2019-10-13 21:32:36,123 INFO L226 Difference]: Without dead ends: 57 [2019-10-13 21:32:36,126 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-13 21:32:36,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-13 21:32:36,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 44. [2019-10-13 21:32:36,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-13 21:32:36,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2019-10-13 21:32:36,143 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 28 [2019-10-13 21:32:36,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:36,145 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2019-10-13 21:32:36,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:32:36,145 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2019-10-13 21:32:36,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 21:32:36,146 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:36,146 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] [2019-10-13 21:32:36,147 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:36,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:36,148 INFO L82 PathProgramCache]: Analyzing trace with hash -299816976, now seen corresponding path program 1 times [2019-10-13 21:32:36,148 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:36,149 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126817752] [2019-10-13 21:32:36,149 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:36,149 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:36,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:36,242 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-13 21:32:36,242 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126817752] [2019-10-13 21:32:36,243 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:32:36,243 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:32:36,243 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876972874] [2019-10-13 21:32:36,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:32:36,244 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:36,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:32:36,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:32:36,245 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand 4 states. [2019-10-13 21:32:36,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:36,282 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2019-10-13 21:32:36,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:32:36,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-10-13 21:32:36,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:36,284 INFO L225 Difference]: With dead ends: 78 [2019-10-13 21:32:36,284 INFO L226 Difference]: Without dead ends: 50 [2019-10-13 21:32:36,285 INFO L600 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-13 21:32:36,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-13 21:32:36,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-10-13 21:32:36,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-13 21:32:36,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2019-10-13 21:32:36,301 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 63 transitions. Word has length 29 [2019-10-13 21:32:36,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:36,302 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 63 transitions. [2019-10-13 21:32:36,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:32:36,302 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2019-10-13 21:32:36,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 21:32:36,306 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:36,306 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-13 21:32:36,307 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:36,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:36,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1746170530, now seen corresponding path program 1 times [2019-10-13 21:32:36,307 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:36,307 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295970410] [2019-10-13 21:32:36,308 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:36,308 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:36,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:36,433 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-13 21:32:36,433 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295970410] [2019-10-13 21:32:36,433 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:32:36,434 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:32:36,434 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13676951] [2019-10-13 21:32:36,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:32:36,435 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:36,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:32:36,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:32:36,435 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. Second operand 5 states. [2019-10-13 21:32:36,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:36,506 INFO L93 Difference]: Finished difference Result 69 states and 86 transitions. [2019-10-13 21:32:36,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:32:36,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-10-13 21:32:36,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:36,508 INFO L225 Difference]: With dead ends: 69 [2019-10-13 21:32:36,508 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 21:32:36,510 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-13 21:32:36,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 21:32:36,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 21:32:36,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 21:32:36,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 21:32:36,511 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2019-10-13 21:32:36,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:36,511 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 21:32:36,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:32:36,514 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 21:32:36,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 21:32:36,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 21:32:36,637 INFO L446 ceAbstractionStarter]: At program point elem_existsENTRY(lines 9 15) the Hoare annotation is: true [2019-10-13 21:32:36,638 INFO L443 ceAbstractionStarter]: For program point elem_existsEXIT(lines 9 15) no Hoare annotation was computed. [2019-10-13 21:32:36,638 INFO L443 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2019-10-13 21:32:36,638 INFO L443 ceAbstractionStarter]: For program point elem_existsFINAL(lines 9 15) no Hoare annotation was computed. [2019-10-13 21:32:36,638 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-13 21:32:36,639 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-13 21:32:36,639 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:32:36,639 INFO L446 ceAbstractionStarter]: At program point insertENTRY(lines 5 8) the Hoare annotation is: true [2019-10-13 21:32:36,639 INFO L443 ceAbstractionStarter]: For program point insertEXIT(lines 5 8) no Hoare annotation was computed. [2019-10-13 21:32:36,639 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:32:36,639 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 21:32:36,639 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 21:32:36,640 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 21:32:36,640 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 16 56) no Hoare annotation was computed. [2019-10-13 21:32:36,640 INFO L439 ceAbstractionStarter]: At program point L52(line 52) the Hoare annotation is: false [2019-10-13 21:32:36,640 INFO L443 ceAbstractionStarter]: For program point L52-1(line 52) no Hoare annotation was computed. [2019-10-13 21:32:36,640 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-13 21:32:36,640 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-13 21:32:36,641 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-13 21:32:36,641 INFO L439 ceAbstractionStarter]: At program point L45-3(lines 45 47) the Hoare annotation is: false [2019-10-13 21:32:36,641 INFO L439 ceAbstractionStarter]: At program point L29-3(lines 29 31) the Hoare annotation is: false [2019-10-13 21:32:36,641 INFO L439 ceAbstractionStarter]: At program point L46(line 46) the Hoare annotation is: false [2019-10-13 21:32:36,641 INFO L443 ceAbstractionStarter]: For program point L46-1(line 46) no Hoare annotation was computed. [2019-10-13 21:32:36,641 INFO L439 ceAbstractionStarter]: At program point L30(line 30) the Hoare annotation is: false [2019-10-13 21:32:36,642 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 16 56) the Hoare annotation is: true [2019-10-13 21:32:36,642 INFO L443 ceAbstractionStarter]: For program point L30-1(line 30) no Hoare annotation was computed. [2019-10-13 21:32:36,642 INFO L439 ceAbstractionStarter]: At program point L22-3(lines 22 25) the Hoare annotation is: (= main_~n~0 0) [2019-10-13 21:32:36,642 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-13 21:32:36,642 INFO L439 ceAbstractionStarter]: At program point L41(line 41) the Hoare annotation is: (and (= main_~n~0 0) (= main_~x~0 0)) [2019-10-13 21:32:36,642 INFO L443 ceAbstractionStarter]: For program point L41-1(line 41) no Hoare annotation was computed. [2019-10-13 21:32:36,643 INFO L443 ceAbstractionStarter]: For program point L41-2(lines 41 43) no Hoare annotation was computed. [2019-10-13 21:32:36,643 INFO L443 ceAbstractionStarter]: For program point L41-4(lines 41 43) no Hoare annotation was computed. [2019-10-13 21:32:36,643 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-13 21:32:36,643 INFO L439 ceAbstractionStarter]: At program point L42(line 42) the Hoare annotation is: false [2019-10-13 21:32:36,643 INFO L443 ceAbstractionStarter]: For program point L42-1(line 42) no Hoare annotation was computed. [2019-10-13 21:32:36,643 INFO L439 ceAbstractionStarter]: At program point L51-3(lines 51 53) the Hoare annotation is: false [2019-10-13 21:32:36,644 INFO L443 ceAbstractionStarter]: For program point L2-1(line 2) no Hoare annotation was computed. [2019-10-13 21:32:36,644 INFO L443 ceAbstractionStarter]: For program point L2-3(line 2) no Hoare annotation was computed. [2019-10-13 21:32:36,644 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 2) the Hoare annotation is: true [2019-10-13 21:32:36,644 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2) no Hoare annotation was computed. [2019-10-13 21:32:36,644 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 2) no Hoare annotation was computed. [2019-10-13 21:32:36,644 INFO L443 ceAbstractionStarter]: For program point L2(line 2) no Hoare annotation was computed. [2019-10-13 21:32:36,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:32:36 BoogieIcfgContainer [2019-10-13 21:32:36,662 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 21:32:36,665 INFO L168 Benchmark]: Toolchain (without parser) took 2497.59 ms. Allocated memory was 135.3 MB in the beginning and 226.5 MB in the end (delta: 91.2 MB). Free memory was 98.6 MB in the beginning and 166.2 MB in the end (delta: -67.5 MB). Peak memory consumption was 23.7 MB. Max. memory is 7.1 GB. [2019-10-13 21:32:36,666 INFO L168 Benchmark]: CDTParser took 1.36 ms. Allocated memory is still 135.3 MB. Free memory is still 116.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-13 21:32:36,667 INFO L168 Benchmark]: CACSL2BoogieTranslator took 350.77 ms. Allocated memory was 135.3 MB in the beginning and 199.2 MB in the end (delta: 64.0 MB). Free memory was 98.6 MB in the beginning and 178.0 MB in the end (delta: -79.4 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2019-10-13 21:32:36,668 INFO L168 Benchmark]: Boogie Preprocessor took 45.39 ms. Allocated memory is still 199.2 MB. Free memory was 178.0 MB in the beginning and 175.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-10-13 21:32:36,669 INFO L168 Benchmark]: RCFGBuilder took 625.46 ms. Allocated memory is still 199.2 MB. Free memory was 175.5 MB in the beginning and 142.5 MB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 7.1 GB. [2019-10-13 21:32:36,670 INFO L168 Benchmark]: TraceAbstraction took 1469.73 ms. Allocated memory was 199.2 MB in the beginning and 226.5 MB in the end (delta: 27.3 MB). Free memory was 141.5 MB in the beginning and 166.2 MB in the end (delta: -24.7 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-10-13 21:32:36,674 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.36 ms. Allocated memory is still 135.3 MB. Free memory is still 116.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 350.77 ms. Allocated memory was 135.3 MB in the beginning and 199.2 MB in the end (delta: 64.0 MB). Free memory was 98.6 MB in the beginning and 178.0 MB in the end (delta: -79.4 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.39 ms. Allocated memory is still 199.2 MB. Free memory was 178.0 MB in the beginning and 175.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 625.46 ms. Allocated memory is still 199.2 MB. Free memory was 175.5 MB in the beginning and 142.5 MB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1469.73 ms. Allocated memory was 199.2 MB in the beginning and 226.5 MB in the end (delta: 27.3 MB). Free memory was 141.5 MB in the beginning and 166.2 MB in the end (delta: -24.7 MB). Peak memory consumption was 2.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.3s, OverallIterations: 5, TraceHistogramMax: 1, AutomataDifference: 0.4s, 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.2s 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...