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_label38.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:40:32,104 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:40:32,106 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:40:32,126 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:40:32,127 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:40:32,129 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:40:32,131 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:40:32,140 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:40:32,145 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:40:32,148 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:40:32,149 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:40:32,150 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:40:32,151 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:40:32,152 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:40:32,155 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:40:32,156 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:40:32,158 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:40:32,159 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:40:32,160 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:40:32,165 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:40:32,169 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:40:32,172 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:40:32,174 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:40:32,175 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:40:32,177 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:40:32,177 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:40:32,177 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:40:32,179 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:40:32,180 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:40:32,182 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:40:32,182 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:40:32,183 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:40:32,184 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:40:32,185 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:40:32,186 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:40:32,186 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:40:32,187 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:40:32,187 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:40:32,188 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:40:32,189 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:40:32,190 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:40:32,191 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:40:32,224 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:40:32,224 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:40:32,225 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:40:32,226 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:40:32,226 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:40:32,231 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:40:32,231 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:40:32,231 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:40:32,232 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:40:32,232 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:40:32,232 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:40:32,232 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:40:32,233 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:40:32,233 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:40:32,234 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:40:32,234 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:40:32,234 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:40:32,234 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:40:32,234 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:40:32,235 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:40:32,235 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:40:32,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:40:32,236 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:40:32,236 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:40:32,236 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:40:32,236 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:40:32,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:40:32,237 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:40:32,237 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:40:32,522 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:40:32,536 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:40:32,540 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:40:32,541 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:40:32,542 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:40:32,543 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label38.c [2019-10-13 21:40:32,606 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/516767cc2/d0ecb05a74c2479facf13bfe0ea0f2ae/FLAG822283e47 [2019-10-13 21:40:33,198 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:40:33,201 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label38.c [2019-10-13 21:40:33,217 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/516767cc2/d0ecb05a74c2479facf13bfe0ea0f2ae/FLAG822283e47 [2019-10-13 21:40:33,456 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/516767cc2/d0ecb05a74c2479facf13bfe0ea0f2ae [2019-10-13 21:40:33,467 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:40:33,469 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:40:33,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:40:33,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:40:33,476 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:40:33,477 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:40:33" (1/1) ... [2019-10-13 21:40:33,480 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e7f8ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:33, skipping insertion in model container [2019-10-13 21:40:33,480 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:40:33" (1/1) ... [2019-10-13 21:40:33,489 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:40:33,557 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:40:34,102 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:40:34,116 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:40:34,245 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:40:34,273 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:40:34,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:34 WrapperNode [2019-10-13 21:40:34,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:40:34,274 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:40:34,274 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:40:34,274 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:40:34,286 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:34" (1/1) ... [2019-10-13 21:40:34,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:34" (1/1) ... [2019-10-13 21:40:34,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:34" (1/1) ... [2019-10-13 21:40:34,316 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:34" (1/1) ... [2019-10-13 21:40:34,361 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:34" (1/1) ... [2019-10-13 21:40:34,378 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:34" (1/1) ... [2019-10-13 21:40:34,395 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:34" (1/1) ... [2019-10-13 21:40:34,409 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:40:34,410 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:40:34,410 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:40:34,410 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:40:34,415 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40: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:40:34,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:40:34,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:40:34,492 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-13 21:40:34,492 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:40:34,493 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-13 21:40:34,493 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:40:34,493 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:40:34,493 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:40:34,494 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:40:34,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:40:34,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:40:36,465 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:40:36,465 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 21:40:36,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:40:36 BoogieIcfgContainer [2019-10-13 21:40:36,469 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:40:36,471 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:40:36,471 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:40:36,476 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:40:36,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:40:33" (1/3) ... [2019-10-13 21:40:36,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e134bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:40:36, skipping insertion in model container [2019-10-13 21:40:36,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:40:34" (2/3) ... [2019-10-13 21:40:36,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e134bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:40:36, skipping insertion in model container [2019-10-13 21:40:36,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:40:36" (3/3) ... [2019-10-13 21:40:36,487 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label38.c [2019-10-13 21:40:36,502 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:40:36,515 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:40:36,527 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:40:36,560 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:40:36,561 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:40:36,561 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:40:36,561 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:40:36,561 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:40:36,561 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:40:36,562 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:40:36,562 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:40:36,594 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2019-10-13 21:40:36,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-13 21:40:36,605 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:40:36,607 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:36,609 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:40:36,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:40:36,615 INFO L82 PathProgramCache]: Analyzing trace with hash 826810913, now seen corresponding path program 1 times [2019-10-13 21:40:36,622 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:40:36,623 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742301116] [2019-10-13 21:40:36,623 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:36,623 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:36,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:40:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:37,089 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:40:37,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742301116] [2019-10-13 21:40:37,091 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:40:37,092 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:40:37,092 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98284737] [2019-10-13 21:40:37,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:40:37,098 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:40:37,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:40:37,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:40:37,121 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 3 states. [2019-10-13 21:40:37,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:40:37,673 INFO L93 Difference]: Finished difference Result 246 states and 454 transitions. [2019-10-13 21:40:37,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:40:37,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-10-13 21:40:37,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:40:37,704 INFO L225 Difference]: With dead ends: 246 [2019-10-13 21:40:37,704 INFO L226 Difference]: Without dead ends: 157 [2019-10-13 21:40:37,711 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 3 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:40:37,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-10-13 21:40:37,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-10-13 21:40:37,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-13 21:40:37,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 273 transitions. [2019-10-13 21:40:37,827 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 273 transitions. Word has length 77 [2019-10-13 21:40:37,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:40:37,829 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 273 transitions. [2019-10-13 21:40:37,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:40:37,831 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 273 transitions. [2019-10-13 21:40:37,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-13 21:40:37,839 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:40:37,840 INFO L380 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-13 21:40:37,840 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:40:37,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:40:37,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1195675720, now seen corresponding path program 1 times [2019-10-13 21:40:37,842 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:40:37,842 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245828404] [2019-10-13 21:40:37,843 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:37,843 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:37,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:40:37,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:38,022 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-13 21:40:38,023 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245828404] [2019-10-13 21:40:38,023 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:40:38,023 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:40:38,023 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140809775] [2019-10-13 21:40:38,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:40:38,025 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:40:38,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:40:38,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:40:38,026 INFO L87 Difference]: Start difference. First operand 157 states and 273 transitions. Second operand 6 states. [2019-10-13 21:40:38,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:40:38,664 INFO L93 Difference]: Finished difference Result 479 states and 861 transitions. [2019-10-13 21:40:38,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:40:38,665 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-10-13 21:40:38,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:40:38,670 INFO L225 Difference]: With dead ends: 479 [2019-10-13 21:40:38,670 INFO L226 Difference]: Without dead ends: 327 [2019-10-13 21:40:38,673 INFO L600 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-13 21:40:38,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-10-13 21:40:38,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 315. [2019-10-13 21:40:38,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-10-13 21:40:38,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 544 transitions. [2019-10-13 21:40:38,715 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 544 transitions. Word has length 87 [2019-10-13 21:40:38,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:40:38,716 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 544 transitions. [2019-10-13 21:40:38,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:40:38,716 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 544 transitions. [2019-10-13 21:40:38,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-13 21:40:38,720 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:40:38,721 INFO L380 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-13 21:40:38,721 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:40:38,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:40:38,721 INFO L82 PathProgramCache]: Analyzing trace with hash -2128697324, now seen corresponding path program 1 times [2019-10-13 21:40:38,722 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:40:38,722 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876924496] [2019-10-13 21:40:38,722 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:38,722 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:38,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:40:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:38,843 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-13 21:40:38,844 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876924496] [2019-10-13 21:40:38,845 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:40:38,845 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:40:38,845 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417802159] [2019-10-13 21:40:38,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:40:38,846 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:40:38,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:40:38,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:40:38,851 INFO L87 Difference]: Start difference. First operand 315 states and 544 transitions. Second operand 3 states. [2019-10-13 21:40:39,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:40:39,263 INFO L93 Difference]: Finished difference Result 852 states and 1516 transitions. [2019-10-13 21:40:39,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:40:39,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-10-13 21:40:39,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:40:39,271 INFO L225 Difference]: With dead ends: 852 [2019-10-13 21:40:39,271 INFO L226 Difference]: Without dead ends: 542 [2019-10-13 21:40:39,273 INFO L600 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-13 21:40:39,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-10-13 21:40:39,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 542. [2019-10-13 21:40:39,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-10-13 21:40:39,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 850 transitions. [2019-10-13 21:40:39,322 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 850 transitions. Word has length 88 [2019-10-13 21:40:39,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:40:39,323 INFO L462 AbstractCegarLoop]: Abstraction has 542 states and 850 transitions. [2019-10-13 21:40:39,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:40:39,323 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 850 transitions. [2019-10-13 21:40:39,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-13 21:40:39,327 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:40:39,328 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2019-10-13 21:40:39,328 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:40:39,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:40:39,329 INFO L82 PathProgramCache]: Analyzing trace with hash -847302476, now seen corresponding path program 1 times [2019-10-13 21:40:39,329 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:40:39,329 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996834847] [2019-10-13 21:40:39,329 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:39,330 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:39,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:40:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:39,430 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:40:39,431 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996834847] [2019-10-13 21:40:39,431 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:40:39,431 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:40:39,432 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397714784] [2019-10-13 21:40:39,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:40:39,433 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:40:39,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:40:39,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:40:39,434 INFO L87 Difference]: Start difference. First operand 542 states and 850 transitions. Second operand 3 states. [2019-10-13 21:40:39,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:40:39,884 INFO L93 Difference]: Finished difference Result 1381 states and 2245 transitions. [2019-10-13 21:40:39,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:40:39,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-10-13 21:40:39,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:40:39,892 INFO L225 Difference]: With dead ends: 1381 [2019-10-13 21:40:39,893 INFO L226 Difference]: Without dead ends: 844 [2019-10-13 21:40:39,895 INFO L600 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-13 21:40:39,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2019-10-13 21:40:39,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 844. [2019-10-13 21:40:39,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2019-10-13 21:40:39,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1310 transitions. [2019-10-13 21:40:39,961 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1310 transitions. Word has length 89 [2019-10-13 21:40:39,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:40:39,961 INFO L462 AbstractCegarLoop]: Abstraction has 844 states and 1310 transitions. [2019-10-13 21:40:39,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:40:39,962 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1310 transitions. [2019-10-13 21:40:39,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-13 21:40:39,969 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:40:39,969 INFO L380 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, 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] [2019-10-13 21:40:39,969 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:40:39,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:40:39,970 INFO L82 PathProgramCache]: Analyzing trace with hash -848490688, now seen corresponding path program 1 times [2019-10-13 21:40:39,971 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:40:39,971 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717409141] [2019-10-13 21:40:39,971 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:39,972 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:39,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:40:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:40,237 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:40:40,237 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717409141] [2019-10-13 21:40:40,238 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:40:40,238 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:40:40,238 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28886257] [2019-10-13 21:40:40,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:40:40,239 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:40:40,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:40:40,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:40:40,240 INFO L87 Difference]: Start difference. First operand 844 states and 1310 transitions. Second operand 6 states. [2019-10-13 21:40:40,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:40:40,961 INFO L93 Difference]: Finished difference Result 2029 states and 3210 transitions. [2019-10-13 21:40:40,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:40:40,961 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2019-10-13 21:40:40,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:40:40,970 INFO L225 Difference]: With dead ends: 2029 [2019-10-13 21:40:40,971 INFO L226 Difference]: Without dead ends: 1113 [2019-10-13 21:40:40,974 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:40:40,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-10-13 21:40:41,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 953. [2019-10-13 21:40:41,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-10-13 21:40:41,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1450 transitions. [2019-10-13 21:40:41,034 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1450 transitions. Word has length 130 [2019-10-13 21:40:41,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:40:41,035 INFO L462 AbstractCegarLoop]: Abstraction has 953 states and 1450 transitions. [2019-10-13 21:40:41,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:40:41,036 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1450 transitions. [2019-10-13 21:40:41,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-13 21:40:41,043 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:40:41,044 INFO L380 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, 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] [2019-10-13 21:40:41,044 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:40:41,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:40:41,045 INFO L82 PathProgramCache]: Analyzing trace with hash -935797971, now seen corresponding path program 1 times [2019-10-13 21:40:41,045 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:40:41,045 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714393744] [2019-10-13 21:40:41,045 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:41,045 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:41,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:40:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:41,251 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 67 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:40:41,251 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714393744] [2019-10-13 21:40:41,252 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810225883] [2019-10-13 21:40:41,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:40:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:41,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-13 21:40:41,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:40:41,508 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 67 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:40:41,509 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:40:41,759 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 39 [2019-10-13 21:40:41,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:40:41,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:40:41,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:40:41,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:40:41,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:40:41,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:40:41,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:40:42,089 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 67 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:40:42,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [733091953] [2019-10-13 21:40:42,152 INFO L162 IcfgInterpreter]: Started Sifa with 81 locations of interest [2019-10-13 21:40:42,152 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:40:42,158 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:40:42,169 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:40:42,171 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:40:42,443 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 98 for LOIs [2019-10-13 21:40:42,856 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:40:42,857 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:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) 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:102) 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) ... 21 more [2019-10-13 21:40:42,864 INFO L168 Benchmark]: Toolchain (without parser) took 9394.56 ms. Allocated memory was 145.8 MB in the beginning and 331.9 MB in the end (delta: 186.1 MB). Free memory was 100.9 MB in the beginning and 146.1 MB in the end (delta: -45.2 MB). Peak memory consumption was 140.9 MB. Max. memory is 7.1 GB. [2019-10-13 21:40:42,867 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 21:40:42,876 INFO L168 Benchmark]: CACSL2BoogieTranslator took 802.15 ms. Allocated memory was 145.8 MB in the beginning and 205.0 MB in the end (delta: 59.2 MB). Free memory was 100.7 MB in the beginning and 169.8 MB in the end (delta: -69.1 MB). Peak memory consumption was 30.0 MB. Max. memory is 7.1 GB. [2019-10-13 21:40:42,879 INFO L168 Benchmark]: Boogie Preprocessor took 135.46 ms. Allocated memory is still 205.0 MB. Free memory was 169.8 MB in the beginning and 164.2 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 7.1 GB. [2019-10-13 21:40:42,881 INFO L168 Benchmark]: RCFGBuilder took 2059.05 ms. Allocated memory was 205.0 MB in the beginning and 249.0 MB in the end (delta: 44.0 MB). Free memory was 164.2 MB in the beginning and 204.9 MB in the end (delta: -40.6 MB). Peak memory consumption was 114.7 MB. Max. memory is 7.1 GB. [2019-10-13 21:40:42,882 INFO L168 Benchmark]: TraceAbstraction took 6390.91 ms. Allocated memory was 249.0 MB in the beginning and 331.9 MB in the end (delta: 82.8 MB). Free memory was 204.9 MB in the beginning and 146.1 MB in the end (delta: 58.8 MB). Peak memory consumption was 141.6 MB. Max. memory is 7.1 GB. [2019-10-13 21:40:42,887 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.22 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 802.15 ms. Allocated memory was 145.8 MB in the beginning and 205.0 MB in the end (delta: 59.2 MB). Free memory was 100.7 MB in the beginning and 169.8 MB in the end (delta: -69.1 MB). Peak memory consumption was 30.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 135.46 ms. Allocated memory is still 205.0 MB. Free memory was 169.8 MB in the beginning and 164.2 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2059.05 ms. Allocated memory was 205.0 MB in the beginning and 249.0 MB in the end (delta: 44.0 MB). Free memory was 164.2 MB in the beginning and 204.9 MB in the end (delta: -40.6 MB). Peak memory consumption was 114.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6390.91 ms. Allocated memory was 249.0 MB in the beginning and 331.9 MB in the end (delta: 82.8 MB). Free memory was 204.9 MB in the beginning and 146.1 MB in the end (delta: 58.8 MB). Peak memory consumption was 141.6 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:307) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...