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/eca-rers2012/Problem01_label53.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:57:03,879 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:57:03,882 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:57:03,894 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:57:03,895 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:57:03,896 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:57:03,897 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:57:03,899 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:57:03,900 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:57:03,901 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:57:03,902 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:57:03,903 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:57:03,904 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:57:03,904 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:57:03,905 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:57:03,907 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:57:03,907 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:57:03,908 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:57:03,910 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:57:03,912 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:57:03,914 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:57:03,915 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:57:03,916 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:57:03,917 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:57:03,919 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:57:03,919 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:57:03,920 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:57:03,921 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:57:03,921 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:57:03,922 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:57:03,922 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:57:03,923 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:57:03,924 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:57:03,925 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:57:03,926 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:57:03,926 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:57:03,926 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:57:03,927 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:57:03,927 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:57:03,928 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:57:03,930 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:57:03,931 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-07 00:57:03,954 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:57:03,954 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:57:03,955 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:57:03,955 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:57:03,956 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:57:03,956 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:57:03,956 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:57:03,956 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:57:03,956 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:57:03,957 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:57:03,957 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:57:03,957 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:57:03,957 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:57:03,957 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:57:03,958 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:57:03,958 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:57:03,958 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:57:03,958 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:57:03,958 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:57:03,959 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:57:03,959 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:57:03,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:57:03,959 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:57:03,959 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:57:03,960 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:57:03,960 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:57:03,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:57:03,960 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:57:03,960 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-07 00:57:04,239 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:57:04,252 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:57:04,255 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:57:04,256 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:57:04,257 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:57:04,258 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label53.c [2019-10-07 00:57:04,319 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/714faa4df/e3e7a8f023fc4c74a13064ef001d4361/FLAGe3d50f665 [2019-10-07 00:57:04,874 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:57:04,875 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label53.c [2019-10-07 00:57:04,889 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/714faa4df/e3e7a8f023fc4c74a13064ef001d4361/FLAGe3d50f665 [2019-10-07 00:57:05,186 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/714faa4df/e3e7a8f023fc4c74a13064ef001d4361 [2019-10-07 00:57:05,196 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:57:05,198 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:57:05,199 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:57:05,199 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:57:05,203 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:57:05,203 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:57:05" (1/1) ... [2019-10-07 00:57:05,206 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3304fef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:57:05, skipping insertion in model container [2019-10-07 00:57:05,207 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:57:05" (1/1) ... [2019-10-07 00:57:05,214 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:57:05,260 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:57:05,754 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:57:05,759 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:57:05,911 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:57:05,928 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:57:05,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:57:05 WrapperNode [2019-10-07 00:57:05,929 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:57:05,930 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:57:05,930 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:57:05,930 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:57:05,944 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:57:05" (1/1) ... [2019-10-07 00:57:05,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:57:05" (1/1) ... [2019-10-07 00:57:05,978 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:57:05" (1/1) ... [2019-10-07 00:57:05,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:57:05" (1/1) ... [2019-10-07 00:57:06,022 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:57:05" (1/1) ... [2019-10-07 00:57:06,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:57:05" (1/1) ... [2019-10-07 00:57:06,045 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:57:05" (1/1) ... [2019-10-07 00:57:06,057 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:57:06,061 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:57:06,061 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:57:06,061 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:57:06,062 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:57:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:57:06,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:57:06,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:57:06,145 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-07 00:57:06,146 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:57:06,146 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-07 00:57:06,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:57:06,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:57:06,148 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 00:57:06,148 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:57:06,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:57:06,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:57:08,102 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:57:08,102 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 00:57:08,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:57:08 BoogieIcfgContainer [2019-10-07 00:57:08,104 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:57:08,105 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:57:08,105 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:57:08,108 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:57:08,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:57:05" (1/3) ... [2019-10-07 00:57:08,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9cc347a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:57:08, skipping insertion in model container [2019-10-07 00:57:08,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:57:05" (2/3) ... [2019-10-07 00:57:08,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9cc347a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:57:08, skipping insertion in model container [2019-10-07 00:57:08,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:57:08" (3/3) ... [2019-10-07 00:57:08,112 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label53.c [2019-10-07 00:57:08,122 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:57:08,130 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:57:08,142 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:57:08,179 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:57:08,180 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:57:08,180 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:57:08,180 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:57:08,180 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:57:08,181 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:57:08,181 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:57:08,181 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:57:08,199 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2019-10-07 00:57:08,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-07 00:57:08,208 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:57:08,209 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:57:08,211 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:57:08,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:57:08,217 INFO L82 PathProgramCache]: Analyzing trace with hash 826821988, now seen corresponding path program 1 times [2019-10-07 00:57:08,226 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:57:08,227 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:08,227 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:08,227 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:08,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:57:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:57:08,630 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-07 00:57:08,630 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:08,631 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:57:08,632 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:57:08,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:57:08,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:57:08,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:57:08,653 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 3 states. [2019-10-07 00:57:09,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:57:09,167 INFO L93 Difference]: Finished difference Result 246 states and 454 transitions. [2019-10-07 00:57:09,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:57:09,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-10-07 00:57:09,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:57:09,183 INFO L225 Difference]: With dead ends: 246 [2019-10-07 00:57:09,184 INFO L226 Difference]: Without dead ends: 157 [2019-10-07 00:57:09,188 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-07 00:57:09,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-10-07 00:57:09,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-10-07 00:57:09,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-07 00:57:09,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 279 transitions. [2019-10-07 00:57:09,254 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 279 transitions. Word has length 77 [2019-10-07 00:57:09,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:57:09,255 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 279 transitions. [2019-10-07 00:57:09,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:57:09,255 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 279 transitions. [2019-10-07 00:57:09,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-07 00:57:09,260 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:57:09,260 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:57:09,260 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:57:09,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:57:09,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1195664645, now seen corresponding path program 1 times [2019-10-07 00:57:09,261 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:57:09,261 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:09,262 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:09,262 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:09,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:57:09,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:57:09,392 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:57:09,392 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:09,393 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:57:09,393 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 00:57:09,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 00:57:09,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 00:57:09,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 00:57:09,396 INFO L87 Difference]: Start difference. First operand 157 states and 279 transitions. Second operand 6 states. [2019-10-07 00:57:10,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:57:10,019 INFO L93 Difference]: Finished difference Result 402 states and 725 transitions. [2019-10-07 00:57:10,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 00:57:10,020 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-10-07 00:57:10,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:57:10,025 INFO L225 Difference]: With dead ends: 402 [2019-10-07 00:57:10,025 INFO L226 Difference]: Without dead ends: 250 [2019-10-07 00:57:10,027 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-07 00:57:10,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-10-07 00:57:10,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 238. [2019-10-07 00:57:10,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-10-07 00:57:10,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 407 transitions. [2019-10-07 00:57:10,058 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 407 transitions. Word has length 87 [2019-10-07 00:57:10,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:57:10,059 INFO L462 AbstractCegarLoop]: Abstraction has 238 states and 407 transitions. [2019-10-07 00:57:10,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 00:57:10,059 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 407 transitions. [2019-10-07 00:57:10,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-07 00:57:10,062 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:57:10,063 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:57:10,063 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:57:10,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:57:10,063 INFO L82 PathProgramCache]: Analyzing trace with hash -2128686249, now seen corresponding path program 1 times [2019-10-07 00:57:10,064 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:57:10,064 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:10,064 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:10,064 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:10,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:57:10,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:57:10,182 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:57:10,182 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:10,183 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:57:10,183 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 00:57:10,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 00:57:10,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 00:57:10,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 00:57:10,186 INFO L87 Difference]: Start difference. First operand 238 states and 407 transitions. Second operand 4 states. [2019-10-07 00:57:10,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:57:10,933 INFO L93 Difference]: Finished difference Result 852 states and 1533 transitions. [2019-10-07 00:57:10,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 00:57:10,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-10-07 00:57:10,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:57:10,943 INFO L225 Difference]: With dead ends: 852 [2019-10-07 00:57:10,943 INFO L226 Difference]: Without dead ends: 619 [2019-10-07 00:57:10,946 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 00:57:10,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-10-07 00:57:10,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 544. [2019-10-07 00:57:11,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-10-07 00:57:11,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 888 transitions. [2019-10-07 00:57:11,004 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 888 transitions. Word has length 88 [2019-10-07 00:57:11,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:57:11,004 INFO L462 AbstractCegarLoop]: Abstraction has 544 states and 888 transitions. [2019-10-07 00:57:11,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 00:57:11,005 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 888 transitions. [2019-10-07 00:57:11,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-07 00:57:11,012 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:57:11,013 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:57:11,013 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:57:11,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:57:11,013 INFO L82 PathProgramCache]: Analyzing trace with hash 579796939, now seen corresponding path program 1 times [2019-10-07 00:57:11,014 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:57:11,014 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:11,014 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:11,014 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:11,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:57:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:57:11,112 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:57:11,112 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:11,113 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:57:11,113 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:57:11,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:57:11,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:57:11,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:57:11,115 INFO L87 Difference]: Start difference. First operand 544 states and 888 transitions. Second operand 3 states. [2019-10-07 00:57:11,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:57:11,614 INFO L93 Difference]: Finished difference Result 1543 states and 2645 transitions. [2019-10-07 00:57:11,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:57:11,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-10-07 00:57:11,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:57:11,629 INFO L225 Difference]: With dead ends: 1543 [2019-10-07 00:57:11,629 INFO L226 Difference]: Without dead ends: 1004 [2019-10-07 00:57:11,632 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-07 00:57:11,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2019-10-07 00:57:11,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 1004. [2019-10-07 00:57:11,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1004 states. [2019-10-07 00:57:11,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1637 transitions. [2019-10-07 00:57:11,738 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1637 transitions. Word has length 94 [2019-10-07 00:57:11,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:57:11,739 INFO L462 AbstractCegarLoop]: Abstraction has 1004 states and 1637 transitions. [2019-10-07 00:57:11,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:57:11,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1637 transitions. [2019-10-07 00:57:11,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-07 00:57:11,759 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:57:11,760 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:57:11,760 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:57:11,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:57:11,761 INFO L82 PathProgramCache]: Analyzing trace with hash 95153079, now seen corresponding path program 1 times [2019-10-07 00:57:11,761 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:57:11,763 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:11,763 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:11,763 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:11,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:57:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:57:11,903 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:57:11,904 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:11,904 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:57:11,904 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 00:57:11,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 00:57:11,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 00:57:11,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 00:57:11,906 INFO L87 Difference]: Start difference. First operand 1004 states and 1637 transitions. Second operand 6 states. [2019-10-07 00:57:12,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:57:12,498 INFO L93 Difference]: Finished difference Result 2444 states and 4170 transitions. [2019-10-07 00:57:12,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 00:57:12,499 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2019-10-07 00:57:12,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:57:12,510 INFO L225 Difference]: With dead ends: 2444 [2019-10-07 00:57:12,510 INFO L226 Difference]: Without dead ends: 1445 [2019-10-07 00:57:12,514 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-07 00:57:12,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-10-07 00:57:12,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1113. [2019-10-07 00:57:12,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1113 states. [2019-10-07 00:57:12,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1613 transitions. [2019-10-07 00:57:12,566 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1613 transitions. Word has length 121 [2019-10-07 00:57:12,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:57:12,566 INFO L462 AbstractCegarLoop]: Abstraction has 1113 states and 1613 transitions. [2019-10-07 00:57:12,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 00:57:12,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1613 transitions. [2019-10-07 00:57:12,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-07 00:57:12,571 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:57:12,571 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:57:12,572 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:57:12,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:57:12,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1205366486, now seen corresponding path program 1 times [2019-10-07 00:57:12,572 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:57:12,573 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:12,573 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:12,573 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:12,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:57:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:57:12,725 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 58 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:57:12,726 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:12,726 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:57:12,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:57:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:57:12,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-07 00:57:12,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:57:12,906 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 58 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:57:12,906 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:57:13,021 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 58 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:57:13,022 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:57:13,083 INFO L162 IcfgInterpreter]: Started Sifa with 81 locations of interest [2019-10-07 00:57:13,083 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:57:13,092 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:57:13,106 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:57:13,107 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:57:13,442 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 98 for LOIs [2019-10-07 00:57:13,949 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:57:13,950 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: assume true; at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: assume true; at de.uni_freiburg.informatik.ultimate.lib.sifa.PriorityWorklist.add(PriorityWorklist.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.lambda$2(DagInterpreter.java:135) at java.lang.Iterable.forEach(Iterable.java:75) at java.util.Collections$UnmodifiableCollection.forEach(Collections.java:1080) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:135) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.computeTopSummary(TopInputCallSummarizer.java:78) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:67) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:230) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:214) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:197) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:166) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarizeInternal(FixpointLoopSummarizer.java:118) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:178) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:169) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:287) ... 21 more [2019-10-07 00:57:13,963 INFO L168 Benchmark]: Toolchain (without parser) took 8760.16 ms. Allocated memory was 145.2 MB in the beginning and 328.2 MB in the end (delta: 183.0 MB). Free memory was 101.6 MB in the beginning and 242.4 MB in the end (delta: -140.8 MB). Peak memory consumption was 42.2 MB. Max. memory is 7.1 GB. [2019-10-07 00:57:13,966 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 00:57:13,969 INFO L168 Benchmark]: CACSL2BoogieTranslator took 730.12 ms. Allocated memory was 145.2 MB in the beginning and 204.5 MB in the end (delta: 59.2 MB). Free memory was 101.4 MB in the beginning and 170.0 MB in the end (delta: -68.6 MB). Peak memory consumption was 32.0 MB. Max. memory is 7.1 GB. [2019-10-07 00:57:13,970 INFO L168 Benchmark]: Boogie Preprocessor took 130.66 ms. Allocated memory is still 204.5 MB. Free memory was 170.0 MB in the beginning and 165.1 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. [2019-10-07 00:57:13,973 INFO L168 Benchmark]: RCFGBuilder took 2043.17 ms. Allocated memory was 204.5 MB in the beginning and 251.1 MB in the end (delta: 46.7 MB). Free memory was 165.1 MB in the beginning and 215.7 MB in the end (delta: -50.6 MB). Peak memory consumption was 117.8 MB. Max. memory is 7.1 GB. [2019-10-07 00:57:13,976 INFO L168 Benchmark]: TraceAbstraction took 5851.62 ms. Allocated memory was 251.1 MB in the beginning and 328.2 MB in the end (delta: 77.1 MB). Free memory was 215.7 MB in the beginning and 242.4 MB in the end (delta: -26.7 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. [2019-10-07 00:57:13,983 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.23 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 730.12 ms. Allocated memory was 145.2 MB in the beginning and 204.5 MB in the end (delta: 59.2 MB). Free memory was 101.4 MB in the beginning and 170.0 MB in the end (delta: -68.6 MB). Peak memory consumption was 32.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 130.66 ms. Allocated memory is still 204.5 MB. Free memory was 170.0 MB in the beginning and 165.1 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2043.17 ms. Allocated memory was 204.5 MB in the beginning and 251.1 MB in the end (delta: 46.7 MB). Free memory was 165.1 MB in the beginning and 215.7 MB in the end (delta: -50.6 MB). Peak memory consumption was 117.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5851.62 ms. Allocated memory was 251.1 MB in the beginning and 328.2 MB in the end (delta: 77.1 MB). Free memory was 215.7 MB in the beginning and 242.4 MB in the end (delta: -26.7 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: assume true; de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: assume true;: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...